제출 #66527

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
66527		KLPP	Sirni (COCI17_sirni)	C++14	42 / 140	2926 ms	787456 KiB

sirni

#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
#include<stdio.h>

using namespace std;
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);
	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;
}

컴파일 시 표준 에러 (stderr) 메시지

sirni.cpp: In function 'int main()':
sirni.cpp:55:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<Edges.size() && CC>1;i++){
              ~^~~~~~~~~~~~~
sirni.cpp:41:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
sirni.cpp:43: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 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 14
• Subtask 8: 0 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14