oj.uz

답안 #742337

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
742337 2023-05-16T06:26:19 Z becaido 가로등 (APIO19_street_lamps) C++17
100 / 100
 1183 ms 89196 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int SIZE = 3e5 + 5;

int n, q;
string str;
int ans[SIZE];
set<pair<int, int>> s;
array<int, 3> ask[SIZE];
vector<array<int, 4>> op;

void add(int u, int d, int l, int r, int x, int t) {
    op.pb(array<int, 4>{d, r, x, t});
    op.pb(array<int, 4>{d, l - 1, -x, t});
    op.pb(array<int, 4>{u - 1, r, -x, t});
    op.pb(array<int, 4>{u - 1, l - 1, x, t});
}
void add(int p, int x, int t) {
    int l = p, r = p;
    auto it = s.lower_bound({p + 1, 0});
    if (it != s.end() && it->F == p + 1) {
        r = it->S;
        s.erase(it);
    }
    it = s.lower_bound({p + 1, 0});
    if (it != s.begin() && prev(it)->S == p - 1) {
        it--;
        l = it->F;
        s.erase(it);
    }
    s.emplace(l, r);
    add(l, p, p, r, x, t);
}
void del(int p, int x, int t) {
    auto it = prev(s.lower_bound({p + 1, 0}));
    auto [l, r] = *it;
    s.erase(it);
    if (l < p) s.emplace(l, p - 1);
    if (p < r) s.emplace(p + 1, r);
    add(l, p, p, r, -x, t);
}

inline bool cmp(const array<int, 4>& lhs, const array<int, 4>& rhs) {
    return lhs[3] != rhs[3] ? lhs[3] < rhs[3] : lhs[0] != rhs[0] ? lhs[0] > rhs[0] : lhs[1] != rhs[1] ? lhs[1] > rhs[1] : lhs[2] != 0;
}
inline bool cmp2(const array<int, 4>& lhs, const array<int, 4>& rhs) {
    return lhs[0] != rhs[0] ? lhs[0] > rhs[0] : lhs[1] != rhs[1] ? lhs[1] > rhs[1] : lhs[2] != 0;
}

int bit[SIZE];
void upd(int pos, int x) {
    for (; pos; pos -= pos & -pos) bit[pos] += x;
}
int que(int pos) {
    int re = 0;
    for (; pos <= n; pos += pos & -pos) re += bit[pos];
    return re;
}

// opx >= quex, opy >= quey, opt <= quet
void divide(vector<array<int, 4>> &op) {
    if (op.size() <= 1) return;
    int mid = op.size() / 2;
    vector<array<int, 4>> opl, opr;
    FOR (i, 0, mid - 1) opl.pb(op[i]);
    FOR (i, mid, op.size() - 1) opr.pb(op[i]);
    op.clear();
    divide(opl);
    divide(opr);

    for (int il = 0, ir = 0; il < opl.size() || ir < opr.size();) {
        if (il < opl.size() && (ir == opr.size() || cmp2(opl[il], opr[ir]))) {
            if (opl[il][2] != 0) upd(opl[il][1], opl[il][2]);
            op.pb(opl[il++]);
        } else {
            if (opr[ir][2] == 0) ans[opr[ir][3]] += que(opr[ir][1]);
            op.pb(opr[ir++]);
        }
    }
    for (auto [x, y, v, t] : opl) if (v != 0) upd(y, -v);
    opl.clear(), opr.clear();
}

void solve() {
    cin >> n >> q;
    cin >> str, str = " " + str;
    for (int i = 1, l = 0; i <= n; i++) if (str[i] == '1') {
        if (l == 0) l = i;
        if (i == n || str[i + 1] != '1') {
            s.emplace(l, i);
            add(l, i, l, i, q, 1);
            l = 0;
        }
    }
    FOR (i, 1, q) {
        string t;
        cin >> t;
        ans[i] = -1;
        if (t[0] == 't') ask[i][0] = 1, cin >> ask[i][1];
        else ask[i][0] = 2, cin >> ask[i][1] >> ask[i][2], ask[i][2]--;
    }
    FOR (i, 1, q) {
        auto [t, x, y] = ask[i];
        if (t == 1) {
            if (i == q) continue;
            if (str[x] == '0') add(x, q - i, i);
            else del(x, q - i, i);
            str[x] = '1' - str[x] + '0';
        } else {
            ans[i] = 0;
            op.pb(array<int, 4>{x, y, 0, i});
            auto it = s.lower_bound({x + 1, 0});
            if (it == s.begin()) continue;
            it--;
            if (it->F <= x && y <= it->S) ans[i] -= q - i;
        }
    }
    sort(op.begin(), op.end(), [](auto lhs, auto rhs) {
        return cmp(lhs, rhs);
    });
    divide(op);
    FOR (i, 1, q) if (ans[i] != -1) cout << ans[i] << '\n';
}

