제출 #816544

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
816544		vjudge1	Intercastellar (JOI22_ho_t1)	C++17	100 / 100	71 ms	9228 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
  #include "/home/trucmai/.vim/tools.h"
  #define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
  #else
  #define debug(x...)
#endif

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

#define ll long long
#define all(a) (a).begin(), (a).end()
#define vi vector<ll>
#define pi pair<ll,ll>
#define pii pair<ll,pair<ll,ll>>
#define fi first
#define se second
#define gcd __gcd
#define mset(a,v) memset(a, v, sizeof(a))
#define endl '\n'
#define spc " "

const int MN = 1e6 + 5,LOG = 27;
const ll MOD = 1e9 + 7,INF = 1e9;
ll n,q,a[MN],len[MN],cnt;
void solve(){
  cin>>n;
  for(ll i = 1;i <= n;++i){
    cnt = 1;
    cin>>a[i]; 
    if(a[i] % 2 == 0){
      while(a[i] % 2 == 0){
        a[i] /= 2;
        cnt *= 2;
      }
    }
    len[i] = len[i-1] + cnt;
  }
  cin>>q;
  while(q--){
    ll x; cin>>x;
    ll l = 1,r = n,res = -1;
    while(l <= r){ 
      ll m = (r+l) >> 1; 
      if(len[m] >= x){
        r = m - 1; 
        res = a[m];
      }else l = m + 1;
    }
    cout<<res<<endl;
  }
}

signed main(){
  cin.tie(0) -> sync_with_stdio(0);
  open();
  ll t = 1; //cin>>t;
  while(t--) solve(); 
  
  #ifdef LOCAL
    cerr << endl << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
  #endif
}

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

Main.cpp: In function 'void open()':
Main.cpp:13:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     freopen("i.inp","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~
Main.cpp:14:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     freopen("o.out","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~

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