oj.uz

Submission #86519

# Submission time Handle Problem Language Result Execution time Memory
86519 2018-11-26T11:53:32 Z dimash241 Sirni (COCI17_sirni) C++17
112 / 140
 5000 ms 651568 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
 
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
 
#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 (int i = x; i <= y; ++i) 
#define FOr(i,x,y)  for (int i = x; i >= y; --i)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0)
// ROAD to...                                                                                                                                                                                                                Red
 
using namespace std;     
const int maxn = 1e7 + 3;
const int N = 1e5 + 1;
 
int n;
int sz[N];
int p[N];
int a[N];
int R[maxn + 5];
int id[maxn + 5];
int ans = 0;                                  
int u[maxn + 5];
vector < pair < int, int > > g[maxn + 5];
 
inline int get (int v) {
	if (p[v] == v) {
		return v;
	}
 
	return p[v] = get(p[v]);
}
 
inline 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;
	if (sz[v] == sz[u]) sz[v] ++;
 
	return 1;
}
 
int main () {               
    scanf("%d", &n);
    For (i, 1, n) {
    	scanf("%d", a + i);
    }
    sort(a + 1, a + n + 1);
    if (a[1] == 1) {
    	puts("0");
    	exit(0);
    }
 
    For (i, 1, n) {
    	if (id[a[i]]) continue;
    	p[i] = i;
    	sz[i] = 1;
    	R[a[i]] = a[i];
    	id[a[i]] = i;
    }
 
    for (int j = maxn - 2; j >= 0; --j) {
    	if (!R[j])
    		R[j] = R[j + 1];
    }
 
    For (i, 1, n) {
    	if (u[a[i]] ++ > 0) continue;
    	if (a[i] + a[i] >= maxn - 1 || R[a[i] + 1] != R[a[i] + a[i]]) {
    		g[R[a[i] + 1] % a[i]].pb(mp(i, id[R[a[i] + 1]]));
    	}
    	for (int j = a[i]; j < maxn && R[j]; j += a[i]) {
    		if (j + a[i] > maxn || R[j] != R[j + a[i]]) {
    			g[R[j] - j].pb(mp(i, id[R[j]]));
    		}
    	}
    	  
    }
	for (int i = 0; i < maxn; ++i) {
   		for (auto it : g[i]) {
   			if (uni (it.F, it.S)) {
   				ans += i;
   			}
   		}
   	}
 
    printf("%d", ans);   
}

Compilation message

sirni.cpp: In function 'int main()':
sirni.cpp:78:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
sirni.cpp:80:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
      scanf("%d", a + i);
      ~~~~~^~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 348 ms 281720 KB Output is correct
2 Correct 415 ms 281720 KB Output is correct
3 Correct 359 ms 282464 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 344 ms 282464 KB Output is correct
2 Correct 799 ms 282464 KB Output is correct
3 Correct 354 ms 282472 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 372 ms 282584 KB Output is correct
2 Correct 343 ms 282584 KB Output is correct
3 Correct 352 ms 282736 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 417 ms 293520 KB Output is correct
2 Correct 610 ms 320280 KB Output is correct
3 Correct 471 ms 320280 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 366 ms 320280 KB Output is correct
2 Correct 539 ms 320280 KB Output is correct
3 Correct 409 ms 320280 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 540 ms 320280 KB Output is correct
2 Correct 614 ms 331716 KB Output is correct
3 Correct 432 ms 331716 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 385 ms 331716 KB Output is correct
2 Correct 593 ms 331716 KB Output is correct
3 Correct 433 ms 331716 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 659 ms 366892 KB Output is correct
2 Correct 4027 ms 562236 KB Output is correct
3 Correct 708 ms 562236 KB Output is correct

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 673 ms 562236 KB Output is correct
2 Execution timed out 5073 ms 651568 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

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