oj.uz

Submission #321309

# Submission time Handle Problem Language Result Execution time Memory
321309 2020-11-12T04:19:03 Z couplefire Land of the Rainbow Gold (APIO17_rainbow) C++17
100 / 100
 1036 ms 187236 KB 
#include "rainbow.h"
#include <bits/stdc++.h>
using namespace std;
#define MAXN 1<<18

const int SZ = MAXN;
template<class T> struct node {
	T val = 0; node<T>* c[2];
	node() { c[0] = c[1] = NULL; }
	void upd(int ind, T v, int L = 0, int R = SZ-1) { // add v
		if (L == ind && R == ind) { val += v; return; }
		int M = (L+R)/2;
		if (ind <= M) {
			if (!c[0]) c[0] = new node();
			c[0]->upd(ind,v,L,M);
		} else {
			if (!c[1]) c[1] = new node();
			c[1]->upd(ind,v,M+1,R);
		}
		val = 0; for(int i = 0; i<2; i++) if (c[i]) val += c[i]->val;
	}
	T query(int lo, int hi, int L = 0, int R = SZ-1) { // query sum of segment
		if (hi < L || R < lo) return 0;
		if (lo <= L && R <= hi) return val;
		int M = (L+R)/2; T res = 0;
		if (c[0]) res += c[0]->query(lo,hi,L,M);
		if (c[1]) res += c[1]->query(lo,hi,M+1,R);
		return res;
	}
	void UPD(int ind, node* c0, node* c1, int L = 0, int R = SZ-1) { // for 2D segtree
		if (L != R) {
			int M = (L+R)/2;
			if (ind <= M) {
				if (!c[0]) c[0] = new node();
				c[0]->UPD(ind,c0?c0->c[0]:NULL,c1?c1->c[0]:NULL,L,M);
			} else {
				if (!c[1]) c[1] = new node();
				c[1]->UPD(ind,c0?c0->c[1]:NULL,c1?c1->c[1]:NULL,M+1,R);
			}
		} 
		val = (c0?c0->val:0)+(c1?c1->val:0);
	}
};


template<class T> struct Node {
	node<T> seg; Node* c[2];
	Node() { c[0] = c[1] = NULL; }
	void upd(int x, int y, T v, int L = 0, int R = SZ-1) { // add v
		if (L == x && R == x) { seg.upd(y,v); return; }
		int M = (L+R)/2;
		if (x <= M) {
			if (!c[0]) c[0] = new Node();
			c[0]->upd(x,y,v,L,M);
		} else {
			if (!c[1]) c[1] = new Node();
			c[1]->upd(x,y,v,M+1,R);
		}
		seg.upd(y,v); // only for addition
		// seg.UPD(y,c[0]?&c[0]->seg:NULL,c[1]?&c[1]->seg:NULL);
	}
	T query(int x1, int x2, int y1, int y2, int L = 0, int R = SZ-1) { // query sum of rectangle
		if (x1 <= L && R <= x2) return seg.query(y1,y2);
		if (x2 < L || R < x1) return 0;
		int M = (L+R)/2; T res = 0;
		if (c[0]) res += c[0]->query(x1,x2,y1,y2,L,M);
		if (c[1]) res += c[1]->query(x1,x2,y1,y2,M+1,R);
		return res;
	}
};

map<pair<int, int>, int> mp;
set<pair<int, int>> visited;
vector<int> trows[MAXN];
vector<int> tcols[MAXN];
vector<pair<int, int>> rows[MAXN];
vector<pair<int, int>> cols[MAXN];
Node<int> seg;
int minr = MAXN, maxr = -MAXN, minc = MAXN, maxc = -MAXN;

void addSquare(int a, int b){
    if(visited.count({a, b})) return;
    visited.insert({a, b});
    mp[{a, b}]++;
    mp[{a+1, b}]++;
    mp[{a, b+1}]++;
    mp[{a+1, b+1}]++;
    trows[a].push_back(b);
    tcols[b].push_back(a);
    minr = min(minr, a); maxr = max(maxr, a);
    minc = min(minc, b); maxc = max(maxc, b);
}

