oj.uz

Submission #66532

# Submission time Handle Problem Language Result Execution time Memory
66532 2018-08-11T10:40:30 Z KLPP Sirni (COCI17_sirni) C++14
126 / 140
 5000 ms 41560 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];
void begin(int n){
	for(int i=0;i<n;i++){
		parent[i]=i;
		size[i]=1;
	}
}
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);
	if(n<=1000){
	vector<pair<int,pair<int,int> > >Edges;
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++){
			Edges.push_back(pair<int,pair<int,int> >(arr[j]%arr[i],pair<int,int>(i,j)));
		}
	}
	sort(Edges.begin(),Edges.end());
	begin(n);
	long long int ans=0;
	int CC=n;
	for(int i=0;i<Edges.size() && CC>1;i++){
		int x,y;
		x=Edges[i].second.first;
		y=Edges[i].second.second;
		if(!component(x,y)){
			merge(x,y);
			CC--;
			ans+=Edges[i].first;
		}
		//cout<<x<<" "<<y<<endl;
	}cout<<ans<<endl;
	return 0;
	}
	vector<int> array;
	array.push_back(arr[0]);
	for(int i=1;i<n;i++){
		if(arr[i]!=arr[i-1]){
			array.push_back(arr[i]);
		}
	}
	n=array.size();
	for(int i=0;i<n;i++)arr[i]=array[i];
	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;
	begin(n);
	int round=0;
	while(CC>1){
		//Plog(n)
		for(int i=0;i<n;i++){
			if(arr[i]>round){
				for(int j=arr[i]+round-1;j<MAXP+5;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:59:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<Edges.size() && CC>1;i++){
              ~^~~~~~~~~~~~~
sirni.cpp:44:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
sirni.cpp:46: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 53 ms 6628 KB Output is correct
2 Correct 78 ms 6628 KB Output is correct
3 Correct 61 ms 6792 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 6792 KB Output is correct
2 Correct 84 ms 6792 KB Output is correct
3 Correct 66 ms 6792 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 6796 KB Output is correct
2 Correct 49 ms 6796 KB Output is correct
3 Correct 62 ms 6796 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1744 ms 41240 KB Output is correct
2 Correct 3283 ms 41240 KB Output is correct
3 Correct 470 ms 41240 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 657 ms 41240 KB Output is correct
2 Correct 3427 ms 41240 KB Output is correct
3 Correct 2217 ms 41240 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3483 ms 41384 KB Output is correct
2 Correct 1654 ms 41384 KB Output is correct
3 Correct 461 ms 41384 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1580 ms 41384 KB Output is correct
2 Correct 2657 ms 41384 KB Output is correct
3 Correct 454 ms 41384 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1511 ms 41560 KB Output is correct
2 Correct 1090 ms 41560 KB Output is correct
3 Correct 1655 ms 41560 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 525 ms 41560 KB Output is correct
2 Correct 3174 ms 41560 KB Output is correct
3 Correct 165 ms 41560 KB Output is correct

Subtask #10
0 / 14.0

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