oj.uz

답안 #145227

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
145227 2019-08-19T10:42:30 Z shashwatchandra Election (BOI18_election) C++17
28 / 100
 13 ms 1016 KB 
/*input
11
CCCTTTTTTCC
3
1 11
4 9
1 6
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define int long long 
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back

#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define REP(i,n) for (int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)

#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define print(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout << *it << " "; cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x,y) cout << x << " " << y << endl;
#define debug3(x,y,z) cout << x << " " << y << " " << z << endl;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;

const int INF = 1e18+1;
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264338;

int raise(int a,int n,int m = MOD){
  if(n == 0)return 1;
  if(n == 1)return a;
  int x = 1;
    x *= raise(a,n/2,m);
    x %= m;
    x *= x;
    x %= m;
    if(n%2)x*= a;
    x %= m;
    return x;
}

int floor1(int n,int k){
    if(n%k == 0 || n >= 0)return n/k;
    return (n/k)-1;
}

int ceil1(int n,int k){
    return floor1(n+k-1,k);
}

const int N = 2001;
bool vt[N];
int n;
int q;
string s;

void solve(){
    cin >> n >> s;
    cin >> q;
    while(q--){
      int l,r;cin >> l >> r;
      l--;r--;
      int dd = 0;
      for(int i = l;i <= r;i++){
        if(s[i] == 'T'){
          dd--;
          if(dd == -1){
            dd = 0;
            vt[i] = 1;
          }
        }
        else{
          dd++;
        }
      }
      dd = 0;
      for(int i = r;i > l-1;i--){
        if(vt[i])continue;
        if(s[i] == 'T'){
          dd--;
          if(dd == -1){
            dd = 0;
            vt[i] = 1;
          }
        }
        else{
          dd++;
        }
      }
      int res =0;
      for(int i = l;i <= r;i++){
        res += vt[i];
        vt[i] = 0;
      }
      cout << res << "\n";
    }
}

signed main(){
  ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  //freopen(".in","r",stdin);freopen(".out","w",stdout);
  int t = 1;
  //cin >> t;
  while(t--){
    solve();
  }
  return 0;
}

Subtask #1
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 504 KB Output is correct
2 Correct 12 ms 376 KB Output is correct
3 Correct 10 ms 376 KB Output is correct
4 Correct 12 ms 520 KB Output is correct
5 Correct 6 ms 376 KB Output is correct

Subtask #2
0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 504 KB Output is correct
2 Correct 12 ms 376 KB Output is correct
3 Correct 10 ms 376 KB Output is correct
4 Correct 12 ms 520 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Runtime error 3 ms 1016 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 504 KB Output is correct
2 Correct 12 ms 376 KB Output is correct
3 Correct 10 ms 376 KB Output is correct
4 Correct 12 ms 520 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Runtime error 3 ms 1016 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Halted 0 ms 0 KB -