結果
問題 | No.769 UNOシミュレータ |
ユーザー |
|
提出日時 | 2018-12-16 23:05:53 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 4,113 bytes |
コンパイル時間 | 2,147 ms |
コンパイル使用メモリ | 177,052 KB |
実行使用メモリ | 14,392 KB |
最終ジャッジ日時 | 2024-11-22 08:42:57 |
合計ジャッジ時間 | 8,060 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 22 WA * 1 |
ソースコード
#define NOMINMAX#define TEST_MODE true#define _CRT_SECURE_NO_WARNINGS#define _USE_MATH_DEFINES#include "bits/stdc++.h"using namespace std;#define rep(i, n) for (int i = 0; i < (int)(n); ++i)#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)#define rrep2(i, a, b) for (int i = (a)-1; i >= (int)b; --i)#define range(i, a, b, c) for (int i = a; \c > 0 ? i < b : i > b; \i += c)#define chmax(a, b) (a = (a) < (b) ? (b) : (a))#define chmin(a, b) (a = (a) > (b) ? (b) : (a))using ll = long long;using ull = unsigned long long;using ld = long double;#define all(a) begin(a), end(a)#define ifnot(a) if (not(a))#define int long long#ifdef LOCAL_ENV#if TEST_MODE == trueconst bool test = true;#define dump(x) cerr << #x << " : " << (x) << " "#define dumpl(x) dump(x) << endl#elseconst bool test = false;#define dump(x)#define dumpl(x)#endif#elseconst bool test = false;#define dump(x)#define dumpl(x)#endifint dx[] = { 1, 0, -1, 0 };int dy[] = { 0, 1, 0, -1 };const int INF = (int)1 << 60;const int undefined = INF;const ll INFL = (ll)1 << 60;ll mod_n = (int)1e9 + 7;const double eps = 1e-10;typedef long double Real;// return -1, 0, 1int sgn(const Real &r) { return (r > eps) - (r < -eps); }int sgn(const Real &a, const Real &b) { return sgn(a - b); }//.....................const int MAX = (int)2e5 + 5;vector<string> split(const string &str, char sep){vector<string> v;stringstream ss(str);string buffer;while (getline(ss, buffer, sep)){v.push_back(buffer);}return v;}string join(const vector<string>& v, const string delim = 0) {string s;if (!v.empty()) {s += v[0];for (decltype(v.size()) i = 1, c = v.size(); i < c; ++i) {if (delim != "") s += delim;s += v[i];}}return s;}string operator * (const string& s, const int& n) {string res = "";rep(i, n) res += s;return res;}template <class InputIterator>int sum(InputIterator begin, InputIterator end){return accumulate(begin, end, 0ll);}template<typename T>T gcd(T a, T b){T c;while (a != 0) {c = a; a = b%a; b = c;}return b;}template<typename T>T bit_count(T N) {T cnt = 0;while (N) {if (N & 1) cnt++;N >>= 1;}return cnt;}template<typename T>void print_vec(ostream& ostream, vector<T> a) {rep(i, a.size() - 1) ostream << a[i] << " ";ostream << a.back() << endl;}ll pow_n(ll x, ll n) {ll res = 1;while (n > 0) {if (n & 1) res = res * x;x = x * x;n >>= 1;}return res;}class Solver {public:int H, W;bool grid_ng(int y, int x) {return y < 0 || y >= H || x < 0 || x >= W;}struct Point {int x, y;bool operator < (const Point& r) const {if (y != r.y) return y < r.y;return x < r.x;}};int N, M;vector<string> l;int cur = 0;int cnt[MAX] = {};int draw2_cnt = 0;int draw4_cnt = 0;int dir = 1;void solve() {cin >> N >> M;l.resize(M);rep(i, M) cin >> l[i];for (int i = 0; i < M; ) {string& s = l[i];if (i != 0) cur += dir;while (cur <= -1) cur += N;while (cur >= N) cur -= N;if (draw2_cnt != 0 && s != "drawtwo") {cerr << "!" << endl;cnt[cur] += draw2_cnt * 2;draw2_cnt = 0;goto label1;}if (draw4_cnt != 0 && s != "drawfour") {cnt[cur] += draw4_cnt * 4;draw4_cnt = 0;goto label1;}cnt[cur] -= 1;if (s == "drawtwo") {draw2_cnt += 1;}if (s == "drawfour") {draw4_cnt += 1;}if (s == "skip") {cur += dir;}if (s == "reverse") {dir *= -1;}i += 1;label1:dumpl(s);rep(i, N) {dump(i + 1); dumpl(cnt[i]);}cerr << endl;}cout << cur + 1 << " " << -cnt[cur] << endl;}};signed main(){srand((unsigned int)time(NULL));cout << fixed << setprecision(20);auto ptr = new Solver();ptr->solve();delete ptr;//while (true) {// if (cin.eof() == true) break;// auto ptr = new Solver();// ptr->solve();// delete ptr;//}return 0;}