結果
問題 | No.1363 [Zelkova Last Tune] 誰がその最後のベルを鳴らすのか? |
ユーザー |
|
提出日時 | 2021-01-22 23:48:01 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 105 ms / 2,000 ms |
コード長 | 3,106 bytes |
コンパイル時間 | 2,348 ms |
コンパイル使用メモリ | 196,536 KB |
最終ジャッジ日時 | 2025-01-18 06:34:34 |
ジャッジサーバーID (参考情報) |
judge3 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 5 |
ソースコード
//@formatter:off#include<bits/stdc++.h>#define overload4(_1,_2,_3,_4,name,...) name#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)#define rrep(i,n) for (ll i = ll(n)-1; i >= 0; i--)#define all(a) a.begin(),a.end()#define rall(a) a.rbegin(),a.rend()#define pb push_back#define eb emplace_back#ifdef __LOCAL#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; }#else#define debug(...) void(0)#endif#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)using namespace std;using ll = long long;using ld = long double;using P = pair<int,int>;using LP = pair<ll,ll>;using vi = vector<int>;using vvi = vector<vector<int>>;using vl = vector<ll>;using vvl = vector<vector<ll>>;using vd = vector<double>;using vvd = vector<vector<double>>;using vs = vector<string>;using vc = vector<char>;using vvc = vector<vector<char>>;using vb = vector<bool>;using vvb = vector<vector<bool>>;using vp = vector<P>;using vvp = vector<vector<P>>;template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']';}template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}void scan(){}template <class Head, class... Tail> void scan(Head& head, Tail&... tail){ cin >> head; scan(tail...); }template<class T> void print(const T& t){ cout << t << '\n'; }template <class Head, class... Tail> void print(const Head& head, const Tail&... tail){ cout<<head<<' '; print(tail...); }const string yes[] = {"no","yes"};const string Yes[] = {"No","Yes"};const string YES[] = {"NO","YES"};const int inf = 1001001001;const ll linf = 1001001001001001001;//@formatter:onvoid solve() {INT(k);LL(x, y);vl a(k), p(k);cin >> a >> p;ll X = 0;rep(i, k) X ^= a[i] % (p[i] + 1);if (x == 0 and y == 0) {if (X > 0) print('Z');else print('C');} else {if (x >= y) print('Z');else {ll d = y - x;if (X <= d) print('C');else print('Z');}}}int main() {ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);int t;cin >> t;rep(i, t) solve();}