void init(int R, int C, int sr, int sc, int M, char *S) {
    string s = S;
    addSquare(sr, sc);
    for(auto c : s){
        if(c == 'N') sr--;
        if(c == 'S') sr++;
        if(c == 'W') sc--;
        if(c == 'E') sc++;
        addSquare(sr, sc);
    }
    for(auto p : mp){
        if(p.second == 1) seg.upd(p.first.first, p.first.second, 1);
        if(p.second == 3) seg.upd(p.first.first, p.first.second, -1);
        if(p.second == 2){
            if(visited.count({p.first.first, p.first.second}) && visited.count({p.first.first-1, p.first.second-1})) seg.upd(p.first.first, p.first.second, -2);
            if(visited.count({p.first.first-1, p.first.second}) && visited.count({p.first.first, p.first.second-1})) seg.upd(p.first.first, p.first.second, -2);
        }
    }
    for(int i = 0; i<MAXN; i++) sort(trows[i].begin(), trows[i].end());
    for(int i = 0; i<MAXN; i++) sort(tcols[i].begin(), tcols[i].end());
    for(int i = 0; i<MAXN; i++){
        if(trows[i].empty()) continue;
        int cur = trows[i][0];
        for(int j = 1; j<trows[i].size(); j++){
            if(trows[i][j] != trows[i][j-1]+1){
                rows[i].push_back({cur, trows[i][j-1]});
                cur = trows[i][j];
            }
        }
        rows[i].push_back({cur, trows[i].back()});
    }
    for(int i = 0; i<MAXN; i++){
        if(tcols[i].empty()) continue;
        int cur = tcols[i][0];
        for(int j = 1; j<tcols[i].size(); j++){
            if(tcols[i][j] != tcols[i][j-1]+1){
                cols[i].push_back({cur, tcols[i][j-1]});
                cur = tcols[i][j];
            }
        }
        cols[i].push_back({cur, tcols[i].back()});
    }
    // for(int i = 0; i<MAXN; i++){
    //     if(cols[i].empty()) continue;
    //     cout << i << endl;
    //     for(auto j : cols[i]) cout << j.first << " " << j.second << endl;
    //     cout << endl;
    // }
}

int colour(int ar, int ac, int br, int bc) {
    int ans = 0;
    ans += seg.query(ar+1, br, ac+1, bc);
    int p1, p2;
    // top row
    p1 = lower_bound(rows[ar].begin(), rows[ar].end(), make_pair(ac+1, -1))-rows[ar].begin();
    p2 = lower_bound(rows[ar].begin(), rows[ar].end(), make_pair(bc+1, -1))-rows[ar].begin();
    p1--; p2--;
    if(p1 >= 0 && rows[ar][p1].second >= ac && rows[ar][p1].second < bc) ans--;
    if(p2 >= 0 && rows[ar][p2].first > ac && rows[ar][p2].second >= bc) ans--;
    p1++; if(p2 >= 0 && rows[ar][p2].second >= bc) p2--;
    if(p1 < rows[ar].size() && rows[ar][p1].second < bc && p2 >= 0 && rows[ar][p2].first > ac) ans -= (p2-p1+1)*2;

    p1 = lower_bound(rows[br].begin(), rows[br].end(), make_pair(ac+1, -1))-rows[br].begin();
    p2 = lower_bound(rows[br].begin(), rows[br].end(), make_pair(bc+1, -1))-rows[br].begin();
    p1--; p2--;
    if(p1 >= 0 && rows[br][p1].second >= ac && rows[br][p1].second < bc) ans--;
    if(p2 >= 0 && rows[br][p2].first > ac && rows[br][p2].second >= bc) ans--;
    p1++; if(p2 >= 0 && rows[br][p2].second >= bc) p2--;
    if(p1 < rows[br].size() && rows[br][p1].second < bc && p2 >= 0 && rows[br][p2].first > ac) ans -= (p2-p1+1)*2;

    p1 = lower_bound(cols[ac].begin(), cols[ac].end(), make_pair(ar+1, -1))-cols[ac].begin();
    p2 = lower_bound(cols[ac].begin(), cols[ac].end(), make_pair(br+1, -1))-cols[ac].begin();
    p1--; p2--;
    if(p1 >= 0 && cols[ac][p1].second >= ar && cols[ac][p1].second < br) ans--;
    if(p2 >= 0 && cols[ac][p2].first > ar && cols[ac][p2].second >= br) ans--;
    p1++; if(p2 >= 0 && cols[ac][p2].second >= br) p2--;
    if(p1 < cols[ac].size() && cols[ac][p1].second < br && p2 >= 0 && cols[ac][p2].first > ar) ans -= (p2-p1+1)*2;

    p1 = lower_bound(cols[bc].begin(), cols[bc].end(), make_pair(ar+1, -1))-cols[bc].begin();
    p2 = lower_bound(cols[bc].begin(), cols[bc].end(), make_pair(br+1, -1))-cols[bc].begin();
    p1--; p2--;
    if(p1 >= 0 && cols[bc][p1].second >= ar && cols[bc][p1].second < br) ans--;
    if(p2 >= 0 && cols[bc][p2].first > ar && cols[bc][p2].second >= br) ans--;
    p1++; if(p2 >= 0 && cols[bc][p2].second >= br) p2--;
    if(p1 < cols[bc].size() && cols[bc][p1].second < br && p2 >= 0 && cols[bc][p2].first > ar) ans -= (p2-p1+1)*2;
    if(!visited.count({ar, ac})) ans--;
    if(!visited.count({ar, bc})) ans--;
    if(!visited.count({br, ac})) ans--;
    if(!visited.count({br, bc})) ans--;
    if(ar < minr && br > maxr && ac < minc && bc > maxc) ans -= 4;
    return -ans/4;
}

