oj.uz

Submission #304321

# Submission time Handle Problem Language Result Execution time Memory
304321 2020-09-21T06:08:51 Z abacaba Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 271 ms 22412 KB 
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <chrono>
#include <vector>
#include <map>
#include <random>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio>
#include <stdio.h>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <deque>
#include <cassert>
#include <stack>
#include "supertrees.h"
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
 
// typedef tree <int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
 
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ppb pop_back
#define emb emplace_back
#define ll long long
#define ull unsigned long long
#define cntbit(x) __builtin_popcount(x)
#define endl '\n'
#define uset unordered_set
#define umap unordered_map
#define pii pair<int, int>
#define ld long double
#define pll pair<long long, long long>
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
template <typename T> inline T range(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
 
template <typename T> void Min(T &a, T b) {
    a = min(a, b);
}
 
template <typename T> void Max(T &a, T b) {
    a = max(a, b);
}
 
const ll INF = 2e18;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 1e3 + 15;
 
bitset <N> d[N];
 
int par[2][N];
 
int find(int v, int i) {
    if(v == par[i][v])
        return v;
    return par[i][v] = find(par[i][v], i);
}
 
void unio(int a, int b, int i) {
    a = find(a, i);
    b = find(b, i);
    if(a != b)
        par[i][b] = a;
}
 
bool used[N];
 
int construct(vector<vector<int>> p) {
    int n = p.size();
    vector<vector<int>> row(n, vector <int> (n, 0));
    for(int i = 0; i < n; ++i)
        for(int j = 0; j < n; ++j)
            d[i][j] = p[i][j] != 0;
    for(int k = 0; k < n; ++k)
        for(int i = 0; i < n; ++i)
            if(d[i][k])
                d[i] |= d[k];
    for(int i = 0; i < n; ++i)
        for(int j = 0; j < n; ++j)
            if(d[i][j] ^ (p[i][j] != 0))
                return 0;
    for(int i = 0; i < n; ++i)
        par[0][i] = par[1][i] = i;
    for(int i = 0; i < n; ++i)
        for(int j = i + 1; j < n; ++j)
            if(d[i][j])
                unio(i, j, 0);
    for(int i = 0; i < n; ++i) {
        if(used[i])
            continue;
        vector <int> cur = {};
        for(int j = 0; j < n; ++j)
            if(find(i, 0) == find(j, 0))
                cur.pb(j);
        vector <int> cycle = {};
        for(int j = 0; j < cur.size(); ++j) {
            int v = cur[j];
            if(used[v])
                continue;
            if(!cycle.empty())
                row[cycle.back()][v] = row[v][cycle.back()] = 1;
            cycle.pb(v);
            used[v] = true;
            for(int u : cur) {
                if(p[u][v] == 1 && !used[u]) {
                    used[u] = used[v] = true;
                    row[u][v] = row[v][u] = 1;
                    unio(v, u, 1);
                    v = u;
                }
            }
        }
        if(cycle.size() > 1)
            row[cycle[0]][cycle.back()] = row[cycle.back()][cycle[0]] = 1;
        if(cycle.size() == 2 && p[cycle[0]][cycle[1]] == 2)
            return 0;
    }
    for(int i = 0; i < n; ++i) {
      	if(!used[i])
          	return 0;
        for(int j = i + 1; j < n; ++j) {
            if(p[i][j] == 0 && find(i, 0) != find(j, 0))
                continue;
            if(p[i][j] == 1 && find(i, 1) == find(j, 1))
                continue;
            if(p[i][j] == 2 && find(i, 0) == find(j, 0) && find(i, 1) != find(j, 1))
                continue;
            return 0;
        }
    }
    build(row);
    return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 263 ms 22264 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 263 ms 22264 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 234 ms 22412 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 123 ms 12280 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 60 ms 5880 KB Output is correct
21 Correct 241 ms 22264 KB Output is correct
22 Correct 237 ms 22264 KB Output is correct
23 Correct 263 ms 22268 KB Output is correct
24 Correct 244 ms 22264 KB Output is correct
25 Correct 104 ms 12280 KB Output is correct
26 Correct 98 ms 12380 KB Output is correct
27 Correct 262 ms 22264 KB Output is correct
28 Correct 237 ms 22264 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 232 ms 22264 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 266 ms 22264 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 123 ms 12284 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 61 ms 5920 KB Output is correct
22 Correct 246 ms 22240 KB Output is correct
23 Correct 235 ms 22264 KB Output is correct
24 Correct 262 ms 22264 KB Output is correct
25 Correct 108 ms 12280 KB Output is correct
26 Correct 104 ms 12280 KB Output is correct
27 Correct 238 ms 22264 KB Output is correct
28 Correct 261 ms 22360 KB Output is correct
29 Correct 103 ms 12280 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 61 ms 5884 KB Output is correct
5 Correct 238 ms 22264 KB Output is correct
6 Correct 236 ms 22264 KB Output is correct
7 Correct 264 ms 22392 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 62 ms 5880 KB Output is correct
10 Correct 243 ms 22316 KB Output is correct
11 Correct 236 ms 22236 KB Output is correct
12 Correct 271 ms 22264 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 61 ms 5880 KB Output is correct
17 Correct 244 ms 22264 KB Output is correct
18 Correct 242 ms 22264 KB Output is correct
19 Correct 235 ms 22264 KB Output is correct
20 Correct 235 ms 22264 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 263 ms 22264 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 234 ms 22412 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 123 ms 12280 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 60 ms 5880 KB Output is correct
21 Correct 241 ms 22264 KB Output is correct
22 Correct 237 ms 22264 KB Output is correct
23 Correct 263 ms 22268 KB Output is correct
24 Correct 244 ms 22264 KB Output is correct
25 Correct 104 ms 12280 KB Output is correct
26 Correct 98 ms 12380 KB Output is correct
27 Correct 262 ms 22264 KB Output is correct
28 Correct 237 ms 22264 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 512 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 232 ms 22264 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 266 ms 22264 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 6 ms 768 KB Output is correct
45 Correct 123 ms 12284 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 61 ms 5920 KB Output is correct
50 Correct 246 ms 22240 KB Output is correct
51 Correct 235 ms 22264 KB Output is correct
52 Correct 262 ms 22264 KB Output is correct
53 Correct 108 ms 12280 KB Output is correct
54 Correct 104 ms 12280 KB Output is correct
55 Correct 238 ms 22264 KB Output is correct
56 Correct 261 ms 22360 KB Output is correct
57 Correct 103 ms 12280 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 5 ms 768 KB Output is correct
61 Correct 133 ms 12260 KB Output is correct
62 Correct 0 ms 384 KB Output is correct
63 Correct 0 ms 384 KB Output is correct
64 Correct 0 ms 384 KB Output is correct
65 Correct 59 ms 5844 KB Output is correct
66 Correct 102 ms 12280 KB Output is correct
67 Correct 109 ms 12304 KB Output is correct
68 Correct 103 ms 12280 KB Output is correct
69 Correct 100 ms 12280 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 263 ms 22264 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 234 ms 22412 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 123 ms 12280 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 60 ms 5880 KB Output is correct
21 Correct 241 ms 22264 KB Output is correct
22 Correct 237 ms 22264 KB Output is correct
23 Correct 263 ms 22268 KB Output is correct
24 Correct 244 ms 22264 KB Output is correct
25 Correct 104 ms 12280 KB Output is correct
26 Correct 98 ms 12380 KB Output is correct
27 Correct 262 ms 22264 KB Output is correct
28 Correct 237 ms 22264 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 512 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 232 ms 22264 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 266 ms 22264 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 6 ms 768 KB Output is correct
45 Correct 123 ms 12284 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 61 ms 5920 KB Output is correct
50 Correct 246 ms 22240 KB Output is correct
51 Correct 235 ms 22264 KB Output is correct
52 Correct 262 ms 22264 KB Output is correct
53 Correct 108 ms 12280 KB Output is correct
54 Correct 104 ms 12280 KB Output is correct
55 Correct 238 ms 22264 KB Output is correct
56 Correct 261 ms 22360 KB Output is correct
57 Correct 103 ms 12280 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 0 ms 384 KB Output is correct
60 Correct 1 ms 512 KB Output is correct
61 Correct 61 ms 5884 KB Output is correct
62 Correct 238 ms 22264 KB Output is correct
63 Correct 236 ms 22264 KB Output is correct
64 Correct 264 ms 22392 KB Output is correct
65 Correct 0 ms 384 KB Output is correct
66 Correct 62 ms 5880 KB Output is correct
67 Correct 243 ms 22316 KB Output is correct
68 Correct 236 ms 22236 KB Output is correct
69 Correct 271 ms 22264 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Correct 61 ms 5880 KB Output is correct
74 Correct 244 ms 22264 KB Output is correct
75 Correct 242 ms 22264 KB Output is correct
76 Correct 235 ms 22264 KB Output is correct
77 Correct 235 ms 22264 KB Output is correct
78 Correct 0 ms 384 KB Output is correct
79 Correct 0 ms 256 KB Output is correct
80 Correct 5 ms 768 KB Output is correct
81 Correct 133 ms 12260 KB Output is correct
82 Correct 0 ms 384 KB Output is correct
83 Correct 0 ms 384 KB Output is correct
84 Correct 0 ms 384 KB Output is correct
85 Correct 59 ms 5844 KB Output is correct
86 Correct 102 ms 12280 KB Output is correct
87 Correct 109 ms 12304 KB Output is correct
88 Correct 103 ms 12280 KB Output is correct
89 Correct 100 ms 12280 KB Output is correct
90 Correct 1 ms 384 KB Output is correct
91 Correct 0 ms 256 KB Output is correct
92 Correct 5 ms 768 KB Output is correct
93 Correct 130 ms 12408 KB Output is correct
94 Correct 1 ms 384 KB Output is correct
95 Correct 0 ms 256 KB Output is correct
96 Correct 0 ms 256 KB Output is correct
97 Correct 25 ms 3320 KB Output is correct
98 Correct 104 ms 12408 KB Output is correct
99 Correct 106 ms 12252 KB Output is correct
100 Correct 101 ms 12280 KB Output is correct
101 Correct 111 ms 12252 KB Output is correct
102 Correct 131 ms 12280 KB Output is correct
103 Correct 129 ms 12280 KB Output is correct
104 Correct 128 ms 12280 KB Output is correct
105 Correct 126 ms 12256 KB Output is correct