oj.uz

답안 #1042215

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1042215 2024-08-02T16:10:52 Z flappybird Sushi (JOI16_sushi) C++17
20 / 100
 12000 ms 134992 KB 
//#define LOCAL
#include <bits/stdc++.h>
#include <cassert>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 1010101
#define MAXQ 101010
#define INF 1'000'000'100
#define bb ' '
#define ln '\n'
#define Ln '\n'
#define MOD 1000000007
#define TC 1
#ifdef LOCAL
#define DEBUG(a) cout<<a
#else
#define DEBUG(...) 1234
#endif
#define B 2500
int A[MAX];
multiset<int> all[MAX];
multiset<int> upd[MAX];
int N, Q;
void prop(int id) {
	all[id].clear();
	int i;
	for (i = id * B; i < min(N, (id + 1) * B); i++) {
		upd[id].emplace(A[i]);
		A[i] = *upd[id].begin();
		upd[id].erase(upd[id].begin());
		all[id].emplace(A[i]);
	}
	upd[id].clear();
}
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	cin >> N >> Q;
	int i;
	for (i = 0; i < N; i++) cin >> A[i];
	for (i = 0; i < N; i++) all[i / B].insert(A[i]);
	auto f = [&](int l, int r, int x) {
		int i;
		i = l;
		while (i <= r) {
			int b = i / B;
			if ((i % B == 0) && i + B - 1 <= r) {
				//DEBUG("ii" << i << ln);
				upd[b].insert(x);
				if (upd[b].size() > B) upd[b].erase(upd[b].find(*upd[b].rbegin()));
				all[b].insert(x);
				x = *all[b].rbegin();
				all[b].erase(all[b].find(x));
				i += B;
				//DEBUG('x' << x << bb);
			}
			else {
				if (upd[b].size()) prop(b);
				//DEBUG('i' << i << bb << A[i] << bb << x << ln);
				if (A[i] > x) {
					//for (auto x : all[b]) DEBUG('x' << x << bb);
					//DEBUG("fuck" << ln);
					//for (int i = B * b; i < B * (b + 1); i++) DEBUG(A[i] << bb);
					//DEBUG(ln);
					//DEBUG("asdf" << x << bb << A[i]);
					all[b].insert(x);
					all[b].erase(all[b].find(A[i]));
					swap(A[i], x);
				}
				i++;
				//DEBUG('y' << x << bb);
			}
		}
		return x;
	};
	while (Q--) {
		int l, r, x;
		cin >> l >> r >> x;
		l--;
		r--;
		if (l > r) {
			x = f(l, N - 1, x);
			x = f(0, r, x);
		}
		else x = f(l, r, x);
		cout << x << ln;
	}
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 97104 KB Output is correct
2 Correct 36 ms 97112 KB Output is correct
3 Correct 34 ms 97160 KB Output is correct
4 Correct 35 ms 97116 KB Output is correct
5 Correct 33 ms 97116 KB Output is correct
6 Correct 34 ms 97164 KB Output is correct
7 Correct 33 ms 97168 KB Output is correct
8 Correct 32 ms 97168 KB Output is correct
9 Correct 36 ms 96980 KB Output is correct
10 Correct 34 ms 97112 KB Output is correct
11 Correct 91 ms 97168 KB Output is correct
12 Correct 91 ms 97116 KB Output is correct
13 Correct 66 ms 97160 KB Output is correct
14 Correct 41 ms 97116 KB Output is correct
15 Correct 41 ms 97100 KB Output is correct
16 Correct 26 ms 97112 KB Output is correct
17 Correct 27 ms 96856 KB Output is correct
18 Correct 26 ms 96860 KB Output is correct
19 Correct 29 ms 96848 KB Output is correct
20 Correct 23 ms 96856 KB Output is correct
21 Correct 26 ms 96848 KB Output is correct
22 Correct 25 ms 96992 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4377 ms 134548 KB Output is correct
2 Correct 4414 ms 134488 KB Output is correct
3 Correct 5184 ms 134476 KB Output is correct
4 Correct 4211 ms 134684 KB Output is correct
5 Correct 2953 ms 134680 KB Output is correct
6 Correct 7847 ms 134744 KB Output is correct
7 Correct 7728 ms 134736 KB Output is correct
8 Correct 7808 ms 134724 KB Output is correct
9 Correct 2990 ms 134740 KB Output is correct
10 Correct 2857 ms 134992 KB Output is correct
11 Correct 2945 ms 134664 KB Output is correct
12 Correct 7958 ms 134656 KB Output is correct
13 Correct 4323 ms 134780 KB Output is correct
14 Correct 4336 ms 134548 KB Output is correct
15 Correct 4921 ms 134488 KB Output is correct
16 Correct 4225 ms 134736 KB Output is correct
17 Correct 8004 ms 134548 KB Output is correct
18 Correct 7709 ms 134636 KB Output is correct
19 Correct 7769 ms 134676 KB Output is correct
20 Correct 3842 ms 134700 KB Output is correct

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 97104 KB Output is correct
2 Correct 36 ms 97112 KB Output is correct
3 Correct 34 ms 97160 KB Output is correct
4 Correct 35 ms 97116 KB Output is correct
5 Correct 33 ms 97116 KB Output is correct
6 Correct 34 ms 97164 KB Output is correct
7 Correct 33 ms 97168 KB Output is correct
8 Correct 32 ms 97168 KB Output is correct
9 Correct 36 ms 96980 KB Output is correct
10 Correct 34 ms 97112 KB Output is correct
11 Correct 91 ms 97168 KB Output is correct
12 Correct 91 ms 97116 KB Output is correct
13 Correct 66 ms 97160 KB Output is correct
14 Correct 41 ms 97116 KB Output is correct
15 Correct 41 ms 97100 KB Output is correct
16 Correct 26 ms 97112 KB Output is correct
17 Correct 27 ms 96856 KB Output is correct
18 Correct 26 ms 96860 KB Output is correct
19 Correct 29 ms 96848 KB Output is correct
20 Correct 23 ms 96856 KB Output is correct
21 Correct 26 ms 96848 KB Output is correct
22 Correct 25 ms 96992 KB Output is correct
23 Correct 4377 ms 134548 KB Output is correct
24 Correct 4414 ms 134488 KB Output is correct
25 Correct 5184 ms 134476 KB Output is correct
26 Correct 4211 ms 134684 KB Output is correct
27 Correct 2953 ms 134680 KB Output is correct
28 Correct 7847 ms 134744 KB Output is correct
29 Correct 7728 ms 134736 KB Output is correct
30 Correct 7808 ms 134724 KB Output is correct
31 Correct 2990 ms 134740 KB Output is correct
32 Correct 2857 ms 134992 KB Output is correct
33 Correct 2945 ms 134664 KB Output is correct
34 Correct 7958 ms 134656 KB Output is correct
35 Correct 4323 ms 134780 KB Output is correct
36 Correct 4336 ms 134548 KB Output is correct
37 Correct 4921 ms 134488 KB Output is correct
38 Correct 4225 ms 134736 KB Output is correct
39 Correct 8004 ms 134548 KB Output is correct
40 Correct 7709 ms 134636 KB Output is correct
41 Correct 7769 ms 134676 KB Output is correct
42 Correct 3842 ms 134700 KB Output is correct
43 Execution timed out 12091 ms 116408 KB Time limit exceeded
44 Halted 0 ms 0 KB -