oj.uz

Submission #982988

# Submission time Handle Problem Language Result Execution time Memory
982988 2024-05-15T06:29:22 Z vjudge1 Street Lamps (APIO19_street_lamps) C++17
40 / 100
 86 ms 9836 KB 
#include<bits/stdc++.h>
#define sz size()
#define ll long long
using namespace std;


ll cnt[205][205];
void solve()
{
    ll n, q, i, j, k;
    cin >> n >> q;
    string s;
    cin >> s;

    ll a[n + 1], sum[n + 1] = {}, lst[n + 1] = {};
    for(i = 1; i <= n; ++i)
        a[i] = s[i - 1] - '0';

    if(n <= 200 && q <= 200)
    {
        for(i = 1; i <= n; ++i)
            for(j = i; j <= n; ++j)
            {
                if(!a[j]) break;
                ++cnt[i][j];
            }
        while(q--)
        {
            cin >> s;
            ll l, r;
            if(s == "toggle")
                cin >> l,
                a[l] ^= 1;
            else
                cin >> l >> r,
                cout << cnt[l][r - 1] << '\n';
            for(i = 1; i <= n; ++i)
                for(j = i; j <= n; ++j)
                {
                    if(!a[j]) break;
                    ++cnt[i][j];
                }
        }
    }

    for(i = 1; i <= q; ++i)
    {
        cin >> s;
        ll l, r;
        if(s == "toggle")
        {
            cin >> l;
            sum[l] += (i - lst[l]) * a[l];
            a[l] ^= 1;
            lst[l] = i;
            continue;
        }
        cin >> l >> r;
        cout << sum[l] + (i - lst[l]) * a[l] << '\n';
    }

}

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

Compilation message

street_lamps.cpp: In function 'void solve()':
street_lamps.cpp:10:20: warning: unused variable 'k' [-Wunused-variable]
   10 |     ll n, q, i, j, k;
      |                    ^

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 1364 KB Output is correct
2 Correct 53 ms 1424 KB Output is correct
3 Correct 55 ms 1360 KB Output is correct
4 Correct 71 ms 8564 KB Output is correct
5 Correct 77 ms 8936 KB Output is correct
6 Correct 62 ms 8416 KB Output is correct
7 Correct 83 ms 8412 KB Output is correct
8 Correct 86 ms 9836 KB Output is correct

Subtask #3
0 / 20.0

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

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 50 ms 1364 KB Output is correct
9 Correct 53 ms 1424 KB Output is correct
10 Correct 55 ms 1360 KB Output is correct
11 Correct 71 ms 8564 KB Output is correct
12 Correct 77 ms 8936 KB Output is correct
13 Correct 62 ms 8416 KB Output is correct
14 Correct 83 ms 8412 KB Output is correct
15 Correct 86 ms 9836 KB Output is correct
16 Incorrect 0 ms 348 KB Output isn't correct
17 Halted 0 ms 0 KB -