# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
303877 | kjain_1810 | Connecting Supertrees (IOI20_supertrees) | C++17 | 1078 ms | 22168 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 "supertrees.h"
#include <vector>
#include<stdio.h>
#define pb push_back
const int N = 1005;
using namespace std;
int taken[N], compcnt = 1, n;
vector<int>comp[N];
bool checkValid(vector<vector<int>>p)
{
for(int a = 1; a < compcnt; a++)
for(int b = 0; b < comp[a].size(); b++)
for(int c = 0; c < comp[a].size(); c++)
if(!p[comp[a][b]][comp[a][c]] || p[comp[a][b]][comp[a][c]] == 3)
return false;
for(int a = 0; a < n; a++)
for(int b = 0; b < n; b++)
if(p[a][b] && taken[a] != taken[b])
return false;
return true;
}
int gettype(vector<int>component, vector<vector<int>>p)
{
int mini = 3;
int maxi = 0;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |