oj.uz

답안 #86443

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
86443 2018-11-26T10:22:31 Z dimash241 Sirni (COCI17_sirni) C++17
14 / 140
 1558 ms 787456 KB 
# include <stdio.h>
# include <bits/stdc++.h>


#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

using namespace std;

inline bool isvowel (char c) {
	c = tolower(c);
    if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u') return 1;
    return 0;
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n;
int sz[N];
int p[N];
int a[N];
bool u[N];
ll ans = 0;
vector < pair < int, pair < int, int > > > v;

int get (int v) {
	if (p[v] == v) {
		return v;
	}

	return p[v] = get(p[v]);
}

bool uni (int u, int v) {
	u = get(u), v = get(v);
	if (u == v) return 0;

	if (sz[u] > sz[v]) swap(u, v);
	p[u] = v;
	sz[v] += sz[u];

	return 1;
}

int main () {               
    cin >> n;
    For (i, 1, n) {
    	cin >> a[i];
    	p[i] = i;
    	sz[i] = 1;
    }

    sort(a + 1, a + n + 1);
    For (i, 1, n) {
    	if (u[i]) continue;
    	For (j, i + 1, n) {
    		if (u[j]) continue;
    		if (i != j) {
    			if (a[j] % a[i] == 0) u[j] = 1;	
    			v.pb(mp(a[j] % a[i], mp(i, j)));
    		}
    	}
    }

    sort(every(v));
    for (auto it : v) {
    	if (uni(it.S.F, it.S.S)) {
    		ans += it.F;
    	}
    }

    cout << ans;
    
    return Accepted;
}

// Coded By OB

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 60 ms 6628 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 29 ms 6628 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 6684 KB Output is correct
2 Correct 56 ms 6876 KB Output is correct
3 Correct 64 ms 6876 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1425 ms 787456 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1302 ms 787456 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1497 ms 787456 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1558 ms 787456 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1313 ms 787456 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1369 ms 787456 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1330 ms 787456 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -