oj.uz

Submission #72640

# Submission time Handle Problem Language Result Execution time Memory
72640 2018-08-26T13:01:55 Z bnahmad15 Mousetrap (CEOI17_mousetrap) C++17
20 / 100
 1528 ms 102320 KB 
#include <bits/stdc++.h>
#define forn(i,j,n) for(int i = (int)j;i<=(int)n;i++)
#define nfor(i,j,n) for(int i = (int)j;i>=(int)n;i--)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N = 2000001,LOG = 17;
 
int n,t,m,dep[N],d[N],src;
vector<pair<int,pii> > g[N];
 
int dfs1(int u,int prnt,int depth){
	dep[u] = depth;
	d[u] = depth;
	int ret = 0;
	forn(i,0,g[u].size() - 1){
		int v = g[u][i].second.second;
		if(v == prnt)
			continue;
		int tmp = dfs1(v,u,depth+1);
		ret = max(ret,tmp);
		dep[u] = max(dep[u],dep[v]);
		g[u][i].first = tmp;
		g[u][i].second.first = -dep[v];
	}
	if(u == t)
		return 1;
	return ret;
}
void dfs(int node,int prnt,int &one,int &two,int in){
	if(node == t)
		return;
	int id = 0;
	while(one <= two && id < g[node].size() && g[node][id].first != 1){
		if(g[node][id].second.second != prnt && g[node][id].first != -1)
			one++;
		g[node][id].first = -1;
		id++;
	}
	if(in == 1)
		src = node;
	id = 0;
	while(id < g[node].size() && g[node][id].first != 1){
		if(g[node][id].second.second != prnt && g[node][id].first != -1){
			++two;
			dfs(g[node][id].second.second,node,one,two,2);
		}
		id++;
	}
	if(in != 1){
		++one;
		++two;
		return;
	}
	while(id < g[node].size()){
		if(g[node][id].second.second != prnt && g[node][id].first == 1){
			++two;
			dfs(g[node][id].second.second,node,one,two,1);
		}
		id++;
	}
}
int main(){
 
	scanf("%d%d%d",&n,&t,&m);
	forn(i,1,n-1){
		int u,v;
		scanf("%d%d",&u,&v);
		g[u].push_back(make_pair(0,make_pair(0,v)));
		g[v].push_back(make_pair(0,make_pair(0,u)));
	}
	dfs1(m,0,0);
	forn(i,1,n){
		sort(g[i].begin(),g[i].end());
	}
	int one = 0,two = 0;
	dfs(m,0,one,two,1);
	cout<<one;
	return 0;
}

Compilation message

mousetrap.cpp: In function 'void dfs(int, int, int&, int&, int)':
mousetrap.cpp:34:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(one <= two && id < g[node].size() && g[node][id].first != 1){
                      ~~~^~~~~~~~~~~~~~~~
mousetrap.cpp:43:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(id < g[node].size() && g[node][id].first != 1){
        ~~~^~~~~~~~~~~~~~~~
mousetrap.cpp:55:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(id < g[node].size()){
        ~~~^~~~~~~~~~~~~~~~
mousetrap.cpp: In function 'int main()':
mousetrap.cpp:65:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d",&n,&t,&m);
  ~~~~~^~~~~~~~~~~~~~~~~~~
mousetrap.cpp:68:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&u,&v);
   ~~~~~^~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 47352 KB Output is correct
2 Correct 46 ms 47352 KB Output is correct
3 Correct 42 ms 47352 KB Output is correct
4 Correct 51 ms 47392 KB Output is correct
5 Correct 52 ms 47492 KB Output is correct
6 Correct 47 ms 47568 KB Output is correct
7 Correct 55 ms 47568 KB Output is correct
8 Correct 44 ms 47568 KB Output is correct
9 Correct 43 ms 47568 KB Output is correct
10 Correct 47 ms 47584 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 590 ms 102320 KB Output is correct
2 Correct 606 ms 102320 KB Output is correct
3 Incorrect 1528 ms 102320 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 47352 KB Output is correct
2 Correct 46 ms 47352 KB Output is correct
3 Correct 42 ms 47352 KB Output is correct
4 Correct 51 ms 47392 KB Output is correct
5 Correct 52 ms 47492 KB Output is correct
6 Correct 47 ms 47568 KB Output is correct
7 Correct 55 ms 47568 KB Output is correct
8 Correct 44 ms 47568 KB Output is correct
9 Correct 43 ms 47568 KB Output is correct
10 Correct 47 ms 47584 KB Output is correct
11 Incorrect 50 ms 102320 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 47352 KB Output is correct
2 Correct 46 ms 47352 KB Output is correct
3 Correct 42 ms 47352 KB Output is correct
4 Correct 51 ms 47392 KB Output is correct
5 Correct 52 ms 47492 KB Output is correct
6 Correct 47 ms 47568 KB Output is correct
7 Correct 55 ms 47568 KB Output is correct
8 Correct 44 ms 47568 KB Output is correct
9 Correct 43 ms 47568 KB Output is correct
10 Correct 47 ms 47584 KB Output is correct
11 Correct 590 ms 102320 KB Output is correct
12 Correct 606 ms 102320 KB Output is correct
13 Incorrect 1528 ms 102320 KB Output isn't correct
14 Halted 0 ms 0 KB -