# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
257030 | Kastanda | Xoractive (IZhO19_xoractive) | C++11 | 27 ms | 1280 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.
// M
#include<bits/stdc++.h>
#include "interactive.h"
using namespace std;
vector < int > RP;
mt19937 Rnd(time(0));
inline int Ask(int i)
{
return (ask(RP[i]));
}
inline vector < int > GetSet(vector < int > A)
{
for (int &a : A)
a = RP[a];
vector < int > Rs = get_pairwise_xor(A);
/*printf("A is : ");
for (int a : A)
printf("%d ", a);
printf("\n");
printf("Rs is : ");
for (int a : Rs)
printf("%d ", a);
printf("\n");*/
for (int i = 0; i < (int)A.size(); i ++)
assert(Rs[0] == 0), Rs.erase(Rs.begin());
vector < int > Rs2;
for (int i = 0; i < (int)Rs.size(); i += 2)
Rs2.push_back(Rs[i]);
/*printf("Rs2 is : ");
for (int a : Rs2)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |