제출 #896769

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
896769		thunopro	Intercastellar (JOI22_ho_t1)	C++14	100 / 100	58 ms	8788 KiB

Main

#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 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 ;
const int LOG = 18 ; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ;
typedef vector<ll> vl ;  
typedef pair<ll,ll> pll ; 
typedef vector<pll> vll ; 

void add ( int&a , int b ) { if ((a+=b) > mod ) a -= mod ; } 
void sub ( int&a , int b ) { if ((a-=b) < 0 ) a += mod ; } 
template<typename T> void chkmin(T& x, T y) {if(x > y) x = y;}
template<typename T> void chkmax(T& x, T y) {if(x < y) x = y;}

void rf ( ) 
{
	freopen ("bai1.inp","r",stdin) ; 
//	freopen ("bai1.out","w",stdout) ;
}

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 ) ; 
}

int n ; 
pii a [maxn] ; 
int q [maxn] ; 
int main ( ) 
{
	ios_base :: sync_with_stdio (0) ; 
	cin.tie(0) ; cout.tie(0) ;
//	rf () ;
	cin >> n ; 
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		int x ; cin >> x ; 
		int cnt = 1 ; 
		while ( x % 2 == 0 ) x /= 2 , cnt *= 2 ; 
		a [i] = {x,cnt} ; 
	}
	int nq ; 
	cin >> nq ; 
	int j = 0 ; 
	ll sum = 0 ; 
	for ( int i = 1 ; i <= nq ; i ++ ) 
	{
		ll x ; cin >> x ; 
		while ( sum < x ) sum += a [++j].se ; 
		cout << a [j].fi << "\n" ; 
	}
}




//-std=c++11 
// check special 
// range , time , error , stay hard stay hard 
// there is no tomorrow 

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

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

• Subtask 1: 25 / 25
• Subtask 2: 35 / 35
• Subtask 3: 40 / 40