oj.uz

답안 #927691

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
927691 2024-02-15T08:46:40 Z Rifal 슈퍼트리 잇기 (IOI20_supertrees) C++14
11 / 100
 146 ms 22092 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
const int M = 1e3 + 4;
int typ[M];
vector<int> v1[M], v2[M];
vector<vector<int>> gr;
bool egd[M][M];
int cnt = 1;
int construct(std::vector<std::vector<int>> p) {
    int n = p.size();
    vector<int> cur; cur.push_back(0);
    for(int i = 1; i < n; i++) {
        cur.push_back(1);
    }
    gr.push_back(cur);
    for(int i = 1; i < n; i++) {
        cur.clear();
        cur.push_back(1);
        for(int j = 1; j < n; j++) {
            cur.push_back(0);
        }
        gr.push_back(cur);
    }
    build(gr);
    return 1;

}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 146 ms 22092 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 146 ms 22092 KB Output is correct
8 Incorrect 0 ms 344 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 0 ms 348 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 0 ms 344 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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 146 ms 22092 KB Output is correct
8 Incorrect 0 ms 344 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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 146 ms 22092 KB Output is correct
8 Incorrect 0 ms 344 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
9 Halted 0 ms 0 KB -