oj.uz

답안 #289286

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
289286 2020-09-02T14:12:11 Z NaimSS Election (BOI18_election) C++14
100 / 100
 798 ms 29360 KB 
#include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());
#define sz(v) (int)v.size()
//#define int long long
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
#define left sefude
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl; 
typedef long long ll;
typedef pair<int,int> pii;
inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll a,ll b,ll m){
    if(b==0LL) return 1LL;
    if(b==1LL) return mod(a,m);
    ll k = mod(exp(a,b/2,m),m);
    if(b&1LL){
        return mod(a*mod(k*k,m),m);
    }
    else return mod(k*k,m);
}
const int N = 500100;
struct node{
  int pre,suf,tot;
  int ans;
  node(){}
  node(int x){
    pre = suf = tot = ans = x;
  }
  node operator+(const node &o)const{
    node r;
    r.pre = max(pre,tot + o.pre);
    r.suf = max(o.suf,o.tot + suf);
    r.tot = tot + o.tot;
    r.ans = max({ans + o.tot,o.ans + tot,pre + o.suf});
    return r;
  }
}tree[4*N];

int v[N];
void build(int no,int i,int j){
  if(i == j){
    tree[no].pre = max(v[i],0);
    tree[no].suf = max(v[i],0);
    tree[no].tot = v[i];
    tree[no].ans = (v[i] < 0 ? 0 : 1);
    return;
  }
  int mid = (i+j)>>1,l=no<<1,r=no<<1|1;
  build(l,i,mid);build(r,mid+1,j);
  tree[no] = tree[l] + tree[r];
}

node query(int no,int i,int j,int a,int b){
  if(i > j || i > b || j < a)return node(-1);
  if(a<=i and j<=b)return tree[no];
  int mid = (i+j)>>1,l=no<<1,r=no<<1|1;
  node op1 = query(l,i,mid,a,b),op2 = query(r,mid+1,j,a,b);
  if(op1.ans == -1)return op2;
  if(op2.ans == -1)return op1;
  return op1 + op2;
}

int32_t main(){
  fastio;
  int n;
  cin >> n;
  for(int i=1;i<=n;i++){
    char c;
    cin>>c;
    v[i] = (c == 'C' ? -1 : 1);
  }
  build(1,1,n);
  int q;
  cin >> q;
  while(q--){
    int l,r;
    cin>>l>>r;
    cout << query(1,1,n,l,r).ans<<endl;
  }

  // math -> gcd it all
  // Did u check N=1? Did you switch N,M?
}

Subtask #1
28.0 / 28.0

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

Subtask #2
54.0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 77 ms 6008 KB Output is correct
7 Correct 65 ms 5940 KB Output is correct
8 Correct 82 ms 5880 KB Output is correct
9 Correct 59 ms 5880 KB Output is correct
10 Correct 64 ms 5880 KB Output is correct
11 Correct 70 ms 6008 KB Output is correct
12 Correct 70 ms 6008 KB Output is correct
13 Correct 68 ms 6008 KB Output is correct
14 Correct 72 ms 6008 KB Output is correct
15 Correct 68 ms 6008 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 77 ms 6008 KB Output is correct
7 Correct 65 ms 5940 KB Output is correct
8 Correct 82 ms 5880 KB Output is correct
9 Correct 59 ms 5880 KB Output is correct
10 Correct 64 ms 5880 KB Output is correct
11 Correct 70 ms 6008 KB Output is correct
12 Correct 70 ms 6008 KB Output is correct
13 Correct 68 ms 6008 KB Output is correct
14 Correct 72 ms 6008 KB Output is correct
15 Correct 68 ms 6008 KB Output is correct
16 Correct 710 ms 28536 KB Output is correct
17 Correct 613 ms 28092 KB Output is correct
18 Correct 657 ms 28408 KB Output is correct
19 Correct 545 ms 27704 KB Output is correct
20 Correct 743 ms 27512 KB Output is correct
21 Correct 779 ms 29360 KB Output is correct
22 Correct 798 ms 29168 KB Output is correct
23 Correct 752 ms 29304 KB Output is correct
24 Correct 710 ms 29036 KB Output is correct
25 Correct 766 ms 28536 KB Output is correct