| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 523907 | MurotY | Carnival Tickets (IOI20_tickets) | C++14 | 0 ms | 0 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>
#include "supertrees.h"
#define ll long long
#include <vector>
using namespace std;
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
bool ok=1;
for (int i=0;i<n;i++){
for (int j=0;j<p[i].size();j++){
if (p[i][j] == 0){
ok=0;
break;
}
}
}
if (ok){
return 1;
}
}