제출 #1282533

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1282533		trinm01	Intercastellar (JOI22_ho_t1)	C++20	100 / 100	54 ms	8596 KiB

Main

// #pragma GCC optimize("O3")
// #pragma GCC optimization("Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;

#define int long long 
#define ll long long
#define FOR(i, l, r) for (int i = (l); i <= (r); i++)
#define FOD(i, r, l) for (int i = (r); i >= (l); i--)
#define fi first
#define se second
#define pii pair<int, int>

const ll mod = 1e9 + 7;
const int MAXN = 2e5 + 5;
const ll oo = 1e18 + 7;  
const int base = 10;

int n, q;
int a[MAXN];
int b[MAXN], c[MAXN], ps[MAXN];

int get(int x){
	int pos=lower_bound(ps+1, ps+1+n, x)-ps;
	return c[pos];
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    
    // freopen("test.txt", "r", stdin);
    // freopen("o2.out", "w", stdout);

    if(fopen(".inp", "r")){
        freopen(".inp", "r", stdin);
        freopen(".out", "w", stdout);
    }

    cin >> n;
    FOR(i, 1, n){
    	cin >> a[i];
    }
    FOR(i, 1, n){
    	int x=a[i], dm=0;
    	while(x%2==0){
    		dm++;
    		x/=2;
    	}
    	c[i]=x;
    	b[i]=(1<<dm);
    	ps[i]=ps[i-1]+b[i];
    }
    
    cin >> q;
    while(q--){
    	int x;
    	cin >> x;
    	cout << get(x) << '\n';
    }
    
    return 0;
}

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

Main.cpp: In function 'int main()':
Main.cpp:39:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |         freopen(".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~
Main.cpp:40:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |         freopen(".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~

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