# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
872408 | racsosabe | XOR Sum (info1cup17_xorsum) | C++14 | 1702 ms | 33172 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;
const int N = 1000000 + 5;
int n;
int a[N];
vector<pair<int, int>> parse(vector<int> &v) {
int l = 0;
vector<pair<int, int>> res;
while(l < v.size()) {
int r = l;
while(r < v.size() and v[l] == v[r]) r += 1;
res.emplace_back(v[l], r - l);
l = r;
}
return res;
}
long long get_crossed(vector<pair<int, int>> a, vector<pair<int, int>> b, int m) {
int sum_a = 0, sum_b = 0;
for(auto x : a) sum_a += x.second;
for(auto x : b) sum_b += x.second;
long long res = 1ll * sum_a * sum_b;
int at = b.size() - 1;
int sum = 0;
for(auto x : a) {
if(x.first == 0) continue;
int want = m - x.first;
Compilation message (stderr)
# | 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... |