제출 #1146973

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1146973		thunopro	사육제 (CEOI14_carnival)	C++20	0 / 100	1027 ms	440 KiB

carnival

#include<bits/stdc++.h> 
using namespace std; 
#define maxn 300009
#define ll long long 
#define fi first 
#define se second 
#define pb push_back 
#define re exit(0); 
#define left id<<1 
#define right id<<1|1 
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin() + 1 
const int mod = 1e9+7;  
const int INF = 1e9; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a >= mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } 
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; }

void runfile() { freopen ("bai1.inp","r",stdin) ; } 

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

mt19937 rng(0) ; 
int n ; 
int a [maxn] ; 

int colour [maxn] ; 

vector <int> get_vector ( int l , int r ) 
{
	vector <int> res ; 
	for ( int i = l ; i <= r ; i ++ ) res . pb (i) ; 
	return res ; 
}

//int ask ( vector <int> vec ) 
//{
//	set <int> S ; 
//	for ( auto x : vec ) S.insert(a[x]) ; 
//	return S.size () ; 
//}

int ask ( vector<int> vec ) 
{
	cout << vec.size () << " " ; for ( auto x : vec ) cout << x << " " ; 
	cout << endl ; 
}
int main() 
{
    ios_base::sync_with_stdio(0); 
    cin.tie(0);cout.tie(0);
//    runfile () ; 
	cin >> n ; 
	
//	for ( int i = 1 ; i <= n ; i ++ ) cin >> a [i] ; 
		
	int cnt_colour = 0 ; 
	colour [1] = ++ cnt_colour ; 
	for ( int i = 1 ; i < n ; i ++ ) if ( ask (get_vector(1,i)) != ask (get_vector(1,i+1)) ) colour [i+1] = ++ cnt_colour ; 
	
	vector<int> vector_colour ; 
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		if ( colour [i] ) vector_colour . pb(i) ; 
	}
	
	if ( cnt_colour == 1 ) 
	{
		for ( int i = 1 ; i <= n ; i ++ ) colour [i] = 1 ; 
	}
	
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		if ( colour [i] ) continue ; 
		int l = 1 , r = cnt_colour , res = -1 ; 
		while ( l <= r ) 
		{
			int mid = (l+r)/2 ; 
			vector <int> query ; 
			query . pb (i) ; 
			for ( int j = 0 ; j < mid ; j ++ ) query . pb (vector_colour[j]) ; 
			if ( ask (query) != query.size () ) res = mid , r = mid - 1 ; 
			else l = mid + 1 ; 
		}
		colour [i] = res ; 
	}
	
	cout << 0 << " " ; 
	for ( int i = 1 ; i <= n ; i ++ ) cout << colour [i] << " " ; 
}

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

carnival.cpp: In function 'int ask(std::vector<int>)':
carnival.cpp:63:1: warning: no return statement in function returning non-void [-Wreturn-type]
   63 | }
      | ^
carnival.cpp: In function 'void runfile()':
carnival.cpp:29:26: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 | void runfile() { freopen ("bai1.inp","r",stdin) ; }
      |                  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20