oj.uz

Submission #134678

# Submission time Handle Problem Language Result Execution time Memory
134678 2019-07-23T07:21:39 Z 송준혁(#3242) Sushi (JOI16_sushi) C++14
5 / 100
 4873 ms 262148 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;

int N, Q, Sq=500;
int A[404040];
priority_queue<int> D[1000], P[1000];
priority_queue<int, vector<int>, greater<int>> C[1000];

int main(){
	scanf("%d %d", &N, &Q);
	for (int i=1; i<=N; i++){
		scanf("%d", &A[i]);
		D[i/Sq].push(A[i]);
	}
	while (Q--){
		int S, T, X;
		scanf("%d %d %d", &S, &T, &X);
		int p = S/Sq, q = T/Sq;
		for (int i=max(1,p*Sq); i<min((p+1)*Sq, N+1); i++) C[p].push(A[i]), A[i] = C[p].top(), C[p].pop();
		while (!C[p].empty()) C[p].pop();
		for (int i=max(1,q*Sq); i<min((q+1)*Sq, N+1); i++) C[q].push(A[i]), A[i] = C[q].top(), C[q].pop();
		while (!C[q].empty()) C[q].pop();

		if (S <= T){
			for (int i=S; i<min((p+1)*Sq, T+1); i++) if (X < A[i]) {P[p].push(A[i]), swap(A[i], X), D[p].push(A[i]);}
			for (p++; p<q; p++) {
				while (!P[p].empty() && D[p].top() == P[p].top()) D[p].pop(), P[p].pop();
				C[p].push(X), D[p].push(X);
				X = D[p].top(), D[p].pop();
			}
			for (int i=max(S,q*Sq); i<=T; i++) if (X < A[i]) {P[q].push(A[i]), swap(A[i], X), D[q].push(A[i]);}
		}
		else{
			for (int i=S; i<min((p+1)*Sq, N+1); i++) if (X < A[i]) {P[p].push(A[i]), swap(A[i], X), D[p].push(A[i]);}
			for (p++; p<=N/Sq; p++) {
				while (!P[p].empty() && D[p].top() == P[p].top()) D[p].pop(), P[p].pop();
				C[p].push(X), D[p].push(X);
				X = D[p].top(), D[p].pop();
			}
			for (p=0; p<q; p++) {
				while (!P[p].empty() && D[p].top() == P[p].top()) D[p].pop(), P[p].pop();
				C[p].push(X), D[p].push(X);
				X = D[p].top(), D[p].pop();
			}
			for (int i=max(1,q*Sq); i<=T; i++)  if (X < A[i]) {P[q].push(A[i]), swap(A[i], X), D[q].push(A[i]);}
		}

		printf("%d\n", X);
	}
	return 0;
}
/*
7 100
13
90
35
60
38
64
83
1 4 33
7 1 14
4 5 47
1 7 82
6 1 93
6 5 56
*/

Compilation message

sushi.cpp: In function 'int main()':
sushi.cpp:12:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &Q);
  ~~~~~^~~~~~~~~~~~~~~~~
sushi.cpp:14:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &A[i]);
   ~~~~~^~~~~~~~~~~~~
sushi.cpp:19:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &S, &T, &X);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 632 KB Output is correct
2 Correct 29 ms 632 KB Output is correct
3 Correct 29 ms 632 KB Output is correct
4 Correct 30 ms 632 KB Output is correct
5 Correct 28 ms 504 KB Output is correct
6 Correct 29 ms 504 KB Output is correct
7 Correct 27 ms 544 KB Output is correct
8 Correct 27 ms 504 KB Output is correct
9 Correct 31 ms 504 KB Output is correct
10 Correct 29 ms 504 KB Output is correct
11 Correct 110 ms 1784 KB Output is correct
12 Correct 112 ms 1848 KB Output is correct
13 Correct 89 ms 1400 KB Output is correct
14 Correct 33 ms 504 KB Output is correct
15 Correct 34 ms 504 KB Output is correct
16 Correct 18 ms 504 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 2 ms 248 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 504 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4043 ms 109528 KB Output is correct
2 Correct 4070 ms 104916 KB Output is correct
3 Correct 2052 ms 96516 KB Output is correct
4 Correct 4108 ms 108456 KB Output is correct
5 Correct 3879 ms 197624 KB Output is correct
6 Correct 4690 ms 229256 KB Output is correct
7 Correct 4864 ms 262144 KB Output is correct
8 Correct 4873 ms 262144 KB Output is correct
9 Correct 1929 ms 96420 KB Output is correct
10 Correct 3367 ms 100116 KB Output is correct
11 Correct 1856 ms 96500 KB Output is correct
12 Correct 3948 ms 197660 KB Output is correct
13 Correct 4129 ms 107176 KB Output is correct
14 Correct 4077 ms 105348 KB Output is correct
15 Correct 1963 ms 96320 KB Output is correct
16 Correct 4107 ms 109844 KB Output is correct
17 Runtime error 3761 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
18 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 632 KB Output is correct
2 Correct 29 ms 632 KB Output is correct
3 Correct 29 ms 632 KB Output is correct
4 Correct 30 ms 632 KB Output is correct
5 Correct 28 ms 504 KB Output is correct
6 Correct 29 ms 504 KB Output is correct
7 Correct 27 ms 544 KB Output is correct
8 Correct 27 ms 504 KB Output is correct
9 Correct 31 ms 504 KB Output is correct
10 Correct 29 ms 504 KB Output is correct
11 Correct 110 ms 1784 KB Output is correct
12 Correct 112 ms 1848 KB Output is correct
13 Correct 89 ms 1400 KB Output is correct
14 Correct 33 ms 504 KB Output is correct
15 Correct 34 ms 504 KB Output is correct
16 Correct 18 ms 504 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 2 ms 248 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 504 KB Output is correct
23 Correct 4043 ms 109528 KB Output is correct
24 Correct 4070 ms 104916 KB Output is correct
25 Correct 2052 ms 96516 KB Output is correct
26 Correct 4108 ms 108456 KB Output is correct
27 Correct 3879 ms 197624 KB Output is correct
28 Correct 4690 ms 229256 KB Output is correct
29 Correct 4864 ms 262144 KB Output is correct
30 Correct 4873 ms 262144 KB Output is correct
31 Correct 1929 ms 96420 KB Output is correct
32 Correct 3367 ms 100116 KB Output is correct
33 Correct 1856 ms 96500 KB Output is correct
34 Correct 3948 ms 197660 KB Output is correct
35 Correct 4129 ms 107176 KB Output is correct
36 Correct 4077 ms 105348 KB Output is correct
37 Correct 1963 ms 96320 KB Output is correct
38 Correct 4107 ms 109844 KB Output is correct
39 Runtime error 3761 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
40 Halted 0 ms 0 KB -