| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1139183 | Agageldi | XOR Sum (info1cup17_xorsum) | C++20 | 1695 ms | 8244 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 6000005
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
ll T, n, a[N], t;
map <int,int> vis;
int main () {
cin >> n;
for(int i = 1;i <= n; i++){
cin >> a[i];
vis[a[i]]++;
}
ll answer = 0;
for(int i=1;i<=n;i++) {
ll sum = a[i];
for(int j = i; j <= n; j++) {
sum += a[j];
answer = (answer ^ sum);
sum -= a[j];
}
}
cout << answer << '\n';
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
