Submission #1004193

#TimeUsernameProblemLanguageResultExecution timeMemory
1004193NeltSirni (COCI17_sirni)C++17
42 / 140
5079 ms2780 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define ll long long #define endl "\n" using namespace std; using namespace __gnu_pbds; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); template<class T> using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>; void solve() { ll n; cin >> n; ll p[n]; for (ll &i : p) cin >> i; ll ans = 0; ll mn[n]; for (ll i = 0; i < n; i++) mn[i] = 1e9; mn[0] = 0; bool used[n]; memset(used, 0, sizeof(used)); for (ll i = 0; i < n; i++) { ll cur = 1e9; ll v = 0; for (ll j = 0; j < n; j++) if (!used[j] and mn[j] < cur) cur = mn[j], v = j; ans += cur; used[v] = 1; for (ll j = 0; j < n; j++) mn[j] = min(mn[j], min(p[v] % p[j], p[j] % p[v])); } cout << ans << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); ll t = 1; // precomp(); // cin >> t; for (ll cs = 1; cs <= t; cs++) solve(); // cerr << "\nTime elapsed: " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n"; }
#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...