oj.uz

답안 #783186

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
783186 2023-07-14T17:14:39 Z teokakabadze 슈퍼트리 잇기 (IOI20_supertrees) C++17
65 / 100
 179 ms 26016 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;
            if(k == 2)
            for(int b = 0; b < n; b++)
            {
                if(!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(!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 0 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 340 KB Output is correct
6 Correct 8 ms 2004 KB Output is correct
7 Correct 154 ms 26012 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 0 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 8 ms 2004 KB Output is correct
7 Correct 154 ms 26012 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1108 KB Output is correct
13 Correct 158 ms 22032 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 3 ms 988 KB Output is correct
17 Correct 61 ms 10124 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 38 ms 7584 KB Output is correct
21 Correct 154 ms 25968 KB Output is correct
22 Correct 156 ms 25512 KB Output is correct
23 Correct 159 ms 25916 KB Output is correct
24 Correct 158 ms 22200 KB Output is correct
25 Incorrect 156 ms 25936 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 1 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 1 ms 212 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 7 ms 1148 KB Output is correct
9 Correct 155 ms 21996 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 1876 KB Output is correct
13 Correct 179 ms 26016 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 980 KB Output is correct
17 Correct 65 ms 10140 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 48 ms 7568 KB Output is correct
22 Correct 177 ms 25976 KB Output is correct
23 Correct 158 ms 25868 KB Output is correct
24 Correct 174 ms 25892 KB Output is correct
25 Correct 72 ms 8348 KB Output is correct
26 Correct 67 ms 9292 KB Output is correct
27 Correct 168 ms 25864 KB Output is correct
28 Correct 172 ms 25996 KB Output is correct
29 Correct 60 ms 8332 KB Output is correct

Subtask #4
35.0 / 35.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 280 KB Output is correct
4 Correct 39 ms 7572 KB Output is correct
5 Correct 153 ms 25884 KB Output is correct
6 Correct 157 ms 25528 KB Output is correct
7 Correct 162 ms 25980 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 41 ms 7548 KB Output is correct
10 Correct 159 ms 26004 KB Output is correct
11 Correct 160 ms 25872 KB Output is correct
12 Correct 171 ms 25888 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 7484 KB Output is correct
17 Correct 158 ms 26000 KB Output is correct
18 Correct 157 ms 25548 KB Output is correct
19 Correct 156 ms 25624 KB Output is correct
20 Correct 156 ms 22300 KB Output is correct

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 0 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 8 ms 2004 KB Output is correct
7 Correct 154 ms 26012 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1108 KB Output is correct
13 Correct 158 ms 22032 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 3 ms 988 KB Output is correct
17 Correct 61 ms 10124 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 38 ms 7584 KB Output is correct
21 Correct 154 ms 25968 KB Output is correct
22 Correct 156 ms 25512 KB Output is correct
23 Correct 159 ms 25916 KB Output is correct
24 Correct 158 ms 22200 KB Output is correct
25 Incorrect 156 ms 25936 KB Answer gives possible 1 while actual possible 0
26 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 0 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 8 ms 2004 KB Output is correct
7 Correct 154 ms 26012 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1108 KB Output is correct
13 Correct 158 ms 22032 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 3 ms 988 KB Output is correct
17 Correct 61 ms 10124 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 38 ms 7584 KB Output is correct
21 Correct 154 ms 25968 KB Output is correct
22 Correct 156 ms 25512 KB Output is correct
23 Correct 159 ms 25916 KB Output is correct
24 Correct 158 ms 22200 KB Output is correct
25 Incorrect 156 ms 25936 KB Answer gives possible 1 while actual possible 0
26 Halted 0 ms 0 KB -