# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28901 | kriii | Test Data Creation (FXCUP2_testdata) | C++14 | 3779 ms | 4844 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 <stdio.h>
int N,M,T[300*300];
bool ans[300*300];
const int non = 0x0f0f0f0f;
const int per = 700;
const int base = 300;
int S1[per][base*2+1];
int S2[per][base*2+1];
void upd(int s[per][base*2+1], int i, int k, int x)
{
i %= per;
if (s[i][k] > x)
s[i][k] = x;
}
int go(int i1, int k1, int i2, int k2)
{
if (i1 == i2 && k1 == k2) return T[i1+k1-base];
int r1 = (i1 + i2) / 2 + 150;
if (r1 >= i2) r1 = i2;
int l2 = (i1 + i2) / 2 - 150;
if (l2 <= i1) l2 = i1;
for (int i=i1;i<=r1;i++) for (int k=0;k<=base*2;k++) S1[i%per][k] = non;
S1[i1%per][k1] = T[i1] + (k1 != base ? T[i1+k1-base] : 0);
for (int i=i1;i<=r1;i++){
int px = i / M, py = i % M;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |