Submission #204217

---

Source Code Expand

#include "animals.h"
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
 
const int MAX_N = 100000;
 
struct Node
{
	int par;
	vector<int> ch;
	int sz;
};
 
int N;
Node node[MAX_N];
 
vector<int> G[MAX_N];
 
map<int, int> m;
 
int prev;
 
int dfs(int p, int v)
{
	node[v].par = p;
	node[v].sz = 1;
	for (int i = 0; i < G[v].size(); i++)
	{
		if (G[v][i] == p) continue;
		node[v].ch.push_back(G[v][i]);
		node[v].sz += dfs(v, G[v][i]);
	}
	return node[v].sz;
}
 
void init(int n, int E[][2])
{
	N = n;
	for (int i = 0; i < N - 1; i++)
	{
		G[E[i][0]].push_back(E[i][1]);
		G[E[i][1]].push_back(E[i][0]);
	}
 
	int sz = dfs(-1, 0);
	m[sz]++;
 
	prev = N;
}
 
int query(int v)
{
	for (int i = 0; i < node[v].ch.size(); i++)
	{
		int nn = node[v].ch[i];
		node[nn].par = -1;
		m[node[nn].sz]++;
	}
 
	int p = v, sz = node[v].sz;
	while (p != -1)
	{
		if (node[p].par == -1)
		{
			m[node[p].sz]--;
		}
		node[p].sz -= sz;
		if (node[p].par == -1)
		{
			m[node[p].sz]++;
		}
		p = node[p].par;
	}
 
	for (; prev >= 0; prev--)
	{
		if (m[prev] != 0) break;
	}
 
	return prev;
}

Submission Info

Compile Error

./grader.cpp: In function ‘int main()’:
./grader.cpp:15: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result
./grader.cpp:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result
./grader.cpp:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result

Judge Result