200000
2 526767110
2 724642759
2 567837900
2 104106873
2 357915481
2 33997211
2 444788944
2
<1586974 bytes omitted>
编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
---|---|---|---|---|---|---|---|---|
#20987 | #1001. A. 神秘谜题 | Time Limit Exceeded | 0 | 1547 ms | 1492 K | C++ / 766 B | bird | 2019-09-14 0:02:43 |
#include <iostream>
#include <set>
using namespace std;
int main() {
int n;
int num;
int operate;
set<unsigned int> s;
set<unsigned int>::iterator it;
cin >> n;
unsigned int ans[n];
for (int i = 0; i < n; i++) {
ans[i] = 0;
}
for (int i = 0; i < n; i++) {
cin >> operate;
if (operate == 1) {
int tp = 0;
int len = s.size();
unsigned int temp[len];
for (it = s.begin(); it != s.end(); it++) {
temp[tp++] = *it;
}
s.clear();
for (int i = 0; i < len; i++) {
s.insert(temp[i] + 1);
}
for (it = s.begin(); it != s.end(); it++) {
ans[i] = *it ^ ans[i];
}
} else {
cin >> num;
s.insert(num);
for (it = s.begin(); it != s.end(); it++) {
ans[i] = *it ^ ans[i];
}
}
}
for (int i = 0; i < n; i++) {
cout << ans[i] << endl;
}
return 0;
}
200000
2 526767110
2 724642759
2 567837900
2 104106873
2 357915481
2 33997211
2 444788944
2
<1586974 bytes omitted>