답안 #55429 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
55429	2018-07-07T09:28:30 Z	노영훈(#1544)	Toilets (JOI16_toilets)	C++11	36 / 100	5 ms	876 KB

toilets

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MX=200010, inf=2e9;

ll n;
int m;

void NOPE(){
    cout<<-1;
    exit(0);
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0);
    cin>>n>>m;


    ll mcnt=0, mn=0, mtmp=0, sum=0;

    char S[MX]; int k;
    for(int i=1; i<=m; i++){
        cin>>(S+1)>>k;

        ll now=0, low=0, cnt=0, tmp=0;
        for(int i=1; S[i]!=0; i++){
            if(S[i]=='M'){
                cnt++;
                now++;
            }
            else{
                now--;
            }
            if(low>now) low=now, tmp=cnt;
        }

        if(now>0){
            ll gmin=sum+low;
            if(mn>=gmin){
                mn=gmin;
                mtmp=mcnt+tmp;
            }
        }
        else{
            ll gmin=sum+now*(k-1)+low;
            if(mn>=gmin){
                mn=gmin;
                mtmp=mcnt+cnt*(k-1)+tmp;
            }
        }
        sum+=now*k;
        mcnt+=cnt*k;
        
        // cout<<now<<' '<<low<<' '<<cnt<<' '<<tmp<<'\n';
        if(cnt>n) NOPE();
    }

    ll need=max(0LL, -1-(n-mcnt)*2-mn);
    if(need>mcnt-mtmp) NOPE();
    else cout<<need;


    return 0;
}

Subtask #1
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	452 KB	Output is correct
3	Correct	2 ms	472 KB	Output is correct
4	Correct	3 ms	476 KB	Output is correct
5	Correct	2 ms	476 KB	Output is correct
6	Correct	2 ms	476 KB	Output is correct
7	Correct	2 ms	500 KB	Output is correct
8	Correct	2 ms	576 KB	Output is correct
9	Correct	2 ms	576 KB	Output is correct
10	Correct	2 ms	576 KB	Output is correct
11	Correct	2 ms	576 KB	Output is correct
12	Correct	2 ms	620 KB	Output is correct
13	Correct	2 ms	636 KB	Output is correct
14	Correct	2 ms	636 KB	Output is correct
15	Correct	3 ms	636 KB	Output is correct
16	Correct	3 ms	636 KB	Output is correct
17	Correct	3 ms	636 KB	Output is correct
18	Correct	3 ms	636 KB	Output is correct
19	Correct	2 ms	636 KB	Output is correct
20	Correct	2 ms	636 KB	Output is correct
21	Correct	2 ms	636 KB	Output is correct
22	Correct	2 ms	636 KB	Output is correct

Subtask #2
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	452 KB	Output is correct
3	Correct	2 ms	472 KB	Output is correct
4	Correct	3 ms	476 KB	Output is correct
5	Correct	2 ms	476 KB	Output is correct
6	Correct	2 ms	476 KB	Output is correct
7	Correct	2 ms	500 KB	Output is correct
8	Correct	2 ms	576 KB	Output is correct
9	Correct	2 ms	576 KB	Output is correct
10	Correct	2 ms	576 KB	Output is correct
11	Correct	2 ms	576 KB	Output is correct
12	Correct	2 ms	620 KB	Output is correct
13	Correct	2 ms	636 KB	Output is correct
14	Correct	2 ms	636 KB	Output is correct
15	Correct	3 ms	636 KB	Output is correct
16	Correct	3 ms	636 KB	Output is correct
17	Correct	3 ms	636 KB	Output is correct
18	Correct	3 ms	636 KB	Output is correct
19	Correct	2 ms	636 KB	Output is correct
20	Correct	2 ms	636 KB	Output is correct
21	Correct	2 ms	636 KB	Output is correct
22	Correct	2 ms	636 KB	Output is correct
23	Correct	3 ms	764 KB	Output is correct
24	Correct	3 ms	764 KB	Output is correct
25	Correct	4 ms	764 KB	Output is correct
26	Correct	3 ms	764 KB	Output is correct
27	Correct	3 ms	764 KB	Output is correct
28	Correct	3 ms	764 KB	Output is correct
29	Correct	3 ms	768 KB	Output is correct
30	Correct	4 ms	768 KB	Output is correct
31	Correct	3 ms	768 KB	Output is correct
32	Correct	4 ms	768 KB	Output is correct
33	Correct	3 ms	820 KB	Output is correct
34	Correct	4 ms	820 KB	Output is correct
35	Correct	5 ms	820 KB	Output is correct
36	Correct	5 ms	820 KB	Output is correct
37	Correct	2 ms	876 KB	Output is correct
38	Correct	4 ms	876 KB	Output is correct
39	Correct	4 ms	876 KB	Output is correct
40	Correct	4 ms	876 KB	Output is correct

Subtask #3
0 / 64.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	452 KB	Output is correct
3	Correct	2 ms	472 KB	Output is correct
4	Correct	3 ms	476 KB	Output is correct
5	Correct	2 ms	476 KB	Output is correct
6	Correct	2 ms	476 KB	Output is correct
7	Correct	2 ms	500 KB	Output is correct
8	Correct	2 ms	576 KB	Output is correct
9	Correct	2 ms	576 KB	Output is correct
10	Correct	2 ms	576 KB	Output is correct
11	Correct	2 ms	576 KB	Output is correct
12	Correct	2 ms	620 KB	Output is correct
13	Correct	2 ms	636 KB	Output is correct
14	Correct	2 ms	636 KB	Output is correct
15	Correct	3 ms	636 KB	Output is correct
16	Correct	3 ms	636 KB	Output is correct
17	Correct	3 ms	636 KB	Output is correct
18	Correct	3 ms	636 KB	Output is correct
19	Correct	2 ms	636 KB	Output is correct
20	Correct	2 ms	636 KB	Output is correct
21	Correct	2 ms	636 KB	Output is correct
22	Correct	2 ms	636 KB	Output is correct
23	Correct	3 ms	764 KB	Output is correct
24	Correct	3 ms	764 KB	Output is correct
25	Correct	4 ms	764 KB	Output is correct
26	Correct	3 ms	764 KB	Output is correct
27	Correct	3 ms	764 KB	Output is correct
28	Correct	3 ms	764 KB	Output is correct
29	Correct	3 ms	768 KB	Output is correct
30	Correct	4 ms	768 KB	Output is correct
31	Correct	3 ms	768 KB	Output is correct
32	Correct	4 ms	768 KB	Output is correct
33	Correct	3 ms	820 KB	Output is correct
34	Correct	4 ms	820 KB	Output is correct
35	Correct	5 ms	820 KB	Output is correct
36	Correct	5 ms	820 KB	Output is correct
37	Correct	2 ms	876 KB	Output is correct
38	Correct	4 ms	876 KB	Output is correct
39	Correct	4 ms	876 KB	Output is correct
40	Correct	4 ms	876 KB	Output is correct
41	Incorrect	5 ms	876 KB	Output isn't correct
42	Halted	0 ms	0 KB	-

답안 #55429

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 22.0 / 22.0

Subtask #3 0 / 64.0

Subtask #1
14.0 / 14.0

Subtask #2
22.0 / 22.0

Subtask #3
0 / 64.0