oj.uz

Submission #300339

# Submission time Handle Problem Language Result Execution time Memory
300339 2020-09-17T05:39:55 Z fpc_coder Connecting Supertrees (IOI20_supertrees) C++17
19 / 100
 248 ms 22264 KB 
#include <bits/stdc++.h>
#include "supertrees.h"

using namespace std;

int construct(vector<vector<int>> p) {
    vector<vector<int>> b(p.size(), vector<int>(p.size(), 0));
    int n = (int) p.size();
    vector<int> par(n, -1);
    vector<bool> vis(n, false);
    for (int i = 0; i < n; i++) {
        vector<int> v;
        if (!vis[i]) {
            for (int j = 0; j < n; j++) {
                if (p[i][j] == 2) {
                    v.push_back(j);
                    vis[i] = true; vis[j] = true;
                }
            }
            if ((int) v.size() == 1) return 0;
            if ((int) v.size() >= 2) {
                for (int j = 0; j + 1 < (int) v.size(); j++) {
                    b[v[j]][v[j + 1]] = 1;
                    b[v[j + 1]][v[j]] = 1;
                }
                b[v[0]][i] = 1;
                b[i][v[0]] = 1;
                b[v[(int) v.size() - 1]][i] = 1;
                b[i][v[(int) v.size() - 1]] = 1;
            }
        }
    }
    for (int i = 0; i < n; i++) par[i] = i;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < i; j++) {
            if (p[i][j] == 2) par[j] = i;
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (par[i] == par[j] && p[i][j] == 0) return 0;
            if (par[i] != par[j] && p[i][j] == 2) return 0;
        }
    }
    build(b);
    return 1;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 256 KB Too few ways to get from 0 to 1, should be 1 found 0
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 1 ms 256 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -

Subtask #3
19.0 / 19.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 Correct 1 ms 256 KB Output is correct
4 Correct 1 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 11 ms 1152 KB Output is correct
9 Correct 241 ms 22136 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 236 ms 22136 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 106 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 59 ms 5752 KB Output is correct
22 Correct 237 ms 22136 KB Output is correct
23 Correct 239 ms 22264 KB Output is correct
24 Correct 244 ms 22136 KB Output is correct
25 Correct 98 ms 12152 KB Output is correct
26 Correct 99 ms 12152 KB Output is correct
27 Correct 242 ms 22136 KB Output is correct
28 Correct 248 ms 22228 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 1 ms 256 KB Too few ways to get from 1 to 2, should be 1 found 0
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 1 ms 256 KB Too few ways to get from 0 to 1, should be 1 found 0
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 1 ms 256 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -