# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
909270 | lighton | Magic Tree (CEOI19_magictree) | C++17 | 185 ms | 54492 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 forf(i,a,b) for(int i = a; i<=b; i++)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
int N,M,K;
int inf = 1e9;
struct ST{
int t; ll v; int id;
bool operator<(const ST &r) const{
if(t==r.t) return id<r.id;
return t<r.t;
}
};
vector<int> adj[200001];
ST upd[200001];
void merg (set<ST> &a, set<ST> b){
for(ST i : b) a.insert(i);
}
void add (set<ST> &now, ST a){
ST tmp = a; tmp.id = inf;
now.insert(a);
auto it = now.upper_bound(tmp);
ll sum = 0; int flag = 0;
ST nxt;
while(it != now.end() && sum <= a.v){
sum += it->v;
if(sum > a.v){
nxt = *it;
flag = 1;
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... |