oj.uz

Submission #168640

# Submission time Handle Problem Language Result Execution time Memory
168640 2019-12-14T17:33:02 Z mhy908 Split the Attractions (IOI19_split) C++14
18 / 100
 176 ms 19592 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], DP;
int siz[100010], cen=-1, c[100010];
int order[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;
void dfs3(int num){
    if(ch[num]||num==cen)return;
    ch[num]=true;
    for(int i=0; i<temp[num].size(); i++){
        dfs3(temp[num][i]);
    }
    order[num]=++kkk;
}
void dfs4(int num, int cnt, int p){
    if(colored>=cnt||ans[num])return;
    ans[num]=p;
    colored++;
    for(int i=0; i<temp[num].size(); i++){
        dfs4(temp[num][i], cnt, p);
    }
}
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;
            DP=dp[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]]){
            dfs3(link[cen][i]);
            break;
        }
	}
	int starthere=cen;
	for(int i=0; i<n; i++){
        if(order[i]<=min(min(a, b), cc)&&order[i]){
            if(a<=b&&a<=cc)ans[i]=1;
            else if(b<=a&&b<=cc)ans[i]=2;
            else ans[i]=3;
        }
        if(order[i]==min(min(a, b), cc)+1)starthere=i;
	}
	if(a<=b&&a<=cc){
        if(b<=cc)dfs4(starthere, b, 2);
        else dfs4(starthere, cc, 3);
	}
	else if(b<=a&&b<=cc){
        if(a<=cc)dfs4(starthere, a, 1);
        else dfs4(starthere, cc, 3);
	}
    else{
        if(a<=b)dfs4(starthere, a, 1);
        dfs4(starthere, 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:22: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:35:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<link[num].size(); i++){
                  ~^~~~~~~~~~~~~~~~~
split.cpp:42: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:55: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)':
split.cpp:64: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 dfs4(int, int, int)':
split.cpp:73:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<temp[num].size(); i++){
                  ~^~~~~~~~~~~~~~~~~
split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:88:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<link[cen].size(); i++){
               ~^~~~~~~~~~~~~~~~~
split.cpp:103: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 5112 KB ok, correct split
2 Correct 6 ms 5112 KB ok, correct split
3 Correct 7 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 168 ms 19536 KB ok, correct split
8 Correct 155 ms 18040 KB ok, correct split
9 Correct 139 ms 17656 KB ok, correct split
10 Correct 156 ms 19592 KB ok, correct split
11 Correct 145 ms 19576 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 5112 KB ok, correct split
3 Correct 6 ms 5112 KB ok, correct split
4 Correct 164 ms 18200 KB ok, correct split
5 Correct 118 ms 15096 KB ok, correct split
6 Correct 147 ms 19576 KB ok, correct split
7 Correct 136 ms 17912 KB ok, correct split
8 Correct 176 ms 16852 KB ok, correct split
9 Correct 142 ms 14968 KB ok, correct split
10 Correct 92 ms 15652 KB ok, correct split
11 Correct 90 ms 15728 KB ok, correct split
12 Correct 97 ms 15856 KB ok, correct split

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB ok, correct split
2 Incorrect 129 ms 15172 KB 2 components are not connected
3 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory 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 5112 KB ok, correct split
4 Correct 6 ms 5112 KB ok, correct split
5 Correct 6 ms 5116 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 2 components are not connected
9 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB ok, correct split
2 Correct 6 ms 5112 KB ok, correct split
3 Correct 7 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 168 ms 19536 KB ok, correct split
8 Correct 155 ms 18040 KB ok, correct split
9 Correct 139 ms 17656 KB ok, correct split
10 Correct 156 ms 19592 KB ok, correct split
11 Correct 145 ms 19576 KB ok, correct split
12 Correct 6 ms 5112 KB ok, correct split
13 Correct 6 ms 5112 KB ok, correct split
14 Correct 6 ms 5112 KB ok, correct split
15 Correct 164 ms 18200 KB ok, correct split
16 Correct 118 ms 15096 KB ok, correct split
17 Correct 147 ms 19576 KB ok, correct split
18 Correct 136 ms 17912 KB ok, correct split
19 Correct 176 ms 16852 KB ok, correct split
20 Correct 142 ms 14968 KB ok, correct split
21 Correct 92 ms 15652 KB ok, correct split
22 Correct 90 ms 15728 KB ok, correct split
23 Correct 97 ms 15856 KB ok, correct split
24 Correct 6 ms 5112 KB ok, correct split
25 Incorrect 129 ms 15172 KB 2 components are not connected
26 Halted 0 ms 0 KB -