oj.uz

답안 #1084267

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1084267 2024-09-05T17:51:04 Z Tymond 슈퍼트리 잇기 (IOI20_supertrees) C++17
96 / 100
 185 ms 32012 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

const int MAXN = 1e3 + 7;
int vis[MAXN];
int p[MAXN][MAXN];
vi g[MAXN];
int n;
vector<vi> ans;

vi akt;
map<int, int> cnt;
void getOthers(int v){
    queue<int> q;
    q.push(v);
    vis[v] = 1;
    while(sz(q)){
        v = q.front();
        q.pop();

        cnt[v] = 1;
        akt.pb(v);
        for(auto u : g[v]){
            if(!vis[u]){
                vis[u] = 1;
                q.push(u);
            }
        }
    }
}

/*void build(vector<vi> xd){
    for(int i = 0; i < sz(xd); i++){
        for(auto ele : xd[i]){
            cout << ele << ' ';
        }
        cout << '\n';
    }
}*/

int construct(vector<vi> given) {
    n = sz(given);
    ans.resize(n);
    for(int i = 0; i < n; i++){
        ans[i].assign(n, 0);
        for(int j = 0; j < n; j++){
            p[i][j] = given[i][j];
            if(p[i][j] > 0 && i != j){
                g[i].pb(j);
            }
        }
    }

    for(int i = 0; i < n; i++){
        if(!vis[i]){
            akt.clear();
            cnt.clear();
            getOthers(i);

            int mx = 0;
            for(auto ele : akt){
                for(int x = 0; x < n; x++){
                    if(x != ele && p[ele][x] == 0 && cnt[x]){
                        return 0;
                    }
                    if(cnt[x]){
                        mx = max(mx, p[ele][x]);
                    }
                }
            }

            if(mx == 1){
                for(int x = 0; x < sz(akt) - 1; x++){
                    ans[akt[x]][akt[x + 1]] = 1;
                    ans[akt[x + 1]][akt[x]] = 1;
                }
                continue;
            }

            map<int, int> f;
            vector<vi> groups;
            int k = 0;
            for(auto ele : akt){
                if(f[ele]){
                    continue;
                }
                groups.pb({ele});
                queue<int> q;
                q.push(ele);
                f[ele] = 1;
                while(sz(q)){
                    int v = q.front();
                    q.pop();

                    for(auto u : g[v]){
                        if(!f[u] && p[ele][u] == 1){
                            f[u] = 1;
                            groups[k].pb(u);
                            q.push(u);
                        }
                    }
                }

                for(int j = 0; j < sz(groups[k]); j++){
                    //cout << groups[k][j] << ' ';
                    if(j + 1 < sz(groups[k])){
                        ans[groups[k][j]][groups[k][j + 1]] = 1;
                        ans[groups[k][j + 1]][groups[k][j]] = 1;
                    }
                    /*for(int x = j + 1; x < sz(groups[k]); x++){
                        if(p[groups[k][i]][groups[k][j]] != 1){
                            return 0;
                        }
                    }*/
                }
                //cout << '\n';
                k++;
            }

            if(k == 2){
                return 0;
            }

            for(int j = 0; j + 1 < k; j++){
                ans[groups[j][0]][groups[j + 1][0]] = 1;
                ans[groups[j + 1][0]][groups[j][0]] = 1;
            }
            ans[groups[k - 1][0]][groups[0][0]] = 1;
            ans[groups[0][0]][groups[k - 1][0]] = 1;
        }
    }


    build(ans);
    return 1;
}

