oj.uz

답안 #571602

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
571602 2022-06-02T11:47:09 Z nttt Election (BOI18_election) C++14
0 / 100
 161 ms 262144 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(c.pr, c.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".inp" , "r" , stdin);
    //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;
}

Compilation message

election.cpp: In function 'int main()':
election.cpp:68:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |     freopen(task".inp" , "r" , stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 161 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 161 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 161 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -