oj.uz

Submission #739363

# Submission time Handle Problem Language Result Execution time Memory
739363 2023-05-10T11:07:57 Z nguyentunglam Street Lamps (APIO19_street_lamps) C++17
100 / 100
 2928 ms 109928 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;
const int N = 3e5 + 10;
int a[N], ans[N];
int n, q;
tuple<int, int, int> query[N];
pair<int, int> tt[N];
vector<int> node[N], bit[N];
void fakeup (int x, int y) {
    for(x; x <= n; x += x & -x) node[x].push_back(y);
}
void up(int x, int yy, int val) {
    for(x; x <= n; x += x & -x) {
        for(int y = upper_bound(node[x].begin(), node[x].end(), yy) - node[x].begin(); y <= node[x].size(); y += y & -y) {
            bit[x][y] += val;
        }
    }
}
int get(int x, int yy) {
    int ret = 0;
    for(x; x; x -= x & -x) {
        if (node[x].empty()) continue;
        for(int y = upper_bound(node[x].begin(), node[x].end(), yy) - node[x].begin(); y; y -= y & -y) {
            ret += bit[x][y];
        }
    }
    return ret;
}
void compress() {
    for(int i = 1; i <= n; i++) {
        sort(node[i].begin(), node[i].end());
        node[i].resize(unique(node[i].begin(), node[i].end()) - node[i].begin());
        bit[i].resize(node[i].size() + 1);
    }
}
void fakeinc(int x, int y, int u, int v) {
    fakeup(x, y);
    fakeup(x, v + 1);
    fakeup(u + 1, y);
    fakeup(u + 1, v + 1);
}
void inc(int x, int y, int u, int v, int val) {
    up(x, y, val);
    up(x, v + 1, -val);
    up(u + 1, y, -val);
    up(u + 1, v + 1, val);
}
int main() {
    #define task ""
    cin.tie(0) -> sync_with_stdio(0);
    if (fopen ("task.inp", "r")) {
        freopen ("task.inp", "r", stdin);
        freopen ("task.out", "w", stdout);
    }
    if (fopen (task".inp", "r")) {
        freopen (task".inp", "r", stdin);
        freopen (task".out", "w", stdout);
    }
    cin >> n >> q;
    string str; cin >> str; str = " " + str;
    set<int> s = {0, n + 1};
    for(int i = 1; i <= n; i++) {
        a[i] = str[i] - '0';
        if (!a[i]) s.insert(i);
    }
    for(int timer = 1; timer <= q; timer++) {
        string ask; cin >> ask;
        if (ask[0] == 't') {
            int i; cin >> i;
            a[i] ^= 1;
            if (a[i]) s.erase(s.find(i));
            else s.insert(i);
            auto it = s.upper_bound(i);
            int r = *it - 1;
            it--;
            if (*it == i) it--;
            int l = *it + 1;
            fakeinc(l, i, i, r);
            query[timer] = {0, l, r};
            tt[timer].fi = i;
            tt[timer].se = a[i] ? -timer : timer;
        }
        else {
            int l, r; cin >> l >> r; r--;
            query[timer] = {1, l, r};
            if (*s.lower_bound(l) > r) ans[timer] += timer;
        }
    }
    compress();
    for(int timer = 1; timer <= q; timer++) {
        int type, l, r; tie(type, l, r) = query[timer];
        if (type == 0) {
            int i, val; tie(i, val) = tt[timer];
            inc(l, i, i, r, val);
        }
        else cout << get(l, r) + ans[timer] << endl;
    }
}

Compilation message

street_lamps.cpp: In function 'void fakeup(int, int)':
street_lamps.cpp:14:9: warning: statement has no effect [-Wunused-value]
   14 |     for(x; x <= n; x += x & -x) node[x].push_back(y);
      |         ^
