# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
901551 | Darren0724 | Minerals (JOI19_minerals) | C++17 | 64 ms | 4732 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 "minerals.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
mt19937 rnd(time(0));
int last=0;
vector<int> have(100000);
int ask(int k){
have[k] ^= 1;
int p = Query(k);
int tmp = p - last;
last = p;
return tmp;
}
void dc(vector<int> &a,vector<int> &b){
shuffle(a.begin(),a.end(),rnd);
shuffle(b.begin(),b.end(),rnd);
int n=a.size();
if(n==1){
Answer(a[0],b[0]);
return;
}
int m=max(1,n*379/1000);
int m1=max(1,n*614/1000);
int sz1=0,sz2=0;
vector<int> a1,a2,b1,b2,tmp1,tmp2;
for(int i=0;i<n;i++){
if(have[a[i]]){
sz1++;
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... |
# | 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... |