oj.uz

답안 #442004

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
442004 2021-07-06T17:30:30 Z julian33 슈퍼트리 잇기 (IOI20_supertrees) C++14
96 / 100
 249 ms 26076 KB 
#include <bits/stdc++.h>
#include "supertrees.h"

using namespace std;

#ifdef LOCAL
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {
    cerr<<vars<<" = ";
    string delim="";
    (...,(cerr<<delim<<values,delim=", "));
    cerr<<"\n";
}
#else
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {}
#endif

#define pb push_back
#define sz(x) (int)(x.size())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T> inline void maxa(T& a,T b){a=max(a,b);}
template<typename T> inline void mina(T& a,T b){a=min(a,b);} 

// void build(vector<vector<int>> b){
//     int n=sz(b); 
//     for(int i=0;i<n;i++){
//         for(int j=0;j<n;j++){
//             cout<<b[i][j]<<" ";
//         }
//         cout<<"\n";
//     }
// }

const int mxN=1e3+5;

int uf[mxN],seen[mxN],is_triple[mxN];
vector<int> component[mxN];
vector<vector<int>> g;

int find(int x){return uf[x]<0?x:uf[x]=find(uf[x]);}
bool same(int x,int y){return find(x)==find(y);}
void unite(int x,int y){
    x=find(x); y=find(y);
    if(x==y)
        return;
    if(uf[x]>uf[y])
        swap(x,y);
    uf[x]+=uf[y]; uf[y]=x;
}

int construct(vector<vector<int>> p){
    g=p;
    memset(uf,-1,sizeof(uf));
    int n=sz(p);
    vector<vector<int>> b;
    b.resize(n);
    for(auto &u:b)
        u.resize(n);
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(g[i][j]){
                unite(i,j);
            }
        }
    }
    for(int i=0;i<n;i++){
        component[find(i)].pb(i);
        for(int j=0;j<n;j++){
            if(!g[i][j] && same(i,j))
                return 0;
        }
    }
    for(int i=0;i<n;i++){
        if(sz(component[i])<=1)
            continue;
        vector<vector<int>> line; vector<int> ring; vector<int> triple; vector<int> single;
        int twocnt=0; int cnt=0;
        for(int &j:component[i]){
            if(seen[j]){
                single.pb(j);
                continue;
            }
            int three=1; int has=0;
            vector<int> one={j};
            for(int k=0;k<n;k++){
                if(g[j][k]==1 && j!=k){
                    one.pb(k);
                    seen[k]=1;
                }
                twocnt+=(g[j][k]==2);
                if((g[j][k]==1 || g[j][k]==2) && j!=k){
                    three=0;
                }
                if(g[j][k]==3)
                    has=1;
            }
            if(sz(one)==1)
                ring.pb(j);
            else
                line.pb(one);
            if(three)
                triple.pb(j);
            else
                single.pb(j);
            cnt+=has;
        }
        if(cnt && twocnt)
            return 0;
        if(cnt && sz(triple)<4)
            return 0;
        if(sz(triple)){
            for(int j=0;j<sz(single);j++){
                for(int k=j+1;k<sz(single);k++){
                    if(g[single[k]][single[j]]!=1){
                        return 0;
                    }
                }
            }
            for(int j=0;j<sz(single)-1;j++){
                b[single[j]][single[j+1]]=b[single[j+1]][single[j]]=1;
            }
            for(int j=0;j<sz(triple)-1;j++){
                b[triple[j]][triple[j+1]]=b[triple[j+1]][triple[j]]=1;
            }
            b[triple[0]][triple.back()]=b[triple.back()][triple[0]]=1;
            b[triple[0]][triple[sz(triple)-2]]=b[triple[sz(triple)-2]][triple[0]]=1;
            if(sz(single)){
                b[single[0]][triple.back()]=b[triple.back()][single[0]]=1;
            }
            continue;
        }
        if(sz(line)==0){
            if(sz(ring)==2)
                return 0;
            for(int j=0;j<sz(ring);j++){
                b[ring[j]][ring[(j+1)%sz(ring)]]=b[ring[(j+1)%sz(ring)]][ring[j]]=1;
            }
        } else{
            for(int j=0;j<sz(ring)-1;j++){
                b[ring[j]][ring[j+1]]=b[ring[j+1]][ring[j]]=1;
            }
            for(auto u:line){
                for(int j=0;j<sz(u)-1;j++){
                    b[u[j]][u[j+1]]=b[u[j+1]][u[j]]=1;
                }
            }
            for(int j=0;j<sz(line)-1;j++){
                b[line[j][0]][line[j+1][0]]=b[line[j+1][0]][line[j][0]]=1;
            }
            if(sz(ring)){
                b[line.back()[0]][ring.back()]=b[ring.back()][line.back()[0]]=1;
                b[line[0][0]][ring[0]]=b[ring[0]][line[0][0]]=1;
            } else if(sz(line)>1){
                b[line.back()[0]][line[0][0]]=b[line[0][0]][line.back()[0]]=1;
            }
        }
    }
    build(b);
    return 1;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1356 KB Output is correct
