oj.uz

답안 #783184

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
783184 2023-07-14T17:08:49 Z teokakabadze 슈퍼트리 잇기 (IOI20_supertrees) C++17
65 / 100
 175 ms 26308 KB 
#include "supertrees.h"
#include<bits/stdc++.h>
#define pb push_back
using namespace std;

int a[1005][1005], i, j, f[1005], a2, a3, k, l, cnt, c, pr[1005];
vector<int> s, d, e;

int construct(std::vector<std::vector<int>> p)
{
	int n = p.size();
	std::vector<std::vector<int>> answer;
	for(i = 0; i < n; i++)
    for(j = 0; j < n; j++)
    if(p[i][j] == 3) return 0;
	for(i = 0; i < n; i++)
    {
        a2 = 0;
        for(j = 0; j < n; j++)
        if(p[i][j] == 2) a2 = 1;
		if(!f[i])
        {
            e.clear(); d.clear();
            if(a2) k = 2; else k = 1;
            f[i] = 1, l = i, cnt = 0;
            for(int b = 0; b < n; b++)
            {
                if(i != b && !f[b] && p[i][b] == 1) { f[b] = 1, a[i][b] = a[b][i] = 1; if(k == 2) e.pb(b); else d.pb(b); pr[b] = i; }
                if(f[b] == 2 && p[i][b]) return 0;
            }
            d.pb(i);
            for(j = 0; j < n; j++)
            if(!f[j] && p[l][j] == k)
            {
                f[j] = 1;
                d.pb(j);
                a[l][j] = a[j][l] = 1;
                for(int b = 0; b < n; b++)
                {
                    if(j != b && !f[b] && p[j][b] == 1) { f[b] = 1, a[j][b] = a[b][j] = 1; if(k == 2) e.pb(b); else d.pb(b); pr[b] = j; }
                    if(f[b] == 2 && p[j][b]) return 0;
                }
                l = j;
                cnt++;
            }
            else if(f[j] == 2 && p[i][j]) return 0;
            if(k == 2 && cnt < 2) return 0;
            if(k == 2) a[l][i] = a[i][l] = 1;
            for(j = 0; j < n; j++)
            if(f[j] == 1) f[j] = 2;
            for(auto x : d)
            for(auto y : e)
            if(!a[x][y] && p[x][y] != k) return 0;
            for(auto x : d)
            for(auto y : d)
            if(x != y && p[x][y] != k) return 0;
            for(auto x : e)
            for(auto y : e)
            {
                if(x != y && pr[x] != pr[y] && p[x][y] != k) return 0;
                if(x != y && pr[x] == pr[y] && p[x][y] != 1) return 0;
            }
        }

	}
	for(i = 0; i < n; i++)
    {
        for(j = 0; j < n; j++)
        s.push_back(a[i][j]);
        answer.push_back(s);
        s.clear();
    }
	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 7 ms 1964 KB Output is correct
7 Correct 151 ms 26176 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 9 ms 1184 KB Output is correct
13 Correct 167 ms 22340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 988 KB Output is correct
17 Correct 62 ms 10512 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 39 ms 7584 KB Output is correct
21 Correct 155 ms 26000 KB Output is correct
22 Correct 152 ms 25408 KB Output is correct
23 Correct 153 ms 26000 KB Output is correct
24 Correct 152 ms 22232 KB Output is correct
25 Incorrect 153 ms 26016 KB Answer gives possible 1 while actual possible 0
26 Halted 0 ms 0 KB -

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 7 ms 1108 KB Output is correct
9 Correct 158 ms 22212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 2004 KB Output is correct
13 Correct 155 ms 26180 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 980 KB Output is correct
17 Correct 67 ms 10324 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 40 ms 7744 KB Output is correct
22 Correct 153 ms 26264 KB Output is correct
23 Correct 163 ms 26212 KB Output is correct
24 Correct 175 ms 26224 KB Output is correct
25 Correct 61 ms 8672 KB Output is correct
26 Correct 60 ms 9548 KB Output is correct
27 Correct 175 ms 26308 KB Output is correct
28 Correct 157 ms 26188 KB Output is correct
29 Correct 62 ms 8684 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 38 ms 7756 KB Output is correct
5 Correct 152 ms 26180 KB Output is correct
6 Correct 154 ms 25616 KB Output is correct
7 Correct 156 ms 26212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 42 ms 7760 KB Output is correct
10 Correct 151 ms 26264 KB Output is correct
11 Correct 160 ms 26128 KB Output is correct
12 Correct 157 ms 26156 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 39 ms 7684 KB Output is correct
17 Correct 154 ms 26184 KB Output is correct
18 Correct 167 ms 25880 KB Output is correct
19 Correct 152 ms 25748 KB Output is correct
20 Correct 165 ms 22552 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 7 ms 1964 KB Output is correct
7 Correct 151 ms 26176 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 9 ms 1184 KB Output is correct
13 Correct 167 ms 22340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 988 KB Output is correct
17 Correct 62 ms 10512 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 39 ms 7584 KB Output is correct
21 Correct 155 ms 26000 KB Output is correct
22 Correct 152 ms 25408 KB Output is correct
23 Correct 153 ms 26000 KB Output is correct
24 Correct 152 ms 22232 KB Output is correct
25 Incorrect 153 ms 26016 KB Answer gives possible 1 while actual possible 0
26 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 7 ms 1964 KB Output is correct
7 Correct 151 ms 26176 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 9 ms 1184 KB Output is correct
13 Correct 167 ms 22340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 988 KB Output is correct
17 Correct 62 ms 10512 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 39 ms 7584 KB Output is correct
21 Correct 155 ms 26000 KB Output is correct
22 Correct 152 ms 25408 KB Output is correct
23 Correct 153 ms 26000 KB Output is correct
24 Correct 152 ms 22232 KB Output is correct
25 Incorrect 153 ms 26016 KB Answer gives possible 1 while actual possible 0
26 Halted 0 ms 0 KB -