| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1112478 |
2024-11-14T08:40:13 Z |
chaoslong |
Sirni (COCI17_sirni) |
C++14 |
|
1235 ms |
786432 KB |
// Calm down.
// Think three times, code twice.
#include "bits/stdc++.h"
#define forr(_a,_b,_c) for(int _a = (_b); _a <= (_c); ++_a)
#define ford(_a,_b,_c) for(int _a = (_b) + 1; _a --> (_c);)
#define forf(_a,_b,_c) for(int _a = (_b); _a < (_c); ++_a)
#define st first
#define nd second
#define ll long long
#define ull unsigned long long
#define pii pair <int,int>
#define pll pair <ll,ll>
#define piii pair <int,pii>
#define vi vector <int>
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define mask(i) (1LL << (i))
#define bit(x, i) (((x) >> (i)) & 1)
#define bp __builtin_popcountll
#define file "test"
using namespace std;
const int N = 1e7 + 500;
const int mod = 1e9 + 7; // 998244353
const ll oo = 1e18;
int n, par[N], sz[N];
vector<pii> f[N];
int find(int v) {
if(v == par[v]) return v;
return par[v] = find(par[v]);
}
bool join(int x, int y) {
int sth1 = x, sth2 = y;
x = find(x); y = find(y);
if(x != y) {
// cout << sth1 << " " << sth2 << endl;
// cout << x << " " << y << endl;
if(sz[x] < sz[y]) swap(x, y);
par[y] = x;
sz[x] += sz[y];
return true;
}
return false;
}
void to_nho_cau() {
cin >> n;
vector<int> a;
forr(i, 1, n) {
int x; cin >> x;
a.pb(x);
}
if(a.size()) {
sort(all(a)); a.resize(unique(all(a)) - a.begin());
}
int mx = a.back();
vector<int> nxt(mx + 500, -1);
forf(i, 0, a.size()) {
nxt[a[i]] = i;
}
ford(i, mx-1, 0) {
if(nxt[i] == -1) nxt[i] = nxt[i+1];
}
forf(i, 0, a.size()) {
if(i+1 < a.size())
f[a[i+1] % a[i]].pb({i, i+1});
for(int cur = 2 * a[i]; cur <= mx; cur += a[i]) {
int good = nxt[cur];
if(good < a.size() && good > i)
f[a[good] % a[i]].pb({i, good});
}
}
memset(par, -1, sizeof par);
forr(i, 0, mx) {
par[i] = i;
sz[i] = 1;
}
ll ans = 0;
forr(i, 0, mx) {
for(pii e: f[i]) {
int u = e.st, v = e.nd;
if(join(u, v)) {
ans = ans + i;
}
}
}
cout << ans << "\n";
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);
#ifdef LOCAL
freopen(file".inp","r",stdin);
freopen(file".out","w",stdout);
#endif
int t = 1;
//cin >> t;
while(t--) to_nho_cau();
}
/*
1.self check:
2.long long
3.size of array
4.code for testing
5.initializing
6.modulo number
*/
/**
∧__∧
（｀•ω• )づ__∧
（つ /( •ω•。)
しーＪ (nnノ) pat pat
**/
/** /\_/\
* (= ._.)
* / >☕ \>💻
**/
Compilation message
sirni.cpp:118:9: warning: "/*" within comment [-Wcomment]
118 | /** /\_/\
|
sirni.cpp: In function 'bool join(int, int)':
sirni.cpp:37:9: warning: unused variable 'sth1' [-Wunused-variable]
37 | int sth1 = x, sth2 = y;
| ^~~~
sirni.cpp:37:19: warning: unused variable 'sth2' [-Wunused-variable]
37 | int sth1 = x, sth2 = y;
| ^~~~
sirni.cpp: In function 'void to_nho_cau()':
sirni.cpp:6:46: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
6 | #define forf(_a,_b,_c) for(int _a = (_b); _a < (_c); ++_a)
| ^
sirni.cpp:62:5: note: in expansion of macro 'forf'
62 | forf(i, 0, a.size()) {
| ^~~~
sirni.cpp:6:46: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
6 | #define forf(_a,_b,_c) for(int _a = (_b); _a < (_c); ++_a)
| ^
sirni.cpp:68:5: note: in expansion of macro 'forf'
68 | forf(i, 0, a.size()) {
| ^~~~
sirni.cpp:69:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
69 | if(i+1 < a.size())
| ~~~~^~~~~~~~~~
sirni.cpp:73:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
73 | if(good < a.size() && good > i)
| ~~~~~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
212 ms |
352780 KB |
Output is correct |
| 2 |
Correct |
276 ms |
381612 KB |
Output is correct |
| 3 |
Correct |
235 ms |
352584 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
148 ms |
274504 KB |
Output is correct |
| 2 |
Correct |
1118 ms |
747560 KB |
Output is correct |
| 3 |
Correct |
236 ms |
353352 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
236 ms |
352844 KB |
Output is correct |
| 2 |
Correct |
229 ms |
352584 KB |
Output is correct |
| 3 |
Correct |
238 ms |
352840 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
198 ms |
292272 KB |
Output is correct |
| 2 |
Correct |
265 ms |
319952 KB |
Output is correct |
| 3 |
Correct |
222 ms |
303024 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
175 ms |
284236 KB |
Output is correct |
| 2 |
Correct |
208 ms |
305224 KB |
Output is correct |
| 3 |
Correct |
190 ms |
288436 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
211 ms |
303508 KB |
Output is correct |
| 2 |
Correct |
286 ms |
337716 KB |
Output is correct |
| 3 |
Correct |
207 ms |
301220 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
164 ms |
279348 KB |
Output is correct |
| 2 |
Correct |
294 ms |
339520 KB |
Output is correct |
| 3 |
Correct |
216 ms |
303024 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
279 ms |
365668 KB |
Output is correct |
| 2 |
Correct |
1088 ms |
710936 KB |
Output is correct |
| 3 |
Correct |
276 ms |
369648 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
275 ms |
370372 KB |
Output is correct |
| 2 |
Runtime error |
1199 ms |
786432 KB |
Execution killed with signal 9 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
231 ms |
354888 KB |
Output is correct |
| 2 |
Correct |
1235 ms |
712480 KB |
Output is correct |
| 3 |
Correct |
229 ms |
304888 KB |
Output is correct |
