結果
問題 | No.5006 Hidden Maze |
ユーザー | TKTYI |
提出日時 | 2022-08-05 01:06:43 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 71 ms / 2,000 ms |
コード長 | 1,760 bytes |
コンパイル時間 | 4,270 ms |
実行使用メモリ | 22,864 KB |
スコア | 0 |
平均クエリ数 | 1000.00 |
最終ジャッジ日時 | 2022-08-05 01:07:01 |
合計ジャッジ時間 | 18,263 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
純コード判定しない問題か言語 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 62 ms
21,780 KB |
testcase_01 | AC | 61 ms
22,632 KB |
testcase_02 | AC | 63 ms
22,216 KB |
testcase_03 | AC | 68 ms
22,004 KB |
testcase_04 | AC | 69 ms
21,928 KB |
testcase_05 | AC | 68 ms
21,880 KB |
testcase_06 | AC | 64 ms
21,768 KB |
testcase_07 | AC | 57 ms
21,940 KB |
testcase_08 | AC | 63 ms
22,576 KB |
testcase_09 | AC | 61 ms
22,588 KB |
testcase_10 | AC | 61 ms
22,216 KB |
testcase_11 | AC | 62 ms
22,456 KB |
testcase_12 | AC | 60 ms
21,868 KB |
testcase_13 | AC | 59 ms
21,904 KB |
testcase_14 | AC | 62 ms
21,892 KB |
testcase_15 | AC | 64 ms
22,444 KB |
testcase_16 | AC | 71 ms
21,928 KB |
testcase_17 | AC | 66 ms
22,216 KB |
testcase_18 | AC | 58 ms
21,928 KB |
testcase_19 | AC | 64 ms
22,588 KB |
testcase_20 | AC | 64 ms
22,552 KB |
testcase_21 | AC | 62 ms
21,684 KB |
testcase_22 | AC | 61 ms
21,892 KB |
testcase_23 | AC | 63 ms
22,864 KB |
testcase_24 | AC | 63 ms
22,624 KB |
testcase_25 | AC | 61 ms
21,780 KB |
testcase_26 | AC | 61 ms
21,952 KB |
testcase_27 | AC | 60 ms
22,588 KB |
testcase_28 | AC | 59 ms
21,892 KB |
testcase_29 | AC | 63 ms
21,892 KB |
testcase_30 | AC | 62 ms
22,216 KB |
testcase_31 | AC | 61 ms
21,940 KB |
testcase_32 | AC | 65 ms
21,768 KB |
testcase_33 | AC | 70 ms
21,880 KB |
testcase_34 | AC | 59 ms
22,028 KB |
testcase_35 | AC | 60 ms
21,904 KB |
testcase_36 | AC | 61 ms
21,768 KB |
testcase_37 | AC | 63 ms
21,952 KB |
testcase_38 | AC | 59 ms
21,928 KB |
testcase_39 | AC | 62 ms
22,704 KB |
testcase_40 | AC | 60 ms
21,780 KB |
testcase_41 | AC | 61 ms
22,264 KB |
testcase_42 | AC | 61 ms
21,892 KB |
testcase_43 | AC | 60 ms
22,228 KB |
testcase_44 | AC | 69 ms
21,904 KB |
testcase_45 | AC | 66 ms
21,916 KB |
testcase_46 | AC | 62 ms
22,468 KB |
testcase_47 | AC | 64 ms
21,792 KB |
testcase_48 | AC | 64 ms
21,904 KB |
testcase_49 | AC | 65 ms
21,792 KB |
testcase_50 | AC | 59 ms
21,892 KB |
testcase_51 | AC | 65 ms
22,456 KB |
testcase_52 | AC | 60 ms
22,264 KB |
testcase_53 | AC | 68 ms
21,928 KB |
testcase_54 | AC | 62 ms
21,904 KB |
testcase_55 | AC | 67 ms
21,904 KB |
testcase_56 | AC | 65 ms
21,904 KB |
testcase_57 | AC | 68 ms
21,792 KB |
testcase_58 | AC | 64 ms
22,276 KB |
testcase_59 | AC | 61 ms
22,856 KB |
testcase_60 | AC | 62 ms
22,576 KB |
testcase_61 | AC | 65 ms
22,620 KB |
testcase_62 | AC | 56 ms
21,992 KB |
testcase_63 | AC | 60 ms
21,768 KB |
testcase_64 | AC | 62 ms
21,760 KB |
testcase_65 | AC | 59 ms
21,780 KB |
testcase_66 | AC | 67 ms
22,608 KB |
testcase_67 | AC | 66 ms
22,276 KB |
testcase_68 | AC | 61 ms
22,456 KB |
testcase_69 | AC | 68 ms
21,904 KB |
testcase_70 | AC | 66 ms
22,252 KB |
testcase_71 | AC | 64 ms
22,288 KB |
testcase_72 | AC | 60 ms
22,228 KB |
testcase_73 | AC | 60 ms
22,588 KB |
testcase_74 | AC | 63 ms
22,432 KB |
testcase_75 | AC | 61 ms
22,564 KB |
testcase_76 | AC | 64 ms
21,928 KB |
testcase_77 | AC | 60 ms
22,016 KB |
testcase_78 | AC | 59 ms
21,756 KB |
testcase_79 | AC | 62 ms
22,588 KB |
testcase_80 | AC | 60 ms
21,940 KB |
testcase_81 | AC | 62 ms
21,856 KB |
testcase_82 | AC | 61 ms
22,456 KB |
testcase_83 | AC | 59 ms
22,240 KB |
testcase_84 | AC | 61 ms
22,856 KB |
testcase_85 | AC | 59 ms
21,792 KB |
testcase_86 | AC | 59 ms
21,780 KB |
testcase_87 | AC | 59 ms
22,488 KB |
testcase_88 | AC | 59 ms
21,940 KB |
testcase_89 | AC | 59 ms
21,904 KB |
testcase_90 | AC | 63 ms
21,928 KB |
testcase_91 | AC | 64 ms
21,952 KB |
testcase_92 | AC | 70 ms
21,768 KB |
testcase_93 | AC | 62 ms
22,216 KB |
testcase_94 | AC | 61 ms
21,928 KB |
testcase_95 | AC | 60 ms
22,228 KB |
testcase_96 | AC | 60 ms
21,892 KB |
testcase_97 | AC | 60 ms
21,780 KB |
testcase_98 | AC | 62 ms
22,228 KB |
testcase_99 | AC | 59 ms
21,892 KB |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; #define FOR(i,l,r) for(ll i=l;i<r;i++) #define REP(i,n) FOR(i,0,n) #define RFOR(i,l,r) for(ll i=r-1;i>=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define PA pair<ll,ll> #define F first #define S second #define BS(A,x) binary_search(ALL(A),x) #define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin()) #define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin()) #define COU(A,x) (UB(A,x)-LB(A,x)) #define sz(c) ((ll)(c).size()) //#include<boost/multiprecision/cpp_int.hpp> //namespace mp=boost::multiprecision; //using Bint=mp::cpp_int; template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>; template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;} template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;} template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;} template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;} template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;} template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;} ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));} //using mint=modint1000000007; using mint=modint998244353; //const ll mod=1000000007; const ll mod=998244353; //using mint=modint; ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;} int main(){ ll H,W,p;cin>>H>>W>>p; REP(i,1000){ string res; REP(i,H)res+="RD"; cout<<res<<endl; ll L;cin>>L; } return 0; }