oj.uz

Submission #983120

# Submission time Handle Problem Language Result Execution time Memory
983120 2024-05-15T08:26:07 Z vjudge1 Street Lamps (APIO19_street_lamps) C++17
20 / 100
 366 ms 7920 KB 
#include <time.h>
#include <cstdlib>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <map>
#include <set>
#include <iterator>
#include <deque>
#include <queue>
#include <sstream>
#include <array>
#include <string>
#include <tuple>
#include <chrono>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <list>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <bitset>

using namespace std;

int tt = 1, n;
string s;
int k[1001][1001];
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n >> tt;
    cin >> s;
    // if(n <= 100 && tt <= 100){
        while(tt--){
            string type;
            cin >> type;
            // cout << s << "\n";
            for(int i = 1; i <= n; i++){
                for(int j = i + 1; j <= n + 1; j++){
                    if(s[j - 2] == '1') k[i][j]++;
                    else break;
                }
            }
            if(type[0] == 'q'){
                int a, b;
                cin >> a >> b;
                cout << k[a][b] << "\n";
            }
            else{
                int p;
                cin >> p;
                if(s[p - 1] == '0') s[p - 1] = '1';
                else s[p - 1] = '0';

            }
        }
    // }

}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 3488 KB Output is correct
2 Correct 310 ms 7272 KB Output is correct
3 Runtime error 4 ms 6744 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4188 KB Output is correct
2 Correct 11 ms 4376 KB Output is correct
3 Correct 14 ms 4184 KB Output is correct
4 Correct 366 ms 4556 KB Output is correct
5 Runtime error 3 ms 6128 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3212 KB Output is correct
2 Correct 4 ms 3676 KB Output is correct
3 Correct 4 ms 3676 KB Output is correct
4 Correct 6 ms 3932 KB Output is correct
5 Runtime error 5 ms 7920 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 138 ms 3488 KB Output is correct
9 Correct 310 ms 7272 KB Output is correct
10 Runtime error 4 ms 6744 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -