結果
問題 | No.438 Cwwプログラミング入門 |
ユーザー | chakku |
提出日時 | 2016-12-21 22:10:51 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,511 bytes |
コンパイル時間 | 1,700 ms |
コンパイル使用メモリ | 179,836 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-05-08 10:46:32 |
合計ジャッジ時間 | 4,948 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 1 ms
6,944 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 2 ms
6,940 KB |
testcase_10 | AC | 2 ms
6,944 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | AC | 2 ms
6,940 KB |
testcase_13 | AC | 2 ms
6,940 KB |
testcase_14 | AC | 2 ms
6,944 KB |
testcase_15 | AC | 2 ms
6,944 KB |
testcase_16 | AC | 2 ms
6,944 KB |
testcase_17 | AC | 2 ms
6,940 KB |
testcase_18 | AC | 2 ms
6,940 KB |
testcase_19 | AC | 2 ms
6,940 KB |
testcase_20 | AC | 2 ms
6,940 KB |
testcase_21 | AC | 2 ms
6,940 KB |
testcase_22 | AC | 1 ms
6,940 KB |
testcase_23 | AC | 2 ms
6,944 KB |
testcase_24 | AC | 1 ms
6,944 KB |
testcase_25 | AC | 2 ms
6,940 KB |
testcase_26 | AC | 2 ms
6,940 KB |
testcase_27 | AC | 2 ms
6,940 KB |
testcase_28 | AC | 2 ms
6,940 KB |
testcase_29 | AC | 2 ms
6,940 KB |
testcase_30 | AC | 2 ms
6,944 KB |
testcase_31 | AC | 2 ms
6,944 KB |
testcase_32 | AC | 2 ms
6,940 KB |
testcase_33 | AC | 2 ms
6,940 KB |
testcase_34 | AC | 2 ms
6,940 KB |
testcase_35 | AC | 2 ms
6,940 KB |
testcase_36 | AC | 2 ms
6,944 KB |
testcase_37 | AC | 2 ms
6,940 KB |
testcase_38 | AC | 2 ms
6,944 KB |
testcase_39 | AC | 2 ms
6,940 KB |
testcase_40 | AC | 2 ms
6,944 KB |
testcase_41 | AC | 2 ms
6,944 KB |
testcase_42 | AC | 2 ms
6,940 KB |
testcase_43 | AC | 2 ms
6,940 KB |
testcase_44 | AC | 2 ms
6,944 KB |
testcase_45 | AC | 2 ms
6,940 KB |
testcase_46 | AC | 2 ms
6,944 KB |
testcase_47 | AC | 2 ms
6,940 KB |
testcase_48 | AC | 2 ms
6,944 KB |
testcase_49 | AC | 2 ms
6,940 KB |
testcase_50 | AC | 2 ms
6,940 KB |
testcase_51 | AC | 2 ms
6,940 KB |
testcase_52 | AC | 2 ms
6,940 KB |
testcase_53 | AC | 2 ms
6,944 KB |
testcase_54 | AC | 2 ms
6,944 KB |
testcase_55 | AC | 2 ms
6,940 KB |
testcase_56 | AC | 2 ms
6,944 KB |
testcase_57 | AC | 2 ms
6,940 KB |
testcase_58 | AC | 2 ms
6,940 KB |
testcase_59 | AC | 2 ms
6,940 KB |
testcase_60 | AC | 2 ms
6,940 KB |
testcase_61 | AC | 2 ms
6,944 KB |
testcase_62 | AC | 2 ms
6,940 KB |
testcase_63 | AC | 2 ms
6,944 KB |
testcase_64 | AC | 2 ms
6,940 KB |
testcase_65 | AC | 2 ms
6,940 KB |
testcase_66 | AC | 2 ms
6,940 KB |
testcase_67 | AC | 1 ms
6,940 KB |
testcase_68 | AC | 2 ms
6,944 KB |
testcase_69 | AC | 2 ms
6,940 KB |
testcase_70 | AC | 2 ms
6,940 KB |
testcase_71 | AC | 2 ms
6,940 KB |
testcase_72 | AC | 2 ms
6,940 KB |
testcase_73 | AC | 1 ms
6,944 KB |
testcase_74 | AC | 2 ms
6,940 KB |
testcase_75 | AC | 2 ms
6,940 KB |
testcase_76 | AC | 1 ms
6,940 KB |
testcase_77 | AC | 2 ms
6,940 KB |
testcase_78 | AC | 2 ms
6,940 KB |
testcase_79 | AC | 2 ms
6,940 KB |
testcase_80 | AC | 2 ms
6,944 KB |
testcase_81 | AC | 2 ms
6,940 KB |
testcase_82 | AC | 2 ms
6,944 KB |
testcase_83 | AC | 2 ms
6,944 KB |
testcase_84 | AC | 2 ms
6,944 KB |
testcase_85 | AC | 2 ms
6,940 KB |
testcase_86 | AC | 2 ms
6,940 KB |
testcase_87 | AC | 2 ms
6,944 KB |
testcase_88 | AC | 2 ms
6,940 KB |
testcase_89 | AC | 2 ms
6,940 KB |
testcase_90 | AC | 2 ms
6,940 KB |
testcase_91 | AC | 2 ms
6,940 KB |
testcase_92 | AC | 2 ms
6,940 KB |
testcase_93 | AC | 1 ms
6,944 KB |
testcase_94 | AC | 2 ms
6,940 KB |
testcase_95 | AC | 2 ms
6,940 KB |
testcase_96 | AC | 2 ms
6,940 KB |
testcase_97 | AC | 2 ms
6,940 KB |
testcase_98 | AC | 2 ms
6,944 KB |
testcase_99 | AC | 2 ms
6,944 KB |
testcase_100 | AC | 2 ms
6,944 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define REP(i,n) for(int i=0;i<n;i++) #define rep(i,n) for(int i=0;i<n;i++) #define INF 1<<29 #define LINF LLONG_MAX/3 #define MP make_pair #define PB push_back #define EB emplace_back #define ALL(v) (v).begin(),(v).end() #define all(v) ALL(v) #define debug(x) cerr<<#x<<":"<<x<<endl #define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; } template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; } typedef long long ll; typedef unsigned long long ull; typedef pair<int,int> pii; typedef vector<int> vi; typedef vector<vi> vvi; ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); } constexpr ll mod = 1e9+7; const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1}; #define NO cout<<"NO"<<endl ll x,y,z; ll maxsize=10000; using p3 = tuple<ll,ll,ll>; int main(){ cin>>x>>y>>z; string ans; vector<p3> vp; if(z==0){ cout << "ccW" << endl; return 0; } for(int i=0;i<maxsize;i++){ if(y==0) break; ll xs = x*i; ll rem = z-xs; if(rem%y==0){ ll t = i+abs(rem/y); t = t + (t-1); if(t>maxsize) continue; vp.push_back(p3(i+abs(rem/y),i,rem/y)); } } for(int i=0;i<maxsize;i++){ if(x==0) break; ll ys = y*i; ll rem = z-ys; if(rem%x==0){ ll t = i+abs(rem/x); t = t + t -1; if(t>maxsize) continue; vp.push_back(p3(i+abs(rem/x),rem/x,i)); } } if(vp.empty()){ NO; return 0; } sort(all(vp)); ll a = get<1>(vp[0]); ll b = get<2>(vp[0]); debug2(a,b); if(a>=0 and b>=0){ rep(i,a) ans.push_back('c'); rep(i,b) ans.push_back('w'); rep(i,a+b-1) ans.push_back('C'); }else if(a<0){ rep(i,abs(a)) ans.push_back('c'); rep(i,b) ans.push_back('w'); rep(i,b-1) ans.push_back('C'); rep(i,abs(a)) ans.push_back('W'); }else if(b<0){ rep(i,abs(b)) ans.push_back('w'); rep(i,a) ans.push_back('c'); rep(i,a-1) ans.push_back('C'); rep(i,abs(b)) ans.push_back('W'); }else{ NO; return 0; // assert(false); } assert(ans!=""); cout << ans << endl; }