# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
541781 | Tenis0206 | Connecting Supertrees (IOI20_supertrees) | C++17 | 204 ms | 24012 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>
//#define test
#ifndef test
#include "supertrees.h"
#endif // testing
using namespace std;
#ifdef test
vector<vector<int>> in;
void build(vector<vector<int>> v)
{
int n = v.size();
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
cout<<v[i][j]<<' ';
}
cout<<'\n';
}
}
#endif // testing
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... |