oj.uz

Submission #66546

# Submission time Handle Problem Language Result Execution time Memory
66546 2018-08-11T11:22:38 Z KLPP Sirni (COCI17_sirni) C++14
98 / 140
 5000 ms 40892 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){//cout<<CC<<endl;
		//Nlog(n)
		for(int i=0;i<n;i++){
			if(arr[i]>round){
				int point=i+1;
				while(point<=n){//cout<<point<<endl;
					if(arr[point]%arr[i]==round && !component(i,point)){
						merge(i,point);
						ans+=round;CC--;
					}
					int num=arr[point];
					num/=arr[i];
					num++;
					num*=arr[i];
					int lo,hi;
					lo=point;
					hi=n+1;
					while(hi-lo>1){//cout<<lo<<" "<<hi<<endl;
						int mid=(hi+lo)/2;
						if(arr[mid]>=num)hi=mid;
						else lo=mid;
					}
					point=hi;
				}
			}
		}
		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 3719 ms 39500 KB Output is correct
2 Correct 350 ms 39652 KB Output is correct
3 Correct 1664 ms 39708 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 39708 KB Output is correct
2 Correct 38 ms 39708 KB Output is correct
3 Correct 177 ms 39768 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3415 ms 39768 KB Output is correct
2 Correct 516 ms 39768 KB Output is correct
3 Correct 2031 ms 39768 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1601 ms 40836 KB Output is correct
2 Correct 2759 ms 40836 KB Output is correct
3 Correct 452 ms 40836 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 329 ms 40836 KB Output is correct
2 Correct 1360 ms 40836 KB Output is correct
3 Correct 995 ms 40836 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2806 ms 40836 KB Output is correct
2 Correct 1650 ms 40892 KB Output is correct
3 Correct 461 ms 40892 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 40892 KB Output is correct
2 Correct 1538 ms 40892 KB Output is correct
3 Correct 401 ms 40892 KB Output is correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5028 ms 40892 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

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

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5104 ms 40892 KB Time limit exceeded
2 Halted 0 ms 0 KB -