oj.uz

답안 #570116

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
570116 2022-05-28T15:11:01 Z PanTkd Election (BOI18_election) C++14
0 / 100
 128 ms 262144 KB 
//
//  main.cpp
//
//  Created by Panagiotis Chadjicostas on
//  Copyright © Panagiotis Hadjicostas. All rights reserved.
//

#include <iostream>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <unordered_map>

using namespace std;

typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
#define fo(i,a,b) for(int i = a; i<=b; i++)
#define f(i,b) for(int i=0;i<b;i++)
#define F first
#define S second
#define sz size
#define ls s,m,idx<<1
#define rs m+1,e,idx<<1|1
const ll MOD=ll(1e9)+7;
const ll MAXN=2*ll(1e6);
void checker(){
    ll n=rand()%20+2;
    vi a(n,ll());
    for(ll i=0;i<n;i++){
        a[i]=rand()%20+2;
    }
    for(ll b=0;b<(1<<n);b++){
        vi on,off;
        for(ll i=0;i<n;i++){
            if(i&(1<<i)){
                on.push_back(i);
            }
            else{
                off.push_back(i);
            }
        }
    }
}
///////////////////////////////////////////////////////////////////////

struct ss{
    ll pr=0,sf=0,s=0,ans=0;
};
ss seg[2000002];
ss miden;
ss push(ss a,ss b){
    ss cc;
    cc.pr=max(a.pr,a.s+b.pr);
    cc.sf=max(b.sf,b.s+a.sf);
    cc.s=a.s+b.s;
    cc.ans = max(a.pr+b.sf, max(a.ans+b.s, b.ans+a.s));
}
void update(ll idx,ll s,ll e,ll u,ll val){
    if(s==e){
        seg[idx].pr = max(seg[idx].pr, val);
        seg[idx].sf = max(seg[idx].sf, val);
        seg[idx].s += val;
        seg[idx].ans = ((val == -1) ? 0 : 1);
        return;
    }
    ll m=(s+e)>>1;
    if(u<=m){
        update(idx<<1,s,m,u,val);
    }
    else{
        update(idx<<1|1,m+1,e,u,val);
    }
    seg[idx]=push(seg[idx<<1],seg[idx<<1|1]);
}
void solve(){
    ll n;cin>>n;
    string s;cin>>s;
    s=' '+s;
    for(ll i=1;i<=n;i++){
        update(1, 1, n, i, ((s[i] == 'C') ? -1 : 1));
    }
    ll q;cin>>q;

    while(q--){
        ll l,r;cin>>l>>r;
        string s1=s;
        ll sum=0,counter=0;
        for(ll i=l;i<=r;i++){
            if(s1[i]=='C'){
                sum++;
            }
            else if(s1[i]=='T')
                sum--;
            if(sum<0){
                counter++;
                sum++;
                s1[i]='N';
            }
        }
        sum=0;
        for(ll i=r;i>=l;i--){
            if(s1[i]=='C'){
                sum++;
            }
            else if(s1[i]=='T')
                sum--;
            if(sum<0){
                counter++;
                sum++;
                s1[i]='N';
            }
        }
        cout<<counter<<endl;
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll t=1;//cin>>t;
    while (t--) {
        solve();
    }
    return 0;
}

Compilation message

election.cpp: In function 'ss push(ss, ss)':
election.cpp:72:1: warning: no return statement in function returning non-void [-Wreturn-type]
   72 | }
      | ^

Subtask #1
0 / 28.0

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

Subtask #2
0 / 54.0

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

Subtask #3
0 / 18.0

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