oj.uz

답안 #488037

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
488037 2021-11-17T13:03:47 Z SlavicG 슈퍼트리 잇기 (IOI20_supertrees) C++17
40 / 100
 228 ms 26192 KB 
#include "supertrees.h"
#include "bits/stdc++.h"
using namespace std;
 
#define ll long long
 
#define       forn(i,n)              for(int i=0;i<n;i++)
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()
 
struct DSU{
    int n;
    vector<int> par, s;
 
    DSU(int N){
        n = N;
        s.assign(n, 1), par.resize(n);
        iota(all(par), 0);
    }
 
    int get(int a){
        return par[a] = (a == par[a] ? a : get(par[a]));
    }
 
    void uni(int a, int b){
        a = get(a), b = get(b);
        if(s[a] > s[b])swap(a, b);
        par[a] = b, s[b] += s[a];
    }
 
    int get_size(int a){
        return s[get(a)];
    }
    bool same_set(int a, int b){
        return get(a) == get(b);
    }
};
 
const int N = 1005;
vector<int> adj[N], adj2[N];
vector<int> component;
bool vis[N];

void dfs(int u){
    component.pb(u);
    vis[u] = true;
    for(int v: adj[u])if(!vis[v])dfs(v);
}
 
int construct(vector<vector<int>> p){
    int n = sz(p);
    vector<vector<int>> ans(n, vector<int>(n, 0));
    
    forn(i,n)adj[i].clear(), adj2[i].clear();
    DSU d(n);
    DSU fuck(n);    
    for(int i = 0;i < n; ++i){
        for(int j = 0;j < n; ++j){
            if(i == j)continue;
            if(p[i][j] != p[j][i])return 0;
        }
    }
    for(int i = 0;i < n; ++i){
        vis[i] = false;
        for(int j = 0;j < n; ++j){
            if(p[i][j] == 2 && i != j){
                adj[i].pb(j);
            }
            if(p[i][j] == 1 && i != j){
                adj2[i].pb(j);
            }
        }
    }
 
    for(int i = 0;i < n; ++i){
        if(!vis[i]){
            component.clear();
            dfs(i);

            if(sz(component) == 2)return 0;
            for(int i = 0;i < sz(component); ++i){
                if(sz(component) > 1)ans[component[i]][component[(i + 1) % sz(component)]] = ans[component[(i + 1) % sz(component)]][component[i]] = 1;
                fuck.uni(component[i], component[(i + 1) % sz(component)]);
            }
 
            int prev = -1;
            for(int u: component){
                for(int v: adj2[u]){
                    if(!d.same_set(u, v)){
                        ans[u][v] = ans[v][u] = 1;
                        d.uni(u, v);
                    }
                }
 
                prev = u;
            }
        }
    }

    for(int i = 0;i < n; ++i){
        for(int j = 0;j < n; ++j){
            if(i == j)continue;
            if(ans[i][j] && !p[i][j])return 0;
            if(fuck.same_set(i, j) && !p[i][j])return 0;
            if(d.same_set(i, j) && !p[i][j])return 0;
        }
    }
    for(int i = 0;i < n; ++i){
        adj[i].clear();
        adj2[i].clear();
        vis[i] = false;
    }
    build(ans);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:89:17: warning: variable 'prev' set but not used [-Wunused-but-set-variable]
   89 |             int prev = -1;
      |                 ^~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 7 ms 1356 KB Output is correct
7 Correct 228 ms 26136 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 7 ms 1356 KB Output is correct
7 Correct 228 ms 26136 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 12 ms 1140 KB Output is correct
13 Correct 166 ms 22072 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 104 ms 14508 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 44 ms 5832 KB Output is correct
21 Correct 175 ms 22600 KB Output is correct
22 Correct 173 ms 22072 KB Output is correct
23 Correct 190 ms 24004 KB Output is correct
24 Correct 179 ms 22068 KB Output is correct
25 Correct 73 ms 12600 KB Output is correct
26 Correct 71 ms 12204 KB Output is correct
27 Correct 194 ms 25104 KB Output is correct
28 Correct 168 ms 22112 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 9 ms 1228 KB Output is correct
9 Correct 164 ms 22060 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 8 ms 1400 KB Output is correct
13 Correct 177 ms 26192 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 88 ms 14648 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 45 ms 5828 KB Output is correct
22 Correct 187 ms 22612 KB Output is correct
23 Correct 169 ms 22072 KB Output is correct
24 Correct 189 ms 25148 KB Output is correct
25 Correct 77 ms 12088 KB Output is correct
26 Correct 71 ms 12584 KB Output is correct
27 Correct 172 ms 22068 KB Output is correct
28 Correct 188 ms 24108 KB Output is correct
29 Correct 73 ms 12088 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 43 ms 5828 KB Output is correct
5 Correct 176 ms 22564 KB Output is correct
6 Correct 177 ms 22072 KB Output is correct
7 Correct 190 ms 24120 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 45 ms 5828 KB Output is correct
10 Correct 205 ms 22556 KB Output is correct
11 Correct 173 ms 22052 KB Output is correct
12 Correct 206 ms 25128 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Incorrect 0 ms 332 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 7 ms 1356 KB Output is correct
7 Correct 228 ms 26136 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 12 ms 1140 KB Output is correct
13 Correct 166 ms 22072 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 104 ms 14508 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 44 ms 5832 KB Output is correct
21 Correct 175 ms 22600 KB Output is correct
22 Correct 173 ms 22072 KB Output is correct
23 Correct 190 ms 24004 KB Output is correct
24 Correct 179 ms 22068 KB Output is correct
25 Correct 73 ms 12600 KB Output is correct
26 Correct 71 ms 12204 KB Output is correct
27 Correct 194 ms 25104 KB Output is correct
28 Correct 168 ms 22112 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 9 ms 1228 KB Output is correct
37 Correct 164 ms 22060 KB Output is correct
38 Correct 0 ms 332 KB Output is correct
39 Correct 0 ms 332 KB Output is correct
40 Correct 8 ms 1400 KB Output is correct
41 Correct 177 ms 26192 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 5 ms 844 KB Output is correct
45 Correct 88 ms 14648 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 0 ms 332 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 45 ms 5828 KB Output is correct
50 Correct 187 ms 22612 KB Output is correct
51 Correct 169 ms 22072 KB Output is correct
52 Correct 189 ms 25148 KB Output is correct
53 Correct 77 ms 12088 KB Output is correct
54 Correct 71 ms 12584 KB Output is correct
55 Correct 172 ms 22068 KB Output is correct
56 Correct 188 ms 24108 KB Output is correct
57 Correct 73 ms 12088 KB Output is correct
58 Correct 0 ms 332 KB Output is correct
59 Correct 0 ms 332 KB Output is correct
60 Correct 5 ms 972 KB Output is correct
61 Correct 96 ms 16312 KB Output is correct
62 Correct 0 ms 332 KB Output is correct
63 Correct 0 ms 332 KB Output is correct
64 Correct 0 ms 332 KB Output is correct
65 Incorrect 47 ms 5720 KB Too many ways to get from 1 to 183, should be 1 found no less than 2
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 7 ms 1356 KB Output is correct
7 Correct 228 ms 26136 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 12 ms 1140 KB Output is correct
13 Correct 166 ms 22072 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 104 ms 14508 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 44 ms 5832 KB Output is correct
21 Correct 175 ms 22600 KB Output is correct
22 Correct 173 ms 22072 KB Output is correct
23 Correct 190 ms 24004 KB Output is correct
24 Correct 179 ms 22068 KB Output is correct
25 Correct 73 ms 12600 KB Output is correct
26 Correct 71 ms 12204 KB Output is correct
27 Correct 194 ms 25104 KB Output is correct
28 Correct 168 ms 22112 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 9 ms 1228 KB Output is correct
37 Correct 164 ms 22060 KB Output is correct
38 Correct 0 ms 332 KB Output is correct
39 Correct 0 ms 332 KB Output is correct
40 Correct 8 ms 1400 KB Output is correct
41 Correct 177 ms 26192 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 5 ms 844 KB Output is correct
45 Correct 88 ms 14648 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 0 ms 332 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 45 ms 5828 KB Output is correct
50 Correct 187 ms 22612 KB Output is correct
51 Correct 169 ms 22072 KB Output is correct
52 Correct 189 ms 25148 KB Output is correct
53 Correct 77 ms 12088 KB Output is correct
54 Correct 71 ms 12584 KB Output is correct
55 Correct 172 ms 22068 KB Output is correct
56 Correct 188 ms 24108 KB Output is correct
57 Correct 73 ms 12088 KB Output is correct
58 Correct 0 ms 332 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 0 ms 332 KB Output is correct
61 Correct 43 ms 5828 KB Output is correct
62 Correct 176 ms 22564 KB Output is correct
63 Correct 177 ms 22072 KB Output is correct
64 Correct 190 ms 24120 KB Output is correct
65 Correct 0 ms 332 KB Output is correct
66 Correct 45 ms 5828 KB Output is correct
67 Correct 205 ms 22556 KB Output is correct
68 Correct 173 ms 22052 KB Output is correct
69 Correct 206 ms 25128 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 0 ms 332 KB Output is correct
72 Incorrect 0 ms 332 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
73 Halted 0 ms 0 KB -