제출 #1174207

#제출 시각아이디문제언어결과실행 시간메모리
1174207InvMODSirni (COCI17_sirni)C++20
84 / 140
5097 ms789312 KiB
#include<bits/stdc++.h> using namespace std; #define sz(v) (int)(v).size() #define all(v) (v).begin(), (v).end() #define compact(v) (v).erase(unique(all(v)), (v).end()) using ll = long long; struct DSU{ vector<int> par; DSU(int n = 0): par(n + 1, -1) {} int asc(int x){ return par[x] < 0 ? x : par[x] = asc(par[x]); } bool join(int u, int v){ u = asc(u), v = asc(v); if(u == v) return false; if(par[u] > par[v]) swap(u, v); par[u] += par[v]; par[v] = u; return true; } }; struct Edge{ int u,v,w; Edge(int u = 0, int v = 0, int w = 0): u(u), v(v), w(w) {} bool operator < (const Edge& q) const{ return w < q.w; } }; void solve() { int n; cin >> n; vector<int> a(n); for(int i = 0; i < n; i++){ cin >> a[i]; } sort(all(a)), compact(a); DSU dsu(sz(a) - 1); vector<Edge> E; for(int i = sz(a) - 1; i >= 0; i--){ int nxt = a[i], p = lower_bound(1 + i + all(a), nxt) - a.begin(); while(p < sz(a)){ E.push_back(Edge(i, p, a[p] % a[i])); nxt += a[i]; p = lower_bound(1 + i + all(a), nxt) - a.begin(); } } sort(all(E)); int answer = 0; for(int i = 0; i < sz(E); i++){ if(dsu.join(E[i].u, E[i].v)){ answer = answer + E[i].w; } } cout << answer << "\n"; } int32_t main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define name "InvMOD" if(fopen(name".INP", "r")){ freopen(name".INP", "r", stdin); freopen(name".ANS", "w", stdout); } solve(); return 0; }

컴파일 시 표준 에러 (stderr) 메시지

sirni.cpp: In function 'int32_t main()':
sirni.cpp:81:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |         freopen(name".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sirni.cpp:82:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |         freopen(name".ANS", "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...