| 编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| #13682 | #1001. A. 神秘谜题 | Runtime Error | 0 | 383 ms | 624 K | C++ / 596 B | ZephyR | 2019-07-07 12:58:00 |
#include <iostream>
#include <cstring>
#include <iomanip>
using namespace std;
int main() {
long long arr[20000], sum = 0;
memset(arr, sizeof(arr), 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++];
t = count - 1;
for (int k = 0; k < t; ++k) {
sum += arr[k] ^ arr[t];
}
cout << sum << endl;
} else {
sum = 0;
for (int k = 0; k < count; ++k) ++arr[k];
for (int i = 0; i < count - 1; ++i) {
for (int j = i + 1; j < count; ++j) sum += arr[i] ^ arr[j];
}
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
877985729
2113666966
3963555720
6388170554
8636262958
11723781812
16300917702
20886115564
26261552329
31905199330
3759
<357216 bytes omitted>系统信息
Killed: Segmentation fault200000
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
5115816
1822392152
2850101111
6149078878
8666547799
11182476888
14456925328
18200407104
21928171045
28866791478
334543
<363834 bytes omitted>系统信息
Killed: Segmentation fault