제출 #931657

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
931657		thunopro	Unscrambling a Messy Bug (IOI16_messy)	C++14	20 / 100	1 ms	604 KiB

messy

#include<bits/stdc++.h>
#include "messy.h"
using namespace std ; 
#define maxn 200009
#define ll long long 
#define pb push_back 
#define fi first 
#define se second 
#define left id<<1
#define right id<<1|1 
#define re exit(0); 
#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 ; 

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 add ( int &a , int b ) 
{
	a += b ; 
	if ( a >= mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

void rf () 
{
	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 ; 
}

vi restore_permutation ( int n , int w , int r ) 
{
	vi result(n) ; 
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		string string_add = "" ; 
		for ( int j = 1 ; j <= n ; j ++ ) 
		{
			if ( j <= i ) string_add += char ('1') ;
			else string_add += char ('0') ; 
		} 
		add_element (string_add) ;
	}
	compile_set () ; 
	string res ; 
	for ( int i = 1 ; i <= n ; i ++ ) res += '0' ; 
	for ( int i = 0 ; i < n ; i ++ ) 
	{
		for ( int j = 0 ; j < n ; j ++ ) 
		{
			if ( res [j] == '1' ) continue ; 
			res [j] = '1' ; 
			if (check_element(res)) 
			{
				result [i] = j ; 
				break ; 
			}
			res [j] = '0' ;
		}
	}
	return result ; 
}

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

messy.cpp: In function 'void rf()':
messy.cpp:32:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 20 / 20
• Subtask 2: 0 / 18
• Subtask 3: 0 / 11
• Subtask 4: 0 / 21
• Subtask 5: 0 / 30