oj.uz

Submission #134651

# Submission time Handle Problem Language Result Execution time Memory
134651 2019-07-23T06:32:45 Z 송준혁(#3242) Sushi (JOI16_sushi) C++14
15 / 100
 1879 ms 27124 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;

int N, Q, Sq=2000;
int A[404040];
priority_queue<int> D[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]) swap(A[i], X);
			for (p++; p<q; p++) 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]) swap(A[i], X);
		}
		else{
			for (int i=S; i<min((p+1)*Sq, N+1); i++) if (X < A[i]) swap(A[i], X);
			for (p++; p<=N/Sq; p++) C[p].push(X), D[p].push(X), X = D[p].top(), D[p].pop();
			for (p=0; p<q; p++) 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]) swap(A[i], X);
		}

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

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
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 376 KB Output is correct
2 Correct 58 ms 504 KB Output is correct
3 Correct 59 ms 504 KB Output is correct
4 Incorrect 58 ms 508 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1784 ms 26780 KB Output is correct
2 Correct 1780 ms 26752 KB Output is correct
3 Correct 1109 ms 26720 KB Output is correct
4 Correct 1812 ms 27092 KB Output is correct
5 Correct 1067 ms 27124 KB Output is correct
6 Correct 1862 ms 26828 KB Output is correct
7 Correct 1839 ms 27016 KB Output is correct
8 Correct 1789 ms 27048 KB Output is correct
9 Correct 1064 ms 26720 KB Output is correct
10 Correct 1095 ms 27000 KB Output is correct
11 Correct 1093 ms 26760 KB Output is correct
12 Correct 1445 ms 26848 KB Output is correct
13 Correct 1780 ms 27012 KB Output is correct
14 Correct 1799 ms 26800 KB Output is correct
15 Correct 732 ms 26752 KB Output is correct
16 Correct 1788 ms 26780 KB Output is correct
17 Correct 1436 ms 26776 KB Output is correct
18 Correct 1869 ms 26868 KB Output is correct
19 Correct 1879 ms 26800 KB Output is correct
20 Correct 1283 ms 27004 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 376 KB Output is correct
2 Correct 58 ms 504 KB Output is correct
3 Correct 59 ms 504 KB Output is correct
4 Incorrect 58 ms 508 KB Output isn't correct
5 Halted 0 ms 0 KB -