QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#414509 | #2928. Espresso! | TheSleepyDevil# | AC ✓ | 1ms | 3776kb | C++14 | 2.2kb | 2024-05-19 05:48:06 | 2024-05-19 05:48:07 |
Judging History
answer
/*
Hell, 'til I reach Hell, I ain't scared
Mama checkin' in my bedroom, I ain't there
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define Major ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define TxtIO freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
#define read(a,n) for(int i = 0 ; i<n ; i++) cin>>a[i];
#define write(a) for(auto x : a) cout<<x<<" ";
#define int long long
#define pb push_back
#define all(a) a.begin(),a.end()
#define el "\n"
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int inf=4e18;
int dx[]={1,0,-1,0,1,1,-1,-1};
int dy[]={0,1,0,-1,1,-1,1,-1};
const int mod=1e9+7;
const int MAX =1e6+7;
// ---------------------------Function----------------------------------//
void TestCake(){
int n,m;
cin>>n>>m;
int base=m;
int ans=0;
for(int i=0;i<n;i++){
string s;
cin>>s;
int here=s[0]-'0';
if(s.size()==1){
if(m>=(here)){
m-=here;
}
else{
ans++;
m=base;
if(m>=here){
m-=here;
}
}
}
else{
here++;
if(m>=(here)){
m-=here;
}
else{
ans++;
m=base;
if(m>=here){
m-=here;
}
}
}
}
cout<<ans<<el;
}
//------------------------------Main---------------------------//
signed main(){
Major
int T = 1;
// cin >> T;
while(T--){
TestCake();
// cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3512kb
input:
1 10 4L
output:
0
result:
ok single line: '0'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3576kb
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: 3572kb
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: 3776kb
input:
8 24 1 3L 4 4L 2L 3 2 1L
output:
0
result:
ok single line: '0'
Test #5:
score: 0
Accepted
time: 1ms
memory: 3584kb
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: 3516kb
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: 3512kb
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: 1ms
memory: 3572kb
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: 1ms
memory: 3512kb
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: 3584kb
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: 3748kb
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: 3588kb
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: 3544kb
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: 3516kb
input:
8 10 1 2L 3 4 3L 1 1L 4L
output:
2
result:
ok single line: '2'
Test #15:
score: 0
Accepted
time: 1ms
memory: 3576kb
input:
3 12 4 4 4
output:
0
result:
ok single line: '0'