oj.uz

답안 #1042206

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1042206 2024-08-02T16:04:20 Z flappybird Sushi (JOI16_sushi) C++17
5 / 100
 12000 ms 134436 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 2
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 83 ms 97268 KB Output is correct
2 Correct 80 ms 97260 KB Output is correct
3 Correct 81 ms 97264 KB Output is correct
4 Correct 80 ms 97116 KB Output is correct
5 Correct 87 ms 97112 KB Output is correct
6 Correct 83 ms 97116 KB Output is correct
7 Correct 89 ms 97112 KB Output is correct
8 Correct 88 ms 97232 KB Output is correct
9 Correct 81 ms 97112 KB Output is correct
10 Correct 83 ms 97264 KB Output is correct
11 Correct 85 ms 97104 KB Output is correct
12 Correct 84 ms 97112 KB Output is correct
13 Correct 87 ms 97244 KB Output is correct
14 Correct 139 ms 97116 KB Output is correct
15 Correct 133 ms 97264 KB Output is correct
16 Correct 21 ms 97116 KB Output is correct
17 Correct 22 ms 97028 KB Output is correct
18 Correct 24 ms 96860 KB Output is correct
19 Correct 22 ms 96856 KB Output is correct
20 Correct 23 ms 96860 KB Output is correct
21 Correct 23 ms 97080 KB Output is correct
22 Correct 25 ms 96860 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 12036 ms 134436 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 97268 KB Output is correct
2 Correct 80 ms 97260 KB Output is correct
3 Correct 81 ms 97264 KB Output is correct
4 Correct 80 ms 97116 KB Output is correct
5 Correct 87 ms 97112 KB Output is correct
6 Correct 83 ms 97116 KB Output is correct
7 Correct 89 ms 97112 KB Output is correct
8 Correct 88 ms 97232 KB Output is correct
9 Correct 81 ms 97112 KB Output is correct
10 Correct 83 ms 97264 KB Output is correct
11 Correct 85 ms 97104 KB Output is correct
12 Correct 84 ms 97112 KB Output is correct
13 Correct 87 ms 97244 KB Output is correct
14 Correct 139 ms 97116 KB Output is correct
15 Correct 133 ms 97264 KB Output is correct
16 Correct 21 ms 97116 KB Output is correct
17 Correct 22 ms 97028 KB Output is correct
18 Correct 24 ms 96860 KB Output is correct
19 Correct 22 ms 96856 KB Output is correct
20 Correct 23 ms 96860 KB Output is correct
21 Correct 23 ms 97080 KB Output is correct
22 Correct 25 ms 96860 KB Output is correct
23 Execution timed out 12036 ms 134436 KB Time limit exceeded
24 Halted 0 ms 0 KB -