# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
300800 | luciocf | 슈퍼트리 잇기 (IOI20_supertrees) | C++14 | 249 ms | 22264 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"
#include <vector>
using namespace std;
const int maxn = 1e3+10;
int construct(vector<vector<int>> p)
{
int n = p.size();
vector<vector<int>> ans;
int u = -1, v = -1;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (p[i][j] == 2)
u = i, v = j;
if (u == -1)
{
for (int i = 0; i < n; i++)
{
vector<int> a;
a.resize(n);
if (i < n-1) a[i+1] = 1;
if (i > 0) a[i-1] = 1;
ans.push_back(a);
}
build(ans);
return 1;
}
}
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... |