Submission #782350

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
782350	2023-07-13T20:45:05 Z	teokakabadze	Connecting Supertrees (IOI20_supertrees)	C++17	30 / 100	189 ms	27948 KB

supertrees

#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(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 && 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

#	Verdict	Execution time	Memory	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	0 ms	340 KB	Output is correct
6	Correct	7 ms	1960 KB	Output is correct
7	Correct	156 ms	26000 KB	Output is correct

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	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	0 ms	340 KB	Output is correct
6	Correct	7 ms	1960 KB	Output is correct
7	Correct	156 ms	26000 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 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	157 ms	22028 KB	Output is correct
14	Correct	1 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	71 ms	10236 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	40 ms	8064 KB	Output is correct
21	Correct	154 ms	27948 KB	Output is correct
22	Correct	177 ms	27340 KB	Output is correct
23	Correct	162 ms	27832 KB	Output is correct
24	Correct	161 ms	24188 KB	Output is correct
25	Incorrect	160 ms	27912 KB	Answer gives possible 1 while actual possible 0
26	Halted	0 ms	0 KB	-

Subtask #3
19.0 / 19.0

#	Verdict	Execution time	Memory	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	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	7 ms	1204 KB	Output is correct
9	Correct	165 ms	22052 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	7 ms	1876 KB	Output is correct
13	Correct	178 ms	25932 KB	Output is correct
14	Correct	1 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	10124 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	39 ms	7584 KB	Output is correct
22	Correct	159 ms	25888 KB	Output is correct
23	Correct	189 ms	25868 KB	Output is correct
24	Correct	161 ms	25988 KB	Output is correct
25	Correct	67 ms	8396 KB	Output is correct
26	Correct	73 ms	9360 KB	Output is correct
27	Correct	157 ms	25872 KB	Output is correct
28	Correct	160 ms	26000 KB	Output is correct
29	Correct	66 ms	8348 KB	Output is correct

Subtask #4
0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	40 ms	7576 KB	Output is correct
5	Correct	181 ms	26000 KB	Output is correct
6	Correct	158 ms	25396 KB	Output is correct
7	Correct	157 ms	25884 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	40 ms	7544 KB	Output is correct
10	Correct	167 ms	25968 KB	Output is correct
11	Correct	173 ms	25904 KB	Output is correct
12	Correct	161 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	0 ms	340 KB	Output is correct
16	Incorrect	15 ms	2328 KB	Answer gives possible 0 while actual possible 1
17	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	Verdict	Execution time	Memory	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	0 ms	340 KB	Output is correct
6	Correct	7 ms	1960 KB	Output is correct
7	Correct	156 ms	26000 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 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	157 ms	22028 KB	Output is correct
14	Correct	1 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	71 ms	10236 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	40 ms	8064 KB	Output is correct
21	Correct	154 ms	27948 KB	Output is correct
22	Correct	177 ms	27340 KB	Output is correct
23	Correct	162 ms	27832 KB	Output is correct
24	Correct	161 ms	24188 KB	Output is correct
25	Incorrect	160 ms	27912 KB	Answer gives possible 1 while actual possible 0
26	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.0

#	Verdict	Execution time	Memory	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	0 ms	340 KB	Output is correct
6	Correct	7 ms	1960 KB	Output is correct
7	Correct	156 ms	26000 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 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	157 ms	22028 KB	Output is correct
14	Correct	1 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	71 ms	10236 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	40 ms	8064 KB	Output is correct
21	Correct	154 ms	27948 KB	Output is correct
22	Correct	177 ms	27340 KB	Output is correct
23	Correct	162 ms	27832 KB	Output is correct
24	Correct	161 ms	24188 KB	Output is correct
25	Incorrect	160 ms	27912 KB	Answer gives possible 1 while actual possible 0
26	Halted	0 ms	0 KB	-

Submission #782350

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 0 / 10.0

Subtask #3 19.0 / 19.0

Subtask #4 0 / 35.0

Subtask #5 0 / 21.0

Subtask #6 0 / 4.0

Subtask #1
11.0 / 11.0

Subtask #2
0 / 10.0

Subtask #3
19.0 / 19.0

Subtask #4
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0