제출 #297588

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
297588		infinite_iq	Split the Attractions (IOI19_split)	C++14	11 / 100	122 ms	10744 KiB

split

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define C continue 
typedef vector < int > vi ;
#include "split.h"
int n , m , goal ;
vi  v [100009] , ret ;
int done [100009] ;
void dfs ( int node ) {
        if ( ret .size () == goal ) return ;
        done  [node] = 1 ;
        ret .pb ( node ) ;
        for ( auto u : v [node] ) {
                if ( done [u] ) C ;
                dfs ( u ) ;
        }
}
vi find_split ( int N , int sz1 , int sz2 , int sz3 , vi p , vi q ) {
        n = N , m = p .size () , goal = sz2 ;
        for ( int i = 0 ; i < m ; i ++ ) {
                int a , b ;
                a = p [i] , b = q [i] ;
                v [a] .pb ( b ) ;
                v [b] .pb ( a ) ;
        }
        dfs ( 0 ) ;
        vi ans ( n , 0 ) ;
        for ( auto u : ret ) {
                ans [u] = 2 ;
        }
        for ( auto &u : ans ) {
                if ( ! u ) {
                        u = 1 ;
                        break ;
                }
        }
        for ( auto &u : ans ) {
                if ( ! u ) {
                        u = 3 ;
                }
        }
        return ans ;
}

컴파일 시 표준 에러 (stderr) 메시지

split.cpp: In function 'void dfs(int)':
split.cpp:11:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   11 |         if ( ret .size () == goal ) return ;
      |              ~~~~~~~~~~~~~^~~~~~~

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