結果
問題 | No.486 3 Straight Win(3連勝) |
ユーザー |
![]() |
提出日時 | 2021-05-08 13:43:24 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,520 bytes |
コンパイル時間 | 3,497 ms |
コンパイル使用メモリ | 182,560 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-16 17:56:47 |
合計ジャッジ時間 | 4,635 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 28 |
ソースコード
#pragma region#define _USE_MATH_DEFINES#include <iostream>#include <string>#include <algorithm>#include <cmath>#include <cstdlib>#include <vector>#include <map>#include <queue>#include <stack>#include <set>#include <list>#include <iomanip>#include <cstdint>#include <bitset>#include <sstream>#include <regex>#include <fstream>#include <array>#include <atcoder/all>using namespace atcoder;using mint = modint1000000007;//using mint = modint998244353;//using mint = modint;using namespace std;typedef long long ll;using vi = vector<int>;using vvi = vector<vi>;using vl = vector<ll>;using vvl = vector<vl>;using pint = pair<int, int>;using pll = pair<ll, ll>;using vpint = vector<pint>;using vvpint = vector<vpint>;using vmint = vector<mint>;using vvmint = vector<vmint>;//#define rep(i, s, e) for (int(i) = (s); (i) < (e); ++(i))#define rep(i, e) for (int(i) = 0; (i) < (e); ++(i))#define rrep(i, s) for (int(i) = (s) - 1; (i) >= 0; --(i))#define all(x) x.begin(),x.end()#define rall(x) x.rbegin(),x.rend()#pragma region GCDll gcd(ll a, ll b){if (b == 0)return a;return gcd(b, a % b);}#pragma endregion#pragma region LCMll lcm(ll a, ll b){return a / gcd(a, b) * b;}#pragma endregion#pragma region chmintemplate<class T> inline bool chmin(T& a, T b){if (a > b){a = b;return true;}return false;}#pragma endregion#pragma region chmaxtemplate<class T> inline bool chmax(T& a, T b){if (a < b){a = b;return true;}return false;}#pragma endregion#pragma region グリッド内チェックbool out(int x, int y, int h, int w){if (x < 0 || h <= x || y < 0 || w <= y)return true;else return false;}#pragma endregion#pragma region Dijkstravl dijkstra(vector<vector<pair<int, ll>>> v, int s){ll INF = 1e18;int MAX = 1e6;vl res(MAX, INF);priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> q;q.push({ 0,s });while (!q.empty()){int now;ll d;tie(d, now) = q.top();q.pop();if (!chmin(res[now], d))continue;for (auto p : v[now]){int next;ll c;tie(next, c) = p;if (res[next] <= res[now] + c)continue;q.push({ res[now] + c,next });}}return res;}#pragma endregion#pragma endregionint main(){string s; cin >> s;int n = s.size();rep(i, n - 2){if (s.substr(i, 3) == "OOO"){cout << "East" << endl;return 0;}else if (s.substr(i, 3) == "XXX"){cout << "West" << endl;return 0;}}cout << "NA" << endl;}