oj.uz

Submission #199473

# Submission time Handle Problem Language Result Execution time Memory
199473 2020-02-01T13:56:53 Z dennisstar Sushi (JOI16_sushi) C++17
100 / 100
 9017 ms 74700 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define all(V) (V).begin(), (V).end()
using namespace std;
typedef vector<int> vim;
typedef pair<int, int> pii;
 
const int sz = 700;

int N, M, Q, X[400010];
priority_queue<int> S[1010], R[1010];

inline void upd(int t) {
	for (int i=t*sz; i<min((t+1)*sz, N); i++) {
		R[t].em(-X[i]);
		X[i]=-R[t].top();
		R[t].pop();
	}
	while (!S[t].empty()) S[t].pop();
	while (!R[t].empty()) R[t].pop();
}
 
inline void sol(int t, int &p) {
	S[t].em(p); R[t].em(-p);
	p=S[t].top(); S[t].pop();
}

inline void make(int t) { for (int i=t*sz; i<min(N, (t+1)*sz); i++) S[t].em(X[i]); }

inline int f(int s, int e, int p) {
	int st=s/sz, et=e/sz;
	if (st==et) {
		upd(st);
		for (int i=s; i<=e; i++) if (p<X[i]) swap(p, X[i]);
		make(st);
	}
	else {
		upd(st); upd(et);
		for (int i=s; i<(st+1)*sz; i++) if (p<X[i]) swap(p, X[i]);
		for (int i=st+1; i<et; i++) sol(i, p);
		for (int i=et*sz; i<=e; i++) if (p<X[i]) swap(p, X[i]);
		make(st); make(et);
	}
	return p;
}
 
int main() {
	scanf("%d %d", &N, &Q); M=(N+sz-1)/sz;
	for (int i=0; i<N; i++) scanf("%d", &X[i]), S[i/sz].em(X[i]);
	while (Q--) {
		int s, t, p;
		scanf("%d %d %d", &s, &t, &p); s--; t--;
		if (s>t) printf("%d\n", f(0, t, f(s, N-1, p)));
		else printf("%d\n", f(s, t, p));
	}
	return 0;
}

Compilation message

sushi.cpp: In function 'int main()':
sushi.cpp:51:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &Q); M=(N+sz-1)/sz;
  ~~~~~^~~~~~~~~~~~~~~~~
sushi.cpp:52:44: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i=0; i<N; i++) scanf("%d", &X[i]), S[i/sz].em(X[i]);
                          ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
sushi.cpp:55:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &s, &t, &p); s--; t--;
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 307 ms 760 KB Output is correct
2 Correct 336 ms 504 KB Output is correct
3 Correct 312 ms 376 KB Output is correct
4 Correct 303 ms 376 KB Output is correct
5 Correct 298 ms 504 KB Output is correct
6 Correct 303 ms 632 KB Output is correct
7 Correct 136 ms 380 KB Output is correct
8 Correct 136 ms 376 KB Output is correct
9 Correct 307 ms 632 KB Output is correct
10 Correct 299 ms 468 KB Output is correct
11 Correct 281 ms 380 KB Output is correct
12 Correct 291 ms 376 KB Output is correct
13 Correct 304 ms 504 KB Output is correct
14 Correct 416 ms 504 KB Output is correct
15 Correct 429 ms 504 KB Output is correct
16 Correct 124 ms 504 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 380 KB Output is correct
22 Correct 5 ms 376 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4210 ms 70356 KB Output is correct
2 Correct 4399 ms 70140 KB Output is correct
3 Correct 1977 ms 70200 KB Output is correct
4 Correct 4213 ms 70492 KB Output is correct
5 Correct 3486 ms 70196 KB Output is correct
6 Correct 4537 ms 70432 KB Output is correct
7 Correct 4454 ms 70356 KB Output is correct
8 Correct 4376 ms 70424 KB Output is correct
9 Correct 1915 ms 70204 KB Output is correct
10 Correct 3424 ms 70400 KB Output is correct
11 Correct 1820 ms 70116 KB Output is correct
12 Correct 3593 ms 70240 KB Output is correct
13 Correct 4117 ms 70356 KB Output is correct
14 Correct 4269 ms 70568 KB Output is correct
15 Correct 2044 ms 70072 KB Output is correct
16 Correct 4256 ms 70244 KB Output is correct
17 Correct 3553 ms 70280 KB Output is correct
18 Correct 4451 ms 70540 KB Output is correct
19 Correct 4402 ms 70392 KB Output is correct
20 Correct 4356 ms 70180 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 307 ms 760 KB Output is correct
2 Correct 336 ms 504 KB Output is correct
3 Correct 312 ms 376 KB Output is correct
4 Correct 303 ms 376 KB Output is correct
5 Correct 298 ms 504 KB Output is correct
6 Correct 303 ms 632 KB Output is correct
7 Correct 136 ms 380 KB Output is correct
8 Correct 136 ms 376 KB Output is correct
9 Correct 307 ms 632 KB Output is correct
10 Correct 299 ms 468 KB Output is correct
11 Correct 281 ms 380 KB Output is correct
12 Correct 291 ms 376 KB Output is correct
13 Correct 304 ms 504 KB Output is correct
14 Correct 416 ms 504 KB Output is correct
15 Correct 429 ms 504 KB Output is correct
16 Correct 124 ms 504 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 380 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 4210 ms 70356 KB Output is correct
24 Correct 4399 ms 70140 KB Output is correct
25 Correct 1977 ms 70200 KB Output is correct
26 Correct 4213 ms 70492 KB Output is correct
27 Correct 3486 ms 70196 KB Output is correct
28 Correct 4537 ms 70432 KB Output is correct
29 Correct 4454 ms 70356 KB Output is correct
30 Correct 4376 ms 70424 KB Output is correct
31 Correct 1915 ms 70204 KB Output is correct
32 Correct 3424 ms 70400 KB Output is correct
33 Correct 1820 ms 70116 KB Output is correct
34 Correct 3593 ms 70240 KB Output is correct
35 Correct 4117 ms 70356 KB Output is correct
36 Correct 4269 ms 70568 KB Output is correct
37 Correct 2044 ms 70072 KB Output is correct
38 Correct 4256 ms 70244 KB Output is correct
39 Correct 3553 ms 70280 KB Output is correct
40 Correct 4451 ms 70540 KB Output is correct
41 Correct 4402 ms 70392 KB Output is correct
42 Correct 4356 ms 70180 KB Output is correct
43 Correct 6647 ms 7236 KB Output is correct
44 Correct 6650 ms 11700 KB Output is correct
45 Correct 3913 ms 8292 KB Output is correct
46 Correct 6642 ms 11792 KB Output is correct
47 Correct 6636 ms 11792 KB Output is correct
48 Correct 6896 ms 11712 KB Output is correct
49 Correct 7354 ms 11512 KB Output is correct
50 Correct 7308 ms 11692 KB Output is correct
51 Correct 7214 ms 11940 KB Output is correct
52 Correct 8757 ms 17524 KB Output is correct
53 Correct 8326 ms 17068 KB Output is correct
54 Correct 8479 ms 17344 KB Output is correct
55 Correct 9017 ms 17200 KB Output is correct
56 Correct 8906 ms 17248 KB Output is correct
57 Correct 8912 ms 16804 KB Output is correct
58 Correct 5030 ms 13284 KB Output is correct
59 Correct 4400 ms 13168 KB Output is correct
60 Correct 3859 ms 74688 KB Output is correct
61 Correct 4485 ms 74328 KB Output is correct
62 Correct 4325 ms 74676 KB Output is correct
63 Correct 4402 ms 74700 KB Output is correct
64 Correct 2809 ms 8052 KB Output is correct
65 Correct 3619 ms 41040 KB Output is correct
66 Correct 3524 ms 41040 KB Output is correct
67 Correct 7019 ms 61816 KB Output is correct
68 Correct 7885 ms 61928 KB Output is correct
69 Correct 7710 ms 61920 KB Output is correct
70 Correct 7723 ms 61872 KB Output is correct