oj.uz

Submission #876919

# Submission time Handle Problem Language Result Execution time Memory
876919 2023-11-22T13:44:14 Z marvinthang Land of the Rainbow Gold (APIO17_rainbow) C++17
100 / 100
 358 ms 141384 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 << '}'; }
 
static char buf[1000 << 20];
void* operator new(size_t s) {
    static size_t i = sizeof buf;
    assert(s < i);
    return (void*)&buf[i -= s];
}
void operator delete(void*) {}
 
 
struct Node {
    int cnt;
    Node *left, *right;
    Node(int v = 0): cnt(v), left(nullptr), right(nullptr) {}
    Node(Node *l, Node *r) {
        left = l, right = r;
        cnt = l->cnt + r->cnt;
    }
};
 
Node* build(int l, int r) {
    if (r - l == 1) return new Node(0);
    int m = l + r >> 1;
    return new Node(build(l, m), build(m, r));
}
Node* upgrade(Node *cur, int l, int r, int p, int v) {
    if (r - l == 1) return new Node(cur->cnt + v);
    int m = l + r >> 1;
    if (p < m) return new Node(upgrade(cur->left, l, m, p, v), cur->right);
    return new Node(cur->left, upgrade(cur->right, m, r, p, v));
};
int get_sum(Node *p, Node *q, int l, int r, int u, int v) {
    if (l >= v || r <= u) return 0;
    if (u <= l && r <= v) return q->cnt - p->cnt;
    int m = l + r >> 1;
    return get_sum(p->left, q->left, l, m, u, v) + get_sum(p->right, q->right, m, r, u, v);
}
 
vector <Node *> 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);
            int add = 0;
            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 'Node* build(int, int)':
rainbow.cpp:65:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   65 |     int m = l + r >> 1;
      |             ~~^~~
rainbow.cpp: In function 'Node* upgrade(Node*, int, int, int, int)':
rainbow.cpp:70:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   70 |     int m = l + r >> 1;
      |             ~~^~~
rainbow.cpp: In function 'int get_sum(Node*, Node*, int, int, int, int)':
rainbow.cpp:77:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   77 |     int m = l + r >> 1;
      |             ~~^~~
rainbow.cpp: In function 'void init(int, int, int, int, int, char*)':
rainbow.cpp:121:17: warning: unused variable 'add' [-Wunused-variable]
  121 |             int add = 0;
      |                 ^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 1 ms 528 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 860 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 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 856 KB Output is correct
14 Correct 2 ms 1116 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 207 ms 50004 KB Output is correct
4 Correct 294 ms 70808 KB Output is correct
5 Correct 320 ms 74692 KB Output is correct
6 Correct 221 ms 87028 KB Output is correct
7 Correct 263 ms 68760 KB Output is correct
8 Correct 147 ms 21328 KB Output is correct
9 Correct 266 ms 70724 KB Output is correct
10 Correct 283 ms 74828 KB Output is correct
11 Correct 238 ms 87048 KB Output is correct
12 Correct 112 ms 66644 KB Output is correct
13 Correct 107 ms 70584 KB Output is correct
14 Correct 111 ms 74848 KB Output is correct
15 Correct 117 ms 87024 KB Output is correct
16 Correct 225 ms 56316 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 47 ms 135764 KB Output is correct
3 Correct 37 ms 137800 KB Output is correct
4 Correct 42 ms 135760 KB Output is correct
5 Correct 33 ms 115240 KB Output is correct
6 Correct 31 ms 86612 KB Output is correct
7 Correct 38 ms 123544 KB Output is correct
8 Correct 24 ms 53596 KB Output is correct
9 Correct 23 ms 51544 KB Output is correct
10 Correct 14 ms 39260 KB Output is correct
11 Correct 22 ms 57684 KB Output is correct
12 Correct 45 ms 135720 KB Output is correct
13 Correct 37 ms 137880 KB Output is correct
14 Correct 41 ms 135848 KB Output is correct
15 Correct 33 ms 115292 KB Output is correct
16 Correct 27 ms 80476 KB Output is correct
17 Correct 42 ms 123460 KB Output is correct
18 Correct 41 ms 135872 KB Output is correct
19 Correct 38 ms 133716 KB Output is correct
20 Correct 37 ms 133700 KB Output is correct
21 Correct 24 ms 53584 KB Output is correct
22 Correct 23 ms 51548 KB Output is correct
23 Correct 15 ms 39328 KB Output is correct
24 Correct 20 ms 57936 KB Output is correct
25 Correct 41 ms 135816 KB Output is correct
26 Correct 36 ms 137812 KB Output is correct
27 Correct 41 ms 135764 KB Output is correct
28 Correct 34 ms 115292 KB Output is correct
29 Correct 27 ms 80468 KB Output is correct
30 Correct 37 ms 123468 KB Output is correct
31 Correct 43 ms 135764 KB Output is correct
32 Correct 42 ms 133748 KB Output is correct
33 Correct 38 ms 133712 KB Output is correct

