# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
412306 | model_code | Hexagonal Territory (APIO21_hexagon) | C++17 | 256 ms | 16212 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 "hexagon.h"
#include <bits/stdc++.h>
#define pii pair<int,int>
#define i1 first
#define i2 second
using namespace std;
const int MAXL=2e3+10;
const long long MOD=1e9+7;
const int dx[]={0,-1,-1,0,1,1,0};
const int dy[]={0,0,1,1,0,-1,-1};
int vis[MAXL][MAXL];
long long now, step, ans;
queue <pii> Q;
void add(int x,int y,int z) {
if (x<0||y<0||x>=MAXL||y>=MAXL) {
if (x+y==-2) {
now=(now+step)%MOD;
Q.push({x,y});
}
}
else if (vis[x][y]<=z) {
ans=(ans+now)%MOD;
vis[x][y]=2;
Q.push({x,y});
}
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |