結果
問題 | No.769 UNOシミュレータ |
ユーザー |
![]() |
提出日時 | 2021-03-25 12:25:32 |
言語 | C++17(clang) (17.0.6 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 34 ms / 2,000 ms |
コード長 | 2,419 bytes |
コンパイル時間 | 1,976 ms |
コンパイル使用メモリ | 164,044 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-27 02:30:18 |
合計ジャッジ時間 | 3,059 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 23 |
ソースコード
#include <bits/stdc++.h>//#include<boost/multiprecision/cpp_int.hpp>//#include<boost/multiprecision/cpp_dec_float.hpp>//#include <atcoder/all>#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)#define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i)#define pb push_back#define eb emplace_back#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define popcount __builtin_popcount#define fi first#define se secondusing ll = long long;constexpr ll mod = 1e9 + 7;constexpr ll mod_998244353 = 998244353;constexpr ll INF = 1LL << 60;// #pragma GCC target("avx2")// #pragma GCC optimize("O3")// #pragma GCC optimize("unroll-loops")//using lll=boost::multiprecision::cpp_int;//using Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1024>>;//仮数部が1024桁template <class T>inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}template <class T>inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}template <typename T>T mypow(T x, T n, const T &p = -1){ //x^nをmodで割った余りif (p != -1){x %= p;}T ret = 1;while (n > 0){if (n & 1){if (p != -1)ret = (ret * x) % p;elseret *= x;}if (p != -1)x = (x * x) % p;elsex *= x;n >>= 1;}return ret;}using namespace std;//using namespace atcoder;void solve(){int n,m;cin>>n>>m;int cur=0;int add=0;int draw2=0,draw4=0;vector<int>num(n);auto func=[](int n,int add,int &cur)->void{if(!add)cur++;else cur--;cur=(cur+n)%n;};rep(i,m){string s;cin>>s;if(draw2>0){if(s!="drawtwo"){num[cur]-=draw2;draw2=0;func(n,add,cur);}else{draw2+=2;}}else{if(s=="drawtwo")draw2+=2;}if(draw4>0){if(s!="drawfour"){num[cur]-=draw4;draw4=0;func(n,add,cur);}else{draw4+=4;}}else{if(s=="drawfour")draw4+=4;}num[cur]++;if(s=="reverse")add^=1;else if(s=="skip"){if(i<m-1)func(n,add,cur);}if(i<m-1)func(n,add,cur);}cout<<cur+1<<" "<<num[cur];}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(15);solve();return 0;}