Submission #130096

#TimeUsernameProblemLanguageResultExecution timeMemory
130096MohamedAhmed04Brunhilda’s Birthday (BOI13_brunhilda)C++14
0 / 100
256 ms262148 KiB
//WA submission to check if it will TLE or not. #include <bits/stdc++.h> using namespace std ; const int MAX = 1e7 + 5 ; const int OO = 1e9 ; int dp[MAX] ; int d[MAX][8] ; int sz[MAX] ; int main() { int n , q ; cin>>n>>q ; int arr[n] ; for(int i = 0 ; i < n ; ++i) { cin>>arr[i] ; for(int j = arr[i] ; j < MAX ; j += arr[i]) { if(j > (int)(1e7)) break ; d[j][sz[j]] = arr[i] ; sz[j]++ ; } } dp[0] = 0 ; for(int i = 1 ; i < MAX ; ++i) { dp[i] = 0 ; for(int j = 0 ; j < sz[i] ; ++j) dp[i] += d[i][j] / 2; } while(q--) { int x ; cin>>x ; if(dp[x] >= OO) cout<<"oo\n" ; else cout<<dp[x]<<"\n"; } return 0 ; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...