QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#533530 | #5077. Card Game | Tiga_Pilot_2 | WA | 9ms | 4072kb | C++20 | 4.3kb | 2024-08-26 02:48:20 | 2024-08-26 02:48:23 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge {c b, e;};
sim > rge<c> range(c i, c j) {return rge<c>{i,j};}
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug{
~debug() {cerr << endl;}
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair <b, c> d) {
ris <<"(" <<d.fi <<", " <<d.se <<")";
}
sim dor(rge<c> d) {
*this << "[";
for(auto it=d.b;it!=d.e;++it) {
*this <<", " + 2*(it==d.b) <<*it;
}
ris << "]";
}
};
#define imie(...) "[" <<#__VA_ARGS__ ": " << (__VA_ARGS__) <<"]"
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = a; i > (b); --i)
#define ar array
#define sz(x) (int) (x).size()
#define pii pair<int,int>
#define fi first
#define se second
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
typedef pair<double,int> pdi;
typedef vector<int> vi;
#define all(x) (x).begin(), (x).end()
template<typename T>
void min_self(T& A, T B) {
A = min(A,B);
}
template<typename T>
void max_self(T& A, T B) {
A = max(A,B);
}
const int mxn=25;
int n,m;
string s[mxn];
using pipi = pair<pii,pii>;
void solve() {
cin >>n >>m;
rep(i,0,n) {
cin >>s[i];
}
map<pipi,int> sg;
for(int len1=1;len1<n+m-1;len1+=2) {
rep(imj1,-m+1,n) {
int imj2 = imj1+len1-1;
if(imj2>=n) break;
for(int len2=1;len2<n+m-1;len2+=2) {
for(int ipj1 = (imj1+n*m*2)%2;ipj1<n+m-1;ipj1+=2) {
int ipj2 = ipj1+len2-1;
if(ipj2>=n+m-1) break;
pipi st = {{imj1,imj2},{ipj1,ipj2}};
set<int> mx;
for(int imji=imj1;imji<=imj2;imji+=2) {
for(int ipji=ipj1; ipji<=ipj2;ipji+=2) {
int i = (imji+ipji)/2;
int j = (ipji-imji)/2;
if(i>=0&&i<n&&j>=0&&j<m) {
int temp = 0;
if(s[i][j]=='R') {
temp ^= sg[{{imj1,imj2},{ipj1,ipji-2}}];
temp ^= sg[{{imj1,imj2},{ipji+2,ipj2}}];
} else if(s[i][j]=='B') {
temp ^= sg[{{imj1,imji-2},{ipj1,ipj2}}];
temp ^= sg[{{imji+2,imj2},{ipj1,ipj2}}];
} else {
pii kiri = {imj1,imji-2}, knn = {imji+2,imj2}, ats={ipj1,ipji-2}, bwh = {ipji+2,ipj2};
temp ^= sg[{kiri,ats}];
temp ^= sg[{kiri,bwh}];
temp ^= sg[{knn,ats}];
temp ^= sg[{knn,bwh}];
}
mx.insert(temp);
}
}
}
int mxi = 0;
for(auto a : mx) {
if(a==mxi) {
mxi++;
} else {
break;
}
}
sg[st] = mxi;
// debug() <<imie(st) imie(mxi);
}
}
}
}
int kr1 = (-m+1),kr2=kr1+1;
int kn1 = n-1,kn2=kn1-1;
if((kn1%2)!=(kr1%2)) {
swap(kn1,kn2);
}
int bwh1 = 0, bwh2=1;
int ats1 = n+m-2, ats2=ats1-1;
if(ats1%2) {
swap(ats1,ats2);
}
if((kr1%2)!=(bwh1%2)) {
swap(bwh1,bwh2);
swap(ats1,ats2);
}
int ans = sg[{{kr1,kn1},{bwh1,ats1}}]^sg[{{kr2,kn2},{bwh2,ats2}}];
if(ans) {
cout <<"W\n";
} else {
cout <<"L\n";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3596kb
input:
1 3 BBB
output:
W
result:
ok single line: 'W'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3748kb
input:
2 3 BBG RGR
output:
W
result:
ok single line: 'W'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
2 2 GG GG
output:
L
result:
ok single line: 'L'
Test #4:
score: 0
Accepted
time: 1ms
memory: 3520kb
input:
1 10 RRRRRRRRRR
output:
L
result:
ok single line: 'L'
Test #5:
score: 0
Accepted
time: 1ms
memory: 3580kb
input:
1 11 BBBBBBBBBBB
output:
W
result:
ok single line: 'W'
Test #6:
score: 0
Accepted
time: 1ms
memory: 3868kb
input:
10 1 G G G G G G G G G G
output:
L
result:
ok single line: 'L'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3860kb
input:
11 1 R R R R R R R R R R R
output:
W
result:
ok single line: 'W'
Test #8:
score: 0
Accepted
time: 9ms
memory: 4072kb
input:
2 20 BBGGBGBGGBBGGBGGBGGG GGBBBGBGBBBGBGGGGGGG
output:
L
result:
ok single line: 'L'
Test #9:
score: -100
Wrong Answer
time: 9ms
memory: 4052kb
input:
2 20 GBGBGBBBGGGGGBGGBBBB GGGBBBGBGBGBGGBGBGGB
output:
L
result:
wrong answer 1st lines differ - expected: 'W', found: 'L'