oj.uz

Submission #434563

# Submission time Handle Problem Language Result Execution time Memory
434563 2021-06-21T12:07:55 Z yuto1115 Connecting Supertrees (IOI20_supertrees) C++17
56 / 100
 290 ms 22216 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, s, n) for(ll i = ll(s); i < ll(n); i++)
#define rrep(i, n) for(ll i = ll(n)-1; i >= 0; i--)
#define pb push_back
#define eb emplace_back
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vs = vector<string>;
const int inf = 1001001001;
const ll linf = 1001001001001001001;

template<class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

class unionfind {
    int n;
    vi p;
public:
    unionfind(int n) : n(n), p(n, -1) {}
    
    int root(int x) {
        if (p[x] < 0) return x;
        return p[x] = root(p[x]);
    }
    
    bool same(int x, int y) { return root(x) == root(y); }
    
    void merge(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return;
        if (p[x] > p[y]) swap(x, y);
        p[x] += p[y];
        p[y] = x;
    }
};

int construct(vvi p) {
    int n = p.size();
    unionfind uf(n);
    rep(i, n) rep2(j, i + 1, n) {
            if (p[i][j] == 3) return 0;
            if (p[i][j]) uf.merge(i, j);
        }
    rep(i, n) rep2(j, i + 1, n) {
            if (!p[i][j] and uf.same(i, j)) return 0;
        }
    map<int, vi> mp;
    rep(i, n) mp[uf.root(i)].pb(i);
    vvi ans(n, vi(n));
    for (auto[_, ls] : mp) {
        int sz = ls.size();
        uf = unionfind(sz);
        rep(i, sz) rep2(j, i + 1, sz) {
                if (p[ls[i]][ls[j]] == 1) uf.merge(i, j);
            }
        rep(i, sz) rep2(j, i + 1, sz) {
                if (p[ls[i]][ls[j]] == 2 and uf.same(i, j)) return 0;
            }
        vi rs;
        rep(i, sz) {
            int r = uf.root(i);
            if (r == i) {
                rs.pb(r);
            } else {
                ans[ls[r]][ls[i]] = 1;
                ans[ls[i]][ls[r]] = 1;
            }
        }
        if (rs.size() >= 2) {
            rep(i, rs.size() - 1) {
                ans[ls[rs[i]]][ls[rs[i + 1]]] = 1;
                ans[ls[rs[i + 1]]][ls[rs[i]]] = 1;
            }
            ans[ls[rs[0]]][ls[rs.back()]] = 1;
            ans[ls[rs.back()]][ls[rs[0]]] = 1;
        }
    }
    build(ans);
    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 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1188 KB Output is correct
7 Correct 255 ms 22216 KB Output is correct

Subtask #2
10.0 / 10.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 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1188 KB Output is correct
7 Correct 255 ms 22216 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 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 1184 KB Output is correct
13 Correct 251 ms 22108 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 580 KB Output is correct
17 Correct 105 ms 8088 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 65 ms 5756 KB Output is correct
21 Correct 290 ms 22052 KB Output is correct
22 Correct 236 ms 22084 KB Output is correct
23 Correct 244 ms 21956 KB Output is correct
24 Correct 226 ms 22044 KB Output is correct
25 Correct 111 ms 8060 KB Output is correct
26 Correct 97 ms 8060 KB Output is correct
27 Correct 246 ms 22012 KB Output is correct
28 Correct 231 ms 22136 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Incorrect 1 ms 204 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 58 ms 5756 KB Output is correct
5 Correct 257 ms 22008 KB Output is correct
6 Correct 231 ms 22084 KB Output is correct
7 Correct 236 ms 22012 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 71 ms 5752 KB Output is correct
10 Correct 232 ms 21968 KB Output is correct
11 Correct 231 ms 21956 KB Output is correct
12 Correct 238 ms 22016 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 58 ms 5760 KB Output is correct
17 Correct 232 ms 22024 KB Output is correct
18 Correct 246 ms 22084 KB Output is correct
19 Correct 273 ms 21968 KB Output is correct
20 Correct 227 ms 22084 KB Output is correct

Subtask #5
0 / 21.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 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1188 KB Output is correct
7 Correct 255 ms 22216 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 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 1184 KB Output is correct
13 Correct 251 ms 22108 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 580 KB Output is correct
17 Correct 105 ms 8088 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 65 ms 5756 KB Output is correct
21 Correct 290 ms 22052 KB Output is correct
22 Correct 236 ms 22084 KB Output is correct
23 Correct 244 ms 21956 KB Output is correct
24 Correct 226 ms 22044 KB Output is correct
25 Correct 111 ms 8060 KB Output is correct
26 Correct 97 ms 8060 KB Output is correct
27 Correct 246 ms 22012 KB Output is correct
28 Correct 231 ms 22136 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Incorrect 1 ms 204 KB Answer gives possible 1 while actual possible 0
33 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 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1188 KB Output is correct
7 Correct 255 ms 22216 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 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 1184 KB Output is correct
13 Correct 251 ms 22108 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 580 KB Output is correct
17 Correct 105 ms 8088 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 65 ms 5756 KB Output is correct
21 Correct 290 ms 22052 KB Output is correct
22 Correct 236 ms 22084 KB Output is correct
23 Correct 244 ms 21956 KB Output is correct
24 Correct 226 ms 22044 KB Output is correct
25 Correct 111 ms 8060 KB Output is correct
26 Correct 97 ms 8060 KB Output is correct
27 Correct 246 ms 22012 KB Output is correct
28 Correct 231 ms 22136 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Incorrect 1 ms 204 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -