oj.uz

Submission #1087280

# Submission time Handle Problem Language Result Execution time Memory
1087280 2024-09-12T12:11:24 Z akim9905 Toilets (JOI16_toilets) C++17
100 / 100
 15 ms 5980 KB 
#include <bits/stdc++.h>
using namespace std;

#define fileio() freopen("input.txt","r",stdin); freopen("output.txt","w",stdout)
#define fio() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define all(x) (x).begin(), (x).end()
#define allr(x) x.rbegin(), x.rend()
#define cmprs(x) sort(all(x)),x.erase(unique(all(x)),x.end())
#define endl "\n"
#define sp " "
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define F first
#define S second
#define rz resize
#define sz(a) (int)(a.size())
#define clr(a) a.clear()

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef tuple<int, int, int> tpi;
typedef tuple<ll, ll, ll> tpl;
typedef pair<double, ll> pdl;
typedef pair<double, int> pdi;

const int dx[] = {1,-1,0,0,1,1,-1,-1};
const int dy[] = {0,0,1,-1,1,-1,1,-1};
const ll MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int MAX = 101010; // PLZ CHK!

ll N,M,K[MAX];
string A[MAX];

int main() {
    fio();
    cin>>N>>M;
    for (int i=0; i<M; i++) cin>>A[i]>>K[i];

    ll am=0,af=0,ans=0;
    for (int i=M-1; i>=0; i--) {
        ll m=0,f=0,mx=0;
        string s=A[i];
        for (int j=sz(s)-1; j>=0; j--) {
            if (s[j]=='M') m++;
            else f++;

            if (m>=f+2) {
                ans=max(ans, am+m-af-f-1);
            }
        }
        
        am+=(K[i]-1)*m,af+=(K[i]-1)*f;

        ll tm=0,tf=0;
        for (int j=sz(s)-1; j>=0; j--) {
            if (s[j]=='M') tm++;
            else tf++;

            ans=max(ans, am+tm-af-tf-1);
        }

        am+=m, af+=f;
    }

    if (am>af) {
        cout<<-1;
    }
    else cout<<ans;
    
    return 0;
}

Compilation message

toilets.cpp: In function 'int main()':
toilets.cpp:46:20: warning: unused variable 'mx' [-Wunused-variable]
   46 |         ll m=0,f=0,mx=0;
      |                    ^~

Subtask #1
14.0 / 14.0

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

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3420 KB Output is correct
2 Correct 1 ms 3420 KB Output is correct
3 Correct 1 ms 3420 KB Output is correct
4 Correct 1 ms 3420 KB Output is correct
5 Correct 2 ms 3420 KB Output is correct
6 Correct 1 ms 3420 KB Output is correct
7 Correct 1 ms 3420 KB Output is correct
8 Correct 1 ms 3420 KB Output is correct
9 Correct 2 ms 3420 KB Output is correct
10 Correct 1 ms 3420 KB Output is correct
11 Correct 1 ms 3420 KB Output is correct
12 Correct 1 ms 3420 KB Output is correct
13 Correct 2 ms 3420 KB Output is correct
14 Correct 1 ms 3420 KB Output is correct
15 Correct 1 ms 3416 KB Output is correct
16 Correct 2 ms 3420 KB Output is correct
17 Correct 2 ms 3420 KB Output is correct
18 Correct 1 ms 3420 KB Output is correct
19 Correct 1 ms 3420 KB Output is correct
20 Correct 1 ms 3556 KB Output is correct
21 Correct 1 ms 3420 KB Output is correct
22 Correct 1 ms 3420 KB Output is correct
23 Correct 4 ms 4292 KB Output is correct
24 Correct 4 ms 4328 KB Output is correct
25 Correct 5 ms 4248 KB Output is correct
26 Correct 2 ms 4324 KB Output is correct
27 Correct 3 ms 4156 KB Output is correct
28 Correct 4 ms 4328 KB Output is correct
29 Correct 3 ms 4328 KB Output is correct
30 Correct 3 ms 4160 KB Output is correct
31 Correct 3 ms 4324 KB Output is correct
32 Correct 4 ms 4164 KB Output is correct
33 Correct 3 ms 4328 KB Output is correct
34 Correct 3 ms 4328 KB Output is correct
35 Correct 4 ms 4328 KB Output is correct
36 Correct 5 ms 4328 KB Output is correct
37 Correct 2 ms 4324 KB Output is correct
38 Correct 3 ms 4328 KB Output is correct
39 Correct 3 ms 4328 KB Output is correct
40 Correct 3 ms 4348 KB Output is correct

Subtask #3
64.0 / 64.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3420 KB Output is correct
2 Correct 1 ms 3420 KB Output is correct
3 Correct 1 ms 3420 KB Output is correct
4 Correct 1 ms 3420 KB Output is correct
5 Correct 2 ms 3420 KB Output is correct
6 Correct 1 ms 3420 KB Output is correct
7 Correct 1 ms 3420 KB Output is correct
8 Correct 1 ms 3420 KB Output is correct
9 Correct 2 ms 3420 KB Output is correct
10 Correct 1 ms 3420 KB Output is correct
11 Correct 1 ms 3420 KB Output is correct
12 Correct 1 ms 3420 KB Output is correct
13 Correct 2 ms 3420 KB Output is correct
14 Correct 1 ms 3420 KB Output is correct
15 Correct 1 ms 3416 KB Output is correct
16 Correct 2 ms 3420 KB Output is correct
17 Correct 2 ms 3420 KB Output is correct
18 Correct 1 ms 3420 KB Output is correct
19 Correct 1 ms 3420 KB Output is correct
20 Correct 1 ms 3556 KB Output is correct
21 Correct 1 ms 3420 KB Output is correct
22 Correct 1 ms 3420 KB Output is correct
23 Correct 4 ms 4292 KB Output is correct
24 Correct 4 ms 4328 KB Output is correct
25 Correct 5 ms 4248 KB Output is correct
26 Correct 2 ms 4324 KB Output is correct
27 Correct 3 ms 4156 KB Output is correct
28 Correct 4 ms 4328 KB Output is correct
29 Correct 3 ms 4328 KB Output is correct
30 Correct 3 ms 4160 KB Output is correct
31 Correct 3 ms 4324 KB Output is correct
32 Correct 4 ms 4164 KB Output is correct
33 Correct 3 ms 4328 KB Output is correct
34 Correct 3 ms 4328 KB Output is correct
35 Correct 4 ms 4328 KB Output is correct
36 Correct 5 ms 4328 KB Output is correct
37 Correct 2 ms 4324 KB Output is correct
38 Correct 3 ms 4328 KB Output is correct
39 Correct 3 ms 4328 KB Output is correct
40 Correct 3 ms 4348 KB Output is correct
41 Correct 15 ms 5976 KB Output is correct
42 Correct 15 ms 5980 KB Output is correct
43 Correct 1 ms 3420 KB Output is correct
44 Correct 1 ms 3420 KB Output is correct
45 Correct 1 ms 3416 KB Output is correct
46 Correct 5 ms 4268 KB Output is correct
47 Correct 4 ms 3932 KB Output is correct
48 Correct 3 ms 3932 KB Output is correct
49 Correct 3 ms 3932 KB Output is correct
50 Correct 3 ms 4188 KB Output is correct
51 Correct 5 ms 4300 KB Output is correct
52 Correct 13 ms 5468 KB Output is correct
53 Correct 13 ms 5448 KB Output is correct
54 Correct 13 ms 5468 KB Output is correct
55 Correct 2 ms 3932 KB Output is correct
56 Correct 3 ms 3932 KB Output is correct