Submission #1087061

#TimeUsernameProblemLanguageResultExecution timeMemory
1087061Dennis_JasonIntercastellar (JOI22_ho_t1)C++14
0 / 100
2069 ms63060 KiB
#include <bitset> #include <cmath> #include <functional> #include <algorithm> #include <numeric> #include <system_error> #include <deque> #include <fstream> #include <iomanip> #include <iostream> #include <iterator> #include <limits> #include <list> #include <map> #include <unordered_map> #include <queue> #include <set> #include <stack> #include <string> #include <vector> #include <cstring> #include <climits> #define pb push_back #define MOD 1000000007 #define NMAX 200001 #define MAX 1000000 #define nl '\n' #define pii1 pair<int, pair<int,int>> (1,(1,2)); #define pii pair<int,int> #define tpl tuple<int,int,int> #define int long long using namespace std; ifstream fin("data.in"); ofstream fout("data.out"); const int INF=1e12; /* ====================DEMONSTRATION====================== =========================END=========================== */ int n; vector<int>v; int q; map<int,int>mp; void ciur() { for(int i=1;i<=MAX;++i) mp[i]=1; for(int i=3;i<=MAX;i+=2) { for(int j=i+i;j<=MAX;j+=i) { mp[j]=max(mp[j],i); } } } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ciur(); cin>>n; v.resize(n+1); for(int i=1;i<=n;++i) { cin>>v[i]; } vector<int>ans; for(int i=1;i<=n;++i) { if(v[i]%2==0) { int aux=mp[v[i]]; int cnt=v[i]/mp[v[i]]; while(cnt--) ans.pb(aux); } else ans.pb(v[i]); } cin>>q; for(int i=1;i<=q;++i) { int x; cin>>x; cout<<ans[x-1]<<nl; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...