oj.uz

Submission #64506

# Submission time Handle Problem Language Result Execution time Memory
64506 2018-08-04T16:50:31 Z antimirage Election (BOI18_election) C++17
100 / 100
 1140 ms 37400 KB 
#include <algorithm>
#include <iostream>
#include <assert.h>
#include <string.h>
#include <stdio.h>
#include <iomanip>
#include <utility>
#include <math.h>
#include <time.h>
#include <vector>
#include <set>
#include <map>

#define fr first
#define sc second
#define mk make_pair
#define pb push_back
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()

using namespace std;

const int N = 5e5 + 5;

int n, tests, L, R, ans[N];

pair <int, int> t[N * 4];

char s[N];

vector < pair <int, int> > vec[N];

vector <int> st;

pair <int, int> combine (pair <int, int> a, pair <int, int> b)
{
    pair <int, int> c = mk( a.fr + b.fr, min( b.sc, a.sc + b.fr ) );
    return c;
}

void build (int v = 1, int tl = 1, int tr = n)
{
    if (tl == tr)
        t[v].fr = (s[tl] == 'C' ? 1 : -1), t[v].sc = t[v].fr;
    else
    {
        int tm = (tl + tr) >> 1;
        build( v + v, tl ,tm );
        build( v + v + 1, tm + 1 ,tr );

        t[v] = combine( t[v + v], t[v + v + 1] );
    }
}
void update (int pos, int val, int v = 1, int tl = 1, int tr = n)
{
    if (tl == tr)
        t[v] = mk( val, val );
    else
    {
        int tm = (tl + tr) >> 1;
        if (pos <= tm)
            update( pos, val, v + v, tl, tm );
        else
            update( pos, val, v + v + 1, tm + 1, tr );

        t[v] = combine( t[v + v], t[v + v + 1] );
    }
}
pair <int, int> get (int l, int r, int v = 1, int tl = 1, int tr = n)
{
    if (tl > r || l > tr)
        return mk(0, 0);

    if (l <= tl && tr <= r)
        return t[v];

    int tm = (tl + tr) >> 1;

    return combine( get(l, r, v + v, tl, tm), get(l, r, v + v + 1, tm + 1, tr) );
}
main()
{
    cin >> n;
    scanf("%s", s + 1);
    cin >> tests;

    for (int i = 1; i <= tests; i++)
    {
        scanf("%d%d", &L, &R);
        vec[L].pb( mk(R, i) );
    }
    build ();

    for (int i = n; i >= 1; i--)
    {
        if (s[i] == 'T')
        {
            update(i, 0);
            st.pb(i);
        }
        else if (!st.empty() )
        {
            update(st.back(), -1);
            st.pop_back();
        }
        for (auto to : vec[i])
        {
            int res = upper_bound( st.rbegin(), st.rend(), to.fr ) - st.rbegin();
            res += max(0, -get( i, to.fr ).sc );
            ans[to.sc] = res;
        }
    }
    for (int i = 1; i <= tests; i++)
        printf("%d\n", ans[i]);
}

Compilation message

election.cpp:81:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
election.cpp: In function 'int main()':
election.cpp:84:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", s + 1);
     ~~~~~^~~~~~~~~~~~~
election.cpp:89:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &L, &R);
         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 12156 KB Output is correct
2 Correct 18 ms 12264 KB Output is correct
3 Correct 15 ms 12264 KB Output is correct
4 Correct 15 ms 12284 KB Output is correct
5 Correct 15 ms 12300 KB Output is correct

Subtask #2
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 12156 KB Output is correct
2 Correct 18 ms 12264 KB Output is correct
3 Correct 15 ms 12264 KB Output is correct
4 Correct 15 ms 12284 KB Output is correct
5 Correct 15 ms 12300 KB Output is correct
6 Correct 118 ms 16416 KB Output is correct
7 Correct 89 ms 16416 KB Output is correct
8 Correct 103 ms 16416 KB Output is correct
9 Correct 104 ms 16448 KB Output is correct
10 Correct 122 ms 16448 KB Output is correct
11 Correct 163 ms 16700 KB Output is correct
12 Correct 146 ms 16700 KB Output is correct
13 Correct 138 ms 16844 KB Output is correct
14 Correct 124 ms 16844 KB Output is correct
15 Correct 115 ms 16844 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 12156 KB Output is correct
2 Correct 18 ms 12264 KB Output is correct
3 Correct 15 ms 12264 KB Output is correct
4 Correct 15 ms 12284 KB Output is correct
5 Correct 15 ms 12300 KB Output is correct
6 Correct 118 ms 16416 KB Output is correct
7 Correct 89 ms 16416 KB Output is correct
8 Correct 103 ms 16416 KB Output is correct
9 Correct 104 ms 16448 KB Output is correct
10 Correct 122 ms 16448 KB Output is correct
11 Correct 163 ms 16700 KB Output is correct
12 Correct 146 ms 16700 KB Output is correct
13 Correct 138 ms 16844 KB Output is correct
14 Correct 124 ms 16844 KB Output is correct
15 Correct 115 ms 16844 KB Output is correct
16 Correct 1140 ms 35736 KB Output is correct
17 Correct 821 ms 35736 KB Output is correct
18 Correct 852 ms 35736 KB Output is correct
19 Correct 990 ms 35736 KB Output is correct
20 Correct 977 ms 35736 KB Output is correct
21 Correct 1128 ms 37116 KB Output is correct
22 Correct 954 ms 37116 KB Output is correct
23 Correct 1135 ms 37400 KB Output is correct
24 Correct 1109 ms 37400 KB Output is correct
25 Correct 1039 ms 37400 KB Output is correct