#64484 (C++11) No.317 辺の追加

• 問題: No.317 辺の追加
• ユーザー: ciel
• 提出日時: 2015-12-10 15:29:16
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 1,877 ms / 2,000 ms
• コード長: 1,278 bytes
• コンパイル時間: 611 ms
• コンパイル使用メモリ: 63,448 KB
• 実行使用メモリ: 8,584 KB
• 最終ジャッジ日時: 2024-09-15 07:33:43
• 合計ジャッジ時間: 9,351 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	47 ms; 5,376 KB
testcase_03	AC	38 ms; 5,376 KB
testcase_04	AC	344 ms; 5,376 KB
testcase_05	AC	38 ms; 5,376 KB
testcase_06	AC	45 ms; 5,376 KB
testcase_07	AC	16 ms; 5,376 KB
testcase_08	AC	968 ms; 5,848 KB
testcase_09	AC	73 ms; 5,376 KB
testcase_10	AC	53 ms; 5,376 KB
testcase_11	AC	1,295 ms; 8,584 KB
testcase_12	AC	53 ms; 5,376 KB
testcase_13	AC	1,877 ms; 7,240 KB
testcase_14	AC	52 ms; 5,376 KB
testcase_15	AC	52 ms; 5,376 KB
testcase_16	AC	299 ms; 5,376 KB
testcase_17	AC	51 ms; 5,376 KB
testcase_18	AC	53 ms; 5,376 KB
testcase_19	AC	54 ms; 5,376 KB
testcase_20	AC	506 ms; 5,376 KB
testcase_21	AC	16 ms; 5,376 KB
testcase_22	AC	10 ms; 5,376 KB
testcase_23	AC	9 ms; 5,376 KB
testcase_24	AC	28 ms; 5,376 KB
testcase_25	AC	20 ms; 5,376 KB
testcase_26	AC	21 ms; 5,376 KB
testcase_27	AC	18 ms; 5,376 KB
testcase_28	AC	10 ms; 5,376 KB
testcase_29	AC	4 ms; 5,376 KB
testcase_30	AC	56 ms; 5,376 KB
testcase_31	AC	51 ms; 5,376 KB
testcase_32	AC	51 ms; 5,376 KB
testcase_33	AC	50 ms; 5,376 KB
testcase_34	AC	50 ms; 5,376 KB
testcase_35	AC	51 ms; 5,376 KB
testcase_36	AC	50 ms; 5,376 KB
testcase_37	AC	51 ms; 5,376 KB
testcase_38	AC	55 ms; 5,376 KB
testcase_39	AC	51 ms; 5,376 KB

コンパイルメッセージ

main.cpp: In function ‘int main()’:
main.cpp:33:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   33 |         scanf("%d%d",&N,&M);
      |         ~~~~~^~~~~~~~~~~~~~
main.cpp:37:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   37 |                 scanf("%d%d",&a,&b);
      |                 ~~~~~^~~~~~~~~~~~~~
main.cpp:47:28: warning: ‘tbelow’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   47 |                 else tbelow+=e;
      |                      ~~~~~~^~~

ソースコード

#include <vector>
#include <unordered_map>
#include <algorithm>
#include <cstdio>
using namespace std;
class union_find{
	int *parent,*rank,n;
public:
	int root(int a){return parent[a]==a?a:(parent[a]=root(parent[a]));}
	union_find(int _n){n=_n;parent=new int[n];rank=new int[n];for(int i=0;i<n;i++)parent[i]=i,rank[i]=0;}
	~union_find(){delete []parent;delete []rank;}
	int same(int a,int b){return root(a)==root(b);}
	int unite(int a,int b){
		int x=root(a),y=root(b);if(x==y)return 0;
		if(rank[x]<rank[y]){
			parent[x]=y;
		}else{
			parent[y]=x;
			if(rank[x]==rank[y])rank[x]++;
		}
		return 1;
	}
	void enumerate(vector<int> &edges){
		unordered_map<int,int> r;
		for(int i=0;i<n;i++)r[root(i)]++;
		for(auto &e:r)edges.push_back(e.second);
		sort(edges.begin(),edges.end());
	}
};
int main(){
	const int INF=1<<29;
	int N,M;
	scanf("%d%d",&N,&M);
	union_find uf(N);
	for(;M--;){
		int a,b;
		scanf("%d%d",&a,&b);
		uf.unite(a-1,b-1);
	}
	vector<int>edges;
	uf.enumerate(edges);
	vector<int>bag(N+1,INF);
	bag[0]=-1;
	int t=0,tbelow,prev=0;
	for(auto &e:edges){
		if(prev!=e)prev=e,tbelow=e;
		else tbelow+=e;
		t+=e;
		for(int i=t;i>=tbelow;i--)if(bag[i-e]<INF){
			bag[i]=min(bag[i],bag[i-e]+1);
		}
	}
	for(int i=1;i<=N;i++)printf("%d\n",bag[i]==INF ? -1 : bag[i]);
}