# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199434 | dennisstar | Sushi (JOI16_sushi) | C++17 | 12056 ms | 24980 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
int N, M, Q, X[400010];
vector<pii> B[810]; multiset<int> S[810];
void make(int t) {
B[t].clear(); S[t].clear();
int ub=min((t+1)*500, N);
for (int i=t*500; i<ub; i++) B[t].eb(X[i], i);
sort(all(B[t])); for (auto &j:B[t]) S[t].em(j.fi);
}
void upd(int t) {
auto it=S[t].begin();
for (auto &i:B[t]) { i.fi=(*it); X[i.se]=i.fi; ++it; }
}
void solve(int t, int &p) {
S[t].em(p);
p=(*prev(S[t].end())); S[t].erase(prev(S[t].end()));
}
int main() {
scanf("%d %d", &N, &Q); M=(N+499)/500;
for (int i=0; i<N; i++) scanf("%d", &X[i]);
for (int i=0; i<M; i++) make(i);
while (Q--) {
int s, t, p;
scanf("%d %d %d", &s, &t, &p); s--; t--;
upd(s/500); upd(t/500);
if (s<=t&&s/500==t/500) {
for (int i=s; i<=t; i++) if (X[i]>p) swap(X[i], p);
make(s/500);
printf("%d\n", p);
continue;
}
int ub=min((s/500+1)*500, N);
for (int i=s; i<ub; i++) if (X[i]>p) swap(X[i], p);
for (int i=s/500+1; i<(s<t?t/500:M); i++) solve(i, p);
if (s>t) for (int i=0; i<t/500; i++) solve(i, p);
for (int i=t/500*500; i<=t; i++) if (X[i]>p) swap(X[i], p);
make(s/500); make(t/500);
printf("%d\n", p);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |