結果
問題 | No.154 市バス |
ユーザー |
![]() |
提出日時 | 2021-04-12 19:24:12 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,498 bytes |
コンパイル時間 | 1,913 ms |
コンパイル使用メモリ | 193,700 KB |
最終ジャッジ日時 | 2025-01-20 16:18:51 |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 7 WA * 1 |
ソースコード
#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 popcountll __builtin_popcountll#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<128>>;//仮数部が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;}ll mypow(ll x, ll n, const ll &p = -1){ //x^nをmodで割った余りif (p != -1){x =(x%p+p)%p;}ll 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 ng(){cout<<"impossible\n";}void solve(){int t;cin>>t;while(t--){string s;cin>>s;int w=0,g=0,r=0;int n=s.size();rep(i,n){if(s[i]=='W')++w;else if(s[i]=='G')++g;else ++r;}if(w<g||w<r){ng();continue;}if(g!=r){ng();continue;}if(!w||!g||!r){ng();continue;}int num=0;bool no=false;rep(i,n){if(s[i]=='G')++num;else if(s[i]=='R'){if(num<=0)no=true;else --num;}}if(num!=0)no=true;int pos=0;for(int i=n-1;i>=0;--i){if(s[i]=='W'){pos=i;break;}}bool ok=false,ok2=false;REP(i,pos,n){if(s[i]=='G')ok=true;else if(s[i]=='R')ok2=true;}ok&=ok2;if(!ok)no=true;if(no)ng();else cout<<"possible\n";}}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(15);solve();return 0;}