street_lamps.cpp: In function 'void up(int, int, int)':
street_lamps.cpp:17:9: warning: statement has no effect [-Wunused-value]
   17 |     for(x; x <= n; x += x & -x) {
      |         ^
street_lamps.cpp:18:90: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |         for(int y = upper_bound(node[x].begin(), node[x].end(), yy) - node[x].begin(); y <= node[x].size(); y += y & -y) {
      |                                                                                        ~~^~~~~~~~~~~~~~~~~
street_lamps.cpp: In function 'int get(int, int)':
street_lamps.cpp:25:9: warning: statement has no effect [-Wunused-value]
   25 |     for(x; x; x -= x & -x) {
      |         ^
street_lamps.cpp: In function 'int main()':
street_lamps.cpp:56:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |         freopen ("task.inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
street_lamps.cpp:57:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |         freopen ("task.out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
street_lamps.cpp:60:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |         freopen (task".inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
street_lamps.cpp:61:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |         freopen (task".out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 8 ms 14424 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 8 ms 14428 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 10 ms 14464 KB Output is correct
7 Correct 8 ms 14428 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 305 ms 36320 KB Output is correct
2 Correct 354 ms 37656 KB Output is correct
3 Correct 594 ms 44060 KB Output is correct
4 Correct 1449 ms 80516 KB Output is correct
5 Correct 1239 ms 66132 KB Output is correct
6 Correct 1759 ms 87296 KB Output is correct
7 Correct 403 ms 46080 KB Output is correct
8 Correct 172 ms 34580 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 14676 KB Output is correct
2 Correct 9 ms 14548 KB Output is correct
3 Correct 10 ms 14564 KB Output is correct
4 Correct 11 ms 14420 KB Output is correct
5 Correct 2928 ms 104604 KB Output is correct
6 Correct 1880 ms 89460 KB Output is correct
7 Correct 1141 ms 67116 KB Output is correct
8 Correct 134 ms 37904 KB Output is correct
9 Correct 81 ms 22012 KB Output is correct
10 Correct 83 ms 22768 KB Output is correct
11 Correct 82 ms 22868 KB Output is correct
12 Correct 336 ms 49416 KB Output is correct
13 Correct 138 ms 37808 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14420 KB Output is correct
2 Correct 9 ms 14564 KB Output is correct
3 Correct 9 ms 14572 KB Output is correct
4 Correct 10 ms 14548 KB Output is correct
5 Correct 339 ms 39784 KB Output is correct
6 Correct 1036 ms 64476 KB Output is correct
7 Correct 1553 ms 86008 KB Output is correct
8 Correct 2315 ms 109928 KB Output is correct
9 Correct 401 ms 46820 KB Output is correct
10 Correct 340 ms 44040 KB Output is correct
11 Correct 408 ms 47136 KB Output is correct
12 Correct 348 ms 44460 KB Output is correct
13 Correct 389 ms 47120 KB Output is correct
14 Correct 341 ms 44480 KB Output is correct
15 Correct 334 ms 49412 KB Output is correct
16 Correct 126 ms 37816 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 8 ms 14424 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 8 ms 14428 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 10 ms 14464 KB Output is correct
7 Correct 8 ms 14428 KB Output is correct
8 Correct 305 ms 36320 KB Output is correct
9 Correct 354 ms 37656 KB Output is correct
10 Correct 594 ms 44060 KB Output is correct
11 Correct 1449 ms 80516 KB Output is correct
12 Correct 1239 ms 66132 KB Output is correct
13 Correct 1759 ms 87296 KB Output is correct
14 Correct 403 ms 46080 KB Output is correct
15 Correct 172 ms 34580 KB Output is correct
16 Correct 12 ms 14676 KB Output is correct
17 Correct 9 ms 14548 KB Output is correct
18 Correct 10 ms 14564 KB Output is correct
19 Correct 11 ms 14420 KB Output is correct
20 Correct 2928 ms 104604 KB Output is correct
21 Correct 1880 ms 89460 KB Output is correct
22 Correct 1141 ms 67116 KB Output is correct
23 Correct 134 ms 37904 KB Output is correct
24 Correct 81 ms 22012 KB Output is correct
25 Correct 83 ms 22768 KB Output is correct
26 Correct 82 ms 22868 KB Output is correct
27 Correct 336 ms 49416 KB Output is correct
28 Correct 138 ms 37808 KB Output is correct
29 Correct 9 ms 14420 KB Output is correct
30 Correct 9 ms 14564 KB Output is correct
31 Correct 9 ms 14572 KB Output is correct
32 Correct 10 ms 14548 KB Output is correct
33 Correct 339 ms 39784 KB Output is correct
34 Correct 1036 ms 64476 KB Output is correct
35 Correct 1553 ms 86008 KB Output is correct
36 Correct 2315 ms 109928 KB Output is correct
37 Correct 401 ms 46820 KB Output is correct
38 Correct 340 ms 44040 KB Output is correct
39 Correct 408 ms 47136 KB Output is correct
40 Correct 348 ms 44460 KB Output is correct
41 Correct 389 ms 47120 KB Output is correct
42 Correct 341 ms 44480 KB Output is correct
43 Correct 334 ms 49412 KB Output is correct
44 Correct 126 ms 37816 KB Output is correct
45 Correct 104 ms 26112 KB Output is correct
46 Correct 159 ms 28088 KB Output is correct
47 Correct 708 ms 48560 KB Output is correct
48 Correct 1446 ms 81532 KB Output is correct
49 Correct 88 ms 23372 KB Output is correct
50 Correct 89 ms 23536 KB Output is correct
51 Correct 87 ms 23500 KB Output is correct
52 Correct 88 ms 23500 KB Output is correct
53 Correct 92 ms 23224 KB Output is correct
54 Correct 90 ms 23540 KB Output is correct