# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
46354 |
2018-04-19T17:36:33 Z |
evpipis |
Sirni (COCI17_sirni) |
C++11 |
|
5000 ms |
786432 KB |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
typedef pair<int, int> ii;
typedef long long ll;
const int len = 1e5+2;
int cnt[100*len], nex[2][100*len], p[len], r[len];
vector<ii> vec[100*len];
int fin(int i){
if (p[i] == i) return i;
return p[i] = fin(p[i]);
}
void join(int i, int j){
if (r[i] > r[j])
p[j] = i;
else{
p[i] = j;
if (r[i] == r[j]) r[j]++;
}
}
void read(int &res){
char c;
while (c = getchar(), c < '0' || c > '9'){}
res = c-'0';
while (c = getchar(), c >= '0' && c <= '9')
res = 10*res+c-'0';
}
int main(){
int n, m = 0, k = 0;
read(n);
for (int i = 0; i < n; i++){
int temp;
read(temp);
m = max(m, temp);
if (!cnt[temp]) cnt[temp] = ++k;
}
for (int i = m; i >= 1; i--){
nex[0][i] = nex[0][i+1];
if (cnt[i]) nex[0][i] = i;
nex[1][i] = nex[1][i+1];
if (cnt[i+1]) nex[1][i] = i+1;
}
for (int i = 1; i <= k; i++){
r[i] = 0;
p[i] = i;
}
for (int i = 1; i <= m; i++)
if (cnt[i])
for (int j = i; j <= m; j+=i){
if (j == i && nex[1][j] && nex[1][j] < j+i)
vec[nex[1][j]-j].pb(mp(cnt[i], cnt[nex[1][j]]));
else if (j != i && nex[0][j] && nex[0][j] < j+i);
vec[nex[0][j]-j].pb(mp(cnt[i], cnt[nex[0][j]]));
}
ll ans = 0;
for (int i = 0; i <= m; i++){
if (k == 1) break;
for (int j = 0; j < vec[i].size(); j++){
if (k == 1) break;
int x = fin(vec[i][j].fi), y = fin(vec[i][j].se);
if (x != y)
join(x, y), ans += i, k--;
}
}
printf("%lld\n", ans);
return 0;
}
Compilation message
sirni.cpp: In function 'int main()':
sirni.cpp:66:22: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
else if (j != i && nex[0][j] && nex[0][j] < j+i);
^~
sirni.cpp:67:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
vec[nex[0][j]-j].pb(mp(cnt[i], cnt[nex[0][j]]));
^~~
sirni.cpp:73:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int j = 0; j < vec[i].size(); j++){
~~^~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
284 ms |
317176 KB |
Output is correct |
2 |
Correct |
985 ms |
347868 KB |
Output is correct |
3 |
Correct |
284 ms |
347868 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
191 ms |
347868 KB |
Output is correct |
2 |
Execution timed out |
5066 ms |
730208 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
286 ms |
730208 KB |
Output is correct |
2 |
Correct |
274 ms |
730208 KB |
Output is correct |
3 |
Correct |
279 ms |
730208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
273 ms |
730208 KB |
Output is correct |
2 |
Correct |
460 ms |
730208 KB |
Output is correct |
3 |
Correct |
307 ms |
730208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
218 ms |
730208 KB |
Output is correct |
2 |
Correct |
399 ms |
730208 KB |
Output is correct |
3 |
Correct |
254 ms |
730208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
396 ms |
730208 KB |
Output is correct |
2 |
Correct |
521 ms |
730208 KB |
Output is correct |
3 |
Correct |
323 ms |
730208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
203 ms |
730208 KB |
Output is correct |
2 |
Correct |
511 ms |
730208 KB |
Output is correct |
3 |
Correct |
297 ms |
730208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
782 ms |
730208 KB |
Output is correct |
2 |
Execution timed out |
5127 ms |
786432 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
602 ms |
786432 KB |
Output is correct |
2 |
Execution timed out |
5096 ms |
786432 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
352 ms |
786432 KB |
Output is correct |
2 |
Execution timed out |
5066 ms |
786432 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |