# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1135320 | Dragos1 | XORanges (eJOI19_xoranges) | C++20 | 338 ms | 14048 KiB |
#include <iostream>
#include <vector>
using namespace std;
int t,n,c,l,r,poz,x,vechi,ans;
struct nod1{
int val;
int mesaj;
};
vector<nod1> aint_impare,aint_pare;
void build_pare(int nod,int st,int dr)
{
if(st==dr)
{
return;
}
else{
int mij=(st+dr)/2;
build_pare(2*nod,st,mij);
build_pare(2*nod+1,mij+1,dr);
aint_pare[nod].val=aint_pare[2*nod].val^aint_pare[2*nod+1].val;
aint_pare[nod].mesaj=0;
}
}
void build_impare(int nod,int st,int dr)
{
if(st==dr)
{
cin>>aint_impare[nod].val;
if(st%2==0)
aint_pare[nod].val=aint_impare[nod].val , aint_impare[nod].val=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... |