제출 #711986

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
711986		epicci23	Intercastellar (JOI22_ho_t1)	C++17	100 / 100	83 ms	10912 KiB

Main

#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int  INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/



inline int in()
{
  int x;cin >> x;
  return x;
}

inline string in2()
{
  string x;cin >> x;
  return x;
}


void solve()
{
  int n=in();
  int arr[n+1];
  for(int i=1;i<=n;i++) arr[i]=in();

  vector<pii> v;
  
  for(int i=1;i<=n;i++)
  {
    int cur=arr[i];
    while(cur%2==0) cur/=2;
    v.pb({cur,arr[i]/cur});
  }

  for(int i=1;i<sz(v);i++) v[i].ss+=v[i-1].ss;

  int q=in();
  while(q--)
  {
    int x=in();
    int l=0,r=sz(v);
    while(l<r)
    {
      int mi=(l+r)/2;
      if(v[mi].ss<x) l=mi+1;
      else r=mi;
    }
    cout << v[l].ff << endl;
  }
}

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//cin>> t;
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

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

Main.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

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