| 编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| #13697 | #1001. A. 神秘谜题 | Time Limit Exceeded | 0 | 2039 ms | 1156 K | C++ / 458 B | ZephyR | 2019-07-07 13:22:03 |
#include <iostream>
using namespace std;
int main() {
long long arr[200001], sum = 0;
int n, t, count = 1;
cin >> n;
cin >> t >> arr[0];
cout << arr[0] << endl;
for (int m = 1; m < n; ++m) {
cin >> t;
if (t == 2) {
cin >> arr[count];
sum = sum ^ arr[count];
cout << sum << endl;
++count;
} else {
for (int k = 0; k < count; ++k) ++arr[k];
sum = arr[0];
for (int i = 1; i < count; ++i) {
sum = sum ^ arr[i];
}
cout << sum << endl;
}
}
}200000
2 526767110
2 724642759
2 567837900
2 104106873
2 357915481
2 33997211
2 444788944
2
<1586974 bytes omitted>526767110
877985729
361528077
330887284
116239149
82537142
510237286
843295274
453728745
55
<2188330 bytes omitted>用户输出
526767110
724642759
183086859
215819378
428375851
462339760
17583712
757497388
74354159
1043364839
204265872
904009700
6889476
9
<1076369 bytes omitted>200000
2 515979308
2 512702340
2 684230440
2 488136957
2 598252313
2 283603971
2 349877373
2
<1586842 bytes omitted>515979308
5115816
679905408
899606653
372667236
114362215
302756634
473674072
520218589
525
<2192841 bytes omitted>用户输出
515979308
512702340
910667948
727699537
150424392
403717963
214600502
49973620
29417457
25854817
925370634
861110868
311841935
5
<1086624 bytes omitted>