# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
815700 | AndrijaM | XORanges (eJOI19_xoranges) | C++14 | 403 ms | 3828 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;
int main()
{
int n,t;
cin>>n>>t;
int x[n];
for(int i=0;i<n;i++)
{
cin>>x[i];
}
int xorval[n][2];
int pom=0;
for(int i=0;i<n;i+=2)
{
pom^=x[i];
xorval[i][0]=pom;
if(i+1<n)
{
xorval[i+1][0]=xorval[i][0];
}
}
xorval[0][1]=0;
pom=0;
for(int i=1;i<n;i+=2)
{
pom^=x[i];
xorval[i][1]=pom;
# | 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... |