QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#270836#2928. Espresso!PetroTarnavskyi#AC ✓0ms3876kbC++20782b2023-12-01 16:11:292023-12-01 16:11:30

Judging History

你现在查看的是最新测评结果

  • [2023-12-01 16:11:30]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3876kb
  • [2023-12-01 16:11:29]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);	
	int n, s;
	cin >> n >> s;
	int cur = s, ans = 0;
	FOR(i, 0, n)
	{
		string str;
		cin >> str;
		int y = 0;
		if (str.back() == 'L')
		{
			str.pop_back();
			y = 1;
		}
		int x = stoi(str);
		if (cur < x + y)
		{
			cur = s;
			ans++;
		}
		cur -= x + y;
	}
	cout << ans << "\n";
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3524kb

input:

1 10
4L

output:

0

result:

ok single line: '0'

Test #2:

score: 0
Accepted
time: 0ms
memory: 3572kb

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: 0ms
memory: 3872kb

input:

8 24
1
1L
2
2L
3
3L
4
4L

output:

0

result:

ok single line: '0'

Test #4:

score: 0
Accepted
time: 0ms
memory: 3840kb

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: 3844kb

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: 3576kb

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: 0ms
memory: 3640kb

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: 0ms
memory: 3612kb

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: 0ms
memory: 3676kb

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: 0ms
memory: 3648kb

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: 0ms
memory: 3580kb

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: 0ms
memory: 3644kb

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: 0ms
memory: 3876kb

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: 0ms
memory: 3616kb

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: 3528kb

input:

3 12
4
4
4

output:

0

result:

ok single line: '0'