oj.uz

Submission #392634

# Submission time Handle Problem Language Result Execution time Memory
392634 2021-04-21T11:46:01 Z codebuster_10 Election (BOI18_election) C++17
28 / 100
 3000 ms 1020 KB 
#include <bits/stdc++.h>

using namespace std ;

#define int int64_t //be careful about this 
#define endl "\n"
#define f(i,a,b) for(int i=int(a);i<int(b);++i)

#define pr pair
#define ar array
#define fr first
#define sc second
#define vt vector
#define pb push_back
#define eb emplace_back
#define LB lower_bound  
#define UB upper_bound
#define PQ priority_queue

#define sz(x) ((int)(x).size())
#define all(a) (a).begin(),(a).end()
#define allr(a) (a).rbegin(),(a).rend()
#define mem0(a) memset(a, 0, sizeof(a))
#define mem1(a) memset(a, -1, sizeof(a))

template<class A> void rd(vt<A>& v);
template<class T> void rd(T& x){ cin >> x; }
template<class H, class... T> void rd(H& h, T&... t) { rd(h) ; rd(t...) ;}
template<class A> void rd(vt<A>& x) { for(auto& a : x) rd(a) ;}

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

template<typename T>
void __p(T a) {
  cout<<a; 
}
template<typename T, typename F>
void __p(pair<T, F> a) {
  cout<<"{";
  __p(a.first);
  cout<<",";
  __p(a.second);
  cout<<"}\n"; 
}
template<typename T>
void __p(std::vector<T> a) {
  cout<<"{";
  for(auto it=a.begin(); it<a.end(); it++)
    __p(*it),cout<<",}\n"[it+1==a.end()]; 
}
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) {
  __p(a1);
  __p(a...);
}
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
  cout<<name<<" : ";
  __p(arg1);
  cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
  int bracket=0,i=0;
  for(;; i++)
    if(names[i]==','&&bracket==0)
      break;
    else if(names[i]=='(')
      bracket++;
    else if(names[i]==')')
      bracket--;
  const char *comma=names+i;
  cout.write(names,comma-names)<<" : ";
  __p(arg1);
  cout<<" | ";
  __f(comma+1,args...);
}

void setIO(string s = "") {
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); 
  cin.exceptions(cin.failbit); 
	cout.precision(15);	cout << fixed;
  #ifdef ONLINE_JUDGE
  if(sz(s)){
  	freopen((s+".in").c_str(),"r",stdin);
  	freopen((s+".out").c_str(),"w",stdout);
  }
  #define __f(...) 0
  #endif
}
int solve(string s){
  int n = sz(s);
  int now = 0;
  vt<bool> removed(n,false);
  f(i,0,n){
  	if(s[i] == 'T'){
  		if(now) now--;
  		else removed[i] = true;
  	}else{
  		now++;
  	}
  }
  now = 0;
  for(int i = n-1; i >= 0; --i){
  	if(removed[i]) continue;
  	if(s[i] == 'T'){
  		if(now) now--;
  		else removed[i] = true;
  	}else{
  		now++;
  	}
  }
  int ans = 0;
  for(auto i : removed) if(i) ans++;
  return ans;
}
signed main(){
  setIO() ;
  int n; rd(n);
  string s; rd(s);
  int q; rd(q);
  while(q--){
  	int l,r; rd(l,r); --l;
  	cout << solve(s.substr(l,r-l)) << endl ;
  }
}

Subtask #1
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 332 KB Output is correct
2 Correct 11 ms 332 KB Output is correct
3 Correct 7 ms 332 KB Output is correct
4 Correct 7 ms 332 KB Output is correct
5 Correct 6 ms 332 KB Output is correct

Subtask #2
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 332 KB Output is correct
2 Correct 11 ms 332 KB Output is correct
3 Correct 7 ms 332 KB Output is correct
4 Correct 7 ms 332 KB Output is correct
5 Correct 6 ms 332 KB Output is correct
6 Execution timed out 3067 ms 1020 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 332 KB Output is correct
2 Correct 11 ms 332 KB Output is correct
3 Correct 7 ms 332 KB Output is correct
4 Correct 7 ms 332 KB Output is correct
5 Correct 6 ms 332 KB Output is correct
6 Execution timed out 3067 ms 1020 KB Time limit exceeded
7 Halted 0 ms 0 KB -