# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
587387 | mohammad_kilani | Game (APIO22_game) | C++17 | 4026 ms | 42544 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;
#define oo 1000000010
vector< vector< int > > g , g2;
vector< int > mn , mx , last , last2;
int n , k;
void init(int n, int k) {
::n = n;
::k = k;
g.resize(n);
g2.resize(n);
mn.resize(n);
mx.resize(n);
for(int i = 0 ;i < k;i++){
mn[i] = mx[i] = i;
}
for(int i = k ;i < n;i++){
mn[i] = oo;
mx[i] = -oo;
}
}
void CheckMax(int u){
if(mx[u] == -oo) return;
# | 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... |