| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 393419 | vanic | UFO (IZhO14_ufo) | C++14 | 329 ms | 232660 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 <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <array>
using namespace std;
const int maxn=1e6+5;
typedef long long ll;
int n, m, r, k, p;
vector < int > poz;
struct tournament{
vector < int > t;
int pot;
tournament(int sz){
pot=sz/2;
while(sz--){
t.push_back(0);
}
}
void build(){
for(int x=pot-1; x>0; x--){
t[x]=max(t[x*2], t[x*2+1]);
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||