oj.uz

Submission #168672

# Submission time Handle Problem Language Result Execution time Memory
168672 2019-12-15T02:16:01 Z mhy908 Split the Attractions (IOI19_split) C++14
40 / 100
 187 ms 19192 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;
	int tonum=0;
	for(int i=1; i<=r; i++){
        if(dp[i]>=min(min(a, b), cc)){
            flag=true;
            tonum=i;
        }
	}
	if(!flag)return ans;
	memset(ch, 0, sizeof(ch));
	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 7 2 3 1
0 1
1 2
2 3
3 4
4 2
2 5
3 1
*/

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:97:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<link[cen].size(); i++){
               ~^~~~~~~~~~~~~~~~~
split.cpp:119: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

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5116 KB ok, correct split
2 Correct 6 ms 4984 KB ok, correct split
3 Correct 6 ms 5112 KB ok, correct split
4 Correct 6 ms 5116 KB ok, correct split
5 Correct 6 ms 5116 KB ok, correct split
6 Correct 6 ms 5112 KB ok, correct split
7 Correct 144 ms 19036 KB ok, correct split
8 Correct 145 ms 17656 KB ok, correct split
9 Correct 147 ms 17272 KB ok, correct split
10 Correct 146 ms 19192 KB ok, correct split
11 Correct 156 ms 19192 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB ok, correct split
2 Correct 6 ms 5084 KB ok, correct split
3 Correct 6 ms 5112 KB ok, correct split
4 Correct 187 ms 17796 KB ok, correct split
5 Correct 130 ms 14684 KB ok, correct split
6 Correct 147 ms 19192 KB ok, correct split
7 Correct 137 ms 17528 KB ok, correct split
8 Correct 185 ms 16600 KB ok, correct split
9 Correct 139 ms 14584 KB ok, correct split
10 Correct 95 ms 15728 KB ok, correct split
11 Correct 90 ms 15732 KB ok, correct split
12 Correct 92 ms 15728 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB ok, correct split
2 Correct 127 ms 14712 KB ok, correct split
3 Correct 45 ms 8952 KB ok, correct split
4 Correct 6 ms 5112 KB ok, correct split
5 Correct 136 ms 16120 KB ok, correct split
6 Correct 134 ms 15864 KB ok, correct split
7 Correct 130 ms 16088 KB ok, correct split
8 Correct 136 ms 16632 KB ok, correct split
9 Correct 139 ms 15864 KB ok, correct split
10 Correct 37 ms 8316 KB ok, no valid answer
11 Correct 55 ms 9976 KB ok, no valid answer
12 Correct 103 ms 15348 KB ok, no valid answer
13 Correct 122 ms 14840 KB ok, no valid answer
14 Correct 102 ms 15732 KB ok, no valid answer

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5116 KB ok, correct split
2 Correct 6 ms 5112 KB ok, no valid answer
3 Correct 7 ms 5112 KB ok, correct split
4 Correct 6 ms 5116 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 Incorrect 6 ms 5112 KB invalid split: #1=5, #2=4, #3=7
9 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5116 KB ok, correct split
2 Correct 6 ms 4984 KB ok, correct split
3 Correct 6 ms 5112 KB ok, correct split
4 Correct 6 ms 5116 KB ok, correct split
5 Correct 6 ms 5116 KB ok, correct split
6 Correct 6 ms 5112 KB ok, correct split
7 Correct 144 ms 19036 KB ok, correct split
8 Correct 145 ms 17656 KB ok, correct split
9 Correct 147 ms 17272 KB ok, correct split
10 Correct 146 ms 19192 KB ok, correct split
11 Correct 156 ms 19192 KB ok, correct split
12 Correct 6 ms 5112 KB ok, correct split
13 Correct 6 ms 5084 KB ok, correct split
14 Correct 6 ms 5112 KB ok, correct split
15 Correct 187 ms 17796 KB ok, correct split
16 Correct 130 ms 14684 KB ok, correct split
17 Correct 147 ms 19192 KB ok, correct split
18 Correct 137 ms 17528 KB ok, correct split
19 Correct 185 ms 16600 KB ok, correct split
20 Correct 139 ms 14584 KB ok, correct split
21 Correct 95 ms 15728 KB ok, correct split
22 Correct 90 ms 15732 KB ok, correct split
23 Correct 92 ms 15728 KB ok, correct split
24 Correct 6 ms 5112 KB ok, correct split
25 Correct 127 ms 14712 KB ok, correct split
26 Correct 45 ms 8952 KB ok, correct split
27 Correct 6 ms 5112 KB ok, correct split
28 Correct 136 ms 16120 KB ok, correct split
29 Correct 134 ms 15864 KB ok, correct split
30 Correct 130 ms 16088 KB ok, correct split
31 Correct 136 ms 16632 KB ok, correct split
32 Correct 139 ms 15864 KB ok, correct split
33 Correct 37 ms 8316 KB ok, no valid answer
34 Correct 55 ms 9976 KB ok, no valid answer
35 Correct 103 ms 15348 KB ok, no valid answer
36 Correct 122 ms 14840 KB ok, no valid answer
37 Correct 102 ms 15732 KB ok, no valid answer
38 Correct 6 ms 5116 KB ok, correct split
39 Correct 6 ms 5112 KB ok, no valid answer
40 Correct 7 ms 5112 KB ok, correct split
41 Correct 6 ms 5116 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 Incorrect 6 ms 5112 KB invalid split: #1=5, #2=4, #3=7
46 Halted 0 ms 0 KB -