oj.uz

Submission #736647

# Submission time Handle Problem Language Result Execution time Memory
736647 2023-05-06T04:11:26 Z Magikarp4000 Street Lamps (APIO19_street_lamps) C++17
20 / 100
 113 ms 13504 KB 
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;

const int MAXN = 3e5+1;
int n,q;
string s;
int w[MAXN], old[MAXN], cnt[MAXN];
pair<bool,PII> qrs[MAXN];

signed main() {
    OPTM;
    cin >> n >> q >> s;
    FOR(i,1,n+1) w[i] = s[i-1]-'0';
    FOR(i,0,q) {
        string t; cin >> t;
        if (t == "toggle") {
            int x; cin >> x;
            if (w[x] == 1) cnt[x] += i+1-old[x];
            else old[x] = i+1;
            w[x] ^= 1;
            qrs[i] = {0,{x,-1}};
        }
        else {
            int a,b; cin >> a >> b;
            int res = 0;
            FOR(j,a,b) {
                res += cnt[j];
                if (w[j]) res += i+1-old[j];
            }
            cout << res << ln;
            qrs[i] = {1,{a,b}};
        }
    }
}

Subtask #1
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 #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 7952 KB Output is correct
2 Correct 69 ms 8236 KB Output is correct
3 Correct 75 ms 8736 KB Output is correct
4 Correct 113 ms 13504 KB Output is correct
5 Correct 100 ms 12832 KB Output is correct
6 Correct 79 ms 13340 KB Output is correct
7 Correct 101 ms 11896 KB Output is correct
8 Correct 98 ms 13256 KB Output is correct

Subtask #3
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 #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 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 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -