# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
195584 | stefdasca | Abduction 2 (JOI17_abduction2) | C++14 | 4568 ms | 257676 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 pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
int h, w, q, vh[50002], vw[50002];
int rmqL[20][50002], rmqC[20][50002];
int aa, bb;
map<pair<int, pair<int, int> >, ll> mp;
ll solve(int L, int C, int dir)
{
if(mp.find({L, {C, dir}}) != mp.end())
return mp[{L, {C, dir}}];
ll ans = 0;
if(dir == 0)
{
int cd = L;
int init = vw[C];
for(int i = aa; i >= 0; --i)
{
if(cd - (1<<i) + 1 >= 1)
{
if(rmqL[i][cd - (1<<i) + 1] > init);
else
cd -= (1<<i);
}
# | 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... |