제출 #41139

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
41139		ssnsarang2023	Bosses (BOI16_bosses)	C++14	컴파일 에러	0 ms	0 KiB

bosses

#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define SZ(x) ((int)x.size())

const int N = 5e3+5;
int n, sz[N], total;
bool vis[N];
vector<int> g[N], g2[N];

void dfs(int u) {
	sz[u] = 1;
	for (int i = 0; i < SZ(g2[u]); ++i) {
		int v = g2[u][i];
		dfs(v, total);
		sz[u] += sz[v];
	}
	total += sz[u];
}

int make_tree(int root) {
	for (int i = 1; i <= n; ++i) vis[i] = false, g2[i].clear();
	queue<int> q;
	q.push(root);
	vis[root] = 1;
	int cnt = 1;
	while (SZ(q)) {
		int u = q.front(); q.pop();
		for (int i = 0; i < SZ(g[u]); ++i) {
			int v = g[u][i];
			if (vis[v]) continue;
			++cnt, vis[v] = true;
			q.push(v);
			g2[u].push_back(v);
		}
	}
	if (cnt < n) return (int)1e9+7;
	total = 0;
	dfs(root);
	return total;
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i) {
		int m; scanf("%d", &m);
		for (int j = 1, v; j <= m; ++j) {
			scanf("%d", &v);
			g[v].push_back(i);
		}
	}
	int res = (int)1e9+7;
	for (int i = 1; i <= n; ++i)
		res = min(res, make_tree(i));
	printf("%d", res);
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

bosses.cpp: In function 'void dfs(int)':
bosses.cpp:21:15: error: too many arguments to function 'void dfs(int)'
   dfs(v, total);
               ^
bosses.cpp:17:6: note: declared here
 void dfs(int u) {
      ^
bosses.cpp: In function 'int main()':
bosses.cpp:50:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
bosses.cpp:52:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int m; scanf("%d", &m);
                         ^
bosses.cpp:54:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &v);
                   ^