Submission #55999

# Submission time Handle Problem Language Result Execution time Memory
55999 2018-07-09T09:58:31 Z 김세빈(#1563) Sushi (JOI16_sushi) C++11
100 / 100
3749 ms 52524 KB
#include <bits/stdc++.h>

using namespace std;

int sz = 1000;

int A[404040], H[404040];
int B[404040], L[1010], R[1010];
priority_queue <int, vector<int>, greater<int>> Q[1010];
int n, k;

void spread(int x)
{
	if(Q[x].empty()) return;
	
	int i;
	
	for(i=L[x];i<=R[x];i++){
		if(A[i] > Q[x].top()){
			Q[x].push(A[i]);
			A[i] = Q[x].top(); Q[x].pop();
		}
	}
	
	for(;!Q[x].empty();) Q[x].pop();
}

int main()
{
	int q, i, a, b, c, x, y;
	
	scanf("%d%d", &n, &q);
	
	for(i=0;i<n;i++){
		scanf("%d", A+i);
		H[i] = A[i]; B[i] = i/sz;
		if(i % sz == 0) L[i/sz] = i;
		R[i/sz] = i;
	}
	
	k = (n - 1) / sz + 1;
	
	for(i=0;i<k;i++){
		make_heap(H + L[i], H + R[i] + 1);
	}
	
	for(;q--;){
		scanf("%d%d%d", &a, &b, &c);
		a --, b --;
		x = B[a], y = B[b];
		
		if(x == y){
			if(a <= b){
				spread(x);
				for(i=a;i<=b;i++){
					if(A[i] > c) swap(A[i], c);
				}
				
				for(i=L[x];i<=R[x];i++) H[i] = A[i];
				make_heap(H + L[x], H + R[x] + 1);
				
				printf("%d\n", c);
			}
			else{
				spread(x);
				for(i=a;i<=R[x];i++){
					if(A[i] > c) swap(A[i], c);
				}
				x = (x + 1) % k;
				
				for(;x!=y;x=(x+1)%k){
					if(H[L[x]] > c){
						Q[x].push(c);
						pop_heap(H + L[x], H + R[x] + 1);
						swap(c, H[R[x]]);
						push_heap(H + L[x], H + R[x] + 1);
					}
				}
				
				for(i=L[x];i<=b;i++){
					if(A[i] > c) swap(A[i], c);
				}
				
				for(i=L[x];i<=R[x];i++) H[i] = A[i];
				make_heap(H + L[x], H + R[x] + 1);
				
				printf("%d\n", c);
			}
		}
		else{
			if(L[x] != a){
				spread(x);
				
				for(i=a;i<=R[x];i++){
					if(A[i] > c) swap(A[i], c);
				}
				
				for(i=L[x];i<=R[x];i++) H[i] = A[i];
				make_heap(H + L[x], H + R[x] + 1);
				
				x = (x + 1) % k;
			}
			
			
			for(;x!=y;x=(x+1)%k){
				if(H[L[x]] > c){
					Q[x].push(c);
					pop_heap(H + L[x], H + R[x] + 1);
					swap(c, H[R[x]]);
					push_heap(H + L[x], H + R[x] + 1);
				}
			}
					
			spread(y);
			for(i=L[y];i<=b;i++){
				if(A[i] > c) swap(A[i], c);
			}
			
			for(i=L[y];i<=R[y];i++) H[i] = A[i];
			make_heap(H + L[y], H + R[y] + 1);

			printf("%d\n", c);
		}
	}
	
	return 0;
}

Compilation message

telegraph.cpp: In function 'int main()':
telegraph.cpp:32:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &q);
  ~~~~~^~~~~~~~~~~~~~~~
telegraph.cpp:35:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", A+i);
   ~~~~~^~~~~~~~~~~
