# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1034649 | idas | Jousting tournament (IOI12_tournament) | C++11 | 22 ms | 10072 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 FOR(i, begin, end) for(int i=(begin); i<(end); i++)
#define pb push_back
#define s second
#define f first
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int MxN=1e5+10, INF=1e9;
int n, rnk, strt[MxN], mx[MxN], t[4*MxN], a[MxN];
bool bad[MxN];
vi ad[MxN];
void build(int l=0, int r=n-1, int id=1)
{
if(l==r){
t[id]=a[l];
return;
}
int m=(l+r)/2;
build(l, m, id*2);
build(m+1, r, id*2+1);
t[id]=max(t[id*2], t[id*2+1]);
}
int get_max(int x, int y, int l=0, int r=n-1, int id=1)
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |