結果
問題 | No.2481 Shiritori |
ユーザー | lemondo |
提出日時 | 2023-09-22 22:37:01 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,698 bytes |
コンパイル時間 | 2,792 ms |
コンパイル使用メモリ | 292,364 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-08 13:20:53 |
合計ジャッジ時間 | 3,707 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 1 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 1 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 1 ms
5,376 KB |
testcase_10 | AC | 1 ms
5,376 KB |
testcase_11 | AC | 1 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 1 ms
5,376 KB |
testcase_14 | AC | 1 ms
5,376 KB |
testcase_15 | AC | 1 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 1 ms
5,376 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 1 ms
5,376 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 1 ms
5,376 KB |
testcase_22 | AC | 2 ms
5,376 KB |
testcase_23 | AC | 1 ms
5,376 KB |
testcase_24 | AC | 2 ms
5,376 KB |
testcase_25 | AC | 2 ms
5,376 KB |
testcase_26 | AC | 2 ms
5,376 KB |
testcase_27 | AC | 1 ms
5,376 KB |
testcase_28 | AC | 2 ms
5,376 KB |
testcase_29 | AC | 1 ms
5,376 KB |
testcase_30 | AC | 2 ms
5,376 KB |
testcase_31 | AC | 1 ms
5,376 KB |
testcase_32 | AC | 1 ms
5,376 KB |
testcase_33 | AC | 2 ms
5,376 KB |
testcase_34 | AC | 1 ms
5,376 KB |
testcase_35 | AC | 1 ms
5,376 KB |
testcase_36 | AC | 2 ms
5,376 KB |
testcase_37 | AC | 2 ms
5,376 KB |
testcase_38 | AC | 1 ms
5,376 KB |
testcase_39 | AC | 1 ms
5,376 KB |
ソースコード
#pragma region Macros#include <bits/stdc++.h>#include <immintrin.h>#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <cctype>#include <cfenv>#include <cfloat>#include <chrono>#include <cinttypes>#include <climits>#include <cmath>#include <complex>#include <cstdarg>#include <cstddef>#include <cstdint>#include <cstdio>#include <cstdlib>#include <cstring>#include <deque>#include <fstream>#include <functional>#include <initializer_list>#include <iomanip>#include <ios>#include <iostream>#include <istream>#include <iterator>#include <limits>#include <list>#include <map>#include <memory>#include <new>#include <numeric>#include <ostream>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <streambuf>#include <string>#include <tuple>#include <type_traits>#include <typeinfo>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>#define ll long long#define OVERLOAD(e1, e2, e3, e4, NAME, ...) NAME#define _rep1(i, n) for (long long i = 0; i < n; i++)#define _rep2(i, a, b) for (long long i = a; i < b; ++i)#define _rep3(i, a, b, t) \for (long long i = a; i * (t / abs(t)) < b * (t / abs(t)); i += t)#define rep(...) OVERLOAD(__VA_ARGS__, _rep3, _rep2, _rep1, _)(__VA_ARGS__)#define all(x) (x).begin(), (x).end()#define sz(x) (int)x.size()#define fi first#define se second#define pb push_back#define eb emplace_back#define mp make_pair#define pcnt __builtin_popcountll#define SORT(v) sort(all(v))#define UNIQUE(v) \SORT(v); \v.erase(unique(v.begin(), v.end()), v.end());#define COPY(A, B) copy(all(A), B.begin());#define REV(v) reverse(all(v))#define MAX(x) *max_element(all(x))#define MIN(x) *min_element(all(x))#ifdef LOCAL#define dbg(x) \{ \cout << __LINE__ << " : " << #x << " = "; \print(x); \}#define IS_LOCAL true#else#define dbg(x) true#define IS_LOCAL false#endifusing namespace std;template <typename T>using vc = vector<T>;template <typename T>using vvc = vector<vc<T>>;template <typename T>using vvvc = vector<vvc<T>>;template <typename T>bool chmin(T& k, T m) {bool ret = k > m;k = min(k, m);return ret;}template <typename T>bool chmax(T& k, T m) {bool ret = k < m;k = max(k, m);return ret;}template <typename T>inline void print(const vector<T>& v, string s = " ") {for (int i = 0; i < (int)v.size(); i++)cout << v[i] << (i != (int)v.size() - 1 ? s : "");cout << "\n";}template <typename T, typename S>inline void print(const pair<T, S>& p) {cout << p.first << " " << p.second << endl;}template <typename T>inline void print(const T& x) {cout << x << "\n";}template <typename T, typename S>inline void print(const vector<pair<T, S>>& v) {for (auto&& p : v) print(p);}void yes(bool a) { cout << (a ? "yes" : "no") << endl; }void YES(bool a) { cout << (a ? "YES" : "NO") << endl; }void Yes(bool a) { cout << (a ? "Yes" : "No") << endl; }template <typename T>T SUM(vc<T> As) {T ret = 0;for (T a : As) ret += a;return ret;}#pragma endregionconst ll INF = numeric_limits<long long>::max();void solve() {ll N, M;cin >> N >> M;if (M <= 2) {print("First");} else if (N % 2 == 0) {print("Second");} else {print("First");}}int main() {ios::sync_with_stdio(false);cin.tie(0);cout << fixed << setprecision(15);// ll T; cin >> T;// rep(_, T)solve();}