telegraph.cpp:48:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &a, &b, &c);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 25 ms 376 KB Output is correct
2 Correct 27 ms 504 KB Output is correct
3 Correct 26 ms 580 KB Output is correct
4 Correct 33 ms 580 KB Output is correct
5 Correct 36 ms 716 KB Output is correct
6 Correct 27 ms 716 KB Output is correct
7 Correct 24 ms 716 KB Output is correct
8 Correct 38 ms 716 KB Output is correct
9 Correct 29 ms 716 KB Output is correct
10 Correct 38 ms 736 KB Output is correct
11 Correct 33 ms 736 KB Output is correct
12 Correct 28 ms 736 KB Output is correct
13 Correct 31 ms 736 KB Output is correct
14 Correct 25 ms 736 KB Output is correct
15 Correct 26 ms 736 KB Output is correct
16 Correct 21 ms 736 KB Output is correct
17 Correct 3 ms 736 KB Output is correct
18 Correct 3 ms 736 KB Output is correct
19 Correct 3 ms 764 KB Output is correct
20 Correct 3 ms 764 KB Output is correct
21 Correct 2 ms 764 KB Output is correct
22 Correct 2 ms 764 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2667 ms 51456 KB Output is correct
2 Correct 2592 ms 52088 KB Output is correct
3 Correct 365 ms 52088 KB Output is correct
4 Correct 2589 ms 52524 KB Output is correct
5 Correct 2259 ms 52524 KB Output is correct
6 Correct 2446 ms 52524 KB Output is correct
7 Correct 2275 ms 52524 KB Output is correct
8 Correct 2508 ms 52524 KB Output is correct
9 Correct 349 ms 52524 KB Output is correct
10 Correct 2068 ms 52524 KB Output is correct
11 Correct 326 ms 52524 KB Output is correct
12 Correct 1764 ms 52524 KB Output is correct
13 Correct 2525 ms 52524 KB Output is correct
14 Correct 2561 ms 52524 KB Output is correct
15 Correct 390 ms 52524 KB Output is correct
16 Correct 2626 ms 52524 KB Output is correct
17 Correct 2134 ms 52524 KB Output is correct
18 Correct 2305 ms 52524 KB Output is correct
19 Correct 2663 ms 52524 KB Output is correct
20 Correct 2474 ms 52524 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 25 ms 376 KB Output is correct
2 Correct 27 ms 504 KB Output is correct
3 Correct 26 ms 580 KB Output is correct
4 Correct 33 ms 580 KB Output is correct
5 Correct 36 ms 716 KB Output is correct
6 Correct 27 ms 716 KB Output is correct
7 Correct 24 ms 716 KB Output is correct
8 Correct 38 ms 716 KB Output is correct
9 Correct 29 ms 716 KB Output is correct
10 Correct 38 ms 736 KB Output is correct
11 Correct 33 ms 736 KB Output is correct
12 Correct 28 ms 736 KB Output is correct
13 Correct 31 ms 736 KB Output is correct
14 Correct 25 ms 736 KB Output is correct
15 Correct 26 ms 736 KB Output is correct
16 Correct 21 ms 736 KB Output is correct
17 Correct 3 ms 736 KB Output is correct
18 Correct 3 ms 736 KB Output is correct
19 Correct 3 ms 764 KB Output is correct
20 Correct 3 ms 764 KB Output is correct
21 Correct 2 ms 764 KB Output is correct
22 Correct 2 ms 764 KB Output is correct
23 Correct 2667 ms 51456 KB Output is correct
24 Correct 2592 ms 52088 KB Output is correct
25 Correct 365 ms 52088 KB Output is correct
26 Correct 2589 ms 52524 KB Output is correct
27 Correct 2259 ms 52524 KB Output is correct
28 Correct 2446 ms 52524 KB Output is correct
29 Correct 2275 ms 52524 KB Output is correct
30 Correct 2508 ms 52524 KB Output is correct
31 Correct 349 ms 52524 KB Output is correct
32 Correct 2068 ms 52524 KB Output is correct
33 Correct 326 ms 52524 KB Output is correct
34 Correct 1764 ms 52524 KB Output is correct
35 Correct 2525 ms 52524 KB Output is correct
36 Correct 2561 ms 52524 KB Output is correct
37 Correct 390 ms 52524 KB Output is correct
38 Correct 2626 ms 52524 KB Output is correct
39 Correct 2134 ms 52524 KB Output is correct
40 Correct 2305 ms 52524 KB Output is correct
41 Correct 2663 ms 52524 KB Output is correct
42 Correct 2474 ms 52524 KB Output is correct
43 Correct 1092 ms 52524 KB Output is correct
44 Correct 1230 ms 52524 KB Output is correct
45 Correct 729 ms 52524 KB Output is correct
46 Correct 1131 ms 52524 KB Output is correct
47 Correct 1224 ms 52524 KB Output is correct
48 Correct 3356 ms 52524 KB Output is correct
49 Correct 3749 ms 52524 KB Output is correct
50 Correct 3645 ms 52524 KB Output is correct
51 Correct 3525 ms 52524 KB Output is correct
52 Correct 989 ms 52524 KB Output is correct
53 Correct 875 ms 52524 KB Output is correct
54 Correct 2757 ms 52524 KB Output is correct
55 Correct 2768 ms 52524 KB Output is correct
56 Correct 2842 ms 52524 KB Output is correct
57 Correct 3096 ms 52524 KB Output is correct
58 Correct 2939 ms 52524 KB Output is correct
59 Correct 3158 ms 52524 KB Output is correct
60 Correct 2485 ms 52524 KB Output is correct
61 Correct 3143 ms 52524 KB Output is correct
62 Correct 2700 ms 52524 KB Output is correct
63 Correct 2697 ms 52524 KB Output is correct
64 Correct 572 ms 52524 KB Output is correct
65 Correct 1170 ms 52524 KB Output is correct
66 Correct 1096 ms 52524 KB Output is correct
67 Correct 1495 ms 52524 KB Output is correct
68 Correct 1749 ms 52524 KB Output is correct
69 Correct 1665 ms 52524 KB Output is correct
70 Correct 1746 ms 52524 KB Output is correct