結果

問題 No.2042 RGB Caps
ユーザー snukesnuke
提出日時 2022-08-19 22:01:13
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 23 ms / 2,000 ms
コード長 3,388 bytes
コンパイル時間 2,213 ms
コンパイル使用メモリ 208,516 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-04-27 20:33:30
合計ジャッジ時間 3,184 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 1 ms
6,944 KB
testcase_04 AC 1 ms
6,944 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 5 ms
6,940 KB
testcase_07 AC 7 ms
6,944 KB
testcase_08 AC 14 ms
6,944 KB
testcase_09 AC 4 ms
6,940 KB
testcase_10 AC 21 ms
6,940 KB
testcase_11 AC 4 ms
6,944 KB
testcase_12 AC 23 ms
6,944 KB
testcase_13 AC 22 ms
6,944 KB
testcase_14 AC 21 ms
6,940 KB
testcase_15 AC 1 ms
6,940 KB
testcase_16 AC 7 ms
6,940 KB
testcase_17 AC 3 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>;
int getInt(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const vv<T>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<typename T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes"); return;}
#define no { puts("No"); return;}
#define ret(x) { cout<<(x)<<endl; return;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

struct Solver {
  void solve() {
    int n,k;
    scanf("%d%d",&n,&k);
    int m = dup(n,3)*3;
    string s(m,'.');
    vv<char> d(m/3,vc<char>(2,'.'));
    rep(i,k) {
      char c;
      int a;
      scanf("%d %c",&a,&c);
      --a;
      if (a%3 == 2) continue;
      d[a/3][a%3] = c;
    }
    rep(i,m/3) {
      if (d[i][0] == d[i][1]) d[i][1] = '.';
      if (d[i][0] == '.') {
        if (d[i][1] == 'R') d[i][0] = 'G';
        else d[i][0] = 'R';
      }
      if (d[i][1] == '.') {
        if (d[i][0] == 'R') d[i][1] = 'G';
        else d[i][1] = 'R';
      }
      s[i*3] = d[i][0];
      s[i*3+1] = d[i][1];
      s[i*3+2] = 'R'^'G'^'B'^d[i][0]^d[i][1];
    }
    while (sz(s) > n) s.pob();
    cout<<s<<endl;
  }
};

int main() {
  int ts = 1;
  // scanf("%d",&ts);
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}
0