oj.uz

Submission #876921

# Submission time Handle Problem Language Result Execution time Memory
876921 2023-11-22T13:45:47 Z marvinthang Land of the Rainbow Gold (APIO17_rainbow) C++17
100 / 100
 392 ms 117408 KB 
/*************************************
*    author: marvinthang             *
*    created: 22.11.2023 16:30:03    *
*************************************/
 
#include "rainbow.h"
#include <bits/stdc++.h>
 
using namespace std;
 
#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif
 
template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }


struct Node {
    int cnt, left, right;
    Node(int v = 0, int l = -1, int r = -1): cnt(v), left(l), right(r) {}
};

vector <Node> nodes;

int newNode(int v) {
    nodes.push_back(Node(v));
    return (int) nodes.size() - 1;
}
int newNode(int l, int r) {
    nodes.push_back(Node(nodes[l].cnt + nodes[r].cnt, l, r));
    return (int) nodes.size() - 1;
}
 
int build(int l, int r) {
    if (r - l == 1) return newNode(0);
    int m = l + r >> 1;
    return newNode(build(l, m), build(m, r));
}
int upgrade(int cur, int l, int r, int p, int v) {
    if (r - l == 1) return newNode(nodes[cur].cnt + v);
    int m = l + r >> 1;
    if (p < m) return newNode(upgrade(nodes[cur].left, l, m, p, v), nodes[cur].right);
    return newNode(nodes[cur].left, upgrade(nodes[cur].right, m, r, p, v));
};
int get_sum(int p, int q, int l, int r, int u, int v) {
    if (l >= v || r <= u) return 0;
    if (u <= l && r <= v) return nodes[q].cnt - nodes[p].cnt;
    int m = l + r >> 1;
    return get_sum(nodes[p].left, nodes[q].left, l, m, u, v) + get_sum(nodes[p].right, nodes[q].right, m, r, u, v);
}
 
vector <int> drow, dcol, dsquare, dcell;
 
int R, C;
vector <vector <int>> rows, cols;
 
void init(int r, int c, int sr, int sc, int M, char *S) {
    R = r; C = c; --sr; --sc;
 
    rows.resize(R);
    cols.resize(C);
    drow.push_back(build(0, C));
    dcol.push_back(build(0, R));
    dsquare.push_back(drow[0]);
    dcell.push_back(drow[0]);
 
    rows[sr].push_back(sc);
    cols[sc].push_back(sr);
 
    REP(i, M) {
        if (S[i] == 'N') --sr;
        else if (S[i] == 'S') ++sr;
        else if (S[i] == 'W') --sc;
        else ++sc;
        rows[sr].push_back(sc);
        cols[sc].push_back(sr);
    }
    vector <bool> exist(C);
    REP(r, R) {
        if (r) {
            drow.push_back(drow.back());
            dsquare.push_back(dsquare.back());
        }
        dcell.push_back(dcell.back());
 
        sort(ALL(rows[r]));
        rows[r].erase(unique(ALL(rows[r])), rows[r].end());
        int last = -2;
        REP(i, rows[r].size()) {
            int c = rows[r][i];
            dcell.back() = upgrade(dcell.back(), 0, C, c, 1);
            if (exist[c]) {
                drow.back() = upgrade(drow.back(), 0, C, c, 1);
                if (last + 1 == c && exist[c - 1]) dsquare.back() = upgrade(dsquare.back(), 0, C, c, -1);
            } else {
                if (c && last + 1 != c && exist[c - 1]) dsquare.back() = upgrade(dsquare.back(), 0, C, c, +1);
                if (c + 1 < C && exist[c + 1] && (i + 1 == (int) rows[r].size() || rows[r][i + 1] != c + 1)) 
                    dsquare.back() = upgrade(dsquare.back(), 0, C, c + 1, +1);
            }
            last = c;
        }
        if (r) for (int c: rows[r - 1]) exist[c] = false;
        for (int c: rows[r]) exist[c] = true;
 
    }
    exist.assign(R, false);
    REP(c, C) {
        if (c) dcol.push_back(dcol.back());
        sort(ALL(cols[c]));
        cols[c].erase(unique(ALL(cols[c])), cols[c].end());
        for (int r: cols[c]) if (exist[r]) dcol.back() = upgrade(dcol.back(), 0, R, r, 1);
        if (c) for (int r: cols[c - 1]) exist[r] = false;
        for (int r: cols[c]) exist[r] = true;
    }
}
 
bool exist(int x, int y) {
    return binary_search(ALL(rows[x]), y);
}
 
