oj.uz

Submission #729831

# Submission time Handle Problem Language Result Execution time Memory
729831 2023-04-24T17:17:35 Z edogawa_something Election (BOI18_election) C++17
28 / 100
 12 ms 972 KB 
#include<bits/stdc++.h>
#include<chrono>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef bool bl;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
typedef vector<pii> vpi;
#define ordered_set tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update>
#define fast ios_base::sync_with_stdio(0);cin.tie();
#define test ll qqqqq;cin>>qqqqq;while(qqqqq--)
#define test1 ll qqqqq=1;while(qqqqq--)
#define F first
#define S second
#define forn(i,n) for(int i=0;i<n;i++)
#define forx(i,j,n) for(int i=j;i<n;i++)
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define all(v) v.begin(),v.end()
#define lb lower_bound
#define ub upper_bound
#define pow powww
#define prtll(x) printf("%lld",x)
#define prtld(x) printf("%Lf",x)
#define prtst(x) printf("%s",x)
#define prtch(x) printf("%c",x)
#define measure chrono::high_resolution_clock::now()
#define duration chrono::duration_cast<chrono::milliseconds>(end-start)
const ll dx[]{1,0,-1,0};
const ll dy[]{0,-1,0,1};
const ll inf=1e18;
const ll mod=1e9+7;
const ll LM=1e8+1;
const ll M=1e6+10;
const ll MM=2002;
const ll MMM=501;
const ld pi=acos(-1);
//const ll mod=998244353;
ll pow(ll r,ll to,ll m=mod){
  ll res=1;
  r%=m;
  while(to){
    if((to&1)){
      res*=r,res%=m;
    }
    r*=r,r%=m;
    to=(to>>1);
  }
  return res;
}
ll n,q;
bl vis[2001];
str s;
int main(){
  fast
  //freopen("gen.txt","r",stdin);
  auto start=measure;
  test1{
    cin>>n>>s;
    cin>>q;
    while(q--){
      memset(vis,0,sizeof vis);
      ll l,r;
      cin>>l>>r;
      l--,r--;
      ll cnt=0;
      forx(i,l,r+1){
        if(vis[i])
        continue;
        if(s[i]=='C')
        cnt++;
        else
        cnt--;
        if(cnt<0)
        cnt=0,vis[i]=1;
      }
      cnt=0;
      for(int i=r;i>=l;i--){
        if(vis[i])
        continue;
        if(s[i]=='C')
        cnt++;
        else
        cnt--;
        if(cnt<0)
        cnt=0,vis[i]=1;
      }
      ll ans=0;
      forx(i,l,r+1)
      ans+=vis[i];
      cout<<ans<<'\n';
    }
  }
  auto end=measure;
  auto dur=duration;
  //cout<<fixed<<dur.count()<<'\n';
  return 0;
}

Subtask #1
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 348 KB Output is correct
2 Correct 12 ms 336 KB Output is correct
3 Correct 9 ms 332 KB Output is correct
4 Correct 9 ms 348 KB Output is correct
5 Correct 6 ms 336 KB Output is correct

Subtask #2
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 348 KB Output is correct
2 Correct 12 ms 336 KB Output is correct
3 Correct 9 ms 332 KB Output is correct
4 Correct 9 ms 348 KB Output is correct
5 Correct 6 ms 336 KB Output is correct
6 Runtime error 1 ms 972 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 348 KB Output is correct
2 Correct 12 ms 336 KB Output is correct
3 Correct 9 ms 332 KB Output is correct
4 Correct 9 ms 348 KB Output is correct
5 Correct 6 ms 336 KB Output is correct
6 Runtime error 1 ms 972 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -