Submission #39428100


Source Code Expand

Copy
// URL
#include <iostream>
#include <vector>
using namespace std;
#define loop(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
#define sz size
typedef long long LL;
const char NL = '\n';
const char SP = ' ';
const char HB[] = "HOBA";
const LL LLINF = 9e18;
const int IINF = 1e9;
vector <vector <int> > g;
bitset <200005> vis;
pair <int, int> dfs(int cur) {
vis[cur] = true;
int e = 0, v = 0;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
// URL
#include <iostream>
#include <vector>
using namespace std;

#define loop(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
#define sz size
typedef long long LL;
const char NL = '\n';
const char SP = ' ';
const char HB[] = "HOBA";
const LL LLINF = 9e18;
const int IINF = 1e9;

vector <vector <int> > g;
bitset <200005> vis;

pair <int, int> dfs(int cur) {
  vis[cur] = true;
  int e = 0, v = 0;
  for (int next : g[cur]) {
    if (!vis[next]) {
      auto x = dfs(next);
      e += x.first;
      v += x.second;
    }
  }
  e += g[cur].sz();
  v++;
  return {e, v};
}

int main() {
  ios_base::sync_with_stdio(false);
  int n, m; cin >> n >> m;
  g.resize(n);
  vis.reset();
  loop (j, 0, m) {
    int a, b; cin >> a >> b;
    a--, b--;
    g[a].pb(b);
    g[b].pb(a);
  }
  loop (i, 0, n) {
    if (!vis[i]) {
      auto cur = dfs(i);
      // cerr << cur.first << SP << cur.second << NL;
      if (cur.first != cur.second * 2) {
        cout << "No\n";
        exit(0);
      }
    }
  }
  cout << "Yes\n";
  return 0;
}
/*
SAMPLE
*/

Submission Info

Submission Time
Task D - Unicyclic Components
User kanapinan
Language C++ (Clang 10.0.0)
Score 400
Code Size 1108 Byte
Status AC
Exec Time 335 ms
Memory 22996 KB

Compile Error

./Main.cpp:10:12: warning: unused variable 'NL' [-Wunused-const-variable]
const char NL = '\n';
           ^
./Main.cpp:11:12: warning: unused variable 'SP' [-Wunused-const-variable]
const char SP = ' ';
           ^
./Main.cpp:12:12: warning: unused variable 'HB' [-Wunused-const-variable]
const char HB[] = "HOBA";
           ^
./Main.cpp:13:10: warning: unused variable 'LLINF' [-Wunused-const-variable]
const LL LLINF = 9e18;
         ^
./Main.cpp:14:11: warning: unused variable 'IINF' [-Wunused-const-variable]
const int IINF = 1e9;
          ^
5 warnings generated.

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 61
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 02_one_00.txt, 02_one_01.txt, 02_one_02.txt, 02_one_03.txt, 02_one_04.txt, 02_one_05.txt, 02_one_06.txt, 02_one_07.txt, 02_one_08.txt, 02_one_09.txt, 02_one_10.txt, 02_one_11.txt, 02_one_12.txt, 02_one_13.txt, 03_two_00.txt, 03_two_01.txt, 03_two_02.txt, 03_two_03.txt, 03_two_04.txt, 03_two_05.txt, 03_two_06.txt, 03_two_07.txt, 03_two_08.txt, 03_two_09.txt, 03_two_10.txt, 03_two_11.txt, 04_many_00.txt, 04_many_01.txt, 04_many_02.txt, 04_many_03.txt, 04_many_04.txt, 04_many_05.txt, 04_many_06.txt, 04_many_07.txt, 04_many_08.txt, 04_many_09.txt, 04_many_10.txt, 04_many_11.txt, 05_hand_00.txt, 05_hand_01.txt, 99_hack_00.txt, 99_hack_01.txt, 99_hack_02.txt, 99_hack_03.txt, 99_hack_04.txt, 99_hack_05.txt, 99_hack_06.txt, 99_hack_07.txt, 99_hack_08.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 10 ms 3008 KB
00_sample_01.txt AC 2 ms 3040 KB
00_sample_02.txt AC 3 ms 2832 KB
01_rnd_00.txt AC 2 ms 3020 KB
01_rnd_01.txt AC 2 ms 2960 KB
01_rnd_02.txt AC 125 ms 4788 KB
01_rnd_03.txt AC 2 ms 2972 KB
01_rnd_04.txt AC 3 ms 2972 KB
01_rnd_05.txt AC 161 ms 5288 KB
01_rnd_06.txt AC 7 ms 7444 KB
01_rnd_07.txt AC 11 ms 7448 KB
01_rnd_08.txt AC 290 ms 15452 KB
02_one_00.txt AC 2 ms 3012 KB
02_one_01.txt AC 2 ms 3008 KB
02_one_02.txt AC 2 ms 3016 KB
02_one_03.txt AC 3 ms 2956 KB
02_one_04.txt AC 2 ms 2964 KB
02_one_05.txt AC 2 ms 3016 KB
02_one_06.txt AC 2 ms 2960 KB
02_one_07.txt AC 227 ms 12352 KB
02_one_08.txt AC 228 ms 12404 KB
02_one_09.txt AC 226 ms 12272 KB
02_one_10.txt AC 224 ms 12320 KB
02_one_11.txt AC 224 ms 12352 KB
02_one_12.txt AC 228 ms 12392 KB
02_one_13.txt AC 230 ms 12288 KB
03_two_00.txt AC 225 ms 12332 KB
03_two_01.txt AC 230 ms 12232 KB
03_two_02.txt AC 225 ms 12452 KB
03_two_03.txt AC 227 ms 12384 KB
03_two_04.txt AC 227 ms 12440 KB
03_two_05.txt AC 228 ms 12252 KB
03_two_06.txt AC 228 ms 12316 KB
03_two_07.txt AC 335 ms 12364 KB
03_two_08.txt AC 229 ms 12256 KB
03_two_09.txt AC 229 ms 12404 KB
03_two_10.txt AC 229 ms 12336 KB
03_two_11.txt AC 234 ms 12432 KB
04_many_00.txt AC 156 ms 9664 KB
04_many_01.txt AC 152 ms 9660 KB
04_many_02.txt AC 152 ms 9620 KB
04_many_03.txt AC 150 ms 9716 KB
04_many_04.txt AC 221 ms 12200 KB
04_many_05.txt AC 220 ms 12096 KB
04_many_06.txt AC 221 ms 12136 KB
04_many_07.txt AC 222 ms 12000 KB
04_many_08.txt AC 206 ms 11792 KB
04_many_09.txt AC 211 ms 11940 KB
04_many_10.txt AC 205 ms 11876 KB
04_many_11.txt AC 202 ms 11856 KB
05_hand_00.txt AC 2 ms 3004 KB
05_hand_01.txt AC 215 ms 22996 KB
99_hack_00.txt AC 2 ms 3008 KB
99_hack_01.txt AC 2 ms 2892 KB
99_hack_02.txt AC 2 ms 3016 KB
99_hack_03.txt AC 2 ms 3020 KB
99_hack_04.txt AC 2 ms 2904 KB
99_hack_05.txt AC 3 ms 3092 KB
99_hack_06.txt AC 1 ms 2960 KB
99_hack_07.txt AC 2 ms 2964 KB
99_hack_08.txt AC 2 ms 3016 KB


2025-03-24 (Mon)
03:32:24 +00:00