# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
997840 | bachhoangxuan | Comparing Plants (IOI20_plants) | C++17 | 353 ms | 21072 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 "plants.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5+5;
const int inf = 1e9;
int n,k;
vector<int> R,A,B;
set<int> ss;
set<pair<int,int>> cc;
void cal(int x,int y){
cc.erase({A[y],y});
if((y-x+n)%n>=k){
//cout << "add " << y << '\n';
cc.insert({A[y],y});
}
}
void add(int x){
if(ss.empty()){
ss.insert(x);
cc.insert({A[x],x});
//cout << "add " << x << '\n';
return;
}
auto it=ss.lower_bound(x);
if(it!=ss.end()) cal(x,*it);
else cal(x,*ss.begin());
if(it==ss.begin()) cal(*ss.rbegin(),x);
else{
it--;
# | 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... |