oj.uz

Submission #302933

# Submission time Handle Problem Language Result Execution time Memory
302933 2020-09-19T12:56:29 Z ivan24 Connecting Supertrees (IOI20_supertrees) C++14
19 / 100
 251 ms 22264 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

using ll = int;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
#define F first
#define S second

class UnionFind {
private:
    ll n;
    vi p,sz;
public:
    UnionFind(ll n): n(n),p(n),sz(n,1){
        for (ll i = 0; n > i; i++) p[i] = i;
    }
    ll root(ll x){
        if (x != p[x]) p[x] = root(p[x]);
        return p[x];
    }
    void unify (ll x, ll y){
        x = root(x), y = root(y);
        if(x == y) return;
        if (sz[x] < sz[y]) swap(x,y);
        p[y] = x; sz[x] += sz[y];
    }
};

void build(vvi b);

int construct(vvi p) {
	int n = p.size();
	vvi ans(n,vi(n,0));
	vi hasSet(n,0);
	for (int i = 0; n > i; i++){
        if (hasSet[i]){
            for (ll j = 0; n > j; j++){
                if (j == i) continue;
                if (p[i][j]) return 0;
            }
            continue;
        }
	    vi cur_set;
        for (ll j = 0; n > j; j++){
            if (p[i][j] != 0){
                cur_set.push_back(j);
                if (hasSet[j]) return 0;
                else hasSet[j] = 1;
            }
        }
        for (auto j: cur_set){
            for (auto k: cur_set){
                if (j == k) continue;
                if (p[j][k] == 0) return 0;
                else p[j][k] = 0;
            }
        }
        if (cur_set.size() == 1) continue;
        if (cur_set.size() == 2) return 0;
        for (ll j = 0; cur_set.size() > j; j++){
            //ans[i][cur_set[j]] = ans[cur_set[j]][i] = 1;
            ans[cur_set[j]][cur_set[(j+1)%cur_set.size()]] = ans[cur_set[(j+1)%cur_set.size()]][cur_set[j]] = 1;
        }
	}
	for (ll i = 0; n > i; i++){
        for (ll j = 0; n > j; j++){
            if (p[i][j] && i != j) return 0;
        }
	}
	build(ans);
	return 1;
}

Compilation message

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

Subtask #1
0 / 11.0

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

Subtask #2
0 / 10.0

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

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 10 ms 1152 KB Output is correct
9 Correct 237 ms 22104 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 249 ms 22136 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 103 ms 12156 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 64 ms 5752 KB Output is correct
22 Correct 251 ms 22084 KB Output is correct
23 Correct 236 ms 22136 KB Output is correct
24 Correct 251 ms 22136 KB Output is correct
25 Correct 101 ms 12152 KB Output is correct
26 Correct 106 ms 12156 KB Output is correct
27 Correct 244 ms 22264 KB Output is correct
28 Correct 246 ms 22136 KB Output is correct
29 Correct 97 ms 12152 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Incorrect 0 ms 252 KB Too many ways to get from 1 to 4, should be 1 found no less than 2
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

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

Subtask #6
0 / 4.0

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