| 编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| #87 | #1001. A. 神秘谜题 | Time Limit Exceeded | 0 | 2067 ms | 1288 K | C / 510 B | 机类824王琨 | 2019-06-06 0:54:53 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int n, i, k = 0, j, m = 0;
scanf("%d", &n);
int *a = (int *)malloc(n * sizeof(int));
int *b = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] == 2) {
scanf("%d", &b[k]);
k++;
m = 0;
for (j = 0; j < k; j++) {
m = m ^ b[j];
}
printf("%d\n", m);
} else {
m = 0;
for (j = 0; j < k; j++) {
b[j] = b[j] + 1;
m = m ^ b[j];
}
printf("%d\n", m);
}
}
free(a);
free(b);
return 0;
}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
361528077
330887284
116239149
82537142
510237286
843295274
453728745
559263713
323554710
713540578
520942594
<1511296 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
5115816
679905408
899606653
372667236
114362215
302756634
473674072
520218589
525056845
703148326
764590712
207056035
<1466240 bytes omitted>