oj.uz

답안 #797940

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
797940 2023-07-30T07:32:33 Z Magikarp4000 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 186 ms 34132 KB 
// goofy ahh

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;

const int MAXN = 1e3+5;
int n,wn;
int a[MAXN][MAXN], d[MAXN], comp[MAXN];
vector<int> v[MAXN], v1[MAXN], goofy, w;
vector<vector<int>> b;
bool vis[MAXN], z[MAXN];

bool bfs(int start) {
    queue<int> q;
    FOR(i,0,wn) d[w[i]] = INF;
    d[start] = 0;
    q.push(start);
    while (!q.empty()) {
        int s = q.front();
        q.pop();
        FORX(u,v[s]) {
            if (d[s] == 1 && d[u] == 1) {
                goofy = {start,s,u};
                return 1;
            }
            if (d[s]+1 < 2 && d[s]+1 < d[u]) {
                d[u] = d[s]+1;
                q.push(u);
            }
        }
    }
    return 0;
}

void dfs(int s) {
    if (vis[s]) return;
    vis[s] = 1;
    w.PB(s);
    FORX(u,v1[s]) dfs(u);
}

bool solve() {
    goofy.clear();
    FOR(i,0,wn) if (bfs(w[i])) break;
    if (goofy.empty()) {
        FOR(i,0,wn) FOR(j,i+1,wn) if (a[w[i]][w[j]] == 2) return 0;
        FOR(i,0,wn-1) b[w[i]][w[i+1]] = b[w[i+1]][w[i]] = 1;
        return 1;
    }
    FORX(u,goofy) z[u] = 1;
    FOR(i,0,wn) {
        if (z[w[i]]) continue;
        bool ok = 1;
        FORX(u,goofy) if (a[w[i]][u] != 2) ok = 0;
        if (ok) z[w[i]] = 1, goofy.PB(w[i]);
    }
    int gn = goofy.size();
    FOR(i,0,wn) comp[w[i]] = -1;
    FORX(u,goofy) comp[u] = u;
    FOR(i,0,wn) {
        if (z[w[i]]) continue;
        FOR(j,0,wn) {
            if (i == j) continue;
            if (a[w[i]][w[j]] == 1 && z[w[j]]) {
                comp[w[i]] = w[j];
                break;
            }
        }
    }
    FOR(i,0,wn) {
        FOR(j,0,wn) {
            if (i == j) continue;
            if (a[w[i]][w[j]] == 2 && comp[w[i]] == comp[w[j]]) return 0;
            if (a[w[i]][w[j]] == 1 && comp[w[i]] != comp[w[j]]) return 0;
        }
    }
    FOR(i,0,gn) b[goofy[i]][goofy[(i+1)%gn]] = b[goofy[(i+1)%gn]][goofy[i]] = 1;
    FOR(i,0,wn) if (!z[w[i]]) b[w[i]][comp[w[i]]] = b[comp[w[i]]][w[i]] = 1;
    return 1;
}

bool precheck() {
    wn = w.size();
    FOR(i,0,wn) {
        FOR(j,0,wn) {
            if (a[w[i]][w[j]] == 0) return 0;
        }
    }
    return 1;
}

void reset() {
    FORX(u,w) v[u].clear();
    w.clear();
}

