Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 2 KBi |
#2 |
Correcto
|
0.005 s | 2 KBi |
#3 |
Correcto
|
0.007 s | 2 KBi |
#4 |
Correcto
|
0.007 s | 2 KBi |
#5 |
Correcto
|
0.007 s | 2 KBi |
#6 |
Correcto
|
0.005 s | 2 KBi |
#7 |
Correcto
|
0.007 s | 1 KBi |
#8 |
Correcto
|
0.007 s | 2 KBi |
#9 |
Correcto
|
0.007 s | 1 KBi |
#10 |
Correcto
|
0.008 s | 2 KBi |
#11 |
Correcto
|
0.007 s | 2 KBi |
#12 |
Correcto
|
0.007 s | 1 KBi |
#13 |
Correcto
|
0.006 s | 2 KBi |
#14 |
Correcto
|
0.006 s | 2 KBi |
#15 |
Correcto
|
0.007 s | 1 KBi |
#16 |
Correcto
|
0.007 s | 2 KBi |
#17 |
Correcto
|
0.009 s | 2 KBi |
#18 |
Correcto
|
0.007 s | 2 KBi |
#19 |
Correcto
|
0.008 s | 1 KBi |
#20 |
Correcto
|
0.007 s | 2 KBi |
#21 |
Correcto
|
0.008 s | 2 KBi |
#22 |
Correcto
|
0.008 s | 1 KBi |
#23 |
Correcto
|
0.008 s | 2 KBi |
#24 |
Correcto
|
0.008 s | 2 KBi |
#25 |
Correcto
|
0.008 s | 2 KBi |
#26 |
Correcto
|
0.007 s | 2 KBi |
#27 |
Correcto
|
0.036 s | 2 KBi |
#28 |
Correcto
|
0.006 s | 2 KBi |
#29 |
Correcto
|
0.031 s | 2 KBi |
#30 |
Correcto
|
0.006 s | 2 KBi |
#31 |
Correcto
|
0.012 s | 1 KBi |
#32 |
Correcto
|
0.029 s | 2 KBi |
#33 |
Correcto
|
0.019 s | 3 KBi |
#34 |
Correcto
|
0.014 s | 2 KBi |
#35 |
Correcto
|
0.042 s | 3 KBi |
#include <bits/stdc++.h> #define ii pair<int,int> #define F first #define S second #define pb push_back #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() #define fore(i, a, b) for(int i = a; i < b; i += 1) #define forr(i, a) for(int i = a; i >= 0; i--) #define sz(s) int(s.size()) #define cls(a,car) memset(a,car,sizeof (a)) #define db(x) cout << #x << " is " << x << '\n' #define angle(x) double(x * acos(-1) / 180.0) using namespace std; void debug(){cout << endl;} template<typename T, typename... Args> void debug(T a, Args... args){cout << a << " "; debug(args...);} typedef long long ll; typedef vector<int> vi; typedef vector<ii> vii; const int N = 1e4 + 10; const ll mod = 1e9 + 7; const double E = 1e-7; vi G[N]; int vis[N]; bool flag; void dfs(int u){ vis[u] = 1; for(auto v : G[u]){ if(vis[v] == -1){ dfs(v); } else{ if(vis[v] == 1) flag = 1; } } vis[u] = 2; } void solve(){ int n, m, u, v; cin >> n >> m; while(m--){ cin >> u >> v; G[u].pb(v); } cls(vis, -1); for(int i = 0; i < n; i++) if(vis[i] == -1){ dfs(i); } cout << (flag ? "Yes" : "No") << '\n'; } int main(){ #ifdef LOCAL freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #else ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #endif int t = 1; //cin >> t; for(int i = 1; i <= t; i++){ solve(); } #ifdef LOCAL cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; #endif return 0; }