oj.uz

Submission #991369

# Submission time Handle Problem Language Result Execution time Memory
991369 2024-06-02T07:50:34 Z gmroh06 Toilets (JOI16_toilets) C++17
36 / 100
 21 ms 5980 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

inline void fastio() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
}

ll n, m, ans, sum;
stack<pair<string, ll>> s;

int main() {
    fastio();

    cin >> n >> m;

    while (m--) {
        string str; ll t;

        cin >> str >> t;

        s.emplace(str, t);
    }

    while (!s.empty()) {
        auto [str, k] = s.top();
        s.pop();

        ll mx = 0, tmp = 0;

        for (auto it = str.end() - 1; it >= str.begin(); it--) {
            tmp += *it == 'M' ? 1 : -1;
            mx = max(mx, tmp - 1);
        }

        ans = max(ans, sum + k * mx);
        sum += tmp;
    }

    cout << (sum <= 0 ? ans : -1);

    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 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 1 ms 760 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 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 1 ms 760 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 1000 KB Output is correct
24 Correct 1 ms 1000 KB Output is correct
25 Correct 1 ms 1000 KB Output is correct
26 Correct 2 ms 1048 KB Output is correct
27 Correct 1 ms 1000 KB Output is correct
28 Correct 1 ms 1048 KB Output is correct
29 Correct 1 ms 1024 KB Output is correct
30 Correct 1 ms 1000 KB Output is correct
31 Correct 2 ms 1060 KB Output is correct
32 Correct 1 ms 1000 KB Output is correct
33 Correct 1 ms 1024 KB Output is correct
34 Correct 1 ms 1000 KB Output is correct
35 Correct 1 ms 1000 KB Output is correct
36 Correct 1 ms 1000 KB Output is correct
37 Correct 1 ms 1020 KB Output is correct
38 Correct 1 ms 1060 KB Output is correct
39 Correct 1 ms 996 KB Output is correct
40 Correct 2 ms 1280 KB Output is correct

Subtask #3
0 / 64.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 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 1 ms 760 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 1000 KB Output is correct
24 Correct 1 ms 1000 KB Output is correct
25 Correct 1 ms 1000 KB Output is correct
26 Correct 2 ms 1048 KB Output is correct
27 Correct 1 ms 1000 KB Output is correct
28 Correct 1 ms 1048 KB Output is correct
29 Correct 1 ms 1024 KB Output is correct
30 Correct 1 ms 1000 KB Output is correct
31 Correct 2 ms 1060 KB Output is correct
32 Correct 1 ms 1000 KB Output is correct
33 Correct 1 ms 1024 KB Output is correct
34 Correct 1 ms 1000 KB Output is correct
35 Correct 1 ms 1000 KB Output is correct
36 Correct 1 ms 1000 KB Output is correct
37 Correct 1 ms 1020 KB Output is correct
38 Correct 1 ms 1060 KB Output is correct
39 Correct 1 ms 996 KB Output is correct
40 Correct 2 ms 1280 KB Output is correct
41 Incorrect 21 ms 5980 KB Output isn't correct
42 Halted 0 ms 0 KB -