Submission #66450

ソースコード

?
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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
// Begin Header {{{
#pragma region
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)
#define let const auto
constexpr size_t operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };
constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;
using usize = size_t;
using imax = intmax_t;
using uimax = uintmax_t;
using ld = long double;
template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;
inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
cin >> head;
input(forward<Tail>(tail)...);
}
template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline istream& operator>>(istream &is, Container &vs) {
for (auto &v: vs) is >> v;
return is;
}
template <class T, class U>
inline istream& operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail)) cout << " ";
output(forward<Tail>(tail)...);
}
template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline ostream& operator<<(ostream &os, const Container &vs) {
static constexpr const char *delim[] = {" ", ""};
for (auto it = begin(vs); it != end(vs); ++it) {
os << delim[it == begin(vs)] << *it;
}
return os;
}
template <class Iterator>
inline void join(const Iterator &Begin, const Iterator &End, const string &delim = "\n", const string &last = "\n") {
for (auto it = Begin; it != End; ++it) {
cout << ((it == Begin) ? "" : delim) << *it;
}
cout << last;
}
template <class T>
inline vector<T> makeVector(const T &init_value, size_t sz) {
return vector<T>(sz, init_value);
}
template <class T, class... Args>
inline auto makeVector(const T &init_value, size_t sz, Args... args) {
return vector<decltype(makeVector<T>(init_value, args...))>(sz, makeVector<T>(init_value, args...));
}
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 Container>
struct reverse_t {
Container &c;
reverse_t(Container &c) : c(c) {}
auto begin() { return c.rbegin(); }
auto end() { return c.rend(); }
};
template <class Container>
auto reversed(Container &c) {
return reverse_t<Container>(c);
}
template <class T>
inline bool chmax(T &a, const T &b) noexcept {
return b > a && (a = b, true);
}
template <class T>
inline bool chmin(T &a, const T &b) noexcept {
return b < a && (a = b, true);
}
template <class T>
inline T diff(const T &a, const T &b) noexcept {
return a < b ? b - a : a - b;
}
void operator|=(vector<bool>::reference lhs, const bool rhs) {
lhs = lhs | rhs;
}
void operator&=(vector<bool>::reference lhs, const bool rhs) {
lhs = lhs & rhs;
}
void operator^=(vector<bool>::reference lhs, const bool rhs) {
lhs = lhs ^ rhs;
}
void ioinit() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
clog << fixed << setprecision(10);
}
#pragma endregion
// }}} End Header
// Edge {{{
template <class Weight>
struct Edge {
size_t from, to;
Weight weight;
Edge() {}
Edge(size_t from, size_t to, Weight weight = 1) :
from(from), to(to), weight(weight)
{}
bool operator<(const Edge &rhs) const {
return weight < rhs.weight;
}
bool operator>(const Edge &rhs) const {
return weight > rhs.weight;
}
operator size_t() const {
return to;
}
};
// }}}
signed main() {
ioinit();
var(char, S);
var(imax, X, Y);
assert(S == 'R' || S == 'P' || S == 'S');
assert(0 <= X && X <= 100);
assert(0 <= Y && Y <= 100);
X %= 3;
Y %= 3;
if (X == Y) {
output("Draw");
} else if (X == (Y + 1) % 3) {
output("Yamamoto");
} else {
output("Yamada");
}
return 0;
}

ステータス

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

セット

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

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
in01.txt AC 23 ms 604 KB
1
in02.txt AC 20 ms 428 KB
1
in03.txt AC 21 ms 380 KB
1
in04.txt AC 21 ms 468 KB
1
in05.txt AC 34 ms 424 KB
1
in06.txt AC 16 ms 504 KB
1
in07.txt AC 17 ms 460 KB
1
in08.txt AC 24 ms 676 KB
1
in09.txt AC 24 ms 756 KB
1
in10.txt AC 25 ms 584 KB
1
in11.txt AC 31 ms 540 KB
1
in12.txt AC 26 ms 752 KB
1
in13.txt AC 18 ms 576 KB
1
in14.txt AC 16 ms 532 KB
1
in15.txt AC 20 ms 492 KB
1
in16.txt AC 25 ms 576 KB
1
in17.txt AC 21 ms 656 KB
1
in18.txt AC 21 ms 480 KB
1
in19.txt AC 18 ms 564 KB
1
in20.txt AC 21 ms 520 KB
1
sample01.txt AC 30 ms 472 KB
1
sample02.txt AC 22 ms 556 KB
1
sample03.txt AC 21 ms 636 KB
1