Submission #00300

ソースコード

?
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
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
#include <bits/stdc++.h>
//typedef
//-------------------------#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
//container util
//------------------------------------------
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const double EPS = 1E-8;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
class UnionFind {
public:
vector <int> par;
vector <int> siz;
UnionFind(int sz_): par(sz_), siz(sz_, 1) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(int sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
int root(int x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(int x, int y) {
return root(x) == root(y);
}
int size(int x) {
return siz[root(x)];
}
};
class WeightedUnionFind{
public:
vector <int> par;
vector <int> siz;
vector <ll> diff_weight; /* 頂点間の重みの差 */
WeightedUnionFind(int sz_): par(sz_), siz(sz_, 1LL), diff_weight(sz_, 0LL){
for(int i=0; i<sz_; i++) par[i] = i;
}
void init(int sz_){
par.resize(sz_);
siz.assign(sz_, 1LL);
diff_weight.resize(sz_);
for(int i=0; i<sz_; i++) par[i] = i, diff_weight[i] = 0;
}
int root(int x){
if(par[x] == x){
return x;
}else{
int r = root(par[x]);
diff_weight[x] += diff_weight[par[x]];
return par[x] = r;
}
}
ll weight(ll x){
root(x);
return diff_weight[x];
}
bool issame(int x, int y){
return root(x) == root(y);
}
bool merge(int x, int y, ll w){
w += weight(x); w -= weight(y);
x = root(x); y = root(y);
if(x == y) return false;
if (siz[x] < siz[y]) swap(x, y), w = -w;
siz[x] += siz[y];
par[y] = x;
diff_weight[y] = w;
return true;
}
ll diff(int x, int y){
return weight(y) - weight(x);
}
};
ll modPow(ll x, ll n, ll mod = MOD){
if(n <= 0) return 1;
ll res = 1;
while(n){
if(n&1) res = (res * x)%mod;
res %= mod;
x = x * x %mod;
n >>= 1;
}
return res;
}
#define SIEVE_SIZE 5000000+10
bool sieve[SIEVE_SIZE];
void makeSieve(){
for(int i=0; i<SIEVE_SIZE; ++i) sieve[i] = true;
sieve[0] = sieve[1] = false;
for(int i=2; i*i<SIEVE_SIZE; ++i) if(sieve[i]) for(int j=2; i*j<SIEVE_SIZE; ++j) sieve[i*j] = false;
}
bool isprime(ll n){
if(n == 0 || n == 1) return false;
for(ll i=2; i*i<=n; ++i) if(n%i==0) return false;
return true;
}
const int MAX = 2000010;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a%b, y, x);
y -= a/b * x;
return d;
}
// 負の数にも対応した mod (a = -11 とかでも OK)
inline long long mod(long long a, long long m) {
return (a % m + m) % m;
}
// 逆元計算 (ここでは a と m が互いに素であることが必要)
long long modinv(long long a, long long m) {
long long x, y;
extGCD(a, m, x, y);
return mod(x, m); // 気持ち的には x % m だが、x が負かもしれないので
}
ll GCD(ll a, ll b){
if(b == 0) return a;
return GCD(b, a%b);
}
template< typename Monoid, typename OperatorMonoid = Monoid >
struct LazySegmentTree
{
using F = function< Monoid(Monoid, Monoid) >;
using G = function< Monoid(Monoid, OperatorMonoid) >;
using H = function< OperatorMonoid(OperatorMonoid, OperatorMonoid) >;
using P = function< OperatorMonoid(OperatorMonoid, int) >;
int sz;
vector< Monoid > data;
vector< OperatorMonoid > lazy;
const F f;
const G g;
const H h;
const P p;
const Monoid M1;
const OperatorMonoid OM0;
LazySegmentTree(int n, const F f, const G g, const H h, const P p,
const Monoid &M1, const OperatorMonoid OM0)
: f(f), g(g), h(h), p(p), M1(M1), OM0(OM0)
{
sz = 1;
while(sz < n) sz <<= 1;
data.assign(2 * sz, M1);
lazy.assign(2 * sz, OM0);
}
void set(int k, const Monoid &x)
{
data[k + sz] = x;
}
void build()
{
for(int k = sz - 1; k > 0; k--) {
data[k] = f(data[2 * k + 0], data[2 * k + 1]);
data[k] %= MOD;
}
}
void propagate(int k, int len)
{
if(lazy[k] != OM0) {
if(k < sz) {
lazy[2 * k + 0] = h(lazy[2 * k + 0], lazy[k]);
lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);
}
data[k] = g(data[k], p(lazy[k], len));
lazy[k] = OM0;
}
}
Monoid update(int a, int b, const OperatorMonoid &x, int k, int l, int r)
{
propagate(k, r - l);
if(r <= a || b <= l) {
return data[k];
} else if(a <= l && r <= b) {
lazy[k] = h(lazy[k], x);
propagate(k, r - l);
return data[k];
} else {
return data[k] = f(update(a, b, x, 2 * k + 0, l, (l + r) >> 1),
update(a, b, x, 2 * k + 1, (l + r) >> 1, r));
}
}
Monoid update(int a, int b, const OperatorMonoid &x)
{
return update(a, b, x, 1, 0, sz);
}
Monoid query(int a, int b, int k, int l, int r)
{
propagate(k, r - l);
if(r <= a || b <= l) {
return M1;
} else if(a <= l && r <= b) {
return data[k];
} else {
return f(query(a, b, 2 * k + 0, l, (l + r) >> 1),
query(a, b, 2 * k + 1, (l + r) >> 1, r));
}
}
Monoid query(int a, int b)
{
return query(a, b, 1, 0, sz);
}
Monoid operator[](const int &k)
{
return query(k, k + 1);
}
};
vector<vector<pair<int, ll>>> G(100010);
int root = 0;
int parent[25][100010];
int depth[100010];
ll arr[100010];
void dfs(int v, int prev, ll cost, int d){
arr[v] = cost;
parent[0][v] = prev;
depth[v] = d;
for(auto u: G[v]){
if(u.first == prev) continue;
dfs(u.first, v, (cost * u.second)%MOD, d+1);
}
}
void init(int N){
dfs(root, -1, 1, 0);
for(int k=0; k+1<25; k++){
for(int v=0; v<N; v++){
if(parent[k][v] < 0) parent[k+1][v] = -1;
else parent[k+1][v] = parent[k][parent[k][v]];
}
}
}
int lca(int u, int v){
if(depth[u] > depth[v]) swap(u, v);
for(int k=0; k<25; k++){
if((depth[v]-depth[u]) >> k & 1) {
v = parent[k][v];
}
}
if(u == v) return u;
for(int k=24; k>=0; k--){
if(parent[k][u] != parent[k][v]){
u = parent[k][u];
v = parent[k][v];
}
}
return parent[0][u];
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
//cout << fixed << setprecision(15);
int N, M, D; cin >> N >> M >> D;
int ans = 0;
for(int i=0; i<D; i++){
if(N>=M){
ans += M;
N -= M;
}else{
ans += N;
N = 0;
}
}
cout << ans << endl;
return 0;
}

ステータス

項目 データ
問題 0001 - Eating NAMEKUZI
ユーザー名 sparkie
投稿日時 2020-03-02 22:43:24
言語 C++11
状態 Accepted
得点 100
ソースコード長 9518 Byte
最大実行時間 33 ms
最大メモリ使用量 5052 KB

セット

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

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
in01.txt AC 19 ms 4956 KB
1
in02.txt AC 28 ms 4872 KB
1
in03.txt AC 26 ms 4788 KB
1
in04.txt AC 29 ms 4828 KB
1
in05.txt AC 22 ms 4872 KB
1
in06.txt AC 25 ms 4920 KB
1
in07.txt AC 24 ms 4968 KB
1
in08.txt AC 18 ms 4880 KB
1
in09.txt AC 21 ms 5052 KB
1
in10.txt AC 27 ms 4968 KB
1
in11.txt AC 25 ms 4880 KB
1
in12.txt AC 17 ms 4924 KB
1
in13.txt AC 21 ms 4836 KB
1
in14.txt AC 19 ms 4876 KB
1
in15.txt AC 23 ms 5048 KB
1
in16.txt AC 19 ms 4964 KB
1
sample01.txt AC 33 ms 4876 KB
1
sample02.txt AC 20 ms 4792 KB
1