이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<bitset>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
/*
cout<<setprecision(20)
cin.tie(0);
ios::sync_with_stdio(false);
*/
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
//信じる気持ちさえあればなんとかなる
int i,m,q;cin>>m>>q;
vector<int>sosu(m);
for(i=0;i<m;i++){cin>>sosu[i];}
vector<int>anss;
anss.pub(0);
int gen=0;
while(-1){
int nex=gen;
for(auto it:sosu){
maxeq(nex,((gen/it +1)*it)-1);
}
if(nex==gen){break;}
anss.pub(nex);
gen=nex;
if(gen>1e7+10){break;}
}
while(q--){
int in;cin>>in;
int turn=LBI(anss,in);
if(anss.size()==turn){cout<<"oo\n";}
else{cout<<turn<<"\n";}
}
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
brunhilda.cpp: In function 'int main()':
brunhilda.cpp:73:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(anss.size()==turn){cout<<"oo\n";}
~~~~~~~~~~~^~~~~~| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |