# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104656 | Shtef | Ili (COI17_ili) | C++14 | 1 ms | 512 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 <iostream>
#include <cstring>
#include <utility>
using namespace std;
typedef pair <char, int> pci;
#define x first
#define y second
#define mp make_pair
int n, m, mali[10005], veliki[10005];
string s;
pci koji[10005][2];
void dfs(char type, int x){
for(int i = 0 ; i < 2 ; ++i){
pci o = koji[x][i];
if(o.x == 'x'){
mali[o.y] = 0;
}
else{
veliki[o.y] = 0;
dfs(o.x, o.y);
}
}
}
void postavinule(){
for(int i = 1 ; i <= m ; ++i){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |