oj.uz

Submission #655088

# Submission time Handle Problem Language Result Execution time Memory
655088 2022-11-03T02:29:06 Z DeMen100ns Street Lamps (APIO19_street_lamps) C++17
20 / 100
 1 ms 340 KB 
/*
Author : DeMen100ns (a.k.a Vo Khac Trieu)
School : VNU-HCM High school for the Gifted
fuck you adhoc
*/

#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5;
const long long INF = 1e18 + 7;
const int MAXA = 1e9;
const int B = sqrt(N) + 5;

int n, q;
string s;

string tme[105];
void subtask1(){
    tme[1] = s;
    for(int i = 1; i <= q; ++i){
        string type; cin >> type;

        tme[i + 1] = tme[i];

        if (type == "query"){
            int l, r; cin >> l >> r;
            --l; --r;
            int cnt = 0;
            for(int j = 1; j <= i; ++j){
                bool f = true;
                for(int k = l; k < r; ++k){
                    f &= (tme[j][k] == '1');
                }
                cnt += f;
            } cout << cnt << endl;
        } else {
            int p; cin >> p;
            tme[i + 1][p - 1] ^= 1;
        }
    }
}

void subtask2345(){
    //
}

void solve()
{
    cin >> n >> q;
    cin >> s;
    
    if (n <= 100 && q <= 100){
        subtask1();
    } else {
        subtask2345();
    }
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    // freopen("codeforces.inp","r",stdin);
    // freopen("codeforces.out","w",stdout);

    int t = 1; // cin >> t;
    while (t--)
    {
        solve();
    }
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 220 KB Output is correct
5 Correct 1 ms 216 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 220 KB Output is correct
5 Correct 1 ms 216 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Incorrect 0 ms 336 KB Output isn't correct
9 Halted 0 ms 0 KB -