Submission #42317

ソースコード

?
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
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;
import java.util.regex.Pattern;
public class Main {
private static final PrintWriter out = new PrintWriter(System.out);
private static int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
private static int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
private static int INF = 1 << 29;
public static void main(String[] args) {
// This is from IntelliJ IDEA
if ( System.getProperty("os.name").contains("indows") ) {
System.err.println("Operating System not found");
System.exit(1);
}
Vector<Pair<Integer, Integer>> vii = new Vector<>();
int money = fgetInt();
int n = fgetInt();
for ( int i = 0; i < n; i++ ) {
vii.add(new Pair<>(fgetInt(), fgetInt()));
}
vii.sort((a, b) -> a.first == b.first ? a.second - b.second : a.first - b.first);
int count = 0;
for ( int i = 0; i < n; i++ ) {
if ( money >= vii.get(i).first ) {
count++;
vii.get(i).second--;
money -= vii.get(i).first;
}
else {
break;
}
}
for ( int i = 0; i < n; i++ ) {
while ( vii.get(i).second != 0 ) {
if ( money >= vii.get(i).first ) {
count++;
vii.get(i).second--;
money -= vii.get(i).first;
}
else {
break;
}
}
}
println(money + " " + count);
suomi();
}
private static boolean isMovable( int x, int y, int w, int h ) {
return ( x >= 0 && y >= 0 && x < w && y < h );
}
private static String fgetStr(){
return FastScanner.next();
}
private static String fgetLine(){
return FastScanner.nextLine();
}
private static char fgetChar(){
return fgetStr().charAt(0);
}
private static int fgetInt(){
return FastScanner.nextInt();
}
private static long fgetLong(){
return FastScanner.nextLong();
}
private static double fgetDouble(){
return FastScanner.nextDouble();
}
private static BigInteger fgetBig(){
return new BigInteger(fgetStr());
}
private static String reverseStr(String str){
StringBuffer sb = new StringBuffer(str);
return sb.reverse().toString();
}
private static void println(Object a){
out.println(a);
}
private static void print(Object a){
out.print(a);
}
private static void printf(String string, Object... args) {
out.printf(string, args);
}
private static void suomi(){
out.flush();
}
private static long pow ( long x, long n ) {
final long MOD = 1000000007;
long ans = 1;
while ( n > 0 ) {
if ( ( n & 1 ) == 1 ) {
ans = (ans * x) % MOD;
}
x = ( x * x ) % MOD;
n >>= 1;
}
return ans;
}
private static long gcd(long x, long y) {
return x % y == 0 ? y : gcd(y, x % y);
}
private static long lcm(long x, long y) {
return ( x / gcd(x, y) * y);
}
}
class Pair<F, S> {
F first;
S second;
public Pair(F a, S b) {
this.first = a;
this.second = b;
}
/*
@Override
public int compareTo(Pair<F, S> pair) {
int firstCmp = Objects.compare(this.first, pair.first, Comparator.comparing(Object::toString));
if ( firstCmp == 0 ) {
return Objects.compare(this.second, pair.second, Comparator.comparing(Object::toString));
}
return firstCmp;
}
*/
public boolean equals(Pair<F, S> pair) {
return this.first.equals(pair.first) && this.second.equals(pair.second);
}
public String toString() {
return String.valueOf(first) + ", " + String.valueOf(second);
}
}
class FastScanner {
private static final InputStream in = System.in;
private static final byte[] buffer = new byte[1024];
private static int ptr = 0;
private static int buflen = 0;
private static boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch ( IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private static int readByte() {
if (hasNextByte()) return buffer[ptr++];
else return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
private static boolean hasNext() {
while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
return hasNextByte();
}
static String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
static String nextLine() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b) || b == 32) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
static long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
static int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
static double nextDouble() {
return Double.parseDouble(next());
}
}
class UnionFind {
private int[] parent;
private int[] sizes;
public UnionFind(int n) {
parent = new int[n+5];
sizes = new int[n+5];
for (int i = 0; i < n; i++) {
parent[i] = i;
sizes[i] = 1;
}
}
public void unite(int x, int y) {
int rootX = getRoot(x);
int rootY = getRoot(y);
if ( !isUnited(rootX, rootY) ) {
sizes[rootY] += sizes[rootX];
parent[rootX] = rootY;
}
}
public int getRoot(int i) {
if (i != parent[i]) {
parent[i] = getRoot(parent[i]);
}
return parent[i];
}
public int getSize(int n) {
return sizes[getRoot(n)];
}
public boolean isUnited(int x, int y) {
return getRoot(x) == getRoot(y);
}
}
class SegmentTree {
private int size;
private long[] data = new long[1<<21];
SegmentTree(int n, int init) {
for ( size = 1; size < n; size *= 2);
Arrays.fill(data, init);
}
void update ( int k, int a ) {
k += size-1;
data[k] = a;
while ( k > 0 ) {
k = (k-1) / 2;
data[k] = Math.min(data[k*2+1], data[k*2+2]);
}
}
long getMin ( int a, int b, int k, int l, int r ) {
if ( r <= a || b <= l ) return 1<<29;
if ( a <= l && r <= b ) return data[k];
return Math.min(getMin( a, b, k*2+1, l, (l+r)/2), getMin( a, b, k*2+2, (l+r)/2, r));
}
long getMin ( int a, int b ) {
return this.getMin( a, b, 0, 0, size );
}
}
class BinaryIndexedTree {
private long[] bit = new long[1<<21];
private long size;
BinaryIndexedTree(int n){
size = n;
}
long getSum(int i) {
int s = 0;
while ( i > 0 ) {
s += bit[i];
i -= (i & -i);
}
return s;
}
void add(int i, int x){
while ( i <= size ) {
bit[i] += x;
i += (i & -i);
}
}
}

ステータス

項目 データ
問題 0051 - お菓子
ユーザー名 r1825
投稿日時 2018-08-30 18:49:49
言語 Java
状態 Accepted
得点 10
ソースコード長 8970 Byte
最大実行時間 160 ms
最大メモリ使用量 15972 KB

セット

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

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
sample1_in.txt AC 160 ms 15972 KB
1
sample1_in2.txt AC 147 ms 15336 KB
1
sample1_in3.txt AC 122 ms 15872 KB
1
sample1_in4.txt AC 148 ms 15452 KB
1