| 编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| #68915 | #1001. A. 神秘谜题 | Time Limit Exceeded | 0 | 2014 ms | 3020 K | Python 3 / 385 B | 焱 | 2022-04-21 15:29:18 |
n = int(input())
x = []
for i in range(n+1):
l = list(map(int, input().split()))
if len(l) == 1:
for j in range(len(x)):
x[j] = x[j] + 1
if len(l) == 2:
y=l[1]
x.append(y)
for obj in range(len(x)):
s = x[0]
if obj != 0:
s = s ^ x[obj]
if obj == 0:
pass
print(s)
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
1052594378
424763263
170954591
493032861
99034326
860873802
908928965
624632334
762934897
648747634
72029898
<32570 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
906608388
64575697
1030333237
237390895
169577553
284244590
503017129
512451772
677622343
448443250
1057287927
<29247 bytes omitted>