Submission #647870

#TimeUsernameProblemLanguageResultExecution timeMemory
647870mychecksedadPolitical Development (BOI17_politicaldevelopment)C++17
0 / 100
14 ms24148 KiB
/* Author : Mychecksdead */ #include<bits/stdc++.h> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; using namespace std; typedef long long int ll; typedef long double ld; #define MOD (1000000000+7) #define MOD1 (998244353) #define PI 3.1415926535 #define pb push_back #define setp() cout << setprecision(15) #define all(x) x.begin(), x.end() #define oset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> #define debug(x) cerr << #x << " is " << x << '\n'; const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20; int n, k; vector<int> g[N], path; vector<bool> vis(N); void dfs(int v, int p){ vis[v] = 1; path.pb(v); for(int u: g[v]){ if(u != p){ if(vis[u]){ if(path[path.size() - 3] == u){ cout << 3; exit(0); } }else{ dfs(u, v); } } } path.pop_back(); } void solve(){ cin >> n >> k; for(int i = 0; i < n; ++i){ int d; cin >> d; for(int j = 0; j < d; ++j){ int x; cin >> x; g[i].pb(x); } } if(k == 2){ for(int i = 0; i < n; ++i){ if(g[i].size()){ cout << 2; return; } } cout << 1; } if(k == 3){ for(int i = 0; i < n; ++i) dfs(i, i); for(int i = 0; i < n; ++i){ if(g[i].size()){ cout << 2; return; } } cout << 1; } } int main(){ cin.tie(0); ios::sync_with_stdio(0); int T = 1, aa; // cin >> T;aa=T; while(T--){ // cout << "Case #" << aa-T << ": "; solve(); cout << '\n'; } return 0; }

Compilation message (stderr)

politicaldevelopment.cpp: In function 'int main()':
politicaldevelopment.cpp:75:16: warning: unused variable 'aa' [-Wunused-variable]
   75 |     int T = 1, aa;
      |                ^~
#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...