# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
144691 | Milki | Ili (COI17_ili) | C++14 | 1766 ms | 988 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>
using namespace std;
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define REP(i, n) FOR(i, 0, n)
#define _ << " " <<
#define sz(x) ((int) x.size())
#define pb(x) push_back(x)
#define TRACE(x) cerr << #x << " = " << x << endl
typedef long long ll;
typedef pair<int, int> point;
const int MAXN = 2e4 + 5;
int n, m, lt[MAXN], rt[MAXN], val[MAXN], tmp_val[MAXN];
string s;
bool go(){
REP(i, n + m)
tmp_val[i] = val[i];
for(int i = n + m - 1; i >= n; --i)
if(tmp_val[i] == 0){
if(tmp_val[ lt[i] ] == 1) return false;
if(tmp_val[ rt[i] ] == 1) return false;
tmp_val[ lt[i] ] = tmp_val[ rt[i] ] = 0;
}
REP(i, n){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |