oj.uz

Submission #301459

# Submission time Handle Problem Language Result Execution time Memory
301459 2020-09-18T01:21:01 Z mth1908 Connecting Supertrees (IOI20_supertrees) C++17
19 / 100
 286 ms 22392 KB 
#include <bits/stdc++.h>
#include "supertrees.h"

using namespace std;

#define ll long long
#define ull unsigned long long
#define ar array
#define pii pair<int, int>
#define sz(s) (int) s.size()
#define all(s) s.begin(), s.end()

int construct(vector<vector<int>> p) {
    int n = sz(p);
    vector<vector<int>> comp1(n), comp2(n);
    vector<vector<int>> b(n, vector<int>(n, 0));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (p[i][j] == 3) return 0;
        }
    }
    vector<int> par1(n), par2(n);
    for (int i = 0; i < n; i++) {
        par1[i] = par2[i] = i;
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (p[i][j] == 1) {
                par1[i] = j;
                comp1[i].push_back(j);
                break;
            }
        }
    }
    for (int i = 0; i < n; i++) {
        if (par1[i] != i) continue;
        for (int j = 0; j < n; j++) {
            if (par1[j] != j) continue;
            if (p[i][j] == 2 || i == j) {
                par2[i] = j;
                comp2[j].push_back(i);
                break;
            }
        }
    }
    for (int i = 0; i < n; i++) {
        vector<int> comp = comp1[i];
        for (int j = 1; j < sz(comp); j++) {
            if (p[comp[j]] != p[comp[0]]) return 0;
            b[comp[j]][comp[0]] = 1;
            b[comp[0]][comp[j]] = 1;
        }
        comp = comp2[i];
        if (sz(comp) == 2) return 0;
        if (sz(comp) < 2) continue;
        for (int j = 0; j < sz(comp); j++) {
            for (int k = 0; k < j; k++) {
                if (p[comp[j]][comp[k]] != 2) return 0;
            }
        }
        for (int j = 1; j < sz(comp); j++) {
            b[comp[j]][comp[j - 1]] = 1;
            b[comp[j - 1]][comp[j]] = 1;
        }
        b[comp[0]][comp[sz(comp) - 1]] = 1;
        b[comp[sz(comp) - 1]][comp[0]] = 1;
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (p[i][j] == 1 && par1[i] != par1[j]) return 0;
            if (p[i][j] == 2 && par2[par1[i]] != par2[par1[j]]) return 0;
        }
    }
    build(b);
    return 1;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 384 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 384 KB Output is correct
2 Incorrect 0 ms 384 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 0 ms 256 KB Output is correct
2 Correct 0 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 384 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 244 ms 22136 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 250 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 7 ms 768 KB Output is correct
17 Correct 112 ms 12280 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 61 ms 5880 KB Output is correct
22 Correct 241 ms 22392 KB Output is correct
23 Correct 239 ms 22264 KB Output is correct
24 Correct 286 ms 22268 KB Output is correct
25 Correct 106 ms 12280 KB Output is correct
26 Correct 107 ms 12244 KB Output is correct
27 Correct 240 ms 22176 KB Output is correct
28 Correct 283 ms 22264 KB Output is correct
29 Correct 116 ms 12280 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 416 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 384 KB Output is correct
2 Incorrect 0 ms 384 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 384 KB Output is correct
2 Incorrect 0 ms 384 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -