oj.uz

Submission #948268

# Submission time Handle Problem Language Result Execution time Memory
948268 2024-03-18T02:34:46 Z steveonalex Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 165 ms 22320 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

struct DSU{
    int n;
    vector<int> parent, sz;

    DSU(int _n){
        n = _n;
        parent.resize(n); sz.resize(n, 1);
        for(int i = 0; i<n; ++i) parent[i] = i;
    }

    int find_set(int u){return (u == parent[u]) ? u : (parent[u] = find_set(parent[u]));}
    bool same_set(int u, int v){return find_set(u) == find_set(v);}

    bool join_set(int u, int v){
        u = find_set(u), v = find_set(v);
        if (u != v){
            if (sz[u] < sz[v]) swap(u, v);
            parent[v] = u;
            sz[u] += sz[v];
            return true;
        }
        return false;
    }
};

// void build(vector<vector<int>> p){
//     cout << "Answer: \n";
//     for(int i = 0; i<p.size(); ++i) printArr(p[i]);
// }

const int N = 1009;

vector<int> crew[N];

int construct(vector<vector<int>> p) {
    int n = p.size();
    vector<vector<int>> ans(n, vector<int>(n));

    for(int i = 0; i<n; ++i) crew[i].clear();

    DSU chode(n);
    for(int i = 0; i<n; ++i) for(int j = i+1; j<n; ++j) if (p[i][j]) chode.join_set(i, j);
    for(int i = 0; i<n; ++i) for(int j = i+1; j<n; ++j) if (p[i][j] == 0 && chode.same_set(i, j)) return 0; 

    for(int i = 0; i<n; ++i) crew[chode.find_set(i)].push_back(i);

    DSU sigma(n);
    for(int i= 0; i<n; ++i) for(int j = i+1; j<n; ++j) if (p[i][j] == 1) sigma.join_set(i, j);

    for(int i = 0; i<n; ++i) if (crew[i].size()){
        vector<int> pos;
        int idx = -1;
        for(int j: crew[i]) if (j != sigma.find_set(j)) {
            int k = sigma.find_set(j);
            if (idx != -1 && k != idx) return 0;
            idx = k;
            ans[j][k] = ans[k][j] = 1;
        }
        else pos.push_back(j);

        if (pos.size() == 1) continue;
        if (pos.size() == 2) return 0;
        int m = pos.size();
        for(int x: pos) if (x != idx) for(int y: crew[i]) if (x != y)
            if (p[x][y] != p[pos[0]][pos[1]]) return 0;
        int deg = p[pos[0]][pos[1]];
        // if (pos.size() <= deg) return 0;
        for(int i = 0; i<m; ++i) {
            int j = (i + 1) % m;
            ans[pos[i]][pos[j]] = ans[pos[j]][pos[i]] = 1;
        }
        if (deg == 3){
            ans[pos[0]][pos[2]] = ans[pos[2]][pos[0]] = 1;
        }
    }

    build(ans);
    return 1;
}

 
// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//     construct({{1, 1, 2, 2}, {1, 1, 2, 2}, {2, 2, 1, 2}, {2, 2, 2, 1}});
//     return 0;
// }

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 151 ms 22124 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 151 ms 22124 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 134 ms 22064 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 67 ms 12084 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 35 ms 5740 KB Output is correct
21 Correct 156 ms 22320 KB Output is correct
22 Correct 138 ms 22012 KB Output is correct
23 Correct 141 ms 22160 KB Output is correct
24 Correct 134 ms 22068 KB Output is correct
25 Correct 60 ms 12112 KB Output is correct
26 Correct 64 ms 12068 KB Output is correct
27 Correct 141 ms 22200 KB Output is correct
28 Correct 135 ms 22128 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 6 ms 1112 KB Output is correct
9 Correct 132 ms 22072 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 137 ms 22052 KB Output is correct
14 Correct 0 ms 544 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 884 KB Output is correct
17 Correct 66 ms 12064 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 39 ms 5876 KB Output is correct
22 Correct 136 ms 21992 KB Output is correct
23 Correct 143 ms 22100 KB Output is correct
24 Correct 141 ms 22184 KB Output is correct
25 Correct 62 ms 12116 KB Output is correct
26 Correct 62 ms 12080 KB Output is correct
27 Correct 143 ms 22096 KB Output is correct
28 Correct 141 ms 22068 KB Output is correct
29 Correct 61 ms 12324 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 35 ms 5716 KB Output is correct
5 Correct 146 ms 22000 KB Output is correct
6 Correct 135 ms 22100 KB Output is correct
7 Correct 141 ms 22096 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 34 ms 5756 KB Output is correct
10 Correct 137 ms 22204 KB Output is correct
11 Correct 165 ms 22096 KB Output is correct
12 Correct 141 ms 22048 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Incorrect 16 ms 3420 KB Answer gives possible 0 while actual possible 1
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 151 ms 22124 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 134 ms 22064 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 67 ms 12084 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 35 ms 5740 KB Output is correct
21 Correct 156 ms 22320 KB Output is correct
22 Correct 138 ms 22012 KB Output is correct
23 Correct 141 ms 22160 KB Output is correct
24 Correct 134 ms 22068 KB Output is correct
25 Correct 60 ms 12112 KB Output is correct
26 Correct 64 ms 12068 KB Output is correct
27 Correct 141 ms 22200 KB Output is correct
28 Correct 135 ms 22128 KB Output is correct
29 Correct 1 ms 504 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 6 ms 1112 KB Output is correct
37 Correct 132 ms 22072 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 6 ms 1116 KB Output is correct
41 Correct 137 ms 22052 KB Output is correct
42 Correct 0 ms 544 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 884 KB Output is correct
45 Correct 66 ms 12064 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 39 ms 5876 KB Output is correct
50 Correct 136 ms 21992 KB Output is correct
51 Correct 143 ms 22100 KB Output is correct
52 Correct 141 ms 22184 KB Output is correct
53 Correct 62 ms 12116 KB Output is correct
54 Correct 62 ms 12080 KB Output is correct
55 Correct 143 ms 22096 KB Output is correct
56 Correct 141 ms 22068 KB Output is correct
57 Correct 61 ms 12324 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 3 ms 860 KB Output is correct
61 Correct 66 ms 12064 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Incorrect 16 ms 3248 KB Answer gives possible 0 while actual possible 1
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 151 ms 22124 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 134 ms 22064 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 67 ms 12084 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 35 ms 5740 KB Output is correct
21 Correct 156 ms 22320 KB Output is correct
22 Correct 138 ms 22012 KB Output is correct
23 Correct 141 ms 22160 KB Output is correct
24 Correct 134 ms 22068 KB Output is correct
25 Correct 60 ms 12112 KB Output is correct
26 Correct 64 ms 12068 KB Output is correct
27 Correct 141 ms 22200 KB Output is correct
28 Correct 135 ms 22128 KB Output is correct
29 Correct 1 ms 504 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 6 ms 1112 KB Output is correct
37 Correct 132 ms 22072 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 6 ms 1116 KB Output is correct
41 Correct 137 ms 22052 KB Output is correct
42 Correct 0 ms 544 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 884 KB Output is correct
45 Correct 66 ms 12064 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 39 ms 5876 KB Output is correct
50 Correct 136 ms 21992 KB Output is correct
51 Correct 143 ms 22100 KB Output is correct
52 Correct 141 ms 22184 KB Output is correct
53 Correct 62 ms 12116 KB Output is correct
54 Correct 62 ms 12080 KB Output is correct
55 Correct 143 ms 22096 KB Output is correct
56 Correct 141 ms 22068 KB Output is correct
57 Correct 61 ms 12324 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 35 ms 5716 KB Output is correct
62 Correct 146 ms 22000 KB Output is correct
63 Correct 135 ms 22100 KB Output is correct
64 Correct 141 ms 22096 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 34 ms 5756 KB Output is correct
67 Correct 137 ms 22204 KB Output is correct
68 Correct 165 ms 22096 KB Output is correct
69 Correct 141 ms 22048 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Incorrect 16 ms 3420 KB Answer gives possible 0 while actual possible 1
74 Halted 0 ms 0 KB -