# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336766 | super_j6 | Abduction 2 (JOI17_abduction2) | C++14 | 1421 ms | 524292 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 <iostream>
#include <cstdio>
#include <algorithm>
#include <array>
#include <unordered_map>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second
typedef array<int, 2> T;
T operator+(T x, T y){
return {x[0] + y[0], x[1] + y[1]};
}
const int mxn = 50000, k = 4, w = 2;
const T d[k] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int n[2], q;
int a[2][mxn];
unordered_map<int, int> dp[k][mxn];
int sol(T x, int y){
for(int i = 0; i < 2; i++) if(x[i] < 0 || x[i] >= n[i]) return 0;
int ret = 0;
if(dp[y][x[0]].count(x[1])){
ret = dp[y][x[0]][x[1]];
}else if(a[!(y & 1)][x[!(y & 1)]] > a[y & 1][x[y & 1]]){
# | 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... |