# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20981 | gs14004 | Ili (COI17_ili) | C++11 | 3083 ms | 15436 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;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
int n, m, l[20005], r[20005];
char str[20005];
int vis[20005];
vector<int> gph[20005];
bitset<10005> s0, s1, dod[10005];
void dfs(int x){
if(vis[x]) return;
vis[x] = 1;
if(x > n){
dfs(l[x]);
dfs(r[x]);
}
}
int input(){
string s;
cin >> s;
int num = 0;
for(int i=1; i<s.size(); i++){
num = num * 10 + s[i] - '0';
}
if(s[0] == 'x'){
return num;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |