oj.uz

Submission #86531

# Submission time Handle Problem Language Result Execution time Memory
86531 2018-11-26T12:08:26 Z dimash241 Sirni (COCI17_sirni) C++14
112 / 140
 5000 ms 568304 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 pb push_back
#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)
// 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 + 1];
int id[maxn + 1];
int ans = 0;                                  
bool u[maxn + 1];
vector < pair < int, int > > g[maxn + 1];
 
inline int get (int v) {
	if (p[v] == v) {
		return v;
	}
 
	return p[v] = get(p[v]);
}
 
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;
    	++ u[a[i]];
    	if (a[i] + a[i] >= maxn - 1 || R[a[i] + 1] != R[a[i] + a[i]]) {
    		g[R[a[i] + 1] % a[i]].pb({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({i, id[R[j]]});
    		}
    	}
    	  
    }
 
	for (int i = 0; i < maxn - 20; ++i) {
   		for (auto it : g[i]) {
   			it.F = get(it.F);
   			it.S = get(it.S);
   			if (it.F == it.S) continue;
   			ans += i;
   			if (sz[it.F] > sz[it.S]) {
   				p[it.S] = it.F;
   			} else if (sz[it.F] < sz[it.S]) {
   				p[it.F] = it.S;
   			} else {
   				p[it.F] = it.S;
   				sz[it.F] ++;
   			}
   		}
   	}
 
    printf("%d", ans);   
}

Compilation message

sirni.cpp: In function 'int main()':
sirni.cpp:85:15: warning: use of an operand of type 'bool' in 'operator++' is deprecated [-Wdeprecated]
      ++ u[a[i]];
               ^
sirni.cpp:60:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
sirni.cpp:62: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 346 ms 281208 KB Output is correct
2 Correct 410 ms 281208 KB Output is correct
3 Correct 343 ms 281920 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 348 ms 281920 KB Output is correct
2 Correct 826 ms 281920 KB Output is correct
3 Correct 352 ms 281920 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 356 ms 281948 KB Output is correct
2 Correct 349 ms 281948 KB Output is correct
3 Correct 346 ms 282040 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 457 ms 290696 KB Output is correct
2 Correct 639 ms 317628 KB Output is correct
3 Correct 480 ms 317628 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 361 ms 317628 KB Output is correct
2 Correct 575 ms 317628 KB Output is correct
3 Correct 442 ms 317628 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 592 ms 317628 KB Output is correct
2 Correct 690 ms 330228 KB Output is correct
3 Correct 481 ms 330228 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 374 ms 330228 KB Output is correct
2 Correct 611 ms 330228 KB Output is correct
3 Correct 449 ms 330228 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 640 ms 337396 KB Output is correct
2 Correct 4119 ms 533560 KB Output is correct
3 Correct 667 ms 533560 KB Output is correct

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 639 ms 533560 KB Output is correct
2 Execution timed out 5132 ms 568304 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

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