# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
936912 | the_coding_pooh | Snowball (JOI21_ho_t2) | C++14 | 287 ms | 24144 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 uwu return 0;
using namespace std;
const int SIZE = 2e5 + 5;
int N, Q;
const long long INF = 3e18 + 5;
long long L[SIZE], R[SIZE], W[SIZE], X[SIZE];
#define fs first
#define sc second
int main(){
cin >> N >> Q;
X[N + 1] = INF;
X[0] = -INF;
for (int i = 1; i <= N;i++){
cin >> X[i];
W[i] = 0;
}
long long in_W, mnL = 0, mxR = 0, nX = 0;
multiset <pair<long long, long long>> opW;
opW.insert({0, 0});
for (int i = 1; i <= Q;i++){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |