Submission #625300

# Submission time Handle Problem Language Result Execution time Memory
625300 2022-08-10T00:44:29 Z Trunkty Connecting Supertrees (IOI20_supertrees) C++14
19 / 100
230 ms 24084 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;
        }
        if(ans[i].size()<=1){
            continue;
        }
        else if(ans[i].size()==2){
            return 0;
        }
        else{
            ret[ans[i][0]][ans[i].back()] = 1;
            ret[ans[i].back()][ans[i][0]] = 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++){
      |                     ~^~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 8 ms 1236 KB Output is correct
9 Correct 184 ms 24040 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 1236 KB Output is correct
13 Correct 193 ms 24012 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 876 KB Output is correct
17 Correct 88 ms 14092 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 328 KB Output is correct
21 Correct 54 ms 6212 KB Output is correct
22 Correct 196 ms 23964 KB Output is correct
23 Correct 178 ms 23980 KB Output is correct
24 Correct 230 ms 23932 KB Output is correct
25 Correct 77 ms 14096 KB Output is correct
26 Correct 79 ms 14100 KB Output is correct
27 Correct 177 ms 23956 KB Output is correct
28 Correct 184 ms 24084 KB Output is correct
29 Correct 75 ms 14112 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Too many ways to get from 1 to 4, should be 1 found no less than 2
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -