Submission #155738

#TimeUsernameProblemLanguageResultExecution timeMemory
155738souhhcongBrunhilda’s Birthday (BOI13_brunhilda)C++14
2.22 / 100
86 ms40212 KiB
#include <iostream> #include <string.h> using namespace std; const int N = 1e5+5, MAXN = 1e7+7, INF = 1e9+9; int n, q, x, p[N], dp[MAXN]; int solve(int x) { //cout << x << endl; if (dp[x] != -1) return dp[x]; int mn = INF; for (int i = n-1; i >= 0; i--) { if (!(x%p[i])) continue; mn = min(mn,solve(x/p[i]*p[i])+1); } dp[x] = mn; return dp[x]; } int main() { memset(dp,-1,sizeof dp); scanf("%d %d",&n,&q); for (int i = 0; i < n; i++) { scanf("%d",&p[i]); } for (int i = 1; i < p[n-1]; i++) dp[i] = 1; while(q--) { scanf("%d",&x); if (x < p[n-1]) printf("%d\n",dp[x]); int tmp = 1; for (int i = 0; i < n-1; i++) { tmp *= p[i]; if (tmp > x) break; } if (tmp > x) { if (x % p[n-1] == 0) { printf("%d\n",2*x/p[n-1]); } else { printf("%d\n",2*x/p[n-1]+1); } } else { bool check = 1; for (int i = 0; i < n-1; i++) { if (x % p[i] != 0) check = 0; } if (check) printf("oo\n"); else { if (x % p[n-1] == 0) { printf("%d\n",2*(x/p[n-1])); } else { printf("%d\n",2*(x/p[n-1])+1); } } } } }

Compilation message (stderr)

brunhilda.cpp: In function 'int main()':
brunhilda.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&q);
     ~~~~~^~~~~~~~~~~~~~~
brunhilda.cpp:29:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&p[i]);
         ~~~~~^~~~~~~~~~~~
brunhilda.cpp:35:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&x);
         ~~~~~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...