Subtask #4
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 1 ms 528 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 860 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 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 856 KB Output is correct
14 Correct 2 ms 1116 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 230 ms 31828 KB Output is correct
19 Correct 83 ms 2192 KB Output is correct
20 Correct 75 ms 1072 KB Output is correct
21 Correct 67 ms 1360 KB Output is correct
22 Correct 65 ms 1616 KB Output is correct
23 Correct 76 ms 2132 KB Output is correct
24 Correct 89 ms 1364 KB Output is correct
25 Correct 78 ms 1876 KB Output is correct
26 Correct 71 ms 1880 KB Output is correct
27 Correct 130 ms 44072 KB Output is correct
28 Correct 148 ms 27560 KB Output is correct
29 Correct 156 ms 50120 KB Output is correct
30 Correct 170 ms 56280 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 239 ms 34016 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 1 ms 528 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 860 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 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 856 KB Output is correct
14 Correct 2 ms 1116 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 230 ms 31828 KB Output is correct
19 Correct 83 ms 2192 KB Output is correct
20 Correct 75 ms 1072 KB Output is correct
21 Correct 67 ms 1360 KB Output is correct
22 Correct 65 ms 1616 KB Output is correct
23 Correct 76 ms 2132 KB Output is correct
24 Correct 89 ms 1364 KB Output is correct
25 Correct 78 ms 1876 KB Output is correct
26 Correct 71 ms 1880 KB Output is correct
27 Correct 130 ms 44072 KB Output is correct
28 Correct 148 ms 27560 KB Output is correct
29 Correct 156 ms 50120 KB Output is correct
30 Correct 170 ms 56280 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 239 ms 34016 KB Output is correct
33 Correct 47 ms 135764 KB Output is correct
34 Correct 37 ms 137800 KB Output is correct
35 Correct 42 ms 135760 KB Output is correct
36 Correct 33 ms 115240 KB Output is correct
37 Correct 31 ms 86612 KB Output is correct
38 Correct 38 ms 123544 KB Output is correct
39 Correct 24 ms 53596 KB Output is correct
40 Correct 23 ms 51544 KB Output is correct
41 Correct 14 ms 39260 KB Output is correct
42 Correct 22 ms 57684 KB Output is correct
43 Correct 45 ms 135720 KB Output is correct
44 Correct 37 ms 137880 KB Output is correct
45 Correct 41 ms 135848 KB Output is correct
46 Correct 33 ms 115292 KB Output is correct
47 Correct 27 ms 80476 KB Output is correct
48 Correct 42 ms 123460 KB Output is correct
49 Correct 41 ms 135872 KB Output is correct
50 Correct 38 ms 133716 KB Output is correct
51 Correct 37 ms 133700 KB Output is correct
52 Correct 24 ms 53584 KB Output is correct
53 Correct 23 ms 51548 KB Output is correct
54 Correct 15 ms 39328 KB Output is correct
55 Correct 20 ms 57936 KB Output is correct
56 Correct 41 ms 135816 KB Output is correct
57 Correct 36 ms 137812 KB Output is correct
58 Correct 41 ms 135764 KB Output is correct
59 Correct 34 ms 115292 KB Output is correct
60 Correct 27 ms 80468 KB Output is correct
61 Correct 37 ms 123468 KB Output is correct
62 Correct 43 ms 135764 KB Output is correct
63 Correct 42 ms 133748 KB Output is correct
64 Correct 38 ms 133712 KB Output is correct
65 Correct 207 ms 50004 KB Output is correct
66 Correct 294 ms 70808 KB Output is correct
67 Correct 320 ms 74692 KB Output is correct
68 Correct 221 ms 87028 KB Output is correct
69 Correct 263 ms 68760 KB Output is correct
70 Correct 147 ms 21328 KB Output is correct
71 Correct 266 ms 70724 KB Output is correct
72 Correct 283 ms 74828 KB Output is correct
73 Correct 238 ms 87048 KB Output is correct
74 Correct 112 ms 66644 KB Output is correct
75 Correct 107 ms 70584 KB Output is correct
76 Correct 111 ms 74848 KB Output is correct
77 Correct 117 ms 87024 KB Output is correct
78 Correct 225 ms 56316 KB Output is correct
79 Correct 358 ms 57144 KB Output is correct
80 Correct 339 ms 55520 KB Output is correct
81 Correct 184 ms 42580 KB Output is correct
82 Correct 195 ms 61268 KB Output is correct
83 Correct 227 ms 139412 KB Output is correct
84 Correct 217 ms 141384 KB Output is correct
85 Correct 149 ms 139396 KB Output is correct
86 Correct 190 ms 118760 KB Output is correct
87 Correct 157 ms 83956 KB Output is correct
88 Correct 135 ms 127056 KB Output is correct
89 Correct 130 ms 139316 KB Output is correct
90 Correct 274 ms 137236 KB Output is correct
91 Correct 343 ms 137560 KB Output is correct