oj.uz

답안 #456148

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
456148 2021-08-06T07:21:25 Z BT21tata 슈퍼트리 잇기 (IOI20_supertrees) C++17
21 / 100
 415 ms 22188 KB 
#include "supertrees.h"
#include<bits/stdc++.h>

using namespace std;

bool used[1005];

int construct(vector<vector<int>> p)
{
	int n = p.size(), mx=0;
	bool f=1;
	vector<vector<int>> ans;
	ans.resize(n);
	for (int i = 0; i < n; i++)
	{
		ans[i].resize(n);
		for(int j=0; j<n; j++)
			mx=max(mx, p[i][j]);
	}
	if(mx==2)
		for(int i=0; i<n; i++)
			p[i][i]=2;
	vector<int>v;
	for(int i=0; i<n; i++)
	{
		if(!used[i])
		{
			v.clear();
			for(int j=0; j<n; j++)
				if(p[i][j])
				{
					if(p[i]==p[j]) v.push_back(j);
					else f=0;
				}
			for(int j=0; j<(int)v.size()-1; j++)
				ans[v[j]][v[j+1]]=ans[v[j+1]][v[j]]=1;
			if(mx==2 and v.size()==2) f=0;
			if(mx==2) ans[v[0]][v[v.size()-1]]=ans[v[v.size()-1]][v[0]]=1;
		}
	}
	if(!f) return 0;
	build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 11 ms 1088 KB Output is correct
7 Correct 415 ms 22012 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 11 ms 1088 KB Output is correct
7 Correct 415 ms 22012 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 12 ms 1116 KB Output is correct
13 Correct 228 ms 21948 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 6 ms 716 KB Output is correct
17 Correct 113 ms 12040 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 62 ms 5676 KB Output is correct
21 Correct 253 ms 21952 KB Output is correct
22 Correct 231 ms 22028 KB Output is correct
23 Correct 333 ms 21956 KB Output is correct
24 Correct 228 ms 21992 KB Output is correct
25 Correct 121 ms 12040 KB Output is correct
26 Correct 101 ms 12036 KB Output is correct
27 Correct 331 ms 21932 KB Output is correct
28 Correct 230 ms 22024 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 10 ms 1088 KB Output is correct
9 Correct 239 ms 22004 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 11 ms 1100 KB Output is correct
13 Correct 391 ms 22188 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 113 ms 12100 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 248 KB Output is correct
20 Incorrect 0 ms 204 KB b[4][4] is not 0
21 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 66 ms 5700 KB Output is correct
5 Correct 252 ms 22020 KB Output is correct
6 Correct 234 ms 22012 KB Output is correct
7 Correct 331 ms 21956 KB Output is correct
8 Incorrect 0 ms 204 KB b[4][4] is not 0
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 11 ms 1088 KB Output is correct
7 Correct 415 ms 22012 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 12 ms 1116 KB Output is correct
13 Correct 228 ms 21948 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 6 ms 716 KB Output is correct
17 Correct 113 ms 12040 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 62 ms 5676 KB Output is correct
21 Correct 253 ms 21952 KB Output is correct
22 Correct 231 ms 22028 KB Output is correct
23 Correct 333 ms 21956 KB Output is correct
24 Correct 228 ms 21992 KB Output is correct
25 Correct 121 ms 12040 KB Output is correct
26 Correct 101 ms 12036 KB Output is correct
27 Correct 331 ms 21932 KB Output is correct
28 Correct 230 ms 22024 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 10 ms 1088 KB Output is correct
37 Correct 239 ms 22004 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 11 ms 1100 KB Output is correct
41 Correct 391 ms 22188 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 5 ms 716 KB Output is correct
45 Correct 113 ms 12100 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 248 KB Output is correct
48 Incorrect 0 ms 204 KB b[4][4] is not 0
49 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 11 ms 1088 KB Output is correct
7 Correct 415 ms 22012 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 12 ms 1116 KB Output is correct
13 Correct 228 ms 21948 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 6 ms 716 KB Output is correct
17 Correct 113 ms 12040 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 62 ms 5676 KB Output is correct
21 Correct 253 ms 21952 KB Output is correct
22 Correct 231 ms 22028 KB Output is correct
23 Correct 333 ms 21956 KB Output is correct
24 Correct 228 ms 21992 KB Output is correct
25 Correct 121 ms 12040 KB Output is correct
26 Correct 101 ms 12036 KB Output is correct
27 Correct 331 ms 21932 KB Output is correct
28 Correct 230 ms 22024 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 10 ms 1088 KB Output is correct
37 Correct 239 ms 22004 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 11 ms 1100 KB Output is correct
41 Correct 391 ms 22188 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 5 ms 716 KB Output is correct
45 Correct 113 ms 12100 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 248 KB Output is correct
48 Incorrect 0 ms 204 KB b[4][4] is not 0
49 Halted 0 ms 0 KB -