CODE FESTIVAL 2016 Final

Submission #7923169

Source codeソースコード

#include <iostream>
#include <vector>

using namespace std;
struct UnionFind {
	vector<int> par;

	UnionFind(int N) : par(N) {
		for(int i = 0; i < N; i++) par[i] = i;
	}

	int root(int x) {
		if(par[x] == x) return x;
			//ここで併合処理も行なっている
		return par[x] = root(par[x]);
	}

	void unite(int x, int y) {
		int rx = root(x);
		int ry = root(y);
		if(rx == ry) return;
		par[rx] = ry;
	}

	bool same(int x, int y) {
		int rx = root(x);
		int ry = root(y);
		return rx == ry;
	}

};


int main() {
	int N;
	cin >> N;
	int M;
	cin >> M;
	UnionFind b(M);
	vector<bool> L(M, false);
	for(int i = 0; i < N; i++) {
		int ki;
		cin >> ki;
		int pre_l = -1;
		for(int j = 0; j < ki; j++) {
			int l;
			cin >> l;
			l--;
			L[l] = true;
			if(pre_l == -1) {
				pre_l = l;
				continue;
			}
			b.unite(pre_l, l);
		}
	}
	int f = -1;
	for(int i = 0; i < M; i++) {
		if(L[i] == false) continue;
		if(f == -1){
			f = i;
			continue;
		}
		if(b.same(f, i) == false) {
			cout << "NO" << endl;
			return 0;
		}
	}
		cout << "YES" << endl;
}

Submission

Task問題 C - Interpretation
User nameユーザ名 STN
Created time投稿日時
Language言語 C++14 (Clang 3.8.0)
Status状態 AC
Score得点 400
Source lengthソースコード長 1125 Byte
File nameファイル名
Exec time実行時間 126 ms
Memory usageメモリ使用量 2048 KB

Test case

Set

Set name Score得点 / Max score Cases
sample - sample-01.txt,sample-02.txt
dataset1 200 / 200 sample-01.txt,sample-02.txt,01-01.txt,01-02.txt,01-03.txt,01-04.txt,01-05.txt,01-06.txt,01-07.txt,01-08.txt,01-09.txt,01-10.txt
dataset2 200 / 200 sample-01.txt,sample-02.txt,01-01.txt,01-02.txt,01-03.txt,01-04.txt,01-05.txt,01-06.txt,01-07.txt,01-08.txt,01-09.txt,01-10.txt,02-01.txt,02-02.txt,02-03.txt,02-04.txt,02-05.txt,02-06.txt,02-07.txt,02-08.txt,02-09.txt,02-10.txt,02-11.txt,02-12.txt,02-13.txt,sample-01.txt,sample-02.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
01-01.txt AC 1 ms 256 KB
01-02.txt AC 2 ms 256 KB
01-03.txt AC 2 ms 256 KB
01-04.txt AC 2 ms 256 KB
01-05.txt AC 2 ms 256 KB
01-06.txt AC 2 ms 256 KB
01-07.txt AC 2 ms 256 KB
01-08.txt AC 2 ms 256 KB
01-09.txt AC 2 ms 256 KB
01-10.txt AC 2 ms 256 KB
02-01.txt AC 88 ms 640 KB
02-02.txt AC 108 ms 256 KB
02-03.txt AC 89 ms 512 KB
02-04.txt AC 108 ms 640 KB
02-05.txt AC 111 ms 256 KB
02-06.txt AC 108 ms 640 KB
02-07.txt AC 114 ms 256 KB
02-08.txt AC 92 ms 256 KB
02-09.txt AC 126 ms 640 KB
02-10.txt AC 101 ms 2048 KB
02-11.txt AC 100 ms 2048 KB
02-12.txt AC 98 ms 640 KB
02-13.txt AC 100 ms 640 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB