# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1139710 | Kerim | XOR Sum (info1cup17_xorsum) | C++20 | 1693 ms | 13228 KiB |
#include "bits/stdc++.h"
#define ff first
#define ss second
#define ll long long
using namespace std;
const int N = 1e6+5;
int a[N];
vector<int> val[2];
ll uly(vector<int> &A, vector<int> &B, int K){
ll cnt = 0;
int sz = (int)B.size() - 1;
int p = sz;
for (auto x: A){
while (p >= 0 and x+B[p]>=K)
p -= 1;
cnt += sz - p;
}
return cnt;
}
ll kici(vector<int> &A, vector<int> &B, int K){
return (ll)A.size()*(ll)B.size() - uly(A, B, K);
}
int main(){
// freopen("file.in", "r", stdin);
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", a+i);
vector<pair<int,int> > tries{{0,0}, {1,1}, {0, 1}};
int ans = 0;
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... |