제출 #220758

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
220758		infinite_iq	친구 (IOI14_friend)	C++14	0 / 100	7 ms	2816 KiB

friend

#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll inf=1e18;
const ld pai=acos(-1);
#include "friend.h"
int n , num , sz ;
vi v [100009];
int done[100009];
void dfs( int node , int crnt){
        done [ node ] = 1 ;
        num += crnt;
        sz ++ ;
        for ( auto u : v[node] ) {
                if ( done [u] ) C ;
                dfs ( u , 1 - crnt ) ;
        }
}
void add ( int a , int b ) {
        v[a].pb ( b ) ;
        v[b].pb ( a ) ;
}
int findSample(int N,int confidence[],int host[],int t[]){
        n = N ;
        for ( int i = 1 ;i < n ;i ++ ) {
                if ( !t[i] ){
                        int a = i , b = host[i] ;
                        add( a , b );
                }
                if ( t[i]  ){
                        for ( auto b : v[ host[i] ] ) {
                                int a = i ;
                                add ( a , b );
                        }
                }
        }
        int ans = 0 ;
        for ( int i = 0 ; i < n ;i ++ ){
                if ( done [i] ) C ;
                num = sz = 0 ;
                dfs ( i , 0 ) ;
                ans += max ( sz - num , num ) ;
        }
        return ans ;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 8
• Subtask 3: 0 / 8
• Subtask 4: 0 / 19
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31