結果
問題 | No.351 市松スライドパズル |
ユーザー |
![]() |
提出日時 | 2016-03-11 23:16:57 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 154 ms / 2,000 ms |
コード長 | 2,800 bytes |
コンパイル時間 | 1,643 ms |
コンパイル使用メモリ | 170,244 KB |
実行使用メモリ | 38,656 KB |
最終ジャッジ日時 | 2024-09-25 02:36:20 |
合計ジャッジ時間 | 4,135 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 17 |
ソースコード
/* template.cpp {{{ */#include <bits/stdc++.h>using namespace std;namespace solver {#define GET_MACRO(a, b, c, d, NAME, ...) NAME#define REP1(n) REP2(i_, n)#define REP2(i, n) REP3(i, 0, n)#define REP3(i, a, b) REP4(i, a, b, 1)#define REP4(i, a, b, s) for (ll i = (a); i < (ll)(b); i += (ll)(s))#define RREP1(n) RREP2(i_, n)#define RREP2(i, n) RREP3(i, 0, n)#define RREP3(i, a, b) RREP4(i, a, b, 1)#define RREP4(i, a, b, s) for (ll i = (b) - 1; i >= (ll)(a); i -= (ll)(s))#define rep(...) GET_MACRO(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)#define rrep(...) GET_MACRO(__VA_ARGS__, RREP4, RREP3, RREP2, RREP1)(__VA_ARGS__)#define each(x, c) for (auto &&x : c)#define all(c) std::begin(c), std::end(c)using ll = long long;using ull = unsigned long long;using uint = unsigned int;using ld = long double;template<typename T>using MinPQ = priority_queue<T, vector<T>, greater<T>>;template<typename T>using MaxPQ = priority_queue<T, vector<T>, less<T>>;template<bool cond, typename T = void>using enable_if_t = typename enable_if<cond, T>::type;const int INF = 1e9 + 10;const ll INF_LL = 1e18 + 10;const double INF_D = 1e12;const ld INF_LD = 1e24;const ld EPS = 1e-8;const ld PI = acos(-1.0l);const int dx[] = {-1, 0, 1, 0, -1, 1, 1, -1};const int dy[] = {0, -1, 0, 1, -1, -1, 1, 1};template<typename T>inline T sq(const T &x){ return x * x; }template<typename T, typename U>inline T &chmin(T &x, const U &y){ if (x > y) x = y; return x; }template<typename T, typename U>inline T &chmax(T &x, const U &y){ if (x < y) x = y; return x; }ll gcd(ll a, ll b){ return b ? gcd(b, a % b) : a; }ll lcm(ll a, ll b){ return a / gcd(a, b) * b; }tuple<ll, ll, ll> extgcd(ll a, ll b){if (b == 0) return make_tuple(a, 1, 0);ll g, x, y;tie(g, x, y) = extgcd(b, a % b);return make_tuple(g, y, x - a / b * y);}ll invmod(ll a, ll m = 1000000007){ll g, x;tie(g, x, ignore) = extgcd(a, m);return g == 1 ? (x + m) % m : 0;}void solve();}signed main(){auto begin = std::chrono::high_resolution_clock::now();std::ios::sync_with_stdio(false);std::cin.tie(nullptr);std::cout << std::fixed << std::setprecision(12);solver::solve();auto end = std::chrono::high_resolution_clock::now();auto time = std::chrono::duration_cast<std::chrono::milliseconds>(end - begin);#ifdef DEBUGstd::cerr << "time: " << time.count() << " [ms]" << std::endl;#endif}namespace solver {/* }}} */int h, w, n;string s[1000000];int k[1000000];void solve(){cin >> h >> w >> n;rep(i, n) cin >> s[i] >> k[i];int x = 0, y = 0;rrep(i, n){if (s[i] == "C" && k[i] == y) x = (x + h - 1) % h;if (s[i] == "R" && k[i] == x) y = (y + w - 1) % w;}cout << ((x ^ y) & 1 ? "black\n" : "white\n");}} /* namespace solver */