# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
747091 | Username4132 | Teams (IOI15_teams) | C++14 | 4059 ms | 370672 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 "teams.h"
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using pii = pair<int, int>;
#define forn(i, n) for(int i=0; i<(int)n; ++i)
#define forsn(i, s, n) for(int i=s; i<(int)n; ++i)
#define dforn(i, n) for(int i=n-1; i>=0; --i)
#define PB push_back
#define F first
#define S second
struct Vertex{
int sum;
Vertex *l, *r;
Vertex(int Sum=0) : sum(Sum), l(NULL), r(NULL){}
Vertex(Vertex* le, Vertex* ri) : sum(le->sum + ri->sum), l(le), r(ri){}
};
Vertex* build(int tl, int tr){
if(tl==tr) return new Vertex;
int tm = (tl+tr)>>1;
return new Vertex(build(tl, tm), build(tm+1, tr));
}
int sum(Vertex* v, int tl, int tr, int l, int r){
if(l>r) return 0;
if(l==tl && r==tr) return v->sum;
int tm = (tl+tr)>>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... |