Submission #385224

#TimeUsernameProblemLanguageResultExecution timeMemory
385224ignaciocantaSirni (COCI17_sirni)C++14
84 / 140
3011 ms786436 KiB
#include <bits/stdc++.h> using namespace std; using tint = long long; using ld = long double; #define FOR(i,a,b) for (int i = (a); i < (b); ++i) #define F0R(i,a) FOR(i,0,a) #define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i) #define R0F(i,a) ROF(i,0,a) #define trav(a,x) for (auto& a: x) using pi = pair<int,int>; using pl = pair<tint,tint>; using vi = vector<int>; using vpi = vector<pi>; using vpl = vector<pl>; using vvi = vector<vi>; using vl = vector<tint>; using vb = vector<bool>; #define pb push_back #define pf push_front #define rsz resize #define all(x) begin(x), end(x) #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)(x).size() #define ins insert #define f first #define s second #define mp make_pair #define DBG(x) cerr << #x << " = " << x << endl; const int MOD = 1e9+7; const tint mod = 998244353; const int MX = 1e5+5; const tint INF = 1e18; const int inf = 2e9; const ld PI = acos(ld(-1)); const ld eps = 1e-5; const int dx[4] = {1, -1, 0, 0}; const int dy[4] = {0, 0, 1, -1}; template<class T> void remDup(vector<T> &v){ sort(all(v)); v.erase(unique(all(v)),end(v)); } template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } bool valid(int x, int y, int n, int m){ return (0<=x && x<n && 0<=y && y<m); } int cdiv(int a, int b) { return a/b+((a^b)>0&&a%b); } //redondea p arriba int fdiv(int a, int b) { return a/b-((a^b)<0&&a%b); } //redondea p abajo void NACHO(string name = ""){ ios_base::sync_with_stdio(0); cin.tie(0); if(sz(name)){ freopen((name+".in").c_str(), "r", stdin); freopen((name+".out").c_str(), "w", stdout); } } vi a; vector<pair<tint, pi>> ed; struct DSU{ vi e; void init(int N){ e = vi(N, -1); } int get(int x){ return e[x] < 0 ? x : e[x] = get(e[x]); } bool unite(int x, int y){ x = get(x), y = get(y); if(x == y) return 0; if(e[x] > e[y]) swap(x, y); e[x] += e[y]; e[y] = x; return 1; } }; int main(){ NACHO(); int n; cin >> n; a.rsz(n); F0R(i, n) cin >> a[i]; remDup(a); assert(is_sorted(all(a))); n = sz(a); F0R(i, n){ int id = upper_bound(all(a), a[i])-a.begin(); if(id != n) ed.pb(mp(a[id] % a[i], mp(id, i))); for(int k = 2*a[i]; k <= a.back(); k += a[i]){ id = lower_bound(all(a), k)-a.begin(); if(id != n) ed.pb(mp(a[id] % a[i], mp(id, i))); } } sort(all(ed)); DSU D; D.init(n); tint ans = 0; trav(o, ed){ int u = o.s.f, v = o.s.s; if(D.unite(u, v)) ans += o.f; } cout << ans << "\n"; }

Compilation message (stderr)

sirni.cpp: In function 'void NACHO(std::string)':
sirni.cpp:69:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   69 |   freopen((name+".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sirni.cpp:70:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   70 |   freopen((name+".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#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...