oj.uz

답안 #576126

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
576126 2022-06-12T11:19:02 Z 2fat2code 슈퍼트리 잇기 (IOI20_supertrees) C++17
11 / 100
 163 ms 25880 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
#define fr first
#define sc second
#define all(s) s.begin(), s.end()

using namespace std;

const int nmax = 1005;

int n, adj[nmax][nmax];
vector<vector<int>>ans;

void lol(){
    for(int i=1;i<=n;i++){
        vector<int>tz;
        for(int j=1;j<=n;j++){
            tz.push_back(adj[i][j]);
        }
        ans.push_back(tz);
        tz.clear();
    }
    build(ans);
}

int construct(vector<vector<int>> p) {
	n = p.size();
	for(int i=1;i<n;i++){
            adj[i][i+1] = adj[i+1][i] = 1;
	}
	lol();
	return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 7 ms 1876 KB Output is correct
7 Correct 163 ms 25880 KB Output is correct

Subtask #2
0 / 10.0

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