oj.uz

Submission #625299

# Submission time Handle Problem Language Result Execution time Memory
625299 2022-08-10T00:40:46 Z Trunkty Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 214 ms 24080 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
//#define int ll

#include "supertrees.h"

int root[1005];
vector<int> ans[1005];

int findroot(int x){
    if(root[x]!=x){
        root[x] = findroot(root[x]);
    }
    return root[x];
}

void domerge(int a, int b){
    a = findroot(a);
    b = findroot(b);
    root[a] = b;
}

int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> ret;
	for (int i = 0; i < n; i++) {
		vector<int> row;
		row.resize(n);
		ret.push_back(row);
	}
    for(int i=0;i<n;i++){
        root[i] = i;
    }
	for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(p[i][j]){
                domerge(i,j);
            }
        }
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(p[i][j]==0 and findroot(i)==findroot(j)){
                return 0;
            }
        }
    }
    for(int i=0;i<n;i++){
        ans[findroot(i)].push_back(i);
    }
    for(int i=0;i<n;i++){
        for(int j=1;j<ans[i].size();j++){
            ret[ans[i][j-1]][ans[i][j]] = 1;
            ret[ans[i][j]][ans[i][j-1]] = 1;
        }
    }
    build(ret);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:55:22: 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=1;j<ans[i].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 328 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 9 ms 1252 KB Output is correct
7 Correct 180 ms 24012 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 9 ms 1252 KB Output is correct
7 Correct 180 ms 24012 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 10 ms 1232 KB Output is correct
13 Correct 207 ms 24080 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 8 ms 852 KB Output is correct
17 Correct 101 ms 14096 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 46 ms 6284 KB Output is correct
21 Correct 184 ms 23992 KB Output is correct
22 Correct 214 ms 24004 KB Output is correct
23 Correct 195 ms 24048 KB Output is correct
24 Correct 183 ms 23952 KB Output is correct
25 Correct 69 ms 14016 KB Output is correct
26 Correct 74 ms 14104 KB Output is correct
27 Correct 196 ms 24024 KB Output is correct
28 Correct 205 ms 24012 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 212 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Too few ways to get from 0 to 1, should be 2 found 1
3 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 328 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 9 ms 1252 KB Output is correct
7 Correct 180 ms 24012 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 10 ms 1232 KB Output is correct
13 Correct 207 ms 24080 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 8 ms 852 KB Output is correct
17 Correct 101 ms 14096 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 46 ms 6284 KB Output is correct
21 Correct 184 ms 23992 KB Output is correct
22 Correct 214 ms 24004 KB Output is correct
23 Correct 195 ms 24048 KB Output is correct
24 Correct 183 ms 23952 KB Output is correct
25 Correct 69 ms 14016 KB Output is correct
26 Correct 74 ms 14104 KB Output is correct
27 Correct 196 ms 24024 KB Output is correct
28 Correct 205 ms 24012 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 328 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Incorrect 1 ms 212 KB Answer gives possible 1 while actual possible 0
33 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 328 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 9 ms 1252 KB Output is correct
7 Correct 180 ms 24012 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 10 ms 1232 KB Output is correct
13 Correct 207 ms 24080 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 8 ms 852 KB Output is correct
17 Correct 101 ms 14096 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 46 ms 6284 KB Output is correct
21 Correct 184 ms 23992 KB Output is correct
22 Correct 214 ms 24004 KB Output is correct
23 Correct 195 ms 24048 KB Output is correct
24 Correct 183 ms 23952 KB Output is correct
25 Correct 69 ms 14016 KB Output is correct
26 Correct 74 ms 14104 KB Output is correct
27 Correct 196 ms 24024 KB Output is correct
28 Correct 205 ms 24012 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 328 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Incorrect 1 ms 212 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -