oj.uz

Submission #790197

# Submission time Handle Problem Language Result Execution time Memory
790197 2023-07-22T12:01:07 Z Andrey Connecting Supertrees (IOI20_supertrees) C++14
30 / 100
 178 ms 27976 KB 
#include "supertrees.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;

vector<vector<int>> ans(0);
vector<vector<int>> haha(0);
vector<bool> bruh(3001,true);
int n;
vector<int> col(3000,-1);
vector<int> no(3000,-1);

void dfs(int a, int c) {
    col[a] = c;
    if(a != c) {
        ans[a][c] = 1;
        ans[c][a] = 1;
    }
    for(int i = 0; i < n; i++) {
        if(col[i] == -1 && haha[a][i] == 1) {
            dfs(i,c);
        }
    }
}

int construct(vector<vector<int>> p) {
    n = p[0].size();
    haha = p;
    vector<int> wut(0);
    for(int i = 0; i < n; i++) {
        ans.push_back(vector<int> (n));
    }
    for(int i = 0; i < n; i++) {
        if(col[i] == -1) {
            dfs(i,i);
            wut.push_back(i);
        }
    }
    for(int i = 0; i < wut.size(); i++) {
        if(no[i] == -1) {
            vector<int> wow(0);
            wow.push_back(wut[i]);
            no[i] = i;
            for(int j = 0; j < wut.size(); j++) {
                if(haha[wut[i]][wut[j]] == 2 && no[j] == -1) {
                    bruh[j] = false;
                    wow.push_back(wut[j]);
                    no[j] = i;
                }
            }
            if(wow.size() == 2) {
                return 0;
            }
            if(wow.size() > 1) {
                for(int j = 0; j < wow.size(); j++) {
                    ans[wow[j]][wow[(j+1)%(int)wow.size()]] = 1;
                    ans[wow[(j+1)%(int)wow.size()]][wow[j]] = 1;
                }
            }
        }
    }
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            if(i != j) {
                if((col[i] == col[j]) && haha[i][j] != 1) {
                    return 0;
                }
                if((col[i] != col[j] && no[col[i]] == no[col[j]]) && haha[i][j] != 2) {
                    return 0;
                }
                if(no[col[i]] != no[col[j]] && haha[i][j] != 0) {
                    return 0;
                }
            }
        }
    }
    build(ans);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:39:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for(int i = 0; i < wut.size(); i++) {
      |                    ~~^~~~~~~~~~~~
supertrees.cpp:44:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |             for(int j = 0; j < wut.size(); j++) {
      |                            ~~^~~~~~~~~~~~
supertrees.cpp:55:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |                 for(int j = 0; j < wow.size(); j++) {
      |                                ~~^~~~~~~~~~~~

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 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 6 ms 1364 KB Output is correct
7 Correct 157 ms 26208 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 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 6 ms 1364 KB Output is correct
7 Correct 157 ms 26208 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 0 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 1364 KB Output is correct
13 Correct 153 ms 26272 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 980 KB Output is correct
17 Correct 65 ms 18056 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Incorrect 16 ms 4760 KB Answer gives possible 0 while actual possible 1
21 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 3 ms 292 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 1456 KB Output is correct
9 Correct 158 ms 27976 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1420 KB Output is correct
13 Correct 157 ms 27956 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 65 ms 18060 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 39 ms 7228 KB Output is correct
22 Correct 163 ms 27916 KB Output is correct
23 Correct 152 ms 27948 KB Output is correct
24 Correct 178 ms 27928 KB Output is correct
25 Correct 61 ms 18060 KB Output is correct
26 Correct 65 ms 18068 KB Output is correct
27 Correct 155 ms 27912 KB Output is correct
28 Correct 157 ms 27964 KB Output is correct
29 Correct 61 ms 18072 KB Output is correct

Subtask #4
0 / 35.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 1 ms 324 KB Output is correct
4 Incorrect 16 ms 4432 KB Answer gives possible 0 while actual possible 1
5 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 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 6 ms 1364 KB Output is correct
7 Correct 157 ms 26208 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 0 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 1364 KB Output is correct
13 Correct 153 ms 26272 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 980 KB Output is correct
17 Correct 65 ms 18056 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Incorrect 16 ms 4760 KB Answer gives possible 0 while actual possible 1
21 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 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 6 ms 1364 KB Output is correct
7 Correct 157 ms 26208 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 0 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 1364 KB Output is correct
13 Correct 153 ms 26272 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 980 KB Output is correct
17 Correct 65 ms 18056 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Incorrect 16 ms 4760 KB Answer gives possible 0 while actual possible 1
21 Halted 0 ms 0 KB -