Submission #779458


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int N,M,S;
list<int> edge [200001];
bool ans [200001];

class union_find{
	public:
	union_find(int n)
		:par(n + 1)
	{
		for(int i = 1;i <= n;i++){
			par [i] = i;
		}
	}
	int find(int x)
	{
		if(par [x] == x){
			return x;
		}
		return par [x] = find(par [x]);
	}
	void connect(int x,int y)
	{
		x = find(x);
		y = find(y);

		if(x != y){
			par [y] = x;
		}
	}
	bool same(int x,int y)
	{
		return find(x) == find(y);
	}
	private:
		vector<int> par;
};

int main()
{
	scanf("%d%d%d",&N,&M,&S);
	for(int i = 0;i < M;i++){
		int U,V;
		scanf("%d%d",&U,&V);
		edge [U].push_back(V);
		edge [V].push_back(U);
	}

	union_find uf(N);
	for(int i = N;i >= 1;i--){
		for(auto it = edge [i].begin();it != edge [i].end();it++){
			if(*it > i){
				uf.connect(i,*it);
			}
		}
		ans [i] = uf.same(i,S);
	}

	for(int i = 1;i <= N;i++){
		if(ans [i]){
			printf("%d\n",i);
		}
	}

	return 0;
}

Submission Info

Submission Time
Task B - 駐車場
User cmmnd17
Language C++14 (GCC 5.4.1)
Score 100
Code Size 996 Byte
Status AC
Exec Time 189 ms
Memory 18048 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:43:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d",&N,&M,&S);
                          ^
./Main.cpp:46:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&U,&V);
                      ^

Judge Result

Set Name Sample Subtask0 All
Score / Max Score 0 / 0 40 / 40 60 / 60
Status
AC × 3
AC × 13
AC × 20
Set Name Test Cases
Sample sample0.txt, sample1.txt, sample2.txt
Subtask0 subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, sample0.txt, sample1.txt, sample2.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask1_0.txt, subtask1_1.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name Status Exec Time Memory
sample0.txt AC 8 ms 3328 KiB
sample1.txt AC 11 ms 3328 KiB
sample2.txt AC 9 ms 3328 KiB
subtask0_0.txt AC 10 ms 3456 KiB
subtask0_1.txt AC 10 ms 3456 KiB
subtask0_2.txt AC 10 ms 3456 KiB
subtask0_3.txt AC 10 ms 3456 KiB
subtask0_4.txt AC 10 ms 3456 KiB
subtask0_5.txt AC 11 ms 3456 KiB
subtask0_6.txt AC 10 ms 3456 KiB
subtask0_7.txt AC 10 ms 3456 KiB
subtask0_8.txt AC 9 ms 3456 KiB
subtask0_9.txt AC 10 ms 3456 KiB
subtask1_0.txt AC 189 ms 18048 KiB
subtask1_1.txt AC 183 ms 16640 KiB
subtask1_2.txt AC 187 ms 16896 KiB
subtask1_3.txt AC 171 ms 16768 KiB
subtask1_4.txt AC 177 ms 16384 KiB
subtask1_5.txt AC 185 ms 16512 KiB
subtask1_6.txt AC 183 ms 16896 KiB
subtask1_7.txt AC 167 ms 16896 KiB
subtask1_8.txt AC 173 ms 16384 KiB
subtask1_9.txt AC 162 ms 16512 KiB