oj.uz

답안 #571605

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
571605 2022-06-02T11:48:08 Z nttt Election (BOI18_election) C++14
100 / 100
 498 ms 30076 KB 
#include<bits/stdc++.h>
using namespace std;
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x >> (i)) & 1)
#define fi first
#define se second
#define ll long long
#define task "name" 

const int oo = 1e9 + 7;
const ll loo = (ll)1e18 + 7;
const int MOD = 1e9 + 7;
const int N = 5e5 + 3;
const int BASE = 10;

template <typename T1, typename T2> bool minimize(T1 &a, T2 b)
{
    if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b)
{
    if (a < b) {a = b; return true;} return false;
}

struct nodes
{
    int sum = 0;
    int pr = 0;
    int sf = 0;
    int ans = 0;
} node[4 * N], base;
int n;
string s;
int a[N];
nodes add(nodes a, nodes b) {
	nodes c;
	c.sum = a.sum + b.sum;
	c.pr = max(a.pr, a.sum + b.pr);
	c.sf = max(b.sf, b.sum + a.sf);
	c.ans = max(a.sum + b.ans, a.ans + b.sum);
	c.ans = max(c.ans, a.pr + b.sf);
	return c;
}
void build(int id, int l, int r)
{
    if (l == r) 
    {
	    node[id].sum = a[l];
		maximize(node[id].pr, a[l]);
		maximize(node[id].sf, a[l]);
		maximize(node[id].ans, a[l]);
		return;
	}
    int mid = (l + r)/2;
	build(id * 2, l, mid);
    build(id * 2 + 1, mid + 1, r);
	node[id] = add(node[id * 2], node[id * 2 + 1]);
}
nodes get(int id, int l, int r, int u, int v)
{
    if (r < u || v < l || l > r) return base;
	if (u <= l && r <= v) return node[id];
    int mid = (l + r)/2;
	return add(get(id * 2, l, mid, u, v), get(id * 2 + 1, mid + 1, r, u, v));
}
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    //freopen(task".out" , "w" , stdout);
    
    cin >> n >> s;
    for (int i = 0; i < n; i++)
    {
        if(s[i] == 'T') a[i + 1] = 1;
        else a[i + 1] = -1;
    }
    build(1, 1, n);
    int q;
    cin >> q;
    while(q--)
    {
        int l, r;
        cin >> l >> r;
        cout << get(1, 1, n, l, r).ans << '\n';
    }

    return 0;
}

Subtask #1
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 428 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #2
54.0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 428 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 46 ms 6064 KB Output is correct
7 Correct 47 ms 5976 KB Output is correct
8 Correct 46 ms 5948 KB Output is correct
9 Correct 42 ms 5964 KB Output is correct
10 Correct 45 ms 5964 KB Output is correct
11 Correct 48 ms 6172 KB Output is correct
12 Correct 46 ms 6148 KB Output is correct
13 Correct 45 ms 6172 KB Output is correct
14 Correct 48 ms 6112 KB Output is correct
15 Correct 45 ms 6040 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 428 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 46 ms 6064 KB Output is correct
7 Correct 47 ms 5976 KB Output is correct
8 Correct 46 ms 5948 KB Output is correct
9 Correct 42 ms 5964 KB Output is correct
10 Correct 45 ms 5964 KB Output is correct
11 Correct 48 ms 6172 KB Output is correct
12 Correct 46 ms 6148 KB Output is correct
13 Correct 45 ms 6172 KB Output is correct
14 Correct 48 ms 6112 KB Output is correct
15 Correct 45 ms 6040 KB Output is correct
16 Correct 498 ms 28844 KB Output is correct
17 Correct 360 ms 28640 KB Output is correct
18 Correct 423 ms 28900 KB Output is correct
19 Correct 341 ms 28228 KB Output is correct
20 Correct 416 ms 28088 KB Output is correct
21 Correct 434 ms 29812 KB Output is correct
22 Correct 432 ms 29648 KB Output is correct
23 Correct 433 ms 30076 KB Output is correct
24 Correct 429 ms 29500 KB Output is correct
25 Correct 429 ms 29080 KB Output is correct