oj.uz

Submission #441902

# Submission time Handle Problem Language Result Execution time Memory
441902 2021-07-06T14:23:31 Z PiejanVDC Connecting Supertrees (IOI20_supertrees) C++17
11 / 100
 263 ms 24000 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
void build(std::vector<std::vector<int>> _b);
vector<int>parent;

int uf(int p) {
    if(parent[p] == p) return p;
    return parent[p] = uf(parent[p]);
}

bool same(int u, int v) {
    if(uf(u) == uf(v)) {
        return true;
    }
    return false;
}

int construct(vector<vector<int>> p) {
    int n = p.size();
    parent.resize(n);
    for(int i = 0 ; i < n ; i++) {
        parent[i]=i;
    }
    vector<vector<int>>v(n,vector<int>(n,0));
    for(int i = 0 ; i < n-1 ; i++) {
        for(int j = i+1 ; j < n ; j++) {
            if(p[i][j]) {
                if(!same(i,j)) {
                    v[i][j]=1,v[j][i]=1;
                    parent[j]=i;
                }
            }
        }
    }
    for(int i = 0 ; i < n ; i++) {
        for(int j = i+1 ; j < n ; j++) {
            if(!p[i][j]) {
                if(same(i,j)) {
                    return 0;
                }
            }
        }
    }
    build(v);
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 13 ms 1228 KB Output is correct
7 Correct 232 ms 23972 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 13 ms 1228 KB Output is correct
7 Correct 232 ms 23972 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1204 KB Output is correct
13 Correct 229 ms 23916 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 784 KB Output is correct
17 Correct 106 ms 14060 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 57 ms 6232 KB Output is correct
21 Correct 232 ms 23952 KB Output is correct
22 Correct 247 ms 23916 KB Output is correct
23 Correct 235 ms 23904 KB Output is correct
24 Correct 226 ms 23876 KB Output is correct
25 Incorrect 263 ms 24000 KB Answer gives possible 1 while actual possible 0
26 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Incorrect 0 ms 204 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 1 ms 204 KB Output is correct
2 Incorrect 0 ms 204 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 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 13 ms 1228 KB Output is correct
7 Correct 232 ms 23972 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1204 KB Output is correct
13 Correct 229 ms 23916 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 784 KB Output is correct
17 Correct 106 ms 14060 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 57 ms 6232 KB Output is correct
21 Correct 232 ms 23952 KB Output is correct
22 Correct 247 ms 23916 KB Output is correct
23 Correct 235 ms 23904 KB Output is correct
24 Correct 226 ms 23876 KB Output is correct
25 Incorrect 263 ms 24000 KB Answer gives possible 1 while actual possible 0
26 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 13 ms 1228 KB Output is correct
7 Correct 232 ms 23972 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1204 KB Output is correct
13 Correct 229 ms 23916 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 784 KB Output is correct
17 Correct 106 ms 14060 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 57 ms 6232 KB Output is correct
21 Correct 232 ms 23952 KB Output is correct
22 Correct 247 ms 23916 KB Output is correct
23 Correct 235 ms 23904 KB Output is correct
24 Correct 226 ms 23876 KB Output is correct
25 Incorrect 263 ms 24000 KB Answer gives possible 1 while actual possible 0
26 Halted 0 ms 0 KB -