# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1116606 | 2024-11-22T01:33:43 Z | 12345678 | XOR Sum (info1cup17_xorsum) | C++17 | 512 ms | 22712 KB |
#include <bits/stdc++.h> using namespace std; int n, res; vector<int> v; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n; v.resize(n); for (auto &x:v) cin>>x; for (int b=1; b<(1<<30); b<<=1) { vector<int> l, r; int cnt=0, idx=0; for (auto x:v) { if (x&b) r.push_back(x); else l.push_back(x); } for (int i=(int)l.size()-1; i>=0; i--) { while (idx<l.size()&&!((l[i]+l[idx])&b)) idx++; if (idx<=i) cnt^=(i-idx+1)%2; } for (int i=(int)r.size()-1, idx=0; i>=0; i--) { while (idx<r.size()&&!((r[i]+r[idx])&b)) idx++; if (idx<=i) cnt^=(i-idx+1)%2; } for (int i=(int)l.size()-1, idx=0; i>=0; i--) { while (idx<r.size()&&(r[idx]+l[i])&b) idx++; cnt^=idx%2; } if (cnt) res|=b; v=l; for (auto x:r) v.push_back(x); } cout<<res; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 336 KB | Output is correct |
2 | Correct | 3 ms | 336 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 331 ms | 13292 KB | Output is correct |
2 | Correct | 303 ms | 16208 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 331 ms | 13292 KB | Output is correct |
2 | Correct | 303 ms | 16208 KB | Output is correct |
3 | Correct | 401 ms | 19724 KB | Output is correct |
4 | Correct | 359 ms | 19468 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 336 KB | Output is correct |
2 | Correct | 3 ms | 336 KB | Output is correct |
3 | Correct | 51 ms | 2680 KB | Output is correct |
4 | Correct | 51 ms | 2676 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 336 KB | Output is correct |
2 | Correct | 3 ms | 336 KB | Output is correct |
3 | Correct | 331 ms | 13292 KB | Output is correct |
4 | Correct | 303 ms | 16208 KB | Output is correct |
5 | Correct | 401 ms | 19724 KB | Output is correct |
6 | Correct | 359 ms | 19468 KB | Output is correct |
7 | Correct | 51 ms | 2680 KB | Output is correct |
8 | Correct | 51 ms | 2676 KB | Output is correct |
9 | Correct | 490 ms | 22712 KB | Output is correct |
10 | Correct | 498 ms | 22632 KB | Output is correct |
11 | Correct | 512 ms | 22572 KB | Output is correct |