제출 #640784

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
640784		Baytoro	Intercastellar (JOI22_ho_t1)	C++17	100 / 100	80 ms	5336 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define Baytoro_Mayrambekov void solve()
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
const int INF=1e18;
void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
int binpow(int a,int n){
	if(n==0)
		return 1;
	if(n%2==1)
		return binpow(a, n-1)*a;
	else{
		int b=binpow(a, n/2);
		return b*b;
	}
}
int f(int x){
	int res=1;
	while(x%2==0){
		x/=2;
		res*=2;
	}
	return res;
}
int get(int x){
	while(x%2==0)
		x/=2;
	return x;
}
int a,b,c,n,m,i,j,k,x,y,cnt=0,sum=0,res=0;
Baytoro_Mayrambekov{
	cin>>n;
	vector<pair<int,int>> vec(n+1);
	for(i=1;i<=n;i++){
		cin>>vec[i].fr;
		vec[i].sc=f(vec[i].fr);
	}
	for(i=1;i<=n;i++){
		vec[i].sc+=vec[i-1].sc;
	}
	int q;
	cin>>q;
	while(q--){
		cin>>x;
		int l=1,r=n;
		while(l<r){
			int md=(l+r)/2;
			if(vec[md].sc<x)
				l=md+1;
			else
				r=md;
		}
		cout<<get(vec[l].fr)<<endl;
	}
}
main(){
	ios;
	int T=1;
	//cin>>T;
	while(T--){
		solve();
	}
}

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

Main.cpp:66:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   66 | main(){
      | ^~~~
Main.cpp: In function 'void fopn(std::string)':
Main.cpp:14:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:15:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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