oj.uz

Submission #66540

# Submission time Handle Problem Language Result Execution time Memory
66540 2018-08-11T11:06:49 Z KLPP Sirni (COCI17_sirni) C++14
126 / 140
 5000 ms 41068 KB 
#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
#include<stdio.h>

using namespace std;
#define MAXP 10000000

int pnt[MAXP+5];
int parent[1000000];
int size[1000000];
int root(int x){
	if(parent[x]==x)return x;
	parent[x]=root(parent[x]);
	return parent[x];
}
bool component(int a, int b){
	a=root(a);
	b=root(b);
	if(root(a)==root(b))return true;
	return false;
}
void merge(int a, int b){
	a=root(a);
	b=root(b);
	if(a==b)return;
	if(size[a]<size[b]){
		size[b]+=size[a];
		parent[a]=b;
		return;
	}
	size[a]+=size[b];
	parent[b]=a;
}
int main(){
	int n;
	scanf("%d",&n);
	int arr[n];
	for(int i=0;i<n;i++)scanf("%d",&arr[i]);
	sort(arr,arr+n);
	int pn=1;
	for(int i=1;i<n;i++){
		if(arr[i]!=arr[pn-1]){
			arr[pn]=arr[i];
			pn++;
		}
	}
	n=pn;
	for(int i=0;i<MAXP+5;i++)pnt[i]=-1;
	for(int i=0;i<n;i++){
		pnt[arr[i]-1]=i;
	}
	long long int ans=0;
	int CC=n;
	for(int i=0;i<n;i++){
		parent[i]=i;
		size[i]=1;
	}
	int round=0;
	n--;
	while(CC>1){
		//Plog(n)
		for(int i=0;i<n;i++){
			if(arr[i]>round){
				int j=arr[i+1]/arr[i];
				j*=arr[i];
				j+=round-1;
				for(;j<MAXP;j+=arr[i]){
					if(pnt[j]!=-1 && !component(i,pnt[j])){
						merge(i,pnt[j]);
						CC--;
						ans+=round;
					}
				}
			}
		}
		round++;
	}printf("%lld\n",ans);

	return 0;
}

Compilation message

sirni.cpp: In function 'int main()':
sirni.cpp:38:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
sirni.cpp:40:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0;i<n;i++)scanf("%d",&arr[i]);
                      ~~~~~^~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 740 ms 39544 KB Output is correct
2 Correct 1443 ms 39544 KB Output is correct
3 Correct 603 ms 39688 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 724 ms 39736 KB Output is correct
2 Correct 918 ms 39736 KB Output is correct
3 Correct 130 ms 39736 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 627 ms 39768 KB Output is correct
2 Correct 206 ms 39788 KB Output is correct
3 Correct 540 ms 39788 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1612 ms 41068 KB Output is correct
2 Correct 2893 ms 41068 KB Output is correct
3 Correct 503 ms 41068 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 646 ms 41068 KB Output is correct
2 Correct 3469 ms 41068 KB Output is correct
3 Correct 2237 ms 41068 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3210 ms 41068 KB Output is correct
2 Correct 1547 ms 41068 KB Output is correct
3 Correct 425 ms 41068 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1630 ms 41068 KB Output is correct
2 Correct 2590 ms 41068 KB Output is correct
3 Correct 469 ms 41068 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1545 ms 41068 KB Output is correct
2 Correct 980 ms 41068 KB Output is correct
3 Correct 1436 ms 41068 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 388 ms 41068 KB Output is correct
2 Correct 2750 ms 41068 KB Output is correct
3 Correct 162 ms 41068 KB Output is correct

Subtask #10
0 / 14.0

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