oj.uz

Submission #86469

# Submission time Handle Problem Language Result Execution time Memory
86469 2018-11-26T11:17:41 Z dimash241 Sirni (COCI17_sirni) C++17
112 / 140
 5000 ms 543616 KB 
# 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];
int R[maxn];
int id[maxn];
ll ans = 0;                                  
vector < pair < int, int > > g[maxn];
set < int > s;
 
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];
    }

    sort(a + 1, a + n + 1);
    n = unique(a + 1, a + n + 1) - a - 1;

    For (i, 1, n) {
    	p[i] = i;
    	sz[i] = 1;
    	R[a[i]] = a[i];
    	id[a[i]] = i;
    }

    for (int j = 1e7; j >= 0; j --) {
    	if (!R[j])
    		R[j] = R[j + 1];
    }

    For (i, 1, n) {
    	if (!R[a[i]]) continue;
    	if (a[i] * 2 >= 1e7 || R[a[i] + 1] != R[a[i] * 2]) {
    		s.insert(R[a[i] + 1] % a[i]);
    		g[R[a[i] + 1] % a[i]].pb(mp(i, id[R[a[i] + 1]]));
    	}
    	for (int j = a[i] + a[i]; j <= 1e7 && R[j]; j += a[i]) {
    		if (j + a[i] >= 1e7 || R[j] != R[j + a[i]]) {
    			s.insert(R[j] % a[i]);
    			g[R[j] % a[i]].pb(mp(i, id[R[j]]));
    		}
    	}
    	  
    }

   	ll ans = 0;
   	for (auto i : s) {
   		if (g[i].empty()) continue;
   		for (auto it : g[i]) {
   			if (uni (it.F, it.S))
   				ans += i;
   		}
   	}
 
    cout << ans;
    
    return Accepted;
}
 
// Coded By OB

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 308 ms 278392 KB Output is correct
2 Correct 424 ms 279044 KB Output is correct
3 Correct 286 ms 279044 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 286 ms 279044 KB Output is correct
2 Correct 749 ms 279044 KB Output is correct
3 Correct 290 ms 279044 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 295 ms 279044 KB Output is correct
2 Correct 293 ms 279044 KB Output is correct
3 Correct 300 ms 279052 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 456 ms 289904 KB Output is correct
2 Correct 746 ms 317512 KB Output is correct
3 Correct 490 ms 317512 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 403 ms 317512 KB Output is correct
2 Correct 746 ms 317512 KB Output is correct
3 Correct 432 ms 317512 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 666 ms 317512 KB Output is correct
2 Correct 887 ms 334980 KB Output is correct
3 Correct 486 ms 334980 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 334980 KB Output is correct
2 Correct 883 ms 334980 KB Output is correct
3 Correct 531 ms 334980 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 612 ms 334980 KB Output is correct
2 Correct 4734 ms 531256 KB Output is correct
3 Correct 657 ms 531256 KB Output is correct

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 593 ms 531256 KB Output is correct
2 Execution timed out 5123 ms 543616 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 358 ms 543616 KB Output is correct
2 Execution timed out 5115 ms 543616 KB Time limit exceeded
3 Halted 0 ms 0 KB -