oj.uz

답안 #835952

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
835952 2023-08-24T00:36:29 Z maomao90 슈퍼트리 잇기 (IOI20_supertrees) C++17
40 / 100
 181 ms 28036 KB 
// I can do all things through Christ who strengthens me
// Philippians 4:13

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

#define REP(i, j, k) for (int i = j; i < (k); i++)
#define RREP(i, j, k) for (int i = j; i >= (k); i--)

template <class T>
inline bool mnto(T &a, const T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T &a, const T b) {return a < b ? a = b, 1 : 0;}

typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define ALL(x) x.begin(), x.end()
#define SZ(x) (int) x.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef tuple<int, int, int> iii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005;
const int MAXN = 1005;

int n;
vector<vi> g;
vector<vi> ans;
bool vis[MAXN];

bool incyc[MAXN];
bool solve(vi comp) {
    if (SZ(comp) == 1) {
        return 1;
    }
    vi cyc, line;
    for (int i : comp) {
        bool all2 = 1;
        for (int j : comp) {
            if (i == j) {
                continue;
            }
            if (g[i][j] != 2) {
                all2 = 0;
                break;
            }
        }
        if (all2) {
            cyc.pb(i);
            incyc[i] = 1;
        } else {
            line.pb(i);
        }
    }
    for (int i : line) {
        for (int j : comp) {
            if (j == i) {
                continue;
            }
            if (incyc[j]) {
                if (g[i][j] != 2) {
                    return 0;
                }
            } else {
                if (g[i][j] != 1) {
                    return 0;
                }
            }
        }
    }
    if (SZ(cyc) == 1) {
        return 0;
    }
    if (line.empty()) {
        if (SZ(cyc) == 2) {
            return 0;
        }
        REP (i, 0, SZ(cyc)) {
            ans[cyc[i]][cyc[(i + 1) % SZ(cyc)]] = 1;
            ans[cyc[(i + 1) % SZ(cyc)]][cyc[i]] = 1;
        }
        return 1;
    }
    REP (i, 0, SZ(line) - 1) {
        ans[line[i]][line[i + 1]] = 1;
        ans[line[i + 1]][line[i]] = 1;
    }
    if (!cyc.empty()) {
        REP (i, 0, SZ(cyc) - 1) {
            ans[cyc[i]][cyc[i + 1]] = 1;
            ans[cyc[i + 1]][cyc[i]] = 1;
        }
        ans[line[0]][cyc[0]] = 1;
        ans[cyc[0]][line[0]] = 1;
        ans[line[0]][cyc.back()] = 1;
        ans[cyc.back()][line[0]] = 1;
    }
    return 1;
}

