# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43960 | IvanC | Kralj (COCI16_kralj) | C++17 | 2081 ms | 82908 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>
#define LSOne(S) (S & (-S))
using namespace std;
const int MAXN = 1e6 + 10;
int Dwarves[MAXN],A[MAXN],N,exibe;
set<int> Elves,Mesa;
int main(){
scanf("%d",&N);
for(int i = 1;i<=N;i++){
scanf("%d",&A[i]);
Mesa.insert(i);
Mesa.insert(i+N);
}
for(int i = 1;i<=N;i++){
scanf("%d",&Dwarves[i]);
}
for(int i = 1;i<=N;i++){
int x;
scanf("%d",&x);
Elves.insert(x);
}
for(int vez = 1;vez<=N;vez++){
int posicao = *Mesa.lower_bound(A[vez]);
if(posicao > N) posicao -= N;
Mesa.erase(posicao);
Mesa.erase(posicao+N);
int dwarf = Dwarves[posicao];
if((*Elves.rbegin()) < dwarf){
Elves.erase(Elves.begin());
}
else{
exibe++;
Elves.erase(Elves.lower_bound(dwarf));
}
//printf("Vez %d\n",vez);
}
printf("%d\n",exibe);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |