답안 #86495 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
86495	2018-11-26T11:36:20 Z	dimash241	Sirni (COCI17_sirni)	C++11	112 / 140	5000 ms	602940 KB

sirni

#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 (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;     
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 () {
	SpeedForce;               
    cin >> n;
    For (i, 1, n) {
    	cin >> a[i];
    }

    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] * 2 >= maxn - 1 || R[a[i] + 1] != R[a[i] * 2]) {
    		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] % a[i]].pb(mp(i, id[R[j]]));
    		}
    	}
    	  
    }
	for (int i = 0; i < maxn; i ++) {
   		if (g[i].empty()) continue;
   		for (auto it : g[i]) {
   			if (uni (it.F, it.S)) {
   				ans += i;
   			}
   		}
   	}
 
    cout << ans;
    
    return Accepted;
}

Subtask #1
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	357 ms	281720 KB	Output is correct
2	Correct	421 ms	281720 KB	Output is correct
3	Correct	390 ms	282508 KB	Output is correct

Subtask #2
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	344 ms	282508 KB	Output is correct
2	Correct	769 ms	282508 KB	Output is correct
3	Correct	349 ms	282516 KB	Output is correct

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	387 ms	282584 KB	Output is correct
2	Correct	349 ms	282584 KB	Output is correct
3	Correct	360 ms	282680 KB	Output is correct

Subtask #4
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	448 ms	294936 KB	Output is correct
2	Correct	579 ms	320272 KB	Output is correct
3	Correct	472 ms	320272 KB	Output is correct

Subtask #5
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	356 ms	320272 KB	Output is correct
2	Correct	576 ms	320272 KB	Output is correct
3	Correct	400 ms	320272 KB	Output is correct

Subtask #6
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	537 ms	320272 KB	Output is correct
2	Correct	675 ms	330520 KB	Output is correct
3	Correct	495 ms	330520 KB	Output is correct

Subtask #7
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	354 ms	330520 KB	Output is correct
2	Correct	669 ms	330956 KB	Output is correct
3	Correct	478 ms	330956 KB	Output is correct

Subtask #8
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	706 ms	367092 KB	Output is correct
2	Correct	4173 ms	574100 KB	Output is correct
3	Correct	728 ms	574100 KB	Output is correct

Subtask #9
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	718 ms	574100 KB	Output is correct
2	Execution timed out	5128 ms	602940 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #10
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	455 ms	602940 KB	Output is correct
2	Execution timed out	5099 ms	602940 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

답안 #86495

Compilation message