Compilation message

rainbow.cpp: In function 'void init(int, int, int, int, int, char*)':
rainbow.cpp:117:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |         for(int j = 1; j<trows[i].size(); j++){
      |                        ~^~~~~~~~~~~~~~~~
rainbow.cpp:128:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |         for(int j = 1; j<tcols[i].size(); j++){
      |                        ~^~~~~~~~~~~~~~~~
rainbow.cpp: In function 'int colour(int, int, int, int)':
rainbow.cpp:155:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  155 |     if(p1 < rows[ar].size() && rows[ar][p1].second < bc && p2 >= 0 && rows[ar][p2].first > ac) ans -= (p2-p1+1)*2;
      |        ~~~^~~~~~~~~~~~~~~~~
rainbow.cpp:163:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  163 |     if(p1 < rows[br].size() && rows[br][p1].second < bc && p2 >= 0 && rows[br][p2].first > ac) ans -= (p2-p1+1)*2;
      |        ~~~^~~~~~~~~~~~~~~~~
rainbow.cpp:171:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  171 |     if(p1 < cols[ac].size() && cols[ac][p1].second < br && p2 >= 0 && cols[ac][p2].first > ar) ans -= (p2-p1+1)*2;
      |        ~~~^~~~~~~~~~~~~~~~~
rainbow.cpp:179:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  179 |     if(p1 < cols[bc].size() && cols[bc][p1].second < br && p2 >= 0 && cols[bc][p2].first > ar) ans -= (p2-p1+1)*2;
      |        ~~~^~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 25068 KB Output is correct
2 Correct 25 ms 25316 KB Output is correct
3 Correct 20 ms 25068 KB Output is correct
4 Correct 20 ms 25068 KB Output is correct
5 Correct 22 ms 25324 KB Output is correct
6 Correct 18 ms 24960 KB Output is correct
7 Correct 18 ms 24940 KB Output is correct
8 Correct 18 ms 24940 KB Output is correct
9 Correct 19 ms 24940 KB Output is correct
10 Correct 18 ms 24940 KB Output is correct
11 Correct 22 ms 25196 KB Output is correct
12 Correct 22 ms 25316 KB Output is correct
13 Correct 22 ms 25452 KB Output is correct
14 Correct 34 ms 25708 KB Output is correct
15 Correct 18 ms 24940 KB Output is correct
16 Correct 18 ms 24940 KB Output is correct
17 Correct 18 ms 24940 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 24940 KB Output is correct
2 Correct 18 ms 24940 KB Output is correct
3 Correct 312 ms 40164 KB Output is correct
4 Correct 519 ms 61180 KB Output is correct
5 Correct 669 ms 86600 KB Output is correct
6 Correct 559 ms 82084 KB Output is correct
7 Correct 810 ms 105144 KB Output is correct
8 Correct 110 ms 25828 KB Output is correct
9 Correct 508 ms 61008 KB Output is correct
10 Correct 631 ms 86716 KB Output is correct
11 Correct 595 ms 82232 KB Output is correct
12 Correct 286 ms 48348 KB Output is correct
13 Correct 326 ms 60892 KB Output is correct
14 Correct 456 ms 86652 KB Output is correct
15 Correct 462 ms 82396 KB Output is correct
16 Correct 318 ms 42720 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 24940 KB Output is correct
2 Correct 221 ms 49116 KB Output is correct
3 Correct 197 ms 48984 KB Output is correct
4 Correct 842 ms 183392 KB Output is correct
5 Correct 145 ms 43104 KB Output is correct
6 Correct 82 ms 31972 KB Output is correct
7 Correct 150 ms 37988 KB Output is correct
8 Correct 233 ms 58212 KB Output is correct
9 Correct 231 ms 56824 KB Output is correct
10 Correct 76 ms 32356 KB Output is correct
11 Correct 115 ms 37988 KB Output is correct
12 Correct 220 ms 49112 KB Output is correct
13 Correct 192 ms 49064 KB Output is correct
14 Correct 825 ms 183524 KB Output is correct
15 Correct 149 ms 43228 KB Output is correct
16 Correct 69 ms 30436 KB Output is correct
17 Correct 146 ms 38116 KB Output is correct
18 Correct 168 ms 46052 KB Output is correct
19 Correct 193 ms 49120 KB Output is correct
20 Correct 193 ms 49120 KB Output is correct
21 Correct 232 ms 58208 KB Output is correct
22 Correct 235 ms 56804 KB Output is correct
23 Correct 73 ms 32356 KB Output is correct
24 Correct 114 ms 37860 KB Output is correct
25 Correct 221 ms 49116 KB Output is correct
26 Correct 191 ms 49116 KB Output is correct
27 Correct 823 ms 183528 KB Output is correct
28 Correct 147 ms 43232 KB Output is correct
29 Correct 68 ms 30436 KB Output is correct
30 Correct 149 ms 38184 KB Output is correct
31 Correct 168 ms 46052 KB Output is correct
32 Correct 199 ms 49244 KB Output is correct
33 Correct 196 ms 49248 KB Output is correct

Subtask #4
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 25068 KB Output is correct
2 Correct 25 ms 25316 KB Output is correct
3 Correct 20 ms 25068 KB Output is correct
4 Correct 20 ms 25068 KB Output is correct
5 Correct 22 ms 25324 KB Output is correct
6 Correct 18 ms 24960 KB Output is correct
7 Correct 18 ms 24940 KB Output is correct
8 Correct 18 ms 24940 KB Output is correct
9 Correct 19 ms 24940 KB Output is correct
10 Correct 18 ms 24940 KB Output is correct
11 Correct 22 ms 25196 KB Output is correct
12 Correct 22 ms 25316 KB Output is correct
13 Correct 22 ms 25452 KB Output is correct
14 Correct 34 ms 25708 KB Output is correct
15 Correct 18 ms 24940 KB Output is correct
16 Correct 18 ms 24940 KB Output is correct
17 Correct 18 ms 24940 KB Output is correct
18 Correct 475 ms 39136 KB Output is correct
19 Correct 144 ms 28984 KB Output is correct
20 Correct 124 ms 28516 KB Output is correct
21 Correct 127 ms 28640 KB Output is correct
22 Correct 128 ms 28644 KB Output is correct
23 Correct 134 ms 29028 KB Output is correct
24 Correct 187 ms 28644 KB Output is correct
25 Correct 164 ms 28772 KB Output is correct
26 Correct 145 ms 28900 KB Output is correct
27 Correct 318 ms 37476 KB Output is correct
28 Correct 297 ms 36068 KB Output is correct
29 Correct 390 ms 41188 KB Output is correct
30 Correct 444 ms 49504 KB Output is correct
31 Correct 22 ms 25068 KB Output is correct
32 Correct 920 ms 44900 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 25068 KB Output is correct
2 Correct 25 ms 25316 KB Output is correct
3 Correct 20 ms 25068 KB Output is correct
4 Correct 20 ms 25068 KB Output is correct
5 Correct 22 ms 25324 KB Output is correct
6 Correct 18 ms 24960 KB Output is correct
7 Correct 18 ms 24940 KB Output is correct
8 Correct 18 ms 24940 KB Output is correct
9 Correct 19 ms 24940 KB Output is correct
10 Correct 18 ms 24940 KB Output is correct
11 Correct 22 ms 25196 KB Output is correct
12 Correct 22 ms 25316 KB Output is correct
13 Correct 22 ms 25452 KB Output is correct
14 Correct 34 ms 25708 KB Output is correct
15 Correct 18 ms 24940 KB Output is correct
16 Correct 18 ms 24940 KB Output is correct
17 Correct 18 ms 24940 KB Output is correct
18 Correct 475 ms 39136 KB Output is correct
19 Correct 144 ms 28984 KB Output is correct
20 Correct 124 ms 28516 KB Output is correct
21 Correct 127 ms 28640 KB Output is correct
22 Correct 128 ms 28644 KB Output is correct
23 Correct 134 ms 29028 KB Output is correct
24 Correct 187 ms 28644 KB Output is correct
25 Correct 164 ms 28772 KB Output is correct
26 Correct 145 ms 28900 KB Output is correct
27 Correct 318 ms 37476 KB Output is correct
28 Correct 297 ms 36068 KB Output is correct
29 Correct 390 ms 41188 KB Output is correct
30 Correct 444 ms 49504 KB Output is correct
31 Correct 22 ms 25068 KB Output is correct
32 Correct 920 ms 44900 KB Output is correct
33 Correct 221 ms 49116 KB Output is correct
34 Correct 197 ms 48984 KB Output is correct
35 Correct 842 ms 183392 KB Output is correct
36 Correct 145 ms 43104 KB Output is correct
37 Correct 82 ms 31972 KB Output is correct
38 Correct 150 ms 37988 KB Output is correct
39 Correct 233 ms 58212 KB Output is correct
40 Correct 231 ms 56824 KB Output is correct
41 Correct 76 ms 32356 KB Output is correct
42 Correct 115 ms 37988 KB Output is correct
43 Correct 220 ms 49112 KB Output is correct
44 Correct 192 ms 49064 KB Output is correct
45 Correct 825 ms 183524 KB Output is correct
46 Correct 149 ms 43228 KB Output is correct
47 Correct 69 ms 30436 KB Output is correct
48 Correct 146 ms 38116 KB Output is correct
49 Correct 168 ms 46052 KB Output is correct
50 Correct 193 ms 49120 KB Output is correct
51 Correct 193 ms 49120 KB Output is correct
52 Correct 232 ms 58208 KB Output is correct
53 Correct 235 ms 56804 KB Output is correct
54 Correct 73 ms 32356 KB Output is correct
55 Correct 114 ms 37860 KB Output is correct
56 Correct 221 ms 49116 KB Output is correct
57 Correct 191 ms 49116 KB Output is correct
58 Correct 823 ms 183528 KB Output is correct
59 Correct 147 ms 43232 KB Output is correct
60 Correct 68 ms 30436 KB Output is correct
61 Correct 149 ms 38184 KB Output is correct
62 Correct 168 ms 46052 KB Output is correct
63 Correct 199 ms 49244 KB Output is correct
64 Correct 196 ms 49248 KB Output is correct
65 Correct 699 ms 61712 KB Output is correct
66 Correct 734 ms 60388 KB Output is correct
67 Correct 350 ms 35940 KB Output is correct
68 Correct 379 ms 41316 KB Output is correct
69 Correct 350 ms 52828 KB Output is correct
70 Correct 393 ms 52696 KB Output is correct
71 Correct 1036 ms 187236 KB Output is correct
72 Correct 315 ms 46688 KB Output is correct
73 Correct 166 ms 34020 KB Output is correct
74 Correct 247 ms 41700 KB Output is correct
75 Correct 263 ms 49508 KB Output is correct
76 Correct 359 ms 52704 KB Output is correct
77 Correct 429 ms 52704 KB Output is correct
78 Correct 312 ms 40164 KB Output is correct
79 Correct 519 ms 61180 KB Output is correct
80 Correct 669 ms 86600 KB Output is correct
81 Correct 559 ms 82084 KB Output is correct
82 Correct 810 ms 105144 KB Output is correct
83 Correct 110 ms 25828 KB Output is correct
84 Correct 508 ms 61008 KB Output is correct
85 Correct 631 ms 86716 KB Output is correct
86 Correct 595 ms 82232 KB Output is correct
87 Correct 286 ms 48348 KB Output is correct
88 Correct 326 ms 60892 KB Output is correct
89 Correct 456 ms 86652 KB Output is correct
90 Correct 462 ms 82396 KB Output is correct
91 Correct 318 ms 42720 KB Output is correct