# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
67814 | 2018-08-15T10:19:17 Z | MrTEK | XOR Sum (info1cup17_xorsum) | C++14 | 1600 ms | 4364 KB |
#include <bits/stdc++.h> using namespace std; #define mp make_pair #define pb push_back #define len(a) (int)a.size() #define fi first #define sc second #define left ind + ind #define right ind + ind + 1 #define mid (l + r) / 2 #define d1(w) cerr<<#w<<":"<<w<<endl; #define d2(w,c) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<endl; #define d3(w,c,z) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<" "<<#z<<":"<<z<<endl; #define FAST_IO ios_base::sync_with_stdio(false); #define endl '\n' const int maxn = 620; const long long LINF = 1e18; const int LOG = 31; const int INF = 1e9; const int N = 1e6 + 5; const int M = 4e3 + 5; const int SQ = 350; const int MOD = 998244353; int n,mx,ans,mark[M],cnt[M * 2],ar[N]; typedef pair <int,int> pii; int main() { scanf("%d",&n); for (int i = 1 ; i <= n ; i++) { scanf("%d",&ar[i]); mx = max(ar[i],mx); } if (n <= 4e3) { for (int i = 1 ; i <= n ; i++) for(int j = i ; j <= n ; j++) ans = ans ^ (ar[i] + ar[j]); } else if (mx <= 4e3){ for (int i = 1 ; i <= n ; i++) { for (int j = 1 ; j <= 4e3 ; j++) { cnt[ar[i] + j] += mark[j]; } mark[ar[i]]++; } for (int j = 1 ; j <= 4e3 ; j++) if (cnt[j] & 1) ans = ans ^ j; } printf("%d\n",ans); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 11 ms | 376 KB | Output is correct |
2 | Correct | 11 ms | 456 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1677 ms | 4364 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1677 ms | 4364 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 11 ms | 376 KB | Output is correct |
2 | Correct | 11 ms | 456 KB | Output is correct |
3 | Incorrect | 25 ms | 4364 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 11 ms | 376 KB | Output is correct |
2 | Correct | 11 ms | 456 KB | Output is correct |
3 | Execution timed out | 1677 ms | 4364 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |