Submission #17352052


Source Code Expand

Copy
#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int64 C2(int64 n) {
  return n * (n - 1) / 2;
}

const int N = 1e5 + 10;
int f[N], c[N];
int find(int x) {
  if (f[x] != f[f[x]]) f[x] = find(f[x]);
  return f[x];
}

int main() {
  // for (int n = 3; n <= 100; n += 2) {
  //   vector<int> cur;
  //   for (int L = 1; L < n; ++L) {
  //     cur.push_back((C2(L) + C2(n - L)) % 2);
  //   }
  //   trace(n, cur);
  // }

  int cas;
  cin >> cas;
  while (cas--) {
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; ++i) f[i] = i, c[i] = 1;
    for (int i = 0; i < m; ++i) {
      int x, y;
      cin >> x >> y;
      --x; --y;
      int rx = find(x), ry = find(y);
      if (rx != ry) {
        f[ry] = rx;
        c[rx] += c[ry];
      }
    }
    int t = (C2(1) + C2(n - 1) + m) % 2;
    if (n % 2 == 1) {
      cout << (t == 1 ? "First" : "Second") << '\n';
      continue;
    }

    vector<int> cnt(2);
    for (int i = 0; i < n; ++i) {
      if (find(i) == i) cnt[c[i] % 2]++;
    }
    int rem = n - 2 - m;
    if (t == 1) {
      if (!(cnt[1] == 2 && c[find(0)] % 2 == 1 && c[find(n - 1)] % 2 == 1) && rem / 2 >= cnt[1] / 2) {
        cout << "Second" << '\n';
      } else {
        cout << "First" << '\n';
      }
    } else {
      if (!(cnt[1] == 2 && c[find(0)] % 2 == 1 && c[find(n - 1)] % 2 == 1) && (rem  + 1) / 2 >= cnt[1] / 2) {
        cout << "First" << '\n';
      } else {
        cout << "Second" << '\n';
      }
    }
  }
  return 0;
}

Submission Info

Submission Time
Task E - Keep Graph Disconnected
User cuiaoxiang
Language C++ (Clang 10.0.0)
Score 0
Code Size 3966 Byte
Status WA
Exec Time 153 ms
Memory 3888 KB

Compile Error

./Main.cpp:78:11: warning: unused variable 'INF' [-Wunused-const-variable]
const int INF = 1 << 29;
          ^
./Main.cpp:79:11: warning: unused variable 'MOD' [-Wunused-const-variable]
const int MOD = 1e9 + 7;
          ^
2 warnings generated.

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 1
AC × 13
WA × 8
Set Name Test Cases
Sample sample_01.txt
All random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, random_17.txt, random_18.txt, random_19.txt, random_20.txt, sample_01.txt
Case Name Status Exec Time Memory
random_01.txt AC 15 ms 2876 KB
random_02.txt WA 52 ms 3020 KB
random_03.txt WA 88 ms 2908 KB
random_04.txt WA 91 ms 2968 KB
random_05.txt WA 122 ms 3052 KB
random_06.txt AC 119 ms 3208 KB
random_07.txt WA 96 ms 3024 KB
random_08.txt WA 137 ms 3176 KB
random_09.txt WA 153 ms 3340 KB
random_10.txt AC 152 ms 3300 KB
random_11.txt AC 109 ms 3828 KB
random_12.txt AC 105 ms 3768 KB
random_13.txt AC 107 ms 3820 KB
random_14.txt WA 105 ms 3820 KB
random_15.txt AC 108 ms 3768 KB
random_16.txt AC 108 ms 3888 KB
random_17.txt AC 106 ms 3816 KB
random_18.txt AC 107 ms 3796 KB
random_19.txt AC 5 ms 3804 KB
random_20.txt AC 86 ms 2960 KB
sample_01.txt AC 2 ms 3020 KB