int construct(vector<vector<int>> P) {
	n = P.size();
    b.resize(n,vector<int>(n));
    FOR(i,0,n) FOR(j,0,n) a[i][j] = P[i][j];
    FOR(i,0,n) {
        FOR(j,i+1,n) {
            if (a[i][j] == 3) return 0;
            if (a[i][j]) v1[i].PB(j), v1[j].PB(i);
            if (a[i][j] == 2) v[i].PB(j), v[j].PB(i);
        }
    }
    FOR(i,0,n) {
        if (vis[i]) continue;
        reset();
        dfs(i);
        if (!precheck()) return 0;
        if (!solve()) return 0;
    }
    build(b);
    return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 7 ms 2260 KB Output is correct
7 Correct 160 ms 30180 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 7 ms 2260 KB Output is correct
7 Correct 160 ms 30180 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 2004 KB Output is correct
13 Correct 148 ms 26044 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 4 ms 1748 KB Output is correct
17 Correct 75 ms 19020 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 37 ms 7764 KB Output is correct
21 Correct 186 ms 26492 KB Output is correct
22 Correct 152 ms 26060 KB Output is correct
23 Correct 161 ms 28288 KB Output is correct
24 Correct 150 ms 26048 KB Output is correct
25 Correct 67 ms 16584 KB Output is correct
26 Correct 66 ms 16064 KB Output is correct
27 Correct 166 ms 29152 KB Output is correct
28 Correct 151 ms 25972 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 7 ms 2004 KB Output is correct
9 Correct 149 ms 25928 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 8 ms 2388 KB Output is correct
13 Correct 162 ms 34132 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 4 ms 1876 KB Output is correct
17 Correct 77 ms 21568 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 39 ms 7868 KB Output is correct
22 Correct 154 ms 27072 KB Output is correct
23 Correct 153 ms 26064 KB Output is correct
24 Correct 163 ms 32200 KB Output is correct
25 Correct 66 ms 16064 KB Output is correct
26 Correct 67 ms 17216 KB Output is correct
27 Correct 154 ms 26060 KB Output is correct
28 Correct 161 ms 30156 KB Output is correct
29 Correct 65 ms 16080 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 38 ms 7852 KB Output is correct
5 Correct 153 ms 26576 KB Output is correct
6 Correct 155 ms 26240 KB Output is correct
7 Correct 159 ms 28092 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 38 ms 7904 KB Output is correct
10 Correct 159 ms 27120 KB Output is correct
11 Correct 150 ms 26072 KB Output is correct
12 Correct 162 ms 32240 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 38 ms 7756 KB Output is correct
17 Correct 155 ms 27072 KB Output is correct
18 Correct 159 ms 27208 KB Output is correct
19 Correct 149 ms 26304 KB Output is correct
20 Correct 151 ms 26044 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 7 ms 2260 KB Output is correct
7 Correct 160 ms 30180 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 2004 KB Output is correct
13 Correct 148 ms 26044 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 4 ms 1748 KB Output is correct
17 Correct 75 ms 19020 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 37 ms 7764 KB Output is correct
21 Correct 186 ms 26492 KB Output is correct
22 Correct 152 ms 26060 KB Output is correct
23 Correct 161 ms 28288 KB Output is correct
24 Correct 150 ms 26048 KB Output is correct
25 Correct 67 ms 16584 KB Output is correct
26 Correct 66 ms 16064 KB Output is correct
27 Correct 166 ms 29152 KB Output is correct
28 Correct 151 ms 25972 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 7 ms 2004 KB Output is correct
37 Correct 149 ms 25928 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 8 ms 2388 KB Output is correct
41 Correct 162 ms 34132 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 4 ms 1876 KB Output is correct
45 Correct 77 ms 21568 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 39 ms 7868 KB Output is correct
50 Correct 154 ms 27072 KB Output is correct
51 Correct 153 ms 26064 KB Output is correct
52 Correct 163 ms 32200 KB Output is correct
53 Correct 66 ms 16064 KB Output is correct
54 Correct 67 ms 17216 KB Output is correct
55 Correct 154 ms 26060 KB Output is correct
56 Correct 161 ms 30156 KB Output is correct
57 Correct 65 ms 16080 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 4 ms 1876 KB Output is correct
61 Correct 78 ms 22600 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 0 ms 340 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 38 ms 7868 KB Output is correct
66 Correct 89 ms 17352 KB Output is correct
67 Correct 68 ms 17216 KB Output is correct
68 Correct 68 ms 16444 KB Output is correct
69 Correct 66 ms 16076 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 7 ms 2260 KB Output is correct
7 Correct 160 ms 30180 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 2004 KB Output is correct
13 Correct 148 ms 26044 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 4 ms 1748 KB Output is correct
17 Correct 75 ms 19020 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 37 ms 7764 KB Output is correct
21 Correct 186 ms 26492 KB Output is correct
22 Correct 152 ms 26060 KB Output is correct
23 Correct 161 ms 28288 KB Output is correct
24 Correct 150 ms 26048 KB Output is correct
25 Correct 67 ms 16584 KB Output is correct
26 Correct 66 ms 16064 KB Output is correct
27 Correct 166 ms 29152 KB Output is correct
28 Correct 151 ms 25972 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 7 ms 2004 KB Output is correct
37 Correct 149 ms 25928 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 8 ms 2388 KB Output is correct
41 Correct 162 ms 34132 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 4 ms 1876 KB Output is correct
45 Correct 77 ms 21568 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 39 ms 7868 KB Output is correct
50 Correct 154 ms 27072 KB Output is correct
51 Correct 153 ms 26064 KB Output is correct
52 Correct 163 ms 32200 KB Output is correct
53 Correct 66 ms 16064 KB Output is correct
54 Correct 67 ms 17216 KB Output is correct
55 Correct 154 ms 26060 KB Output is correct
56 Correct 161 ms 30156 KB Output is correct
57 Correct 65 ms 16080 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 38 ms 7852 KB Output is correct
62 Correct 153 ms 26576 KB Output is correct
63 Correct 155 ms 26240 KB Output is correct
64 Correct 159 ms 28092 KB Output is correct
65 Correct 0 ms 340 KB Output is correct
66 Correct 38 ms 7904 KB Output is correct
67 Correct 159 ms 27120 KB Output is correct
68 Correct 150 ms 26072 KB Output is correct
69 Correct 162 ms 32240 KB Output is correct
70 Correct 0 ms 340 KB Output is correct
71 Correct 0 ms 340 KB Output is correct
72 Correct 0 ms 340 KB Output is correct
73 Correct 38 ms 7756 KB Output is correct
74 Correct 155 ms 27072 KB Output is correct
75 Correct 159 ms 27208 KB Output is correct
76 Correct 149 ms 26304 KB Output is correct
77 Correct 151 ms 26044 KB Output is correct
78 Correct 0 ms 340 KB Output is correct
79 Correct 0 ms 340 KB Output is correct
80 Correct 4 ms 1876 KB Output is correct
81 Correct 78 ms 22600 KB Output is correct
82 Correct 0 ms 340 KB Output is correct
83 Correct 0 ms 340 KB Output is correct
84 Correct 1 ms 340 KB Output is correct
85 Correct 38 ms 7868 KB Output is correct
86 Correct 89 ms 17352 KB Output is correct
87 Correct 68 ms 17216 KB Output is correct
88 Correct 68 ms 16444 KB Output is correct
89 Correct 66 ms 16076 KB Output is correct
90 Correct 0 ms 340 KB Output is correct
91 Correct 0 ms 340 KB Output is correct
92 Correct 3 ms 1620 KB Output is correct
93 Correct 66 ms 16032 KB Output is correct
94 Correct 1 ms 340 KB Output is correct
95 Correct 0 ms 340 KB Output is correct
96 Correct 0 ms 340 KB Output is correct
97 Correct 20 ms 5320 KB Output is correct
98 Correct 66 ms 16192 KB Output is correct
99 Correct 68 ms 16444 KB Output is correct
100 Correct 65 ms 16188 KB Output is correct
101 Correct 66 ms 16064 KB Output is correct
102 Correct 64 ms 16064 KB Output is correct
103 Correct 80 ms 16076 KB Output is correct
104 Correct 68 ms 16060 KB Output is correct
105 Correct 68 ms 16080 KB Output is correct