QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #53661 | #2928. Espresso! | Silverhorse7# | AC ✓ | 2ms | 3652kb | C++ | 760b | 2022-10-05 17:56:41 | 2022-10-05 17:56:43 |
Judging History
answer
#include "bits/stdc++.h"
using namespace std;
#define int long long
signed main() {
int n, s;
cin >> n >> s;
int cnt = 0;
int fill = s;
while (n--) {
string t;
cin >> t;
if (t.back() == 'L') {
string tmp;
for (int i = 0; i < t.size() - 1; i++)
tmp += t[i];
int tm = stoll(tmp) + 1;
if (s < tm)
s = fill, cnt++;
s -= tm;
} else {
string tmp;
for (int i = 0; i < t.size(); i++)
tmp += t[i];
int tm = stoll(tmp);
if (s < tm)
s = fill, cnt++;
s -= tm;
}
}
cout << cnt << endl;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3520kb
input:
1 10 4L
output:
0
result:
ok single line: '0'
Test #2:
score: 0
Accepted
time: 2ms
memory: 3536kb
input:
15 10 3 2L 3 1 3 2L 3 4 3L 2L 3 1 4 2 4L
output:
5
result:
ok single line: '5'
Test #3:
score: 0
Accepted
time: 2ms
memory: 3600kb
input:
8 24 1 1L 2 2L 3 3L 4 4L
output:
0
result:
ok single line: '0'
Test #4:
score: 0
Accepted
time: 2ms
memory: 3536kb
input:
8 24 1 3L 4 4L 2L 3 2 1L
output:
0
result:
ok single line: '0'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3540kb
input:
100 10 3 3L 3 1 3 4 2 4L 2L 3L 3L 3 2L 1 3 4 3L 3L 2L 1 3L 2 3 3 3L 3 1 4 1L 4 2 4 3L 3 1L 2 1L 4 4 3L 4 3L 1L 1L 1 3 2 1L 3 1L 3 4L 4L 3L 4 1L 2L 2 4 1 2 1 4L 3L 1L 2L 3 2L 1L 2L 2L 3 2L 2 3L 3L 4L 1 2L 3L 4 3 3L 4L 4 3 4L 1 2 2 3L 2 1L 4 3L 4 1 3L 4 1L
output:
34
result:
ok single line: '34'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3540kb
input:
100 11 3L 3L 3 2 3L 1L 2 3L 2 3 3 4 1 3 1L 2L 2L 4 2L 4L 2L 4 3 4L 4 2L 2 4L 3L 2L 3 1L 4L 2L 2L 1 2L 1 1 1L 1L 1L 2 1L 2 2 3L 1L 1 4L 4 3L 2L 4 4L 4 4 2L 3 2L 1 2L 2L 2L 2L 4L 4 3 4L 1L 2 4 1L 2L 4 2 1 2 3 4 2L 1 3L 1L 3 3L 1L 2 4 1L 3L 1 4L 4L 3L 2 1L 3L 2L 2L
output:
31
result:
ok single line: '31'
Test #7:
score: 0
Accepted
time: 2ms
memory: 3544kb
input:
100 12 1 2 1L 4 3L 3 2L 4L 1L 3 4L 3L 1 1L 4 2L 3L 4L 4 3L 1L 4 1L 4L 3L 1L 2 4 1 2 3 2L 4 2L 2 2L 4 2 4 3 4 2L 4L 2 1 4L 2L 2 3 2 1L 2L 4 3 2 1 2 4 1L 1L 4L 1L 1 1L 1 2 1L 4L 1 3 1L 3L 4 4L 1 1 4L 1L 2L 2L 2L 2L 1 2 1L 3 2L 4L 4 3 1L 1 4 4 4 3L 4 4 1L 1L
output:
27
result:
ok single line: '27'
Test #8:
score: 0
Accepted
time: 2ms
memory: 3540kb
input:
100 13 1L 2L 2 2 4L 2 4 3L 2L 4L 4L 2 1 3 4 3 1 2L 2L 4 4 3 2 3L 3 4L 3L 1 4 2 4 2 4L 4L 2 2L 2L 2L 4L 2L 4L 1 4 2L 3 1L 1L 4L 4 4L 3 1L 1L 2 4 4L 2L 1 1 3 1L 4L 1 2L 2 1L 2L 2L 1 2 2L 3L 3L 2L 3 3 4L 4 4L 4L 3 4L 4 3 1L 3 4 2L 4L 2 2 3L 3L 3 4L 4L 3L 1 2L 3L
output:
27
result:
ok single line: '27'
Test #9:
score: 0
Accepted
time: 2ms
memory: 3612kb
input:
100 15 1 4 3 2 4L 3L 1L 4 3L 3L 2 2L 1L 4L 3L 4L 1 2 3 2 2L 2 4 2 4L 1L 3 2 1L 1 2L 3 2L 1L 4 1 2L 1L 3L 4L 3L 1L 2L 3L 2L 4L 1L 1L 1L 1L 3 1L 4 3L 3 1 2 3L 4 4L 1 3 1L 4 1L 2L 1L 4 4L 4L 3L 1L 2 2 4L 1L 3L 4 1L 2 1L 3L 3 4L 2L 1 4L 2 4L 3L 4 1 4 4 4 3L 4 3L 2L 3
output:
22
result:
ok single line: '22'
Test #10:
score: 0
Accepted
time: 2ms
memory: 3544kb
input:
100 17 2 3L 1L 1L 3 2L 4 3 1L 2 3L 3 3L 2L 1 2L 3L 3 2 1L 4L 1L 3 3 4 1 2L 3L 1 2 1L 4 3 3L 3L 1L 4 2 4 2 3L 3L 1 1L 3L 4 3 2L 1L 2 2 1L 2L 1 3L 3 4 4 2L 1 2L 1 3 4L 2 4L 4L 2L 3 3 4L 4L 3L 4L 1 4L 3L 1L 3L 2 4L 1L 1L 2L 3L 2L 3L 1 2L 3 2 4L 4 1 3L 1L 4 4 2 3L
output:
19
result:
ok single line: '19'
Test #11:
score: 0
Accepted
time: 1ms
memory: 3464kb
input:
100 24 1 3 2 4 1 4 2 1L 1L 4 2 1 3L 2L 3 2L 1 1 1 1L 3 1L 2L 3L 1L 4 4 2 3 3L 1 3L 2 2 2L 4L 4L 4L 2L 1L 4 3L 4L 3 4 4L 2 3 2 4L 2L 3L 1 3L 4 1L 1L 3L 4L 4L 2 1 2 4 3 3 3L 2L 2L 4 1 4L 2L 4L 3L 4 4 1L 4L 1 1 2 4L 2 1L 4L 3L 3 4 4 4L 3 2L 2L 3 2L 1L 3 3 1
output:
13
result:
ok single line: '13'
Test #12:
score: 0
Accepted
time: 2ms
memory: 3652kb
input:
100 131 1 1L 2 2L 1 4L 3L 3L 3L 4 2 3 3 1L 3 3 1 3L 3L 4L 2 3 2 1L 2 4 4L 4L 3 3 4L 3 2 3 2L 4L 4L 4 3L 4L 2 3L 2 3 4 1L 1 2 2L 3L 4L 3 3L 3L 1 1L 3L 3 4 3L 2 1 4L 2 3L 1 1 2 4 1 1 4L 4L 2L 3L 3 3 4L 3L 4L 4 4L 1 3 1 4L 4 3 4L 3L 4L 2 4 4 4L 1L 1L 4 3L 2
output:
2
result:
ok single line: '2'
Test #13:
score: 0
Accepted
time: 2ms
memory: 3540kb
input:
100 200 2 2 2L 1 1L 3L 1L 1L 1 3L 2L 3L 3 1 2L 2L 2L 4 1L 3L 1L 2 3L 3 2 3 4 2L 2 2L 1 3L 3 2L 3L 3 4L 4 1 1L 4L 1L 2L 1 2L 4L 1 3 4L 4L 1L 2 4 2 4L 3L 3L 2L 3 3 3L 3L 4L 4 3 3L 4L 3L 1L 4 1 4L 1 1 4L 2L 2 2 4L 1L 1 3L 4L 3 2L 2L 4 2L 3L 4L 4 2 4L 1 1L 4L 4L 1 1L 1
output:
1
result:
ok single line: '1'
Test #14:
score: 0
Accepted
time: 2ms
memory: 3520kb
input:
8 10 1 2L 3 4 3L 1 1L 4L
output:
2
result:
ok single line: '2'
Test #15:
score: 0
Accepted
time: 0ms
memory: 3504kb
input:
3 12 4 4 4
output:
0
result:
ok single line: '0'