oj.uz

답안 #983294

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
983294 2024-05-15T09:59:28 Z vjudge1 가로등 (APIO19_street_lamps) C++17
60 / 100
 161 ms 40684 KB 
#include<bits/stdc++.h>
#define sz size()
#define ll long long
using namespace std;
const ll N = 4e6;

ll f[N], s[N], T = 1;
ll fget(ll i, ll res = 0)
{
    for(; i > 0; i -= (i & -i))
        res += f[i];
    return res;
}
void fupd(ll i, ll x)
{
    for(; i < N; i += (i & -i))
        f[i] += x;
}

ll get(ll l, ll r, ll res = 0)
{
    l += T - 1, r += T - 1;
    for(; l <= r; l >>= 1, r >>= 1)
    {
        if(l % 2 == 1) res = max(res, s[l++]);
        if(r % 2 == 0) res = max(res, s[r--]);
    }
    return res;
}
void upd(ll i, ll x)
{
    i += T - 1;
    s[i] = x;
    for(; i > 1; i >>= 1)
        s[i >> 1] = max(s[i], s[i ^ 1]);
}

ll cnt[205][205];
void solve()
{
    ll n, q, i, j, k;
    cin >> n >> q;
    while(T < n) T <<= 1;
    string st;
    cin >> st;

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

    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 >> st;
            ll l, r;
            if(st == "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];
                }
        }
        return;
    }

    string s1[q + 1];
    ll l1[q + 1], r1[q + 1] = {};
    ll ok = 1;
    for(i = 1; i <= q; ++i)
    {
        cin >> s1[i] >> l1[i];
        if(s1[i] == "query")
        {
            cin >> r1[i];
            ok &= (r1[i] - l1[i] == 1);
        }
    }

    if(ok)
    {
        for(i = 1; i <= q; ++i)
        {
            st = s1[i];
            ll l = l1[i], r = r1[i];
            if(st == "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';
        }
        return;
    }

    for(i = 1; i <= q; ++i)
    {
        st = s1[i];
        ll l = l1[i], r = r1[i];
        if(st == "toggle")
        {
            a[l] ^= 1;
            fupd(l, a[l]);
            upd(l, i);
            continue;
        }
        ll ans = 0;
        if(fget(r - 1) - fget(l - 1) == r - l)
            ans = (i - get(l, r - 1));
        cout << ans << '\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:41:20: warning: unused variable 'k' [-Wunused-variable]
   41 |     ll n, q, i, j, k;
      |                    ^

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10844 KB Output is correct
5 Correct 2 ms 10844 KB Output is correct
6 Correct 2 ms 10588 KB Output is correct
7 Correct 2 ms 10844 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 25684 KB Output is correct
2 Correct 72 ms 25680 KB Output is correct
3 Correct 90 ms 25680 KB Output is correct
4 Correct 118 ms 32740 KB Output is correct
5 Correct 101 ms 33252 KB Output is correct
6 Correct 105 ms 32740 KB Output is correct
7 Correct 116 ms 32996 KB Output is correct
8 Correct 114 ms 34180 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 90 ms 40464 KB Output is correct
6 Correct 99 ms 40680 KB Output is correct
7 Correct 108 ms 40684 KB Output is correct
8 Correct 153 ms 34064 KB Output is correct
9 Correct 67 ms 22864 KB Output is correct
10 Correct 74 ms 23888 KB Output is correct
11 Correct 76 ms 23868 KB Output is correct
12 Correct 120 ms 32744 KB Output is correct
13 Correct 161 ms 34280 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Incorrect 2 ms 12636 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10844 KB Output is correct
5 Correct 2 ms 10844 KB Output is correct
6 Correct 2 ms 10588 KB Output is correct
7 Correct 2 ms 10844 KB Output is correct
8 Correct 69 ms 25684 KB Output is correct
9 Correct 72 ms 25680 KB Output is correct
10 Correct 90 ms 25680 KB Output is correct
11 Correct 118 ms 32740 KB Output is correct
12 Correct 101 ms 33252 KB Output is correct
13 Correct 105 ms 32740 KB Output is correct
14 Correct 116 ms 32996 KB Output is correct
15 Correct 114 ms 34180 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12636 KB Output is correct
18 Correct 2 ms 12636 KB Output is correct
19 Correct 2 ms 10588 KB Output is correct
20 Correct 90 ms 40464 KB Output is correct
21 Correct 99 ms 40680 KB Output is correct
22 Correct 108 ms 40684 KB Output is correct
23 Correct 153 ms 34064 KB Output is correct
24 Correct 67 ms 22864 KB Output is correct
25 Correct 74 ms 23888 KB Output is correct
26 Correct 76 ms 23868 KB Output is correct
27 Correct 120 ms 32744 KB Output is correct
28 Correct 161 ms 34280 KB Output is correct
29 Correct 2 ms 12632 KB Output is correct
30 Incorrect 2 ms 12636 KB Output isn't correct
31 Halted 0 ms 0 KB -