oj.uz

답안 #782349

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
782349 2023-07-13T20:42:22 Z teokakabadze 슈퍼트리 잇기 (IOI20_supertrees) C++17
65 / 100
 173 ms 26136 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;
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++)
    {
        a2 = a3 = 0;
        for(j = 0; j < n; j++)
        {
            if(p[i][j] == 2) a2 = 1;
            if(p[i][j] == 3) a3 = 1;
        }
        if(a2 && a3) return 0;
        //cout << i << "A\n";
		if(!f[i])
        {
            a2 = a3 = 0;
            for(j = 0; j < n; j++)
            {
                if(p[i][j] == 2) a2 = 1;
                if(p[i][j] == 3) a3 = 1;
            }
            e.clear(); d.clear();
            if(a2 && a3) return 0;
            if(a2) k = 2; else if(a3) k = 3;  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; e.pb(b); }
                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; e.pb(b); }
                    if(f[b] == 2 && p[j][b]) return 0;
                }
                l = j;
                cnt++;
                if(cnt == 2) c = j;
            }
            if(k == 2 && cnt < 2) return 0;
            if(k == 2) a[l][i] = a[i][l] = 1;
            if(k == 3 && cnt < 3) return 0;
            if(k == 3) a[l][i] = a[i][l] = a[i][c] = a[c][i] = 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(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 316 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 2040 KB Output is correct
7 Correct 158 ms 26132 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 316 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 2040 KB Output is correct
7 Correct 158 ms 26132 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 312 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 164 ms 22204 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 312 KB Output is correct
16 Correct 4 ms 1064 KB Output is correct
17 Correct 72 ms 10468 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Incorrect 0 ms 308 KB Answer gives possible 1 while actual possible 0
20 Halted 0 ms 0 KB -

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 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 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 7 ms 1216 KB Output is correct
9 Correct 168 ms 22160 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 1960 KB Output is correct
13 Correct 163 ms 26124 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 71 ms 10368 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 308 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 41 ms 7688 KB Output is correct
22 Correct 165 ms 26052 KB Output is correct
23 Correct 167 ms 26044 KB Output is correct
24 Correct 165 ms 26060 KB Output is correct
25 Correct 68 ms 8468 KB Output is correct
26 Correct 68 ms 9484 KB Output is correct
27 Correct 166 ms 26028 KB Output is correct
28 Correct 169 ms 26028 KB Output is correct
29 Correct 70 ms 8528 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 41 ms 7680 KB Output is correct
5 Correct 162 ms 26048 KB Output is correct
6 Correct 161 ms 25548 KB Output is correct
7 Correct 162 ms 26008 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 42 ms 7648 KB Output is correct
10 Correct 162 ms 26048 KB Output is correct
11 Correct 165 ms 26060 KB Output is correct
12 Correct 173 ms 26136 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 41 ms 7604 KB Output is correct
17 Correct 163 ms 26128 KB Output is correct
18 Correct 162 ms 25756 KB Output is correct
19 Correct 165 ms 25732 KB Output is correct
20 Correct 164 ms 22348 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 316 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 2040 KB Output is correct
7 Correct 158 ms 26132 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 312 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 164 ms 22204 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 312 KB Output is correct
16 Correct 4 ms 1064 KB Output is correct
17 Correct 72 ms 10468 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Incorrect 0 ms 308 KB Answer gives possible 1 while actual possible 0
20 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 316 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 2040 KB Output is correct
7 Correct 158 ms 26132 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 312 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 164 ms 22204 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 312 KB Output is correct
16 Correct 4 ms 1064 KB Output is correct
17 Correct 72 ms 10468 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Incorrect 0 ms 308 KB Answer gives possible 1 while actual possible 0
20 Halted 0 ms 0 KB -