Submission #66446

ソースコード

?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#pragma GCC optimize("O3")
#include <bits/extc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define reps(i,n) for(int i=1;i<=(n);++i)
#define all(x) begin(x), end(x)
#define Fixed fixed << setprecision(12)
#define int int_fast64_t
using pii = pair<int,int>;
constexpr int32_t INF = 0x3f3f3f3f;
constexpr int_fast64_t LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr int mod1 = 1e9+7;
constexpr int mod2 = 998244353;
template <class Func>
class FixPoint : Func {
public:
explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}
template <class... Args>
constexpr decltype(auto) operator()(Args&&... args) const {
return Func::operator()(*this, std::forward<Args>(args)...);
}
};
template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
return FixPoint<Func>{forward<Func>(f)};
}
template <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }
template <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }
template <class T> using max_heap = priority_queue<T>;
template <class T> using min_heap = priority_queue<T,vector<T>,greater<T> >;
template <class A, class B> using umap = unordered_map<A,B>;
template <class T> using Max_Heap = __gnu_pbds::priority_queue<T, less<T>, __gnu_pbds::rc_binomial_heap_tag>;
template <class T> using Min_Heap = __gnu_pbds::priority_queue<T, greater<T>, __gnu_pbds::rc_binomial_heap_tag>;
template <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;
template <class K, class V> using Umap = __gnu_pbds::gp_hash_table<K, V>;
using Trie = __gnu_pbds::trie<string, __gnu_pbds::null_type, __gnu_pbds::trie_string_access_traits<>, __gnu_pbds::pat_trie_tag, __gnu_pbds::trie_prefix_search_node_update>;
template <class T> inline void bye(T x) { cout << x << '\n'; exit(0); }
inline int square(int a){ return a * a;}
inline int updiv(int a,int b){ return (a + b - 1) / b; }
constexpr int dx[] = {1,0,-1,0,1,1,-1,-1};
constexpr int dy[] = {0,-1,0,1,1,-1,-1,1};
signed main(void){
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
char s;
int x, y;
cin >> s >> x >> y;
char a, b;
a = b = s;
char tmp = s;
for(int i = 0; i < x; ++i){
char pa = a;
if(tmp == 'R') a = 'P';
else if(tmp == 'S') a = 'R';
else a = 'S';
if(pa == 'R') tmp = 'P';
else if(pa == 'S') tmp = 'R';
else tmp = 'S';
}
tmp = s;
for(int i = 0; i < y; ++i){
char pb = b;
if(tmp == 'R') b = 'P';
else if(tmp == 'S') b = 'R';
else b = 'S';
if(pb == 'R') tmp = 'P';
else if(pb == 'S') tmp = 'R';
else tmp = 'S';
}
if(a == b){
cout << "Draw\n";
}else if(a == 'R'){
if(b == 'S'){
cout << "Yamamoto\n";
}else{
cout << "Yamada\n";
}
}else if(a == 'S'){
if(b == 'P'){
cout << "Yamamoto\n";
}else{
cout << "Yamada\n";
}
}else{
if(b == 'R'){
cout << "Yamamoto\n";
}else{
cout << "Yamada\n";
}
}
return 0;
}

ステータス

項目 データ
問題 1480 - じゃんけん
ユーザー名 ei1903
投稿日時 2021-05-04 10:02:59
言語 C++17
状態 Accepted
得点 100
ソースコード長 3439 Byte
最大実行時間 32 ms
最大メモリ使用量 668 KB

セット

セット 得点 Cases
1 ALL 100 / 100 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
in01.txt AC 26 ms 604 KB
1
in02.txt AC 24 ms 424 KB
1
in03.txt AC 15 ms 380 KB
1
in04.txt AC 17 ms 464 KB
1
in05.txt AC 20 ms 548 KB
1
in06.txt AC 24 ms 504 KB
1
in07.txt AC 27 ms 588 KB
1
in08.txt AC 25 ms 416 KB
1
in09.txt AC 19 ms 500 KB
1
in10.txt AC 23 ms 332 KB
1
in11.txt AC 24 ms 416 KB
1
in12.txt AC 21 ms 500 KB
1
in13.txt AC 23 ms 588 KB
1
in14.txt AC 32 ms 668 KB
1
in15.txt AC 19 ms 628 KB
1
in16.txt AC 28 ms 584 KB
1
in17.txt AC 28 ms 536 KB
1
in18.txt AC 28 ms 624 KB
1
in19.txt AC 21 ms 580 KB
1
in20.txt AC 20 ms 540 KB
1
sample01.txt AC 27 ms 624 KB
1
sample02.txt AC 25 ms 580 KB
1
sample03.txt AC 23 ms 660 KB
1