oj.uz

Submission #472493

# Submission time Handle Problem Language Result Execution time Memory
472493 2021-09-13T16:20:58 Z yasseenkamel Political Development (BOI17_politicaldevelopment) C++14
0 / 100
 397 ms 708 KB 
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>

using namespace std;

typedef int in;
#define int long long
#define s second
#define f first
const long double EPS=1e-9;
const int MOD=1e9+7;
const int N=1e6;

int n,m;
vector<int> adj[5005];
bool vis[5005];
int ans;

void dfs(int node,int d){
	if(vis[node]){
		if(d == m){
			ans = max(ans,d);
		}
		else if(d == m){
			ans = max(ans,d);
		}
		return;
	}
	if(d >= 3){
		return;
	}
	//cout << node << " " << d << endl;
	vis[node] = 1;
	for(int i = 0 ; i < adj[node].size() ; i ++){
		dfs(adj[node][i],d + 1);
	}
}

in main(){
	cin >> n >> m;
	for(int i = 0 ; i < n ; i ++){
		int x;
		cin >> x;
		while(x --){
			int y;
			cin >> y;
			adj[i].push_back(y);
		}
	}
	for(int i = 0 ; i < n ; i ++){
		memset(vis,0,sizeof vis);
		dfs(i,0);
	}
	cout << ans << endl;
	return 0;
}

Compilation message

politicaldevelopment.cpp: In function 'void dfs(long long int, long long int)':
politicaldevelopment.cpp:36:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |  for(int i = 0 ; i < adj[node].size() ; i ++){
      |                  ~~^~~~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 7 ms 588 KB Output is correct
4 Correct 397 ms 596 KB Output is correct
5 Correct 375 ms 708 KB Output is correct
6 Correct 13 ms 640 KB Output is correct
7 Correct 13 ms 588 KB Output is correct
8 Incorrect 3 ms 332 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 7 ms 588 KB Output is correct
4 Correct 397 ms 596 KB Output is correct
5 Correct 375 ms 708 KB Output is correct
6 Correct 13 ms 640 KB Output is correct
7 Correct 13 ms 588 KB Output is correct
8 Incorrect 3 ms 332 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 7 ms 588 KB Output is correct
4 Correct 397 ms 596 KB Output is correct
5 Correct 375 ms 708 KB Output is correct
6 Correct 13 ms 640 KB Output is correct
7 Correct 13 ms 588 KB Output is correct
8 Incorrect 3 ms 332 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 7 ms 588 KB Output is correct
4 Correct 397 ms 596 KB Output is correct
5 Correct 375 ms 708 KB Output is correct
6 Correct 13 ms 640 KB Output is correct
7 Correct 13 ms 588 KB Output is correct
8 Incorrect 3 ms 332 KB Output isn't correct
9 Halted 0 ms 0 KB -