oj.uz

답안 #134676

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
134676 2019-07-23T07:20:33 Z 송준혁(#3242) Sushi (JOI16_sushi) C++14
5 / 100
 113 ms 5424 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[600], P[600];
priority_queue<int, vector<int>, greater<int>> C[600];

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

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 508 KB Output is correct
2 Correct 30 ms 504 KB Output is correct
3 Correct 30 ms 508 KB Output is correct
4 Correct 31 ms 504 KB Output is correct
5 Correct 30 ms 556 KB Output is correct
6 Correct 29 ms 504 KB Output is correct
7 Correct 26 ms 376 KB Output is correct
8 Correct 27 ms 476 KB Output is correct
9 Correct 31 ms 504 KB Output is correct
10 Correct 29 ms 508 KB Output is correct
11 Correct 111 ms 1780 KB Output is correct
12 Correct 113 ms 1720 KB Output is correct
13 Correct 85 ms 1528 KB Output is correct
14 Correct 32 ms 504 KB Output is correct
15 Correct 33 ms 504 KB Output is correct
16 Correct 17 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 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 380 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 72 ms 5424 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 508 KB Output is correct
2 Correct 30 ms 504 KB Output is correct
3 Correct 30 ms 508 KB Output is correct
4 Correct 31 ms 504 KB Output is correct
5 Correct 30 ms 556 KB Output is correct
6 Correct 29 ms 504 KB Output is correct
7 Correct 26 ms 376 KB Output is correct
8 Correct 27 ms 476 KB Output is correct
9 Correct 31 ms 504 KB Output is correct
10 Correct 29 ms 508 KB Output is correct
11 Correct 111 ms 1780 KB Output is correct
12 Correct 113 ms 1720 KB Output is correct
13 Correct 85 ms 1528 KB Output is correct
14 Correct 32 ms 504 KB Output is correct
15 Correct 33 ms 504 KB Output is correct
16 Correct 17 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 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 380 KB Output is correct
23 Runtime error 72 ms 5424 KB Execution killed with signal 11 (could be triggered by violating memory limits)
24 Halted 0 ms 0 KB -