結果
問題 | No.1613 Rush and Remove |
ユーザー |
|
提出日時 | 2023-04-16 13:10:47 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,669 bytes |
コンパイル時間 | 3,055 ms |
コンパイル使用メモリ | 385,120 KB |
最終ジャッジ日時 | 2025-02-12 09:10:01 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 36 |
ソースコード
#pragma GCC optimize("O3")#pragma GCC optimize(2)#pragma GCC optimize(3)#pragma GCC optimize("Ofast")#pragma GCC optimize("inline")#pragma GCC optimize("-fgcse")#pragma GCC optimize("-fgcse-lm")#pragma GCC optimize("-fipa-sra")#pragma GCC optimize("-ftree-pre")#pragma GCC optimize("-ftree-vrp")#pragma GCC optimize("-fpeephole2")#pragma GCC optimize("-ffast-math")#pragma GCC optimize("-fsched-spec")#pragma GCC optimize("unroll-loops")#pragma GCC optimize("-falign-jumps")#pragma GCC optimize("-falign-loops")#pragma GCC optimize("-falign-labels")#pragma GCC optimize("-fdevirtualize")#pragma GCC optimize("-fcaller-saves")#pragma GCC optimize("-fcrossjumping")#pragma GCC optimize("-fthread-jumps")#pragma GCC optimize("-funroll-loops")#pragma GCC optimize("-freorder-blocks")#pragma GCC optimize("-fschedule-insns")#pragma GCC optimize("inline-functions")#pragma GCC optimize("-ftree-tail-merge")#pragma GCC optimize("-fschedule-insns2")#pragma GCC optimize("-fstrict-aliasing")#pragma GCC optimize("-falign-functions")#pragma GCC optimize("-fcse-follow-jumps")#pragma GCC optimize("-fsched-interblock")#pragma GCC optimize("-fpartial-inlining")#pragma GCC optimize("no-stack-protector")#pragma GCC optimize("-freorder-functions")#pragma GCC optimize("-findirect-inlining")#pragma GCC optimize("-fhoist-adjacent-loads")#pragma GCC optimize("-frerun-cse-after-loop")#pragma GCC optimize("inline-small-functions")#pragma GCC optimize("-finline-small-functions")#pragma GCC optimize("-ftree-switch-conversion")#pragma GCC optimize("-foptimize-sibling-calls")#pragma GCC optimize("-fexpensive-optimizations")#pragma GCC optimize("inline-functions-called-once")#pragma GCC optimize("-fdelete-null-pointer-checks")#pragma GCC optimize("Ofast")#include <bits/stdc++.h>using namespace std;int h,w;int grundy[305];int calc(int x){if(grundy[x]!=-1) return grundy[x];if(x==0){grundy[x] = x;return grundy[x];}set <int> S;//S.insert();for(int i=0;i<x;i++){int val = 0;if(i%2==1) val^=calc(1);val^=calc(x-1-i);S.insert(val);}int mex = 0;while(1){if(S.find(mex)==S.end()) break;mex++;}grundy[x] = mex;return grundy[x];}int main(void){cin.tie(0);ios::sync_with_stdio(false);vector <string> board;int val = 0;string s;cin >> h >> w;for(int i=0;i<h;i++){cin >> s;board.push_back(s);}memset(grundy,-1,sizeof(grundy));for(int j=0;j<w;j++){int x = 0;for(int i=0;i<h;i++){x = 2*x;if(board[i][j]=='o') x += 1;x%=3;}val^=x;}if(val) cout << "First" << '\n';else cout << "Second" << '\n';return 0;}