Submission #16490


Source Code Expand

#include"animals.h"
#include<vector>

#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

int n;
vector<int> G[1000];

void init(int n,int E[][2]){
	::n=n;
	rep(i,n-1){
		int u=E[i][0],v=E[i][1];
		::G[u].push_back(v);
		::G[v].push_back(u);
	}
}

bool vis[1000];
int dfs(int u,int pre){
	vis[u]=true;

	int res=1;
	rep(i,G[u].size()){
		int v=G[u][i];
		if(v!=pre) res+=dfs(v,u);
	}
	return res;
}

int query(int v0){
	G[v0].clear();
	rep(u,n) rep(i,G[u].size()) {
		int v=G[u][i];
		if(v==v0){
			G[u].erase(G[u].begin()+i);
			break;
		}
	}

	rep(u,n) vis[u]=false;
	int res=0;
	rep(u,n) if(!vis[u]) res=max(res,dfs(u,-1));
	return res;
}

Submission Info

Submission Time
Task A - むこのどうぶつたち と しんりんのはかい (Innocent Animals and Destruction of Forests)
User fura2
Language IOI-Style C++ (GCC 5.4.1)
Score 20
Code Size 699 Byte
Status RE
Exec Time 298 ms
Memory 1824 KB

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

Set Name Subtask1 Subtask2 Subtask3
Score / Max Score 20 / 20 0 / 25 0 / 55
Status
AC × 19
AC × 4
RE × 7
AC × 5
RE × 11
Set Name Test Cases
Subtask1 subtask1/1, subtask1/10, subtask1/11, subtask1/12, subtask1/13, subtask1/14, subtask1/15, subtask1/16, subtask1/17, subtask1/18, subtask1/19, subtask1/2, subtask1/3, subtask1/4, subtask1/5, subtask1/6, subtask1/7, subtask1/8, subtask1/9
Subtask2 subtask2/1, subtask2/10, subtask2/11, subtask2/2, subtask2/3, subtask2/4, subtask2/5, subtask2/6, subtask2/7, subtask2/8, subtask2/9
Subtask3 subtask3/1, subtask3/10, subtask3/11, subtask3/12, subtask3/13, subtask3/14, subtask3/15, subtask3/16, subtask3/2, subtask3/3, subtask3/4, subtask3/5, subtask3/6, subtask3/7, subtask3/8, subtask3/9
Case Name Status Exec Time Memory
subtask1/1 AC 23 ms 988 KB
subtask1/10 AC 49 ms 1108 KB
subtask1/11 AC 51 ms 1124 KB
subtask1/12 AC 51 ms 1000 KB
subtask1/13 AC 48 ms 996 KB
subtask1/14 AC 54 ms 1004 KB
subtask1/15 AC 58 ms 1016 KB
subtask1/16 AC 55 ms 1072 KB
subtask1/17 AC 57 ms 1112 KB
subtask1/18 AC 56 ms 1088 KB
subtask1/19 AC 46 ms 1124 KB
subtask1/2 AC 23 ms 980 KB
subtask1/3 AC 24 ms 1048 KB
subtask1/4 AC 24 ms 1024 KB
subtask1/5 AC 24 ms 936 KB
subtask1/6 AC 23 ms 996 KB
subtask1/7 AC 25 ms 992 KB
subtask1/8 AC 25 ms 940 KB
subtask1/9 AC 35 ms 1068 KB
subtask2/1 AC 23 ms 1100 KB
subtask2/10 RE 298 ms 1768 KB
subtask2/11 RE 199 ms 1700 KB
subtask2/2 AC 24 ms 1004 KB
subtask2/3 AC 24 ms 940 KB
subtask2/4 AC 49 ms 992 KB
subtask2/5 RE 143 ms 1048 KB
subtask2/6 RE 168 ms 1376 KB
subtask2/7 RE 195 ms 1708 KB
subtask2/8 RE 194 ms 1712 KB
subtask2/9 RE 192 ms 1728 KB
subtask3/1 AC 49 ms 1020 KB
subtask3/10 RE 196 ms 1700 KB
subtask3/11 RE 196 ms 1696 KB
subtask3/12 RE 198 ms 1704 KB
subtask3/13 RE 198 ms 1824 KB
subtask3/14 RE 196 ms 1704 KB
subtask3/15 RE 198 ms 1704 KB
subtask3/16 RE 195 ms 1712 KB
subtask3/2 AC 53 ms 1000 KB
subtask3/3 AC 58 ms 1024 KB
subtask3/4 AC 42 ms 1004 KB
subtask3/5 AC 46 ms 1000 KB
subtask3/6 RE 198 ms 1684 KB
subtask3/7 RE 200 ms 1744 KB
subtask3/8 RE 198 ms 1704 KB
subtask3/9 RE 196 ms 1704 KB