oj.uz

Submission #115118

# Submission time Handle Problem Language Result Execution time Memory
115118 2019-06-05T10:54:13 Z 김세빈(#2863) Land of the Rainbow Gold (APIO17_rainbow) C++14
100 / 100
 696 ms 276552 KB 
#include <bits/stdc++.h>

#include "rainbow.h"

using namespace std;

typedef pair <int, int> pii;

struct pst{
	struct node{
		int l, r, v;
		node() : l(0), r(0), v(0) {}
	};
	
	node T[20202020];
	int R[202020], r, t, c;
	
	void init(int w) { c = w; }
	
	void insert(int p, int s, int e, int i, int v)
	{
		T[p].v += v;
		
		if(s == e) return;
		else if(i <= (s + e >> 1)){
			T[++t] = T[T[p].l]; T[p].l = t;
			insert(T[p].l, s, s + e >> 1, i, v);
		}
		else{
			T[++t] = T[T[p].r]; T[p].r = t;
			insert(T[p].r, (s + e >> 1) + 1, e, i, v);
		}
	}
	
	void insert(int p, int v)
	{
		T[++t] = T[r]; r = t;
		insert(r, 1, c, p, v);
	}
	
	void root(int p) { R[p] = r; }
	
	int query(int p, int s, int e, int l, int r)
	{
		if(!p || r < s || e < l) return 0;
		else if(l <= s && e <= r){
			return T[p].v;
		}
		else return query(T[p].l, s, s + e >> 1, l, r)
				+ query(T[p].r, (s + e >> 1) + 1, e, l, r);
	}
	
	int query(int sr, int sc, int er, int ec)
	{
		return query(R[er], 1, c, sc, ec) 
			- query(R[sr - 1], 1, c, sc, ec);	
	}
};

pst T;
vector <int> R1[202020], R2[202020];
vector <int> C1[202020], C2[202020];
vector <pii> V, E1, E2, F;
int lx, ly, rx, ry;

void push(int x, int y)
{
	V.emplace_back(x, y);
	
	E1.emplace_back(x, y);
	E1.emplace_back(x + 1, y);
	
	E2.emplace_back(x, y);
	E2.emplace_back(x, y + 1);
	
	F.emplace_back(x, y);
	F.emplace_back(x, y + 1);
	F.emplace_back(x + 1, y);
	F.emplace_back(x + 1, y + 1);
}

void compress(vector <pii> &V)
{
	sort(V.begin(), V.end());
	V.erase(unique(V.begin(), V.end()), V.end());
} 

void init(int r, int c, int x, int y, int m, char *S)
{
	int i, v, e1, e2, f;
	
	T.init(c + 1);
	
	push(x, y);
	
	lx = rx = x; ly = ry = y;
	
	for(i=0; i<m; i++){
		if(S[i] == 'N') x --;
		else if(S[i] == 'S') x ++;
		else if(S[i] == 'W') y --;
		else y ++;
		
		push(x, y);
		
		lx = min(lx, x); rx = max(rx, x);
		ly = min(ly, y); ry = max(ry, y);
	}
	
	compress(V);
	compress(E1);
	compress(E2);
	compress(F);
	
	v = e1 = e2 = f = 0;
	
	for(i=1; i<=r+1; i++){
		for(; v<V.size() && V[v].first == i; v++){
			T.insert(V[v].second, -1);
		}
		
		for(; e1<E1.size() && E1[e1].first == i; e1++){
			T.insert(E1[e1].second, 1);
			R1[i].push_back(E1[e1].second);
		}
		
		for(; e2<E2.size() && E2[e2].first == i; e2++){
			T.insert(E2[e2].second, 1);
			C1[E2[e2].second].push_back(i);
		}
		
		for(; f<F.size() && F[f].first == i; f++){
			T.insert(F[f].second, -1);
			R2[i].push_back(F[f].second);
			C2[F[f].second].push_back(i);
		}
		
		T.root(i);
	}
}

int colour(int sr, int sc, int er, int ec)
{
	int ret = 1 + T.query(sr, sc, er, ec);
	
	ret -= lower_bound(R1[sr].begin(), R1[sr].end(), ec + 1)
		 - lower_bound(R1[sr].begin(), R1[sr].end(), sc);
	ret -= lower_bound(C1[sc].begin(), C1[sc].end(), er + 1)
		 - lower_bound(C1[sc].begin(), C1[sc].end(), sr);
	
	ret += lower_bound(R2[sr].begin(), R2[sr].end(), ec + 1)
		 - lower_bound(R2[sr].begin(), R2[sr].end(), sc + 1);
	ret += lower_bound(C2[sc].begin(), C2[sc].end(), er + 1)
		 - lower_bound(C2[sc].begin(), C2[sc].end(), sr);
		 
	ret += (sr < lx && rx < er && sc < ly && ry < ec);
	
    return ret;
}

Compilation message

rainbow.cpp: In member function 'void pst::insert(int, int, int, int, int)':
rainbow.cpp:25:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   else if(i <= (s + e >> 1)){
                 ~~^~~
rainbow.cpp:27:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    insert(T[p].l, s, s + e >> 1, i, v);
                      ~~^~~
rainbow.cpp:31:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    insert(T[p].r, (s + e >> 1) + 1, e, i, v);
                    ~~^~~
rainbow.cpp: In member function 'int pst::query(int, int, int, int, int)':
rainbow.cpp:49:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   else return query(T[p].l, s, s + e >> 1, l, r)
                                ~~^~~
rainbow.cpp:50:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     + query(T[p].r, (s + e >> 1) + 1, e, l, r);
                      ~~^~~
rainbow.cpp: In function 'void init(int, int, int, int, int, char*)':
rainbow.cpp:118:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(; v<V.size() && V[v].first == i; v++){
         ~^~~~~~~~~
rainbow.cpp:122:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(; e1<E1.size() && E1[e1].first == i; e1++){
         ~~^~~~~~~~~~
rainbow.cpp:127:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(; e2<E2.size() && E2[e2].first == i; e2++){
         ~~^~~~~~~~~~
rainbow.cpp:132:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(; f<F.size() && F[f].first == i; f++){
         ~^~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 196 ms 256588 KB Output is correct
2 Correct 200 ms 256760 KB Output is correct
3 Correct 196 ms 256716 KB Output is correct
4 Correct 193 ms 256632 KB Output is correct
5 Correct 193 ms 256888 KB Output is correct
6 Correct 194 ms 256596 KB Output is correct
7 Correct 194 ms 256488 KB Output is correct
8 Correct 193 ms 256568 KB Output is correct
9 Correct 194 ms 256476 KB Output is correct
10 Correct 194 ms 256504 KB Output is correct
11 Correct 196 ms 256788 KB Output is correct
12 Correct 197 ms 256784 KB Output is correct
13 Correct 194 ms 256788 KB Output is correct
14 Correct 196 ms 257060 KB Output is correct
15 Correct 194 ms 256504 KB Output is correct
16 Correct 199 ms 256632 KB Output is correct
17 Correct 194 ms 256504 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 256632 KB Output is correct
2 Correct 194 ms 256504 KB Output is correct
3 Correct 460 ms 266588 KB Output is correct
4 Correct 603 ms 272536 KB Output is correct
5 Correct 618 ms 272092 KB Output is correct
6 Correct 536 ms 269124 KB Output is correct
7 Correct 579 ms 269120 KB Output is correct
8 Correct 320 ms 265072 KB Output is correct
9 Correct 678 ms 272540 KB Output is correct
10 Correct 609 ms 271812 KB Output is correct
11 Correct 555 ms 269280 KB Output is correct
12 Correct 445 ms 271548 KB Output is correct
13 Correct 449 ms 272452 KB Output is correct
14 Correct 469 ms 271812 KB Output is correct
15 Correct 438 ms 269124 KB Output is correct
16 Correct 560 ms 268048 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 194 ms 256504 KB Output is correct
2 Correct 395 ms 272924 KB Output is correct
3 Correct 305 ms 272576 KB Output is correct
4 Correct 315 ms 270760 KB Output is correct
5 Correct 299 ms 269648 KB Output is correct
6 Correct 285 ms 265252 KB Output is correct
7 Correct 296 ms 265796 KB Output is correct
8 Correct 346 ms 268488 KB Output is correct
9 Correct 348 ms 267864 KB Output is correct
10 Correct 244 ms 261328 KB Output is correct
11 Correct 316 ms 266796 KB Output is correct
12 Correct 391 ms 273092 KB Output is correct
13 Correct 294 ms 272580 KB Output is correct
14 Correct 318 ms 270880 KB Output is correct
15 Correct 302 ms 269640 KB Output is correct
16 Correct 300 ms 265320 KB Output is correct
17 Correct 312 ms 266052 KB Output is correct
18 Correct 342 ms 268100 KB Output is correct
19 Correct 339 ms 272744 KB Output is correct
20 Correct 339 ms 272852 KB Output is correct
21 Correct 405 ms 268524 KB Output is correct
22 Correct 342 ms 267716 KB Output is correct
23 Correct 249 ms 261324 KB Output is correct
24 Correct 312 ms 266884 KB Output is correct
25 Correct 385 ms 272900 KB Output is correct
26 Correct 293 ms 272584 KB Output is correct
27 Correct 321 ms 270916 KB Output is correct
28 Correct 297 ms 269636 KB Output is correct
29 Correct 281 ms 265280 KB Output is correct
30 Correct 312 ms 266104 KB Output is correct
31 Correct 346 ms 268228 KB Output is correct
32 Correct 333 ms 272712 KB Output is correct
33 Correct 348 ms 272868 KB Output is correct

Subtask #4
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 196 ms 256588 KB Output is correct
2 Correct 200 ms 256760 KB Output is correct
3 Correct 196 ms 256716 KB Output is correct
4 Correct 193 ms 256632 KB Output is correct
5 Correct 193 ms 256888 KB Output is correct
6 Correct 194 ms 256596 KB Output is correct
7 Correct 194 ms 256488 KB Output is correct
8 Correct 193 ms 256568 KB Output is correct
9 Correct 194 ms 256476 KB Output is correct
10 Correct 194 ms 256504 KB Output is correct
11 Correct 196 ms 256788 KB Output is correct
12 Correct 197 ms 256784 KB Output is correct
13 Correct 194 ms 256788 KB Output is correct
14 Correct 196 ms 257060 KB Output is correct
15 Correct 194 ms 256504 KB Output is correct
16 Correct 199 ms 256632 KB Output is correct
17 Correct 194 ms 256504 KB Output is correct
18 Correct 522 ms 269100 KB Output is correct
19 Correct 317 ms 260472 KB Output is correct
20 Correct 313 ms 260048 KB Output is correct
21 Correct 280 ms 260044 KB Output is correct
22 Correct 322 ms 260216 KB Output is correct
23 Correct 329 ms 260344 KB Output is correct
24 Correct 296 ms 260344 KB Output is correct
25 Correct 290 ms 260344 KB Output is correct
26 Correct 298 ms 260472 KB Output is correct
27 Correct 385 ms 268840 KB Output is correct
28 Correct 362 ms 268040 KB Output is correct
29 Correct 379 ms 268608 KB Output is correct
30 Correct 493 ms 270916 KB Output is correct
31 Correct 193 ms 256760 KB Output is correct
32 Correct 470 ms 268984 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 196 ms 256588 KB Output is correct
2 Correct 200 ms 256760 KB Output is correct
3 Correct 196 ms 256716 KB Output is correct
4 Correct 193 ms 256632 KB Output is correct
5 Correct 193 ms 256888 KB Output is correct
6 Correct 194 ms 256596 KB Output is correct
7 Correct 194 ms 256488 KB Output is correct
8 Correct 193 ms 256568 KB Output is correct
9 Correct 194 ms 256476 KB Output is correct
10 Correct 194 ms 256504 KB Output is correct
11 Correct 196 ms 256788 KB Output is correct
12 Correct 197 ms 256784 KB Output is correct
13 Correct 194 ms 256788 KB Output is correct
14 Correct 196 ms 257060 KB Output is correct
15 Correct 194 ms 256504 KB Output is correct
16 Correct 199 ms 256632 KB Output is correct
17 Correct 194 ms 256504 KB Output is correct
18 Correct 522 ms 269100 KB Output is correct
19 Correct 317 ms 260472 KB Output is correct
20 Correct 313 ms 260048 KB Output is correct
21 Correct 280 ms 260044 KB Output is correct
22 Correct 322 ms 260216 KB Output is correct
23 Correct 329 ms 260344 KB Output is correct
24 Correct 296 ms 260344 KB Output is correct
25 Correct 290 ms 260344 KB Output is correct
26 Correct 298 ms 260472 KB Output is correct
27 Correct 385 ms 268840 KB Output is correct
28 Correct 362 ms 268040 KB Output is correct
29 Correct 379 ms 268608 KB Output is correct
30 Correct 493 ms 270916 KB Output is correct
31 Correct 193 ms 256760 KB Output is correct
32 Correct 470 ms 268984 KB Output is correct
33 Correct 395 ms 272924 KB Output is correct
34 Correct 305 ms 272576 KB Output is correct
35 Correct 315 ms 270760 KB Output is correct
36 Correct 299 ms 269648 KB Output is correct
37 Correct 285 ms 265252 KB Output is correct
38 Correct 296 ms 265796 KB Output is correct
39 Correct 346 ms 268488 KB Output is correct
40 Correct 348 ms 267864 KB Output is correct
41 Correct 244 ms 261328 KB Output is correct
42 Correct 316 ms 266796 KB Output is correct
43 Correct 391 ms 273092 KB Output is correct
44 Correct 294 ms 272580 KB Output is correct
45 Correct 318 ms 270880 KB Output is correct
46 Correct 302 ms 269640 KB Output is correct
47 Correct 300 ms 265320 KB Output is correct
48 Correct 312 ms 266052 KB Output is correct
49 Correct 342 ms 268100 KB Output is correct
50 Correct 339 ms 272744 KB Output is correct
51 Correct 339 ms 272852 KB Output is correct
52 Correct 405 ms 268524 KB Output is correct
53 Correct 342 ms 267716 KB Output is correct
54 Correct 249 ms 261324 KB Output is correct
55 Correct 312 ms 266884 KB Output is correct
56 Correct 385 ms 272900 KB Output is correct
57 Correct 293 ms 272584 KB Output is correct
58 Correct 321 ms 270916 KB Output is correct
59 Correct 297 ms 269636 KB Output is correct
60 Correct 281 ms 265280 KB Output is correct
61 Correct 312 ms 266104 KB Output is correct
62 Correct 346 ms 268228 KB Output is correct
63 Correct 333 ms 272712 KB Output is correct
64 Correct 348 ms 272868 KB Output is correct
65 Correct 696 ms 271988 KB Output is correct
66 Correct 655 ms 271196 KB Output is correct
67 Correct 376 ms 264824 KB Output is correct
68 Correct 425 ms 270200 KB Output is correct
69 Correct 550 ms 276552 KB Output is correct
70 Correct 397 ms 276004 KB Output is correct
71 Correct 454 ms 274368 KB Output is correct
72 Correct 503 ms 273208 KB Output is correct
73 Correct 380 ms 268840 KB Output is correct
74 Correct 385 ms 269516 KB Output is correct
75 Correct 423 ms 271704 KB Output is correct
76 Correct 480 ms 276420 KB Output is correct
77 Correct 467 ms 276284 KB Output is correct
78 Correct 460 ms 266588 KB Output is correct
79 Correct 603 ms 272536 KB Output is correct
80 Correct 618 ms 272092 KB Output is correct
81 Correct 536 ms 269124 KB Output is correct
82 Correct 579 ms 269120 KB Output is correct
83 Correct 320 ms 265072 KB Output is correct
84 Correct 678 ms 272540 KB Output is correct
85 Correct 609 ms 271812 KB Output is correct
86 Correct 555 ms 269280 KB Output is correct
87 Correct 445 ms 271548 KB Output is correct
88 Correct 449 ms 272452 KB Output is correct
89 Correct 469 ms 271812 KB Output is correct
90 Correct 438 ms 269124 KB Output is correct
91 Correct 560 ms 268048 KB Output is correct