Submission #428482

#	Time	Username	Problem	Language	Result	Execution time	Memory
428482		Blistering_Barnacles	Split the Attractions (IOI19_split)	C++14	22 / 100	553 ms	1048580 KiB

split

#include "split.h"
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll q, dp[100005], a[555555] , par[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555] , v;
const ll mod = 1e9+7;
str s;
ll dfs1(ll v , ll pr){
    par[v] = pr ;
    dp[v] = 1 ;
    for(auto u : adj[v]){
        if(u == pr)C ;
        dp[v] += dfs1(u , v) ;
    }
    R dp[v] ;
}
void dfs(ll v , ll pr , ll col){
    //cout << v << " " << pr << " " << col << endl ;
    if(!l)R ;
    a[v] = col ;
    l-- ;
    for(auto u : adj[v]){
        if(u == pr)C ;
        dfs(u , v , col) ;
    }
}
vector<int> find_split(int n, int a1, int b1, int c, vector<int> p1, vector<int> q) {
    for(ll i = 0 ; i < sz(p1) ; i++){
        adj[p1[i] + 1].pb(q[i] + 1) ;
        adj[q[i] + 1].pb(p1[i] + 1) ;
    }
    vector < pll > pp = { { a1 , 1 } , { b1 , 2 } , { c , 3 } } ;
    sort(all(pp)) ;
    ll mn1 = pp[0].F , mn2 = pp[1].F;
    dfs1(1 , 0) ;
    for(ll i = 1 ; i <= n ; i++){
        if(dp[i] >= mn1 && n - dp[i] >= mn2){
            l = mn1 ;
            dfs(i , par[i] , pp[0].S) ;
            l = mn2 ;
            dfs(par[i] , i , pp[1].S) ;
            for(ll j = 1 ; j <= n; j++){
                //cout << a[j] << " " ;
                if(!a[j])a[j] = pp[2].S ;
            }
            B ;
        }
        if(dp[i] >= mn2 && n - dp[i] >= mn1){
            l = mn2 ;
            dfs(i , par[i] , pp[1].S) ;
            l = mn1 ;
            dfs(par[i] , i , pp[0].S) ;
            for(ll j = 1 ; j <= n; j++){
                //cout << a[j] << " " ;
                if(!a[j])a[j] = pp[2].S ;
            }
            B ;
        }
    }
    vll ret ;
    for(ll i = 1 ; i <= n ; i++)ret.pb(a[i]) ;
    R ret ;
}
/*
7 6 1 3 3
0 1
1 2
2 3
3 4
4 5
5 6
*/

Compilation message (stderr)

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:58:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for(ll i = 0 ; i < sz(p1) ; i++){
      |                      ^

• Subtask 1: 0 / 7
• Subtask 2: 0 / 11
• Subtask 3: 22 / 22
• Subtask 4: 0 / 24
• Subtask 5: 0 / 36