# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
435716 | penguinhacker | Toll (BOI17_toll) | C++14 | 192 ms | 13512 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>
using namespace std;
#define ll long long
#define ar array
const int mxN=5e4, mxQ=1e4;
int n, m, k, q, ans[mxQ];
ar<int, 2> qry[mxQ];
vector<ar<int, 2>> bef[mxN], aft[mxN];
int tl[mxN][5], tr[mxN][5];
void smin(int& x, int y) {
if (x==-1||y<x)
x=y;
}
void solve(int l, int r, vector<int>& v) {
if (v.empty())
return;
assert(l^r);
int mid=(l+r)/2;
for (int i=mid*k; i<(mid+1)*k; ++i) {
memset(tl[i], -1, sizeof(tl[i]));
memset(tr[i], -1, sizeof(tr[i]));
tl[i][i%k]=tr[i][i%k]=0;
}
for (int i=mid*k-1; i>=l*k; --i) {
memset(tl[i], -1, sizeof(tl[i]));
for (int j=0; j<k; ++j)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |