# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
596132 | mohammad_kilani | Game (APIO22_game) | C++17 | 1 ms | 256 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 "game.h"
#include <bits/stdc++.h>
using namespace std;
int n , k;
vector< int > mx , mn , l , r;
vector< vector< int > > g , g2;
bool fixNode(int node){
if(mx[node] >= mn[node])
return false;
int mid;
bool good = false;
while(l[node] < r[node]){
mid = (l[node] + r[node]) / 2;
if(mn[node] <= mid){
r[node] = mid;
good = true;
}
else if(mx[node] > mid){
l[node] = mid + 1;
good = true;
}
else
break;
}
return good;
}
# | 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... |