# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
712020 | pcc | Checker (COCI19_checker) | C++14 | 390 ms | 55344 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>
using namespace std;
#define pii pair<int,int>
#define fs first
#define sc second
struct node{
set<pii> st;
int pre,nxt;
bool del;
node(){
pre = nxt = 0;
del = false;
}
void add(int to,int c){
st.insert({to,c});
}
int get(int k){
auto it = st.upper_bound(make_pair(k,-1));
if(it == st.end()||it->fs != k)return 0;
return it->sc;
}
};
const int mxn = 2e5+10;
node v[mxn];
void remov(int k){
v[v[k].pre].nxt = v[k].nxt;
v[v[k].nxt].pre = v[k].pre;
v[k].del = true;
return;
# | 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... |