제출 #320037

#제출 시각아이디문제언어결과실행 시간메모리
320037HemimorBrunhilda’s Birthday (BOI13_brunhilda)C++14
0 / 100
171 ms262148 KiB
#include <algorithm> #include <iostream> #include <iomanip> #include <numeric> #include <cassert> #include <vector> #include <cmath> #include <queue> #include <set> #include <map> #define syosu(x) fixed<<setprecision(x) using namespace std; typedef long long ll; typedef unsigned int uint; typedef unsigned long long ull; typedef pair<int,int> P; typedef pair<double,double> pdd; typedef pair<ll,ll> pll; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<double> vd; typedef vector<vd> vvd; typedef vector<ll> vl; typedef vector<vl> vvl; typedef vector<string> vs; typedef vector<P> vp; typedef vector<vp> vvp; typedef vector<pll> vpll; typedef pair<int,P> pip; typedef vector<pip> vip; const int inf=1<<30; const ll INF=1ll<<60; const double pi=acos(-1); const double eps=1e-8; const ll mod=1e9+7; const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1}; const int M=10000001; int n,q,res[M]; vi a; int main(){ scanf("%d%d",&n,&q); a=vi(n); for(int i=0;i<n;i++) scanf("%d",&a[i]); int mx=a[n-1]; fill(res,res+mx,1); fill(res+mx,res+M,inf); multiset<int> st; priority_queue<P,vector<P>,greater<P>> que; vvi b(M); for(auto i:a){ st.insert(1); que.push({(mx+i-1)/i*i,i}); } for(int i=mx;i<M;i++){ int t=0; while(que.top().first==i){ int j=que.top().second,x=res[i-j]; que.pop(); st.erase(st.find(x)); que.push({i+j,j}); t++; } if(!st.empty()) res[i]=min(inf,1+*st.begin()); while(t){ st.insert(res[i]); t--; } } for(int i=0;i<q;i++){ int x; scanf("%d",&x); if(res[x]==inf) printf("oo\n"); else printf("%d\n",res[x]); } }

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

brunhilda.cpp: In function 'int main()':
brunhilda.cpp:43:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   43 |  scanf("%d%d",&n,&q);
      |  ~~~~~^~~~~~~~~~~~~~
brunhilda.cpp:45:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   45 |  for(int i=0;i<n;i++) scanf("%d",&a[i]);
      |                       ~~~~~^~~~~~~~~~~~
brunhilda.cpp:73:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   73 |   scanf("%d",&x);
      |   ~~~~~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...