Submission #18357926


Source Code Expand

#include <bits/stdc++.h>

const int N = 1e2;
int n;
char str[N + 5];
bool e[N + 5][N + 5], vis[N + 5];

int dfs(int u) {
	vis[u] = true;
	int ans = 1;
	for (int i = 1; i <= n; i++) {
		if (e[u][i] && !vis[i]) {
			ans += dfs(i);
		}
	}
	return ans;
}
int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%s", str + 1);
		for (int j = 1; j <= n; j++) {
			e[j][i] = str[j] == '1';
		}
	}
	double ans = 0;
	for (int i = 1; i <= n; i++) {
		std::fill(vis + 1, vis + n + 1, false);
		ans += 1.0 / dfs(i);
	}
	printf("%.10lf\n", ans);
	return 0;
}

Submission Info

Submission Time
Task A - Erasing Vertices
User siyuan
Language C++ (GCC 9.2.1)
Score 400
Code Size 593 Byte
Status AC
Exec Time 12 ms
Memory 3800 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:19:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   19 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
./Main.cpp:21:8: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   21 |   scanf("%s", str + 1);
      |   ~~~~~^~~~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 20
Set Name Test Cases
Sample 00-sample-001.txt, 00-sample-002.txt, 00-sample-003.txt
All 00-sample-001.txt, 00-sample-002.txt, 00-sample-003.txt, 01-001.txt, 01-002.txt, 01-003.txt, 01-004.txt, 01-005.txt, 01-006.txt, 01-007.txt, 01-008.txt, 01-009.txt, 01-010.txt, 01-011.txt, 01-012.txt, 01-013.txt, 01-014.txt, 01-015.txt, 01-016.txt, 01-017.txt
Case Name Status Exec Time Memory
00-sample-001.txt AC 6 ms 3560 KiB
00-sample-002.txt AC 2 ms 3724 KiB
00-sample-003.txt AC 2 ms 3692 KiB
01-001.txt AC 2 ms 3576 KiB
01-002.txt AC 2 ms 3696 KiB
01-003.txt AC 1 ms 3732 KiB
01-004.txt AC 2 ms 3580 KiB
01-005.txt AC 2 ms 3732 KiB
01-006.txt AC 7 ms 3572 KiB
01-007.txt AC 3 ms 3564 KiB
01-008.txt AC 3 ms 3736 KiB
01-009.txt AC 2 ms 3608 KiB
01-010.txt AC 12 ms 3608 KiB
01-011.txt AC 5 ms 3696 KiB
01-012.txt AC 2 ms 3800 KiB
01-013.txt AC 2 ms 3692 KiB
01-014.txt AC 9 ms 3768 KiB
01-015.txt AC 4 ms 3728 KiB
01-016.txt AC 3 ms 3756 KiB
01-017.txt AC 2 ms 3768 KiB