# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
440601 | zxcvbnm | XOR Sum (info1cup17_xorsum) | C++14 | 1701 ms | 109632 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
const int L = 35;
map<ll, ll> mp[L];
ll calc(int left, int right, int mod) {
if (left > right) return 0;
auto it1 = mp[mod].upper_bound(right);
it1--;
auto it2 = mp[mod].lower_bound(left);
it2--;
ll ret = it1->second - it2->second;
return ret;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<ll> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> cnt(L, 0);
vector<ll> p(L);
p[0] = 1LL;
# | 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... |