| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1243192 | nikulid | Connecting Supertrees (IOI20_supertrees) | C++20 | 0 ms | 324 KiB |
#include "supertrees.h"
#include <vector>
using namespace std;
#define pb push_back
int construct(vector<vector<int>> p) {
int n = p.size();
vector<vector<int>> answer;
// test case 1 (line city)
vector<int> ns(n);
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
ns[j]=(j == i-1 || j == i || j == i+1);
}
answer.pb(ns);
}
build(answer);
return 1;
}| # | 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... | ||||
