oj.uz

답안 #896769

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
896769 2024-01-02T06:05:02 Z thunopro Intercastellar (JOI22_ho_t1) C++14
100 / 100
 58 ms 8788 KB 
#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

Compilation message

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.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 14 ms 3660 KB Output is correct
4 Correct 21 ms 3672 KB Output is correct
5 Correct 35 ms 4956 KB Output is correct
6 Correct 21 ms 3928 KB Output is correct
7 Correct 39 ms 4948 KB Output is correct
8 Correct 35 ms 5100 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2804 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 14 ms 3660 KB Output is correct
4 Correct 21 ms 3672 KB Output is correct
5 Correct 35 ms 4956 KB Output is correct
6 Correct 21 ms 3928 KB Output is correct
7 Correct 39 ms 4948 KB Output is correct
8 Correct 35 ms 5100 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2804 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 27 ms 4672 KB Output is correct
24 Correct 25 ms 5188 KB Output is correct
25 Correct 49 ms 8272 KB Output is correct
26 Correct 32 ms 5728 KB Output is correct
27 Correct 30 ms 5460 KB Output is correct
28 Correct 58 ms 8788 KB Output is correct
29 Correct 55 ms 8276 KB Output is correct
30 Correct 29 ms 5408 KB Output is correct
31 Correct 57 ms 8644 KB Output is correct