제출 #280436

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
280436		CaroLinda	Split the Attractions (IOI19_split)	C++14	0 / 100	1 ms	256 KiB

split

#include <bits/stdc++.h>
#include "split.h"

#define sz(x) (int)x.size()
#define mkt make_tuple
#define lp(i,a,b) for(int i = a ; i < b ; i++ )
#define ff first
#define ss second
#define eb emplace_back
#define ll long long
#define mk make_pair
#define pii pair<int,int>
#define debug printf
#define all(x) x.begin(),x.end()

const int MAXN = 1e5+10 ;

using namespace std ;

vector< vector<int> > adj ;
vector<int> vec ;
bool vis[MAXN] ;
int sobra ;

void dfs(int x )
{

    vis[x] = true ;
    vec.emplace_back(x) ;
    sobra-- ;

    for(auto e : adj[x])
        if(!vis[e] && sobra > 0) dfs(e) ;

}

vector<int> find_split(int n , int a , int b , int c , vector<int> p ,vector<int> q )
{

    for(int i = 0 ; i <= n ; i++ ) adj.emplace_back( *(new vector<int>) ) ;
    for(int i = 0 ; i < sz(p) ; i++ ) adj[ p[i] ].emplace_back( q[i] ) ;

    int x = 1 ;
    lp(i,1,n+1)
        if( sz(adj[i]) < sz(adj[x]) ) x = i ;

    sobra = a ;
    dfs(x) ;
    sobra = b ;
    lp(i,1,n+1)
        if(!vis[i])
        {
            dfs(i) ;
            break ;
        }

    lp(i,1,n+1)
        if(!vis[i]) vec.emplace_back(i) ;

    return vec ;

}

/*int N , M , A , B , C ;
vector<int> p , q ;

int main()
{

    scanf("%d%d%d%d%d", &N , &M, &A, &B, &C ) ;
    for(int i = 0 , u, v ; i < M ; i++ )
    {
        scanf("%d%d", &u, &v ) ;
        p.eb(u) ;
        q.eb(v) ;
    }

    vector<int> ans = find_split(N , A , B , C , p , q ) ;

    for(auto e : ans ) printf("%d " , e) ;
    printf("\n") ;

}
*/

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