Submission #1042281

#TimeUsernameProblemLanguageResultExecution timeMemory
1042281AbitoSirni (COCI17_sirni)C++17
0 / 140
243 ms786432 KiB
#include <bits/stdc++.h> #define F first #define S second #define pb push_back #define ppb pop_back #define ep insert #define endl '\n' #define elif else if #define pow pwr #define sqrt sqrtt //#define int long long #define ll long long #define y1 YONE typedef unsigned long long ull; using namespace std; const int N=1e7+5; int a[N],n; set<int> ad[N],er[N],s; bool b[N]; int32_t main(){ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); cin>>n; for (int i=1;i<=n;i++) cin>>a[i],b[a[i]]=1; for (int i=1;i<N;i++){ if (!b[i]) continue; for (int j=i;j<N;j+=i){ if (j!=i) ad[j].ep(j); if (j+i<N) er[j+i].ep(j); } } int ans=0; for (int i=1;i<N;i++){ for (auto u:ad[i]) s.ep(u); if (b[i] && !s.empty()){ //cout<<i<<endl; //for (auto u:s) cout<<u<<' ';cout<<endl; ans+=i-(*--s.end()); s.ep(i); } for (auto u:er[i]) s.erase(u); } cout<<ans<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...