Submission #472487

#TimeUsernameProblemLanguageResultExecution timeMemory
472487yasseenkamelPolitical Development (BOI17_politicaldevelopment)C++14
0 / 100
5 ms588 KiB
#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 = 1; void dfs(int node,int d){ if(d > 2){ return; } if(vis[node]){ if(d == 3){ ans = max(ans,d); } else if(d == 2){ ans = max(ans,d); } return; } 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[x].push_back(y); } } cout << min(m,min((int)2,n)) << endl; return 0; for(int i = 0 ; i < n ; i ++){ memset(vis,0,sizeof vis); dfs(i,0); } cout << ans << endl; return 0; }

Compilation message (stderr)

politicaldevelopment.cpp: In function 'void dfs(long long int, long long int)':
politicaldevelopment.cpp:35: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]
   35 |  for(int i = 0 ; i < adj[node].size() ; i ++){
      |                  ~~^~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...