oj.uz

Submission #145510

# Submission time Handle Problem Language Result Execution time Memory
145510 2019-08-20T10:06:15 Z Blagojce Election (BOI18_election) C++11
28 / 100
 3000 ms 1488 KB 
#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x),end(x)

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
ll const inf = 1e9;
ll const mod = 1e9 + 7;
ld const eps = 1e-9;

int main()
{
        int n, q;
        string s;
        cin >> n;
        cin >> s;
        cin >> q;
        int nulify[n];
        memset(nulify, -1, sizeof(nulify));

        fr(t, 0, q){
                int l, r;
                cin >> l >> r;
                l --, r --;
                int c = 0;
                int cnt = 0;
                fr(i, l, r + 1){
                        if(s[i] == 'C') c ++;
                        else c --;
                        if(c < 0){
                                cnt ++;
                                nulify[i] = t;
                                c ++;
                        }
                }
                c = 0;
                for(int i = r; i >= l; i --){
                        if(s[i] == 'C') c ++;
                        else if(nulify[i] != t) c --;
                        if(c < 0){
                                cnt ++;
                                c ++;
                        }
                }
                cout << cnt << endl;

        }
        return 0;
}

Subtask #1
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 376 KB Output is correct
2 Correct 19 ms 376 KB Output is correct
3 Correct 18 ms 376 KB Output is correct
4 Correct 19 ms 376 KB Output is correct
5 Correct 13 ms 380 KB Output is correct

Subtask #2
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 376 KB Output is correct
2 Correct 19 ms 376 KB Output is correct
3 Correct 18 ms 376 KB Output is correct
4 Correct 19 ms 376 KB Output is correct
5 Correct 13 ms 380 KB Output is correct
6 Execution timed out 3045 ms 1488 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 376 KB Output is correct
2 Correct 19 ms 376 KB Output is correct
3 Correct 18 ms 376 KB Output is correct
4 Correct 19 ms 376 KB Output is correct
5 Correct 13 ms 380 KB Output is correct
6 Execution timed out 3045 ms 1488 KB Time limit exceeded
7 Halted 0 ms 0 KB -