# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28677 | not good but never sad (#68) | Test Data Creation (FXCUP2_testdata) | C++98 | 3 ms | 4376 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>
#include <algorithm>
using namespace std;
int N, M, S[400][601], T[300*300];
int S1[400][601], S2[400][601];
bool ans[303*303];
void upd(int s[400][601], int i, int k, int t)
{
i %= 400;
if (s[i][k] == -1 || s[i][k] > t){
s[i][k] = t;
}
}
void go(int i1, int k1, int i2, int k2)
{
ans[i1] = ans[i1+k1-300] = ans[i2] = ans[i2+k2-300] = 1;
if (i1 == i2 && k1 == k2) return;
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=0;i<400;i++) for (int k=0;k<=600;k++) S1[i][k] = -1;
S1[i1][k1] = T[i1] + (k1 != 300 ? T[i1+k1] : 0);
for (int i=i1;i<=r1;i++){
int xp = i / M, yp = i % M;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |