# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
690528 | alexdd | CONSUL (info1cup19_consul) | C++17 | 26 ms | 348 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>
#include "grader.h"
using namespace std;
unordered_map<int,int> fr1;
unordered_map<int,bool> bl1;
unordered_map<int,int> fr2;
unordered_map<int,bool> bl2;
int maxq;
int cntq;
int actual_kth(int k)
{
if(bl1[k]==0)
{
fr1[k]=kth(k);
bl1[k]=1;
cntq++;
}
return fr1[k];
}
int actual_cnt(int x)
{
if(bl2[x]==0)
{
fr2[x]=cnt(x);
bl2[x]=1;
cntq++;
}
return fr2[x];
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |