oj.uz

답안 #168676

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
168676 2019-12-15T02:36:54 Z mhy908 Split the Attractions (IOI19_split) C++14
100 / 100
 213 ms 21880 KB 
#include "split.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
const LL llinf=9000000000000000000;
const int inf=2000000000;
int n, m;
vector<int> temp[100010], link[100010];
vector<int> ans;
bool ch[100010];
int siz[100010], cen=-1, c[100010];
void dfs1(int num){
    ch[num]=true;
    siz[num]=1;
    for(int i=0; i<temp[num].size(); i++){
        if(ch[temp[num][i]])continue;
        //printf("link : %d %d\n", num, temp[num][i]);
        link[num].pb(temp[num][i]);
        link[temp[num][i]].pb(num);
        dfs1(temp[num][i]);
        siz[num]+=siz[temp[num][i]];
    }
}
void find_centroid(int num){
    if(ch[num])return;
    bool poss=true;
    ch[num]=true;
    for(int i=0; i<link[num].size(); i++){
        if(siz[link[num][i]]>n/2)poss=false;
    }
    if(poss){
        cen=num;
        return;
    }
    for(int i=0; i<link[num].size(); i++){
        int tt=siz[link[num][i]];
        siz[num]=n-tt;
        siz[link[num][i]]=n;
        find_centroid(link[num][i]);
        if(cen>=0)return;
        siz[num]=n;
        siz[link[num][i]]=tt;
    }
}
void dfs2(int num, int col){
    if(num==cen||c[num])return;
    c[num]=col;
    for(int i=0; i<temp[num].size(); i++){
        dfs2(temp[num][i], col);
    }
}
int dp[100010];
int colored, skipped, kkk;
bool chlink[100010];
void dfs3(int num, int pp, int ccc){
    if(ch[num]||num==cen)return;
    ch[num]=true;
    if(colored<pp){
        ans[num]=ccc;
        colored++;
    }
    for(int i=0; i<link[num].size(); i++){
        dfs3(link[num][i], pp, ccc);
    }
}
vector<int> find_split(int _n, int a, int b, int cc, vector<int> p, vector<int> q){
	n=_n, m=p.size();
	ans.resize(n);
	for(int i=0; i<m; i++){
        temp[p[i]].pb(q[i]);
        temp[q[i]].pb(p[i]);
	}
	dfs1(0);
	memset(ch, 0, sizeof(ch));
	find_centroid(0);
	int r=0;
	for(int i=0; i<link[cen].size(); i++){
        if(!c[link[cen][i]])dfs2(link[cen][i], ++r);
        dp[c[link[cen][i]]]+=siz[link[cen][i]];
	}
	bool flag=false, flag2=false;
	int tonum=0;
	for(int i=1; i<=r; i++){
        if(dp[i]>=min(min(a, b), cc)){
            flag=true;
            tonum=i;
        }
	}
	memset(ch, 0, sizeof(ch));
	for(int i=0; i<link[cen].size(); i++){
        if(siz[link[cen][i]]>=min(min(a, b), cc)){
            flag2=true;
            if(a<=b&&a<=cc)dfs3(link[cen][i], a, 1);
            else if(b<=a&&b<=cc)dfs3(link[cen][i], b, 2);
            else dfs3(link[cen][i], cc, 3);
            chlink[i]=true;
            break;
        }
	}
	if(!flag)return ans;
	if(!flag2){
	for(int i=0; i<link[cen].size(); i++){
        if(tonum==c[link[cen][i]]){
            if(a<=b&&a<=cc)dfs3(link[cen][i], a, 1);
            else if(b<=a&&b<=cc)dfs3(link[cen][i], b, 2);
            else dfs3(link[cen][i], cc, 3);
            chlink[i]=true;
            if(colored==min(min(a, b), cc))break;
        }
	}
	}
	if(a<=b&&a<=cc){
        if(b<=cc)ans[cen]=2;
        else ans[cen]=3;
	}
	else if(b<=a&&b<=cc){
        if(a<=cc)ans[cen]=1;
        else ans[cen]=3;
	}
    else{
        if(a<=b)ans[cen]=1;
        else ans[cen]=2;
    }
    colored=1;
	for(int i=0; i<link[cen].size(); i++){
        if(chlink[i])continue;
        if(a<=b&&a<=cc){
            if(b<=cc)dfs3(link[cen][i], b, 2);
            else dfs3(link[cen][i], cc, 3);
        }
        else if(b<=a&&b<=cc){
            if(a<=cc)dfs3(link[cen][i], a, 1);
            else dfs3(link[cen][i], cc, 3);
        }
        else{
            if(a<=b)dfs3(link[cen][i], a, 1);
            else dfs3(link[cen][i], b, 2);
        }
	}
    for(int i=0; i<n; i++){
        if(!ans[i]){
            if(a<=b&&a<=cc){
                if(b<=cc)ans[i]=3;
                else ans[i]=2;
            }
            else if(b<=a&&b<=cc){
                if(a<=cc)ans[i]=3;
                else ans[i]=1;
            }
            else{
                if(a<=b)ans[i]=2;
                else ans[i]=1;
            }
        }
    }
    return ans;
}
/*
6 5 2 2 2
0 1
1 2
2 3
3 4
4 5
*/

Compilation message

split.cpp: In function 'void dfs1(int)':
split.cpp:21:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<temp[num].size(); i++){
                  ~^~~~~~~~~~~~~~~~~
split.cpp: In function 'void find_centroid(int)':
split.cpp:34:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<link[num].size(); i++){
                  ~^~~~~~~~~~~~~~~~~
split.cpp:41:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<link[num].size(); i++){
                  ~^~~~~~~~~~~~~~~~~
split.cpp: In function 'void dfs2(int, int)':
split.cpp:54:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<temp[num].size(); i++){
                  ~^~~~~~~~~~~~~~~~~
split.cpp: In function 'void dfs3(int, int, int)':
split.cpp:68:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<link[num].size(); i++){
                  ~^~~~~~~~~~~~~~~~~
split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:83:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<link[cen].size(); i++){
               ~^~~~~~~~~~~~~~~~~
split.cpp:96:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<link[cen].size(); i++){
               ~^~~~~~~~~~~~~~~~~
split.cpp:108:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<link[cen].size(); i++){
               ~^~~~~~~~~~~~~~~~~
split.cpp:131:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<link[cen].size(); i++){
               ~^~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5112 KB ok, correct split
2 Correct 6 ms 5112 KB ok, correct split
3 Correct 6 ms 5112 KB ok, correct split
4 Correct 6 ms 5112 KB ok, correct split
5 Correct 6 ms 5112 KB ok, correct split
6 Correct 6 ms 5112 KB ok, correct split
7 Correct 151 ms 18908 KB ok, correct split
8 Correct 145 ms 17784 KB ok, correct split
9 Correct 163 ms 17196 KB ok, correct split
10 Correct 165 ms 19192 KB ok, correct split
11 Correct 155 ms 19320 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5116 KB ok, correct split
2 Correct 6 ms 5084 KB ok, correct split
3 Correct 6 ms 5160 KB ok, correct split
4 Correct 173 ms 17784 KB ok, correct split
5 Correct 125 ms 14804 KB ok, correct split
6 Correct 161 ms 19192 KB ok, correct split
7 Correct 144 ms 17528 KB ok, correct split
8 Correct 192 ms 16504 KB ok, correct split
9 Correct 153 ms 14584 KB ok, correct split
10 Correct 118 ms 15728 KB ok, correct split
11 Correct 96 ms 15728 KB ok, correct split
12 Correct 102 ms 15740 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5112 KB ok, correct split
2 Correct 161 ms 14688 KB ok, correct split
3 Correct 50 ms 8952 KB ok, correct split
4 Correct 5 ms 5112 KB ok, correct split
5 Correct 153 ms 16144 KB ok, correct split
6 Correct 146 ms 15996 KB ok, correct split
7 Correct 146 ms 15928 KB ok, correct split
8 Correct 158 ms 16760 KB ok, correct split
9 Correct 138 ms 15864 KB ok, correct split
10 Correct 37 ms 8312 KB ok, no valid answer
11 Correct 57 ms 9980 KB ok, no valid answer
12 Correct 111 ms 15348 KB ok, no valid answer
13 Correct 131 ms 14880 KB ok, no valid answer
14 Correct 97 ms 15700 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5112 KB ok, correct split
2 Correct 6 ms 5112 KB ok, no valid answer
3 Correct 6 ms 5116 KB ok, correct split
4 Correct 6 ms 5112 KB ok, correct split
5 Correct 6 ms 5112 KB ok, correct split
6 Correct 6 ms 5112 KB ok, correct split
7 Correct 6 ms 5112 KB ok, correct split
8 Correct 6 ms 5112 KB ok, correct split
9 Correct 9 ms 5496 KB ok, correct split
10 Correct 9 ms 5368 KB ok, correct split
11 Correct 6 ms 5112 KB ok, correct split
12 Correct 9 ms 5496 KB ok, correct split
13 Correct 6 ms 5116 KB ok, correct split
14 Correct 6 ms 5160 KB ok, correct split
15 Correct 6 ms 5112 KB ok, correct split
16 Correct 6 ms 5112 KB ok, correct split
17 Correct 6 ms 5112 KB ok, correct split
18 Correct 6 ms 5112 KB ok, correct split
19 Correct 6 ms 5240 KB ok, correct split
20 Correct 7 ms 5240 KB ok, correct split
21 Correct 8 ms 5496 KB ok, correct split
22 Correct 8 ms 5368 KB ok, correct split
23 Correct 8 ms 5496 KB ok, correct split
24 Correct 8 ms 5496 KB ok, correct split
25 Correct 8 ms 5500 KB ok, correct split
26 Correct 8 ms 5496 KB ok, correct split
27 Correct 8 ms 5496 KB ok, correct split
28 Correct 9 ms 5496 KB ok, correct split
29 Correct 6 ms 5240 KB ok, correct split
30 Correct 9 ms 5496 KB ok, correct split
31 Correct 7 ms 5240 KB ok, correct split
32 Correct 6 ms 5084 KB ok, correct split
33 Correct 7 ms 5112 KB ok, correct split
34 Correct 8 ms 5496 KB ok, correct split
35 Correct 9 ms 5368 KB ok, correct split
36 Correct 8 ms 5368 KB ok, correct split
37 Correct 10 ms 5496 KB ok, correct split
38 Correct 10 ms 5496 KB ok, correct split
39 Correct 10 ms 5496 KB ok, correct split
40 Correct 9 ms 5496 KB ok, correct split
41 Correct 7 ms 5240 KB ok, correct split
42 Correct 7 ms 5240 KB ok, correct split
43 Correct 9 ms 5496 KB ok, correct split
44 Correct 9 ms 5496 KB ok, correct split
45 Correct 9 ms 5496 KB ok, correct split
46 Correct 8 ms 5496 KB ok, correct split
47 Correct 10 ms 5496 KB ok, no valid answer
48 Correct 8 ms 5372 KB ok, correct split
49 Correct 8 ms 5496 KB ok, correct split
50 Correct 6 ms 5112 KB ok, no valid answer
51 Correct 7 ms 5240 KB ok, no valid answer
52 Correct 8 ms 5460 KB ok, no valid answer
53 Correct 9 ms 5496 KB ok, no valid answer
54 Correct 8 ms 5496 KB ok, no valid answer
55 Correct 8 ms 5496 KB ok, no valid answer
56 Correct 8 ms 5496 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5112 KB ok, correct split
2 Correct 6 ms 5112 KB ok, correct split
3 Correct 6 ms 5112 KB ok, correct split
4 Correct 6 ms 5112 KB ok, correct split
5 Correct 6 ms 5112 KB ok, correct split
6 Correct 6 ms 5112 KB ok, correct split
7 Correct 151 ms 18908 KB ok, correct split
8 Correct 145 ms 17784 KB ok, correct split
9 Correct 163 ms 17196 KB ok, correct split
10 Correct 165 ms 19192 KB ok, correct split
11 Correct 155 ms 19320 KB ok, correct split
12 Correct 6 ms 5116 KB ok, correct split
13 Correct 6 ms 5084 KB ok, correct split
14 Correct 6 ms 5160 KB ok, correct split
15 Correct 173 ms 17784 KB ok, correct split
16 Correct 125 ms 14804 KB ok, correct split
17 Correct 161 ms 19192 KB ok, correct split
18 Correct 144 ms 17528 KB ok, correct split
19 Correct 192 ms 16504 KB ok, correct split
20 Correct 153 ms 14584 KB ok, correct split
21 Correct 118 ms 15728 KB ok, correct split
22 Correct 96 ms 15728 KB ok, correct split
23 Correct 102 ms 15740 KB ok, correct split
24 Correct 6 ms 5112 KB ok, correct split
25 Correct 161 ms 14688 KB ok, correct split
26 Correct 50 ms 8952 KB ok, correct split
27 Correct 5 ms 5112 KB ok, correct split
28 Correct 153 ms 16144 KB ok, correct split
29 Correct 146 ms 15996 KB ok, correct split
30 Correct 146 ms 15928 KB ok, correct split
31 Correct 158 ms 16760 KB ok, correct split
32 Correct 138 ms 15864 KB ok, correct split
33 Correct 37 ms 8312 KB ok, no valid answer
34 Correct 57 ms 9980 KB ok, no valid answer
35 Correct 111 ms 15348 KB ok, no valid answer
36 Correct 131 ms 14880 KB ok, no valid answer
37 Correct 97 ms 15700 KB ok, no valid answer
38 Correct 6 ms 5112 KB ok, correct split
39 Correct 6 ms 5112 KB ok, no valid answer
40 Correct 6 ms 5116 KB ok, correct split
41 Correct 6 ms 5112 KB ok, correct split
42 Correct 6 ms 5112 KB ok, correct split
43 Correct 6 ms 5112 KB ok, correct split
44 Correct 6 ms 5112 KB ok, correct split
45 Correct 6 ms 5112 KB ok, correct split
46 Correct 9 ms 5496 KB ok, correct split
47 Correct 9 ms 5368 KB ok, correct split
48 Correct 6 ms 5112 KB ok, correct split
49 Correct 9 ms 5496 KB ok, correct split
50 Correct 6 ms 5116 KB ok, correct split
51 Correct 6 ms 5160 KB ok, correct split
52 Correct 6 ms 5112 KB ok, correct split
53 Correct 6 ms 5112 KB ok, correct split
54 Correct 6 ms 5112 KB ok, correct split
55 Correct 6 ms 5112 KB ok, correct split
56 Correct 6 ms 5240 KB ok, correct split
57 Correct 7 ms 5240 KB ok, correct split
58 Correct 8 ms 5496 KB ok, correct split
59 Correct 8 ms 5368 KB ok, correct split
60 Correct 8 ms 5496 KB ok, correct split
61 Correct 8 ms 5496 KB ok, correct split
62 Correct 8 ms 5500 KB ok, correct split
63 Correct 8 ms 5496 KB ok, correct split
64 Correct 8 ms 5496 KB ok, correct split
65 Correct 9 ms 5496 KB ok, correct split
66 Correct 6 ms 5240 KB ok, correct split
67 Correct 9 ms 5496 KB ok, correct split
68 Correct 7 ms 5240 KB ok, correct split
69 Correct 6 ms 5084 KB ok, correct split
70 Correct 7 ms 5112 KB ok, correct split
71 Correct 8 ms 5496 KB ok, correct split
72 Correct 9 ms 5368 KB ok, correct split
73 Correct 8 ms 5368 KB ok, correct split
74 Correct 10 ms 5496 KB ok, correct split
75 Correct 10 ms 5496 KB ok, correct split
76 Correct 10 ms 5496 KB ok, correct split
77 Correct 9 ms 5496 KB ok, correct split
78 Correct 7 ms 5240 KB ok, correct split
79 Correct 7 ms 5240 KB ok, correct split
80 Correct 9 ms 5496 KB ok, correct split
81 Correct 9 ms 5496 KB ok, correct split
82 Correct 9 ms 5496 KB ok, correct split
83 Correct 8 ms 5496 KB ok, correct split
84 Correct 10 ms 5496 KB ok, no valid answer
85 Correct 8 ms 5372 KB ok, correct split
86 Correct 8 ms 5496 KB ok, correct split
87 Correct 6 ms 5112 KB ok, no valid answer
88 Correct 7 ms 5240 KB ok, no valid answer
89 Correct 8 ms 5460 KB ok, no valid answer
90 Correct 9 ms 5496 KB ok, no valid answer
91 Correct 8 ms 5496 KB ok, no valid answer
92 Correct 8 ms 5496 KB ok, no valid answer
93 Correct 8 ms 5496 KB ok, no valid answer
94 Correct 145 ms 17756 KB ok, correct split
95 Correct 202 ms 21880 KB ok, correct split
96 Correct 189 ms 20472 KB ok, correct split
97 Correct 51 ms 9464 KB ok, correct split
98 Correct 52 ms 9592 KB ok, correct split
99 Correct 72 ms 11316 KB ok, correct split
100 Correct 213 ms 19328 KB ok, correct split
101 Correct 170 ms 18296 KB ok, correct split
102 Correct 164 ms 18160 KB ok, correct split
103 Correct 172 ms 18032 KB ok, correct split
104 Correct 144 ms 19684 KB ok, correct split
105 Correct 82 ms 11768 KB ok, correct split
106 Correct 146 ms 19560 KB ok, correct split
107 Correct 136 ms 16000 KB ok, correct split
108 Correct 134 ms 15864 KB ok, correct split
109 Correct 180 ms 18808 KB ok, correct split
110 Correct 178 ms 19028 KB ok, correct split
111 Correct 187 ms 18796 KB ok, correct split
112 Correct 172 ms 19056 KB ok, correct split
113 Correct 170 ms 19056 KB ok, correct split
114 Correct 21 ms 6724 KB ok, correct split
115 Correct 19 ms 6520 KB ok, correct split
116 Correct 182 ms 18852 KB ok, correct split
117 Correct 183 ms 18672 KB ok, correct split
118 Correct 172 ms 15872 KB ok, correct split
119 Correct 134 ms 15708 KB ok, correct split
120 Correct 139 ms 18196 KB ok, correct split
121 Correct 126 ms 15864 KB ok, no valid answer
122 Correct 113 ms 16044 KB ok, no valid answer
123 Correct 179 ms 19424 KB ok, no valid answer
124 Correct 184 ms 19320 KB ok, no valid answer
125 Correct 120 ms 17520 KB ok, no valid answer
126 Correct 84 ms 15728 KB ok, no valid answer
127 Correct 142 ms 17884 KB ok, no valid answer