Submission #17344874


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_;

int main() {
  int cas;
  cin >> cas;
  while (cas--) {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) cin >> a[i];
    if (n % 2 == 1) {
      cout << "Second" << '\n';
    } else {
      sort(a.begin(), a.end());
      bool found = false;
      for (int i = 0; i < n; i += 2) {
        if (a[i] != a[i + 1]) {
          found = true;
          break;
        }
      }
      cout << (found ? "First" : "Second") << '\n';
    }
  }
  return 0;
}

Submission Info

Submission Time
Task D - Let's Play Nim
User cuiaoxiang
Language C++ (Clang 10.0.0)
Score 600
Code Size 2986 Byte
Status AC
Exec Time 153 ms
Memory 3428 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 600 / 600
Status
AC × 1
AC × 51
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, random_21.txt, random_22.txt, random_23.txt, random_24.txt, random_25.txt, random_26.txt, random_27.txt, random_28.txt, random_29.txt, random_30.txt, random_31.txt, random_32.txt, random_33.txt, random_34.txt, random_35.txt, random_36.txt, random_37.txt, random_38.txt, random_39.txt, random_40.txt, random_41.txt, random_42.txt, random_43.txt, random_44.txt, random_45.txt, random_46.txt, random_47.txt, random_48.txt, random_49.txt, random_50.txt, sample_01.txt
Case Name Status Exec Time Memory
random_01.txt AC 145 ms 3420 KB
random_02.txt AC 153 ms 3428 KB
random_03.txt AC 151 ms 3420 KB
random_04.txt AC 39 ms 3220 KB
random_05.txt AC 79 ms 3088 KB
random_06.txt AC 68 ms 3112 KB
random_07.txt AC 83 ms 3180 KB
random_08.txt AC 93 ms 3148 KB
random_09.txt AC 88 ms 3032 KB
random_10.txt AC 79 ms 3132 KB
random_11.txt AC 77 ms 3020 KB
random_12.txt AC 66 ms 3064 KB
random_13.txt AC 80 ms 3068 KB
random_14.txt AC 104 ms 3236 KB
random_15.txt AC 113 ms 3128 KB
random_16.txt AC 89 ms 3160 KB
random_17.txt AC 92 ms 3024 KB
random_18.txt AC 132 ms 3220 KB
random_19.txt AC 77 ms 2996 KB
random_20.txt AC 86 ms 3260 KB
random_21.txt AC 75 ms 2964 KB
random_22.txt AC 82 ms 3028 KB
random_23.txt AC 83 ms 2904 KB
random_24.txt AC 77 ms 3040 KB
random_25.txt AC 78 ms 3012 KB
random_26.txt AC 82 ms 3064 KB
random_27.txt AC 75 ms 3048 KB
random_28.txt AC 74 ms 3064 KB
random_29.txt AC 75 ms 2996 KB
random_30.txt AC 79 ms 3052 KB
random_31.txt AC 77 ms 3036 KB
random_32.txt AC 78 ms 3004 KB
random_33.txt AC 78 ms 3060 KB
random_34.txt AC 74 ms 2912 KB
random_35.txt AC 80 ms 2920 KB
random_36.txt AC 77 ms 3008 KB
random_37.txt AC 78 ms 2916 KB
random_38.txt AC 80 ms 2912 KB
random_39.txt AC 78 ms 3060 KB
random_40.txt AC 79 ms 2920 KB
random_41.txt AC 85 ms 3136 KB
random_42.txt AC 84 ms 3096 KB
random_43.txt AC 84 ms 3044 KB
random_44.txt AC 82 ms 2904 KB
random_45.txt AC 86 ms 2984 KB
random_46.txt AC 85 ms 2984 KB
random_47.txt AC 82 ms 2988 KB
random_48.txt AC 85 ms 3032 KB
random_49.txt AC 84 ms 2996 KB
random_50.txt AC 81 ms 2888 KB
sample_01.txt AC 2 ms 2892 KB