int main() {
    Waimai;
    solve();
}

Compilation message

street_lamps.cpp: In function 'void divide(std::vector<std::array<int, 4> >&)':
street_lamps.cpp:90:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 4> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |     for (int il = 0, ir = 0; il < opl.size() || ir < opr.size();) {
      |                              ~~~^~~~~~~~~~~~
street_lamps.cpp:90:52: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 4> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |     for (int il = 0, ir = 0; il < opl.size() || ir < opr.size();) {
      |                                                 ~~~^~~~~~~~~~~~
street_lamps.cpp:91:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 4> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |         if (il < opl.size() && (ir == opr.size() || cmp2(opl[il], opr[ir]))) {
      |             ~~~^~~~~~~~~~~~
street_lamps.cpp:91:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 4> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |         if (il < opl.size() && (ir == opr.size() || cmp2(opl[il], opr[ir]))) {
      |                                 ~~~^~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 457 ms 46744 KB Output is correct
2 Correct 508 ms 47128 KB Output is correct
3 Correct 564 ms 47852 KB Output is correct
4 Correct 855 ms 76844 KB Output is correct
5 Correct 787 ms 57852 KB Output is correct
6 Correct 926 ms 76808 KB Output is correct
7 Correct 255 ms 27676 KB Output is correct
8 Correct 252 ms 29100 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 1 ms 352 KB Output is correct
5 Correct 963 ms 75216 KB Output is correct
6 Correct 980 ms 75444 KB Output is correct
7 Correct 762 ms 58508 KB Output is correct
8 Correct 252 ms 29092 KB Output is correct
9 Correct 133 ms 19268 KB Output is correct
10 Correct 154 ms 22944 KB Output is correct
11 Correct 152 ms 23156 KB Output is correct
12 Correct 245 ms 27704 KB Output is correct
13 Correct 246 ms 29148 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 3 ms 476 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 552 ms 48660 KB Output is correct
6 Correct 701 ms 58184 KB Output is correct
7 Correct 922 ms 76172 KB Output is correct
8 Correct 1183 ms 89196 KB Output is correct
9 Correct 548 ms 54344 KB Output is correct
10 Correct 626 ms 70692 KB Output is correct
11 Correct 542 ms 54452 KB Output is correct
12 Correct 616 ms 70920 KB Output is correct
13 Correct 550 ms 54328 KB Output is correct
14 Correct 636 ms 70812 KB Output is correct
15 Correct 241 ms 27676 KB Output is correct
16 Correct 247 ms 29104 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 457 ms 46744 KB Output is correct
9 Correct 508 ms 47128 KB Output is correct
10 Correct 564 ms 47852 KB Output is correct
11 Correct 855 ms 76844 KB Output is correct
12 Correct 787 ms 57852 KB Output is correct
13 Correct 926 ms 76808 KB Output is correct
14 Correct 255 ms 27676 KB Output is correct
15 Correct 252 ms 29100 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 3 ms 468 KB Output is correct
19 Correct 1 ms 352 KB Output is correct
20 Correct 963 ms 75216 KB Output is correct
21 Correct 980 ms 75444 KB Output is correct
22 Correct 762 ms 58508 KB Output is correct
23 Correct 252 ms 29092 KB Output is correct
24 Correct 133 ms 19268 KB Output is correct
25 Correct 154 ms 22944 KB Output is correct
26 Correct 152 ms 23156 KB Output is correct
27 Correct 245 ms 27704 KB Output is correct
28 Correct 246 ms 29148 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 3 ms 476 KB Output is correct
32 Correct 3 ms 604 KB Output is correct
33 Correct 552 ms 48660 KB Output is correct
34 Correct 701 ms 58184 KB Output is correct
35 Correct 922 ms 76172 KB Output is correct
36 Correct 1183 ms 89196 KB Output is correct
37 Correct 548 ms 54344 KB Output is correct
38 Correct 626 ms 70692 KB Output is correct
39 Correct 542 ms 54452 KB Output is correct
40 Correct 616 ms 70920 KB Output is correct
41 Correct 550 ms 54328 KB Output is correct
42 Correct 636 ms 70812 KB Output is correct
43 Correct 241 ms 27676 KB Output is correct
44 Correct 247 ms 29104 KB Output is correct
45 Correct 253 ms 29596 KB Output is correct
46 Correct 291 ms 29516 KB Output is correct
47 Correct 476 ms 40432 KB Output is correct
48 Correct 858 ms 76764 KB Output is correct
49 Correct 168 ms 25004 KB Output is correct
50 Correct 179 ms 24936 KB Output is correct
51 Correct 172 ms 25200 KB Output is correct
52 Correct 170 ms 25412 KB Output is correct
53 Correct 177 ms 25392 KB Output is correct
54 Correct 180 ms 25512 KB Output is correct