7 Correct 237 ms 26016 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 9 ms 1356 KB Output is correct
13 Correct 229 ms 26020 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 109 ms 16024 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 70 ms 6688 KB Output is correct
21 Correct 238 ms 26016 KB Output is correct
22 Correct 225 ms 26032 KB Output is correct
23 Correct 248 ms 25936 KB Output is correct
24 Correct 224 ms 26024 KB Output is correct
25 Correct 100 ms 16068 KB Output is correct
26 Correct 100 ms 16024 KB Output is correct
27 Correct 238 ms 26008 KB Output is correct
28 Correct 226 ms 25960 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 9 ms 1356 KB Output is correct
9 Correct 223 ms 26052 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 10 ms 1356 KB Output is correct
13 Correct 228 ms 25908 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 109 ms 16024 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 58 ms 6728 KB Output is correct
22 Correct 235 ms 25924 KB Output is correct
23 Correct 247 ms 25912 KB Output is correct
24 Correct 243 ms 26020 KB Output is correct
25 Correct 95 ms 16036 KB Output is correct
26 Correct 96 ms 16036 KB Output is correct
27 Correct 231 ms 25924 KB Output is correct
28 Correct 247 ms 25988 KB Output is correct
29 Correct 94 ms 16020 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 58 ms 6732 KB Output is correct
5 Correct 230 ms 26016 KB Output is correct
6 Correct 233 ms 25924 KB Output is correct
7 Correct 241 ms 25980 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 61 ms 6772 KB Output is correct
10 Correct 249 ms 25944 KB Output is correct
11 Correct 234 ms 25924 KB Output is correct
12 Correct 245 ms 25928 KB Output is correct
13 Correct 0 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 60 ms 6804 KB Output is correct
17 Correct 232 ms 26008 KB Output is correct
18 Correct 243 ms 26076 KB Output is correct
19 Correct 227 ms 26016 KB Output is correct
20 Correct 222 ms 26020 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1356 KB Output is correct
7 Correct 237 ms 26016 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 9 ms 1356 KB Output is correct
13 Correct 229 ms 26020 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 109 ms 16024 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 70 ms 6688 KB Output is correct
21 Correct 238 ms 26016 KB Output is correct
22 Correct 225 ms 26032 KB Output is correct
23 Correct 248 ms 25936 KB Output is correct
24 Correct 224 ms 26024 KB Output is correct
25 Correct 100 ms 16068 KB Output is correct
26 Correct 100 ms 16024 KB Output is correct
27 Correct 238 ms 26008 KB Output is correct
28 Correct 226 ms 25960 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 9 ms 1356 KB Output is correct
37 Correct 223 ms 26052 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 10 ms 1356 KB Output is correct
41 Correct 228 ms 25908 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 5 ms 844 KB Output is correct
45 Correct 109 ms 16024 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 58 ms 6728 KB Output is correct
50 Correct 235 ms 25924 KB Output is correct
51 Correct 247 ms 25912 KB Output is correct
52 Correct 243 ms 26020 KB Output is correct
53 Correct 95 ms 16036 KB Output is correct
54 Correct 96 ms 16036 KB Output is correct
55 Correct 231 ms 25924 KB Output is correct
56 Correct 247 ms 25988 KB Output is correct
57 Correct 94 ms 16020 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 5 ms 948 KB Output is correct
61 Correct 107 ms 16032 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Correct 0 ms 332 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 60 ms 6680 KB Output is correct
66 Correct 130 ms 16036 KB Output is correct
67 Correct 96 ms 16024 KB Output is correct
68 Correct 94 ms 16068 KB Output is correct
69 Correct 100 ms 16196 KB Output is correct

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1356 KB Output is correct
7 Correct 237 ms 26016 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 9 ms 1356 KB Output is correct
13 Correct 229 ms 26020 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 109 ms 16024 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 70 ms 6688 KB Output is correct
21 Correct 238 ms 26016 KB Output is correct
22 Correct 225 ms 26032 KB Output is correct
23 Correct 248 ms 25936 KB Output is correct
24 Correct 224 ms 26024 KB Output is correct
25 Correct 100 ms 16068 KB Output is correct
26 Correct 100 ms 16024 KB Output is correct
27 Correct 238 ms 26008 KB Output is correct
28 Correct 226 ms 25960 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 9 ms 1356 KB Output is correct
37 Correct 223 ms 26052 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 10 ms 1356 KB Output is correct
41 Correct 228 ms 25908 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 5 ms 844 KB Output is correct
45 Correct 109 ms 16024 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 58 ms 6728 KB Output is correct
50 Correct 235 ms 25924 KB Output is correct
51 Correct 247 ms 25912 KB Output is correct
52 Correct 243 ms 26020 KB Output is correct
53 Correct 95 ms 16036 KB Output is correct
54 Correct 96 ms 16036 KB Output is correct
55 Correct 231 ms 25924 KB Output is correct
56 Correct 247 ms 25988 KB Output is correct
57 Correct 94 ms 16020 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 1 ms 320 KB Output is correct
61 Correct 58 ms 6732 KB Output is correct
62 Correct 230 ms 26016 KB Output is correct
63 Correct 233 ms 25924 KB Output is correct
64 Correct 241 ms 25980 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 61 ms 6772 KB Output is correct
67 Correct 249 ms 25944 KB Output is correct
68 Correct 234 ms 25924 KB Output is correct
69 Correct 245 ms 25928 KB Output is correct
70 Correct 0 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 0 ms 204 KB Output is correct
73 Correct 60 ms 6804 KB Output is correct
74 Correct 232 ms 26008 KB Output is correct
75 Correct 243 ms 26076 KB Output is correct
76 Correct 227 ms 26016 KB Output is correct
77 Correct 222 ms 26020 KB Output is correct
78 Correct 0 ms 204 KB Output is correct
79 Correct 0 ms 204 KB Output is correct
80 Correct 5 ms 948 KB Output is correct
81 Correct 107 ms 16032 KB Output is correct
82 Correct 0 ms 204 KB Output is correct
83 Correct 0 ms 332 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 60 ms 6680 KB Output is correct
86 Correct 130 ms 16036 KB Output is correct
87 Correct 96 ms 16024 KB Output is correct
88 Correct 94 ms 16068 KB Output is correct
89 Correct 100 ms 16196 KB Output is correct
90 Correct 1 ms 204 KB Output is correct
91 Correct 0 ms 204 KB Output is correct
92 Correct 5 ms 856 KB Output is correct
93 Correct 102 ms 16020 KB Output is correct
94 Correct 0 ms 204 KB Output is correct
95 Correct 0 ms 204 KB Output is correct
96 Correct 0 ms 204 KB Output is correct
97 Correct 25 ms 4260 KB Output is correct
98 Correct 98 ms 16032 KB Output is correct
99 Correct 98 ms 16024 KB Output is correct
100 Correct 95 ms 16036 KB Output is correct
101 Correct 95 ms 16068 KB Output is correct
102 Incorrect 229 ms 26004 KB Answer gives possible 1 while actual possible 0
103 Halted 0 ms 0 KB -