| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1117283 | 2024-11-23T08:14:37 Z | hihihihaw | Sirni (COCI17_sirni) | C++17 | 3255 ms | 786432 KB |
#pragma GCC optimize("O3,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pii pair<int, int>
#define sz(v) (int)v.size()
#define fi first
#define se second
#define INF 999999992000000023
#define MOD 1000000007
#define cint(x) int x;cin >> x;
#define cinarr(a, n) int a[n]; for (int i = 0; i < n; i++) cin >> a[i];
#define coutarr(a) for (auto d : a){cout << d << " ";} cout << endl;
#define coutarrD(a) for (auto d : a) {cout << d.fi << "," << d.se << " "; }cout << endl;
#define BERKAY_TUP ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define endl '\n'
#define ld long double
#define mid (start + end) / 2
#define vvi vector<vector<int>>
int t=1;
int interactive=0;
int usaco=0;
int testCase=0;
int a[10000023]={};
int pre[10000023];
int parent[10000023];
int find(int x){
if (parent[x]==x) return x;
return parent[x]=find(parent[x]);
}
void unionSet(int x,int y){
x=find(x),y=find(y);
if (x==y) return;
parent[x]=y;
}
void solve(){
int n;
cin>>n;
set<int> s;
for (int i=0;i<n;i++){
int x;
cin>>x;
s.insert(x);
}
for (auto d:s) a[d]=d;
int x=0;
for (int i=10000022;i>=0;i--){
parent[i]=i;
if (a[i]!=0) x=a[i];
pre[i]=x;
}
vector<vector<int>> v;
for (int i=1;i<10000023;i++){
if (a[i]==0) continue;
for (int j=i;j<10000023;j+=i){
int z;
if (j==i) z=pre[j+1];
else z=pre[j];
//if (i==2 && j<20) cout<<z<<" "<<j<<endl;
if (z/i==j/i && z!=0){
v.pb({z%i,i,z});
}
}
}
sort(v.begin(),v.end());
int ans=0;
for (auto d:v){
int x,y,c;
x=d[1],y=d[2],c=d[0];
if (find(x)!=find(y)){
ans+=c;
unionSet(x,y);
}
}
cout<<ans<<endl;
}
int32_t main(){
BERKAY_TUP;
if (usaco)
{
freopen("help.in", "r", stdin);
freopen("help.out", "w", stdout);
}
if (!interactive)
{
#ifdef Local
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
// freopen("wormsort.out", "w", stdout);
#endif
}
if (t == 1)
solve();
else
{
cin >> t;
while (t--)
{
testCase++;
solve();
}
}
return 0;
}
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 125 ms | 164620 KB | Output is correct |
| 2 | Correct | 182 ms | 175092 KB | Output is correct |
| 3 | Correct | 123 ms | 169100 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 152 ms | 159048 KB | Output is correct |
| 2 | Correct | 393 ms | 168700 KB | Output is correct |
| 3 | Correct | 122 ms | 164996 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 123 ms | 164936 KB | Output is correct |
| 2 | Correct | 120 ms | 161608 KB | Output is correct |
| 3 | Correct | 130 ms | 164936 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 626 ms | 224948 KB | Output is correct |
| 2 | Correct | 2505 ms | 381060 KB | Output is correct |
| 3 | Correct | 910 ms | 250456 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 157 ms | 175864 KB | Output is correct |
| 2 | Correct | 1288 ms | 327552 KB | Output is correct |
| 3 | Correct | 698 ms | 221876 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1616 ms | 333440 KB | Output is correct |
| 2 | Correct | 3255 ms | 497432 KB | Output is correct |
| 3 | Correct | 918 ms | 251316 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 349 ms | 180712 KB | Output is correct |
| 2 | Correct | 3018 ms | 496660 KB | Output is correct |
| 3 | Correct | 803 ms | 250848 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 924 ms | 321460 KB | Output is correct |
| 2 | Runtime error | 976 ms | 786432 KB | Execution killed with signal 9 |
| 3 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 888 ms | 322208 KB | Output is correct |
| 2 | Runtime error | 1047 ms | 786432 KB | Execution killed with signal 9 |
| 3 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 234 ms | 219640 KB | Output is correct |
| 2 | Runtime error | 958 ms | 786432 KB | Execution killed with signal 9 |
| 3 | Halted | 0 ms | 0 KB | - |