/*int main(){
    cout << construct({{1, 1, 2, 2}, {1, 1, 2, 2}, {2, 2, 1, 2}, {2, 2, 2, 1}}) << '\n';
}*/

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 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 6 ms 2396 KB Output is correct
7 Correct 127 ms 32012 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 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 6 ms 2396 KB Output is correct
7 Correct 127 ms 32012 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 512 KB Output is correct
12 Correct 8 ms 2140 KB Output is correct
13 Correct 168 ms 27988 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 1884 KB Output is correct
17 Correct 70 ms 20560 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 45 ms 8272 KB Output is correct
21 Correct 142 ms 28452 KB Output is correct
22 Correct 169 ms 28140 KB Output is correct
23 Correct 148 ms 30000 KB Output is correct
24 Correct 181 ms 28080 KB Output is correct
25 Correct 73 ms 18768 KB Output is correct
26 Correct 56 ms 18260 KB Output is correct
27 Correct 143 ms 31020 KB Output is correct
28 Correct 185 ms 27984 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 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 7 ms 2224 KB Output is correct
9 Correct 177 ms 28060 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 2384 KB Output is correct
13 Correct 139 ms 32008 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 1736 KB Output is correct
17 Correct 71 ms 20660 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 38 ms 8476 KB Output is correct
22 Correct 142 ms 28500 KB Output is correct
23 Correct 150 ms 28320 KB Output is correct
24 Correct 146 ms 31056 KB Output is correct
25 Correct 86 ms 18212 KB Output is correct
26 Correct 59 ms 18772 KB Output is correct
27 Correct 156 ms 27984 KB Output is correct
28 Correct 145 ms 30032 KB Output is correct
29 Correct 84 ms 18252 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 38 ms 8288 KB Output is correct
5 Correct 138 ms 28536 KB Output is correct
6 Correct 154 ms 27988 KB Output is correct
7 Correct 137 ms 30036 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 44 ms 8276 KB Output is correct
10 Correct 139 ms 28464 KB Output is correct
11 Correct 148 ms 27988 KB Output is correct
12 Correct 153 ms 31312 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 36 ms 8284 KB Output is correct
17 Correct 152 ms 28756 KB Output is correct
18 Correct 148 ms 28572 KB Output is correct
19 Correct 149 ms 28240 KB Output is correct
20 Correct 170 ms 27988 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 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 6 ms 2396 KB Output is correct
7 Correct 127 ms 32012 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 512 KB Output is correct
12 Correct 8 ms 2140 KB Output is correct
13 Correct 168 ms 27988 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 1884 KB Output is correct
17 Correct 70 ms 20560 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 45 ms 8272 KB Output is correct
21 Correct 142 ms 28452 KB Output is correct
22 Correct 169 ms 28140 KB Output is correct
23 Correct 148 ms 30000 KB Output is correct
24 Correct 181 ms 28080 KB Output is correct
25 Correct 73 ms 18768 KB Output is correct
26 Correct 56 ms 18260 KB Output is correct
27 Correct 143 ms 31020 KB Output is correct
28 Correct 185 ms 27984 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 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 7 ms 2224 KB Output is correct
37 Correct 177 ms 28060 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 6 ms 2384 KB Output is correct
41 Correct 139 ms 32008 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 4 ms 1736 KB Output is correct
45 Correct 71 ms 20660 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 38 ms 8476 KB Output is correct
50 Correct 142 ms 28500 KB Output is correct
51 Correct 150 ms 28320 KB Output is correct
52 Correct 146 ms 31056 KB Output is correct
53 Correct 86 ms 18212 KB Output is correct
54 Correct 59 ms 18772 KB Output is correct
55 Correct 156 ms 27984 KB Output is correct
56 Correct 145 ms 30032 KB Output is correct
57 Correct 84 ms 18252 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 3 ms 1884 KB Output is correct
61 Correct 63 ms 22100 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 37 ms 8272 KB Output is correct
66 Correct 59 ms 18836 KB Output is correct
67 Correct 66 ms 18772 KB Output is correct
68 Correct 58 ms 18336 KB Output is correct
69 Correct 58 ms 18004 KB Output is correct

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 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 6 ms 2396 KB Output is correct
7 Correct 127 ms 32012 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 512 KB Output is correct
12 Correct 8 ms 2140 KB Output is correct
13 Correct 168 ms 27988 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 1884 KB Output is correct
17 Correct 70 ms 20560 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 45 ms 8272 KB Output is correct
21 Correct 142 ms 28452 KB Output is correct
22 Correct 169 ms 28140 KB Output is correct
23 Correct 148 ms 30000 KB Output is correct
24 Correct 181 ms 28080 KB Output is correct
25 Correct 73 ms 18768 KB Output is correct
26 Correct 56 ms 18260 KB Output is correct
27 Correct 143 ms 31020 KB Output is correct
28 Correct 185 ms 27984 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 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 7 ms 2224 KB Output is correct
37 Correct 177 ms 28060 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 6 ms 2384 KB Output is correct
41 Correct 139 ms 32008 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 4 ms 1736 KB Output is correct
45 Correct 71 ms 20660 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 38 ms 8476 KB Output is correct
50 Correct 142 ms 28500 KB Output is correct
51 Correct 150 ms 28320 KB Output is correct
52 Correct 146 ms 31056 KB Output is correct
53 Correct 86 ms 18212 KB Output is correct
54 Correct 59 ms 18772 KB Output is correct
55 Correct 156 ms 27984 KB Output is correct
56 Correct 145 ms 30032 KB Output is correct
57 Correct 84 ms 18252 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 38 ms 8288 KB Output is correct
62 Correct 138 ms 28536 KB Output is correct
63 Correct 154 ms 27988 KB Output is correct
64 Correct 137 ms 30036 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 44 ms 8276 KB Output is correct
67 Correct 139 ms 28464 KB Output is correct
68 Correct 148 ms 27988 KB Output is correct
69 Correct 153 ms 31312 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 36 ms 8284 KB Output is correct
74 Correct 152 ms 28756 KB Output is correct
75 Correct 148 ms 28572 KB Output is correct
76 Correct 149 ms 28240 KB Output is correct
77 Correct 170 ms 27988 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 3 ms 1884 KB Output is correct
81 Correct 63 ms 22100 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 37 ms 8272 KB Output is correct
86 Correct 59 ms 18836 KB Output is correct
87 Correct 66 ms 18772 KB Output is correct
88 Correct 58 ms 18336 KB Output is correct
89 Correct 58 ms 18004 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 1 ms 348 KB Output is correct
92 Correct 3 ms 2000 KB Output is correct
93 Correct 63 ms 22096 KB Output is correct
94 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
95 Halted 0 ms 0 KB -