oj.uz

Submission #1011367

# Submission time Handle Problem Language Result Execution time Memory
1011367 2024-06-30T12:31:16 Z pcc Toilets (JOI16_toilets) C++17
100 / 100
 21 ms 6860 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define fs first
#define sc second

ll N,M;
vector<pair<string,ll>> v;

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>N>>M;
	ll sum = 0,ans = 0;
	for(ll i = 0;i<M;i++){
		string s;
		ll t;
		cin>>s>>t;
		reverse(s.begin(),s.end());
		v.push_back(make_pair(s,t));
	}
	reverse(v.begin(),v.end());
	for(auto [s,t] : v){
		ll ts = 0,tbig = -1e18;
		for(auto &i:s){
			if(i == 'F'){
				ts--;
				tbig = max(tbig,ts);
			}
			else ts++;
		}
		ans = max(ans,sum+tbig);
		sum += ts*(t-1);
		ans = max(ans,sum+tbig);
		sum += ts;
	}
	if(sum>0)cout<<"-1\n";
	else cout<<ans<<'\n';
	return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 456 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 452 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 456 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 452 KB Output is correct
23 Correct 2 ms 1000 KB Output is correct
24 Correct 2 ms 1116 KB Output is correct
25 Correct 2 ms 1000 KB Output is correct
26 Correct 2 ms 1280 KB Output is correct
27 Correct 1 ms 1000 KB Output is correct
28 Correct 2 ms 1000 KB Output is correct
29 Correct 2 ms 1000 KB Output is correct
30 Correct 2 ms 1168 KB Output is correct
31 Correct 2 ms 1000 KB Output is correct
32 Correct 2 ms 1000 KB Output is correct
33 Correct 1 ms 1000 KB Output is correct
34 Correct 1 ms 1000 KB Output is correct
35 Correct 2 ms 1000 KB Output is correct
36 Correct 2 ms 1048 KB Output is correct
37 Correct 1 ms 1000 KB Output is correct
38 Correct 1 ms 1000 KB Output is correct
39 Correct 2 ms 1056 KB Output is correct
40 Correct 2 ms 1056 KB Output is correct

Subtask #3
64.0 / 64.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 456 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 452 KB Output is correct
23 Correct 2 ms 1000 KB Output is correct
24 Correct 2 ms 1116 KB Output is correct
25 Correct 2 ms 1000 KB Output is correct
26 Correct 2 ms 1280 KB Output is correct
27 Correct 1 ms 1000 KB Output is correct
28 Correct 2 ms 1000 KB Output is correct
29 Correct 2 ms 1000 KB Output is correct
30 Correct 2 ms 1168 KB Output is correct
31 Correct 2 ms 1000 KB Output is correct
32 Correct 2 ms 1000 KB Output is correct
33 Correct 1 ms 1000 KB Output is correct
34 Correct 1 ms 1000 KB Output is correct
35 Correct 2 ms 1000 KB Output is correct
36 Correct 2 ms 1048 KB Output is correct
37 Correct 1 ms 1000 KB Output is correct
38 Correct 1 ms 1000 KB Output is correct
39 Correct 2 ms 1056 KB Output is correct
40 Correct 2 ms 1056 KB Output is correct
41 Correct 18 ms 6792 KB Output is correct
42 Correct 21 ms 6860 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 4 ms 1464 KB Output is correct
47 Correct 2 ms 860 KB Output is correct
48 Correct 2 ms 860 KB Output is correct
49 Correct 1 ms 724 KB Output is correct
50 Correct 1 ms 860 KB Output is correct
51 Correct 4 ms 1452 KB Output is correct
52 Correct 16 ms 6512 KB Output is correct
53 Correct 15 ms 6600 KB Output is correct
54 Correct 15 ms 6604 KB Output is correct
55 Correct 1 ms 856 KB Output is correct
56 Correct 1 ms 860 KB Output is correct