oj.uz

Submission #888218

# Submission time Handle Problem Language Result Execution time Memory
888218 2023-12-16T14:07:39 Z 12345678 Connecting Supertrees (IOI20_supertrees) C++17
46 / 100
 166 ms 24144 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=1e3+5;
bool vs[nx];
vector<int> c[nx];

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
    for (int i=0; i<n; i++) for (int j=0; j<n; j++) if (p[i][j]==3) return 0;
	vector<vector<int>> answer(n, vector<int> (n, 0));
    vector<int> h;
	for (int i=0; i<n; i++)
    {
        if (vs[i]) continue;
        vector<int> d;
        for (int j=0; j<n; j++) if (p[i][j]==1) vs[j]=1, d.push_back(j);
        for (auto u:d) for (auto v:d) if (p[u][v]!=1) return 0;
        h.push_back(i);
        c[i]=d;
        int sz=d.size();
        for (int j=0; j<sz-1; j++) answer[d[j]][d[j+1]]=answer[d[j+1]][d[j]]=1;
    }
    for (int i=0; i<n; i++) vs[i]=0;
    for (int i=0; i<h.size(); i++)
    {
        if (vs[i]) continue;
        vector<int> d;
        for (auto j:h) if (p[i][j]) d.push_back(j), vs[j]=1;
        for (auto u:d)
        {
            for (auto v:d)
            {
                if (v==u) continue;
                for (auto x:c[u]) for (auto y:c[v]) if (p[x][y]!=2) return 0;
            }
        }
        if (d.size()==2) return 0;
        if (d.size()==1) continue;
        int sz=d.size();
        for (int j=0; j<sz-1; j++) answer[d[j]][d[j+1]]=answer[d[j+1]][d[j]]=1;
        answer[d[0]][d[sz-1]]=answer[d[sz-1]][d[0]]=1;
    }
	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:27:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for (int i=0; i<h.size(); i++)
      |                   ~^~~~~~~~~

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 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 148 ms 22060 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 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 148 ms 22060 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1112 KB Output is correct
13 Correct 154 ms 22244 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 464 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 64 ms 14224 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 39 ms 6296 KB Output is correct
21 Correct 152 ms 23960 KB Output is correct
22 Correct 149 ms 23936 KB Output is correct
23 Correct 153 ms 23964 KB Output is correct
24 Correct 152 ms 24144 KB Output is correct
25 Incorrect 150 ms 24144 KB Answer gives possible 1 while actual possible 0
26 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 7 ms 1112 KB Output is correct
9 Correct 166 ms 22032 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 7 ms 1128 KB Output is correct
13 Correct 164 ms 22216 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 66 ms 12080 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 39 ms 5720 KB Output is correct
22 Correct 151 ms 22096 KB Output is correct
23 Correct 148 ms 22228 KB Output is correct
24 Correct 163 ms 22060 KB Output is correct
25 Correct 63 ms 12080 KB Output is correct
26 Incorrect 149 ms 22056 KB Answer gives possible 1 while actual possible 0
27 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 36 ms 5796 KB Output is correct
5 Correct 154 ms 22180 KB Output is correct
6 Correct 146 ms 22100 KB Output is correct
7 Correct 151 ms 22100 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 43 ms 5716 KB Output is correct
10 Correct 153 ms 22064 KB Output is correct
11 Correct 150 ms 22100 KB Output is correct
12 Correct 158 ms 21996 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 37 ms 5744 KB Output is correct
17 Correct 150 ms 22064 KB Output is correct
18 Correct 153 ms 22096 KB Output is correct
19 Correct 149 ms 22096 KB Output is correct
20 Correct 149 ms 22104 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 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 148 ms 22060 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1112 KB Output is correct
13 Correct 154 ms 22244 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 464 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 64 ms 14224 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 39 ms 6296 KB Output is correct
21 Correct 152 ms 23960 KB Output is correct
22 Correct 149 ms 23936 KB Output is correct
23 Correct 153 ms 23964 KB Output is correct
24 Correct 152 ms 24144 KB Output is correct
25 Incorrect 150 ms 24144 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 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 148 ms 22060 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1112 KB Output is correct
13 Correct 154 ms 22244 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 464 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 64 ms 14224 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 39 ms 6296 KB Output is correct
21 Correct 152 ms 23960 KB Output is correct
22 Correct 149 ms 23936 KB Output is correct
23 Correct 153 ms 23964 KB Output is correct
24 Correct 152 ms 24144 KB Output is correct
25 Incorrect 150 ms 24144 KB Answer gives possible 1 while actual possible 0
26 Halted 0 ms 0 KB -