oj.uz

답안 #312454

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
312454 2020-10-13T10:14:26 Z lani1akea 슈퍼트리 잇기 (IOI20_supertrees) C++17
11 / 100
 248 ms 25976 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;
int construct(vector<vector<int>> p) {
  int n = (int)p.size();
  vector<vector<int>> g(n, vector<int>(n));
  vector<vector<int>> b(n, vector<int>(n, 0));
  for (int i = 1; i < n; ++i) b[0][i] = 1, b[i][0] = 1;
  build(b);
  return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 10 ms 1408 KB Output is correct
7 Correct 248 ms 25976 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 10 ms 1408 KB Output is correct
7 Correct 248 ms 25976 KB Output is correct
8 Incorrect 0 ms 256 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
9 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 256 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 256 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 10 ms 1408 KB Output is correct
7 Correct 248 ms 25976 KB Output is correct
8 Incorrect 0 ms 256 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
9 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 10 ms 1408 KB Output is correct
7 Correct 248 ms 25976 KB Output is correct
8 Incorrect 0 ms 256 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
9 Halted 0 ms 0 KB -