int colour(int ar, int ac, int br, int bc) {
    --ar; --ac; --br; --bc;
    int cnt_cell = get_sum(dcell[ar], dcell[br + 1], 0, C, ac, bc + 1);
    if (!cnt_cell) return 1;
    int cnt_border = 0;
    int res = 1 - exist(ar, ac) - exist(ar, bc) - exist(br, ac) - exist(br, bc);
    res += get_sum(drow[ar], drow[br], 0, C, ac, bc + 1);
    res += get_sum(dcol[ac], dcol[bc], 0, R, ar, br + 1);
    for (int c: {ac, bc}) {
        cnt_border += upper_bound(ALL(cols[c]), br) - lower_bound(ALL(cols[c]), ar);
        res -= get_sum(drow[ar], drow[br], 0, C, c, c + 1);
    }
    for (int r: {ar, br}) {
        cnt_border += upper_bound(ALL(rows[r]), bc) - lower_bound(ALL(rows[r]), ac);
        res -= get_sum(dcol[ac], dcol[bc], 0, R, r, r + 1);
    }
    res += get_sum(dsquare[ar], dsquare[br], 0, C, ac + 1, bc + 1);
    return cnt_border - cnt_cell + res + !cnt_border;
}

Compilation message

rainbow.cpp: In function 'int build(int, int)':
rainbow.cpp:63:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   63 |     int m = l + r >> 1;
      |             ~~^~~
rainbow.cpp: In function 'int upgrade(int, int, int, int, int)':
rainbow.cpp:68:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   68 |     int m = l + r >> 1;
      |             ~~^~~
rainbow.cpp: In function 'int get_sum(int, int, int, int, int, int)':
rainbow.cpp:75:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   75 |     int m = l + r >> 1;
      |             ~~^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 896 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 800 KB Output is correct
13 Correct 2 ms 800 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 217 ms 32512 KB Output is correct
4 Correct 323 ms 57996 KB Output is correct
5 Correct 323 ms 57772 KB Output is correct
6 Correct 267 ms 56496 KB Output is correct
7 Correct 280 ms 57524 KB Output is correct
8 Correct 135 ms 13496 KB Output is correct
9 Correct 284 ms 58544 KB Output is correct
10 Correct 294 ms 59488 KB Output is correct
11 Correct 248 ms 57508 KB Output is correct
12 Correct 137 ms 58288 KB Output is correct
13 Correct 137 ms 57776 KB Output is correct
14 Correct 144 ms 59064 KB Output is correct
15 Correct 161 ms 58284 KB Output is correct
16 Correct 216 ms 34244 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 83 ms 116128 KB Output is correct
3 Correct 84 ms 116192 KB Output is correct
4 Correct 83 ms 115640 KB Output is correct
5 Correct 70 ms 64428 KB Output is correct
6 Correct 57 ms 66224 KB Output is correct
7 Correct 74 ms 63508 KB Output is correct
8 Correct 38 ms 29888 KB Output is correct
9 Correct 36 ms 28860 KB Output is correct
10 Correct 26 ms 31676 KB Output is correct
11 Correct 41 ms 31512 KB Output is correct
12 Correct 81 ms 115856 KB Output is correct
13 Correct 90 ms 116880 KB Output is correct
14 Correct 82 ms 115728 KB Output is correct
15 Correct 68 ms 64172 KB Output is correct
16 Correct 52 ms 64812 KB Output is correct
17 Correct 67 ms 62788 KB Output is correct
18 Correct 89 ms 114848 KB Output is correct
19 Correct 90 ms 116840 KB Output is correct
20 Correct 88 ms 117148 KB Output is correct
21 Correct 41 ms 28476 KB Output is correct
22 Correct 39 ms 28600 KB Output is correct
23 Correct 27 ms 30904 KB Output is correct
24 Correct 38 ms 31828 KB Output is correct
25 Correct 83 ms 117408 KB Output is correct
26 Correct 82 ms 116308 KB Output is correct
27 Correct 82 ms 115364 KB Output is correct
28 Correct 68 ms 64176 KB Output is correct
29 Correct 49 ms 64628 KB Output is correct
30 Correct 79 ms 62912 KB Output is correct
31 Correct 89 ms 114780 KB Output is correct
32 Correct 82 ms 117084 KB Output is correct
33 Correct 91 ms 115872 KB Output is correct

