Submission #314064

# Submission time Handle Problem Language Result Execution time Memory
314064 2020-10-18T05:10:47 Z linear00000 Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
266 ms 22264 KB
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

vector<vector<int> > d;
vector<int> C[1004];

int par[1004], num = 0;

int findpar(int N) {
	if (N == par[N]) return N;
	else return par[N] = findpar(par[N]);
}

void merge(int a, int b) {
	int aa = findpar(a), bb = findpar(b);
	par[aa] = bb;
}

int construct(vector<vector<int> > v) {
    int n = v.size();
    for (int i = 0; i < n; i++) par[i] = i;
    d.resize(n);
    for (int i = 0; i < n; i++) d[i].resize(n);

    // checking
    int type = 0;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (v[i][j] == 2) {
                type = 2;
                break;
            }
            if (v[i][j] == 1) type = 1;
        }
        if (type == 2) break;
    }

    // checking ends
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (v[i][j] == 2 && i != j) merge(i, j);
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (v[i][j] == 0) {
                if (findpar(i) == findpar(j)) return 0;
            }
        }
    }
    for (int i = 0; i < n; i++) par[i] = findpar(i);
    for (int i = 0; i < n; i++) C[par[i]].push_back(i);
    for (int i = 0; i < n; i++) {
        int cnt = 0;
        if (C[i].size() == 2) return 0;
        else if (C[i].size() >= 3) {
            for (int j = 0; j < C[i].size() - 1; j++) {
                d[C[i][j]][C[i][j + 1]] = 1, d[C[i][j + 1]][C[i][j]] = 1;
            }
            d[C[i][C[i].size() - 1]][C[i][0]] = 1, d[C[i][0]][C[i][C[i].size() - 1]] = 1;
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (v[i][j] >= 1 && i != j) merge(i, j);
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (v[i][j] == 0) {
                if (findpar(i) == findpar(j)) return 0;
            }
        }
    }
    for (int i = 0; i < n; i++) par[i] = findpar(i);
    for (int i = 0; i < n; i++) C[par[i]].push_back(i);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < C[i].size(); j++) {
            if (C[i][j] != i) d[i][C[i][j]] = 1, d[C[i][j]][i] = 1;
        }
    }
    build(d);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:60:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |             for (int j = 0; j < C[i].size() - 1; j++) {
      |                             ~~^~~~~~~~~~~~~~~~~
supertrees.cpp:57:13: warning: unused variable 'cnt' [-Wunused-variable]
   57 |         int cnt = 0;
      |             ^~~
supertrees.cpp:81:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |         for (int j = 0; j < C[i].size(); j++) {
      |                         ~~^~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 250 ms 22136 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 250 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 245 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 124 ms 12272 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 61 ms 5880 KB Output is correct
21 Correct 245 ms 22136 KB Output is correct
22 Correct 241 ms 22140 KB Output is correct
23 Correct 261 ms 22136 KB Output is correct
24 Correct 241 ms 22264 KB Output is correct
25 Correct 109 ms 12276 KB Output is correct
26 Correct 108 ms 12152 KB Output is correct
27 Correct 266 ms 22136 KB Output is correct
28 Correct 241 ms 22260 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 236 ms 22136 KB Output is correct
10 Incorrect 1 ms 384 KB Too many ways to get from 0 to 4, should be 2 found no less than 3
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 65 ms 5880 KB Output is correct
5 Correct 252 ms 22136 KB Output is correct
6 Correct 240 ms 22136 KB Output is correct
7 Correct 260 ms 22136 KB Output is correct
8 Incorrect 1 ms 384 KB Too many ways to get from 0 to 3, should be 2 found no less than 3
9 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 250 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 245 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 124 ms 12272 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 61 ms 5880 KB Output is correct
21 Correct 245 ms 22136 KB Output is correct
22 Correct 241 ms 22140 KB Output is correct
23 Correct 261 ms 22136 KB Output is correct
24 Correct 241 ms 22264 KB Output is correct
25 Correct 109 ms 12276 KB Output is correct
26 Correct 108 ms 12152 KB Output is correct
27 Correct 266 ms 22136 KB Output is correct
28 Correct 241 ms 22260 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 236 ms 22136 KB Output is correct
38 Incorrect 1 ms 384 KB Too many ways to get from 0 to 4, should be 2 found no less than 3
39 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 250 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 245 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 124 ms 12272 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 61 ms 5880 KB Output is correct
21 Correct 245 ms 22136 KB Output is correct
22 Correct 241 ms 22140 KB Output is correct
23 Correct 261 ms 22136 KB Output is correct
24 Correct 241 ms 22264 KB Output is correct
25 Correct 109 ms 12276 KB Output is correct
26 Correct 108 ms 12152 KB Output is correct
27 Correct 266 ms 22136 KB Output is correct
28 Correct 241 ms 22260 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 236 ms 22136 KB Output is correct
38 Incorrect 1 ms 384 KB Too many ways to get from 0 to 4, should be 2 found no less than 3
39 Halted 0 ms 0 KB -