int construct(vector<vi> p) {
    n = SZ(p);
    ans = vector<vi>(n, vi(n, 0));
    g = p;
    REP (i, 0, n) {
        REP (j, 0, n) {
            if (g[i][j] == 3) {
                return 0;
            }
        }
    }
    REP (i, 0, n) {
        if (vis[i]) {
            continue;
        }
        vi comp;
        REP (j, 0, n) {
            if (g[i][j]) {
                comp.pb(j);
            }
        }
        for (int j : comp) {
            vis[j] = 1;
            REP (k, 0, n) {
                if ((g[j][k] > 0) != (g[i][k] > 0)) {
                    return 0;
                }
            }
        }
        if (!solve(comp)) {
            return 0;
        }
    }
    build(ans);
    return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 7 ms 1364 KB Output is correct
7 Correct 147 ms 27920 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 7 ms 1364 KB Output is correct
7 Correct 147 ms 27920 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 ms 1364 KB Output is correct
13 Correct 152 ms 27592 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 980 KB Output is correct
17 Correct 66 ms 18036 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 40 ms 7160 KB Output is correct
21 Correct 155 ms 28036 KB Output is correct
22 Correct 147 ms 27912 KB Output is correct
23 Correct 164 ms 27908 KB Output is correct
24 Correct 146 ms 27920 KB Output is correct
25 Correct 65 ms 17976 KB Output is correct
26 Correct 60 ms 17920 KB Output is correct
27 Correct 155 ms 27948 KB Output is correct
28 Correct 149 ms 27900 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 288 KB Output is correct
8 Correct 7 ms 1236 KB Output is correct
9 Correct 146 ms 25900 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 ms 1364 KB Output is correct
13 Correct 147 ms 26004 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 65 ms 16004 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 37 ms 6668 KB Output is correct
22 Correct 146 ms 26000 KB Output is correct
23 Correct 153 ms 25960 KB Output is correct
24 Correct 155 ms 25992 KB Output is correct
25 Correct 62 ms 16004 KB Output is correct
26 Correct 61 ms 16012 KB Output is correct
27 Correct 150 ms 26000 KB Output is correct
28 Correct 152 ms 25932 KB Output is correct
29 Correct 61 ms 16004 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 37 ms 7160 KB Output is correct
5 Correct 151 ms 27896 KB Output is correct
6 Correct 148 ms 27936 KB Output is correct
7 Correct 153 ms 27896 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 37 ms 7220 KB Output is correct
10 Correct 152 ms 27908 KB Output is correct
11 Correct 149 ms 27856 KB Output is correct
12 Correct 181 ms 27904 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Incorrect 15 ms 4724 KB Answer gives possible 0 while actual possible 1
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 7 ms 1364 KB Output is correct
7 Correct 147 ms 27920 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 ms 1364 KB Output is correct
13 Correct 152 ms 27592 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 980 KB Output is correct
17 Correct 66 ms 18036 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 40 ms 7160 KB Output is correct
21 Correct 155 ms 28036 KB Output is correct
22 Correct 147 ms 27912 KB Output is correct
23 Correct 164 ms 27908 KB Output is correct
24 Correct 146 ms 27920 KB Output is correct
25 Correct 65 ms 17976 KB Output is correct
26 Correct 60 ms 17920 KB Output is correct
27 Correct 155 ms 27948 KB Output is correct
28 Correct 149 ms 27900 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 288 KB Output is correct
36 Correct 7 ms 1236 KB Output is correct
37 Correct 146 ms 25900 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 6 ms 1364 KB Output is correct
41 Correct 147 ms 26004 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 3 ms 852 KB Output is correct
45 Correct 65 ms 16004 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 37 ms 6668 KB Output is correct
50 Correct 146 ms 26000 KB Output is correct
51 Correct 153 ms 25960 KB Output is correct
52 Correct 155 ms 25992 KB Output is correct
53 Correct 62 ms 16004 KB Output is correct
54 Correct 61 ms 16012 KB Output is correct
55 Correct 150 ms 26000 KB Output is correct
56 Correct 152 ms 25932 KB Output is correct
57 Correct 61 ms 16004 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 3 ms 980 KB Output is correct
61 Correct 64 ms 18056 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Incorrect 16 ms 4736 KB Answer gives possible 0 while actual possible 1
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 7 ms 1364 KB Output is correct
7 Correct 147 ms 27920 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 ms 1364 KB Output is correct
13 Correct 152 ms 27592 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 980 KB Output is correct
17 Correct 66 ms 18036 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 40 ms 7160 KB Output is correct
21 Correct 155 ms 28036 KB Output is correct
22 Correct 147 ms 27912 KB Output is correct
23 Correct 164 ms 27908 KB Output is correct
24 Correct 146 ms 27920 KB Output is correct
25 Correct 65 ms 17976 KB Output is correct
26 Correct 60 ms 17920 KB Output is correct
27 Correct 155 ms 27948 KB Output is correct
28 Correct 149 ms 27900 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 288 KB Output is correct
36 Correct 7 ms 1236 KB Output is correct
37 Correct 146 ms 25900 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 6 ms 1364 KB Output is correct
41 Correct 147 ms 26004 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 3 ms 852 KB Output is correct
45 Correct 65 ms 16004 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 37 ms 6668 KB Output is correct
50 Correct 146 ms 26000 KB Output is correct
51 Correct 153 ms 25960 KB Output is correct
52 Correct 155 ms 25992 KB Output is correct
53 Correct 62 ms 16004 KB Output is correct
54 Correct 61 ms 16012 KB Output is correct
55 Correct 150 ms 26000 KB Output is correct
56 Correct 152 ms 25932 KB Output is correct
57 Correct 61 ms 16004 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 37 ms 7160 KB Output is correct
62 Correct 151 ms 27896 KB Output is correct
63 Correct 148 ms 27936 KB Output is correct
64 Correct 153 ms 27896 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 37 ms 7220 KB Output is correct
67 Correct 152 ms 27908 KB Output is correct
68 Correct 149 ms 27856 KB Output is correct
69 Correct 181 ms 27904 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 0 ms 300 KB Output is correct
73 Incorrect 15 ms 4724 KB Answer gives possible 0 while actual possible 1
74 Halted 0 ms 0 KB -