oj.uz

Submission #873352

# Submission time Handle Problem Language Result Execution time Memory
873352 2023-11-14T22:00:20 Z teokakabadze Connecting Supertrees (IOI20_supertrees) C++17
65 / 100
 169 ms 26152 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;
      	if(p[i][j] != p[j][i]) return 0;
      	if(i == j && !p[i][j]) 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 3420 KB Output is correct
7 Correct 148 ms 26152 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 3420 KB Output is correct
7 Correct 148 ms 26152 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 151 ms 22048 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 2908 KB Output is correct
17 Correct 69 ms 11288 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 544 KB Output is correct
20 Correct 37 ms 7916 KB Output is correct
21 Correct 152 ms 26140 KB Output is correct
22 Correct 157 ms 25932 KB Output is correct
23 Correct 156 ms 25936 KB Output is correct
24 Correct 150 ms 24356 KB Output is correct
25 Incorrect 151 ms 26028 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 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 6 ms 1112 KB Output is correct
9 Correct 147 ms 22096 KB Output is correct
10 Correct 0 ms 600 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 7 ms 3420 KB Output is correct
13 Correct 151 ms 26144 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 2652 KB Output is correct
17 Correct 70 ms 11288 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 38 ms 7988 KB Output is correct
22 Correct 169 ms 25936 KB Output is correct
23 Correct 158 ms 25944 KB Output is correct
24 Correct 159 ms 26132 KB Output is correct
25 Correct 63 ms 10260 KB Output is correct
26 Correct 60 ms 10776 KB Output is correct
27 Correct 151 ms 25944 KB Output is correct
28 Correct 154 ms 25936 KB Output is correct
29 Correct 57 ms 10256 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 38 ms 7952 KB Output is correct
5 Correct 146 ms 25888 KB Output is correct
6 Correct 152 ms 25924 KB Output is correct
7 Correct 157 ms 25892 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 41 ms 8032 KB Output is correct
10 Correct 154 ms 25912 KB Output is correct
11 Correct 153 ms 25936 KB Output is correct
12 Correct 157 ms 25940 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 39 ms 7928 KB Output is correct
17 Correct 156 ms 26152 KB Output is correct
18 Correct 153 ms 25684 KB Output is correct
19 Correct 152 ms 25888 KB Output is correct
20 Correct 149 ms 24144 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 3420 KB Output is correct
7 Correct 148 ms 26152 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 151 ms 22048 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 2908 KB Output is correct
17 Correct 69 ms 11288 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 544 KB Output is correct
20 Correct 37 ms 7916 KB Output is correct
21 Correct 152 ms 26140 KB Output is correct
22 Correct 157 ms 25932 KB Output is correct
23 Correct 156 ms 25936 KB Output is correct
24 Correct 150 ms 24356 KB Output is correct
25 Incorrect 151 ms 26028 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 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 3420 KB Output is correct
7 Correct 148 ms 26152 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 151 ms 22048 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 2908 KB Output is correct
17 Correct 69 ms 11288 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 544 KB Output is correct
20 Correct 37 ms 7916 KB Output is correct
21 Correct 152 ms 26140 KB Output is correct
22 Correct 157 ms 25932 KB Output is correct
23 Correct 156 ms 25936 KB Output is correct
24 Correct 150 ms 24356 KB Output is correct
25 Incorrect 151 ms 26028 KB Answer gives possible 1 while actual possible 0
26 Halted 0 ms 0 KB -