Submission #1865862


Source Code Expand

#include <iostream>
#include <cstdio>
#include <map>
#include <vector>
#define N 200005
#define PII pair<int, int>
using namespace std;

int n, k, l, c, a[N], b[N];
map<PII, int> m;
vector<int> va[N], vb[N];

void f(int p) {
	int i;
	if (a[p]) return;
	a[p] = c;
	for (i = 0; i < va[p].size(); i++) f(va[p][i]);
}

void g(int p) {
	int i;
	if (b[p]) return;
	b[p] = c;
	for (i = 0; i < vb[p].size(); i++) g(vb[p][i]);
}

int main()
{
	int i, t1, t2;
	cin >> n >> k >> l;
	for (i = 0; i < k; i++) {
		scanf("%d %d", &t1, &t2);
		va[t1].push_back(t2), va[t2].push_back(t1);
	}
	for (i = 0; i < l; i++) {
		scanf("%d %d", &t1, &t2);
		vb[t1].push_back(t2), vb[t2].push_back(t1);
	}
	for (i = 1, c = 0; i <= n; i++) if (!a[i]) c++, f(i);
	for (i = 1, c = 0; i <= n; i++)
		if (!b[i])
			c++, g(i);
	for (i = 1; i <= n; i++) m[PII(a[i], b[i])]++;
	for (i = 1; i <= n; i++) {
		if (a[i] == 0 && b[i] == 0) printf("1 ");
		else printf("%d ", m[PII(a[i], b[i])]);
	}
    return 0;
}

Submission Info

Submission Time
Task D - Connectivity
User Abra_Stone
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1022 Byte
Status AC
Exec Time 178 ms
Memory 27904 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:32:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &t1, &t2);
                           ^
./Main.cpp:36:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &t1, &t2);
                           ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 18
Set Name Test Cases
Sample subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.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
subtask0_0.txt AC 5 ms 10496 KB
subtask0_1.txt AC 5 ms 10496 KB
subtask0_2.txt AC 5 ms 10496 KB
subtask1_0.txt AC 42 ms 13056 KB
subtask1_1.txt AC 178 ms 25600 KB
subtask1_10.txt AC 44 ms 13312 KB
subtask1_11.txt AC 162 ms 24064 KB
subtask1_12.txt AC 125 ms 26496 KB
subtask1_13.txt AC 127 ms 27392 KB
subtask1_14.txt AC 145 ms 25344 KB
subtask1_2.txt AC 102 ms 23424 KB
subtask1_3.txt AC 136 ms 27520 KB
subtask1_4.txt AC 153 ms 26368 KB
subtask1_5.txt AC 45 ms 13184 KB
subtask1_6.txt AC 150 ms 23296 KB
subtask1_7.txt AC 130 ms 27520 KB
subtask1_8.txt AC 134 ms 27904 KB
subtask1_9.txt AC 129 ms 22528 KB