Subtask #4
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 896 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 800 KB Output is correct
13 Correct 2 ms 800 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 256 ms 27392 KB Output is correct
19 Correct 75 ms 1752 KB Output is correct
20 Correct 68 ms 1104 KB Output is correct
21 Correct 66 ms 1428 KB Output is correct
22 Correct 60 ms 1404 KB Output is correct
23 Correct 81 ms 1796 KB Output is correct
24 Correct 87 ms 1436 KB Output is correct
25 Correct 74 ms 1480 KB Output is correct
26 Correct 67 ms 1708 KB Output is correct
27 Correct 140 ms 27140 KB Output is correct
28 Correct 150 ms 15112 KB Output is correct
29 Correct 157 ms 26880 KB Output is correct
30 Correct 209 ms 52440 KB Output is correct
31 Correct 3 ms 344 KB Output is correct
32 Correct 217 ms 26372 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 896 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 800 KB Output is correct
13 Correct 2 ms 800 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 256 ms 27392 KB Output is correct
19 Correct 75 ms 1752 KB Output is correct
20 Correct 68 ms 1104 KB Output is correct
21 Correct 66 ms 1428 KB Output is correct
22 Correct 60 ms 1404 KB Output is correct
23 Correct 81 ms 1796 KB Output is correct
24 Correct 87 ms 1436 KB Output is correct
25 Correct 74 ms 1480 KB Output is correct
26 Correct 67 ms 1708 KB Output is correct
27 Correct 140 ms 27140 KB Output is correct
28 Correct 150 ms 15112 KB Output is correct
29 Correct 157 ms 26880 KB Output is correct
30 Correct 209 ms 52440 KB Output is correct
31 Correct 3 ms 344 KB Output is correct
32 Correct 217 ms 26372 KB Output is correct
33 Correct 83 ms 116128 KB Output is correct
34 Correct 84 ms 116192 KB Output is correct
35 Correct 83 ms 115640 KB Output is correct
36 Correct 70 ms 64428 KB Output is correct
37 Correct 57 ms 66224 KB Output is correct
38 Correct 74 ms 63508 KB Output is correct
39 Correct 38 ms 29888 KB Output is correct
40 Correct 36 ms 28860 KB Output is correct
41 Correct 26 ms 31676 KB Output is correct
42 Correct 41 ms 31512 KB Output is correct
43 Correct 81 ms 115856 KB Output is correct
44 Correct 90 ms 116880 KB Output is correct
45 Correct 82 ms 115728 KB Output is correct
46 Correct 68 ms 64172 KB Output is correct
47 Correct 52 ms 64812 KB Output is correct
48 Correct 67 ms 62788 KB Output is correct
49 Correct 89 ms 114848 KB Output is correct
50 Correct 90 ms 116840 KB Output is correct
51 Correct 88 ms 117148 KB Output is correct
52 Correct 41 ms 28476 KB Output is correct
53 Correct 39 ms 28600 KB Output is correct
54 Correct 27 ms 30904 KB Output is correct
55 Correct 38 ms 31828 KB Output is correct
56 Correct 83 ms 117408 KB Output is correct
57 Correct 82 ms 116308 KB Output is correct
58 Correct 82 ms 115364 KB Output is correct
59 Correct 68 ms 64176 KB Output is correct
60 Correct 49 ms 64628 KB Output is correct
61 Correct 79 ms 62912 KB Output is correct
62 Correct 89 ms 114780 KB Output is correct
63 Correct 82 ms 117084 KB Output is correct
64 Correct 91 ms 115872 KB Output is correct
65 Correct 217 ms 32512 KB Output is correct
66 Correct 323 ms 57996 KB Output is correct
67 Correct 323 ms 57772 KB Output is correct
68 Correct 267 ms 56496 KB Output is correct
69 Correct 280 ms 57524 KB Output is correct
70 Correct 135 ms 13496 KB Output is correct
71 Correct 284 ms 58544 KB Output is correct
72 Correct 294 ms 59488 KB Output is correct
73 Correct 248 ms 57508 KB Output is correct
74 Correct 137 ms 58288 KB Output is correct
75 Correct 137 ms 57776 KB Output is correct
76 Correct 144 ms 59064 KB Output is correct
77 Correct 161 ms 58284 KB Output is correct
78 Correct 216 ms 34244 KB Output is correct
79 Correct 318 ms 28544 KB Output is correct
80 Correct 354 ms 29104 KB Output is correct
81 Correct 183 ms 30148 KB Output is correct
82 Correct 223 ms 32440 KB Output is correct
83 Correct 276 ms 117152 KB Output is correct
84 Correct 258 ms 115244 KB Output is correct
85 Correct 200 ms 115620 KB Output is correct
86 Correct 180 ms 64288 KB Output is correct
87 Correct 164 ms 65204 KB Output is correct
88 Correct 205 ms 65192 KB Output is correct
89 Correct 154 ms 113832 KB Output is correct
90 Correct 269 ms 116896 KB Output is correct
91 Correct 392 ms 117404 KB Output is correct