fork download
  1. #include<bits/stdc++.h>
  2.  
  3. #define ll long long
  4. #define pp push_back
  5. #define endl '\n'
  6. #define all(x) x.begin(),x.end()
  7. #define ld long double
  8. #define PI acos(-1)
  9. #define ones(x) __builtin_popcountll(x)
  10. //#define int ll
  11.  
  12. using namespace std;
  13.  
  14. void Drakon() {
  15. ios_base::sync_with_stdio(false);
  16. cin.tie(nullptr);
  17. cout.tie(nullptr);
  18. #ifdef Clion
  19. freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  20. #endif
  21. }
  22.  
  23. unsigned long long inf = 1e10;
  24. const double EPS = 1e-6;
  25. const int MOD = 1000000007, N = 1e5 + 5, LOG = 25;
  26.  
  27. ll mul(const ll &a, const ll &b) {
  28. return (a % MOD + MOD) * (b % MOD + MOD) % MOD;
  29. }
  30.  
  31. ll add(const ll &a, const ll &b) {
  32. return (a + b + 2 * MOD) % MOD;
  33. }
  34.  
  35. ll pw(ll x, ll y) {
  36. ll ret = 1;
  37. while (y > 0) {
  38. if (y % 2 == 0) {
  39. x = mul(x, x);
  40. y = y / 2;
  41. } else {
  42. ret = mul(ret, x);
  43. y = y - 1;
  44. }
  45. }
  46. return ret;
  47. }
  48.  
  49. vector<int> adj[N];
  50. bool vis[N];
  51. int cnt;
  52.  
  53. void dfs(int u) {
  54. vis[u] = true;
  55. for(auto v : adj[u]) if(!vis[v]) dfs(v);
  56. }
  57.  
  58. void solve() {
  59. int n, m, k;
  60. cin >> n >> m >> k;
  61. for (int i = 0; i < m; ++i) {
  62. int u, v;
  63. cin >> u >> v;
  64. u--, v--;
  65. adj[u].push_back(v);
  66. adj[v].push_back(u);
  67. }
  68. for (int i = 0; i < n; ++i) {
  69. if(vis[i]) continue;
  70. dfs(i);
  71. cnt ++;
  72. }
  73. if(cnt >= k) cout << "YES";
  74. else cout << "NO";
  75. }
  76.  
  77. signed main() {
  78. Drakon();
  79. int t = 1;
  80. //cin >> t;
  81. while (t--) {
  82. solve();
  83. }
  84. }
Success #stdin #stdout 0.01s 6056KB
stdin
Standard input is empty
stdout
NO