# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14216 | Fakeable | 포탈들 (BOI14_portals) | C++98 | 368 ms | 67624 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<cstdio>
#include<queue>
#include<memory.h>
#define origin 1061109567
#define MAX_N 1100
using namespace std;
struct data {
int x,y,v;
data() {
}
data(int x_,int y_,int v_) {
x = x_, y = y_, v = v_;
}
};
bool operator <(data X,data Y) {
return X.v > Y.v;
}
bool operator >(data X,data Y) {
return X.v < Y.v;
}
int n,m,ct,dir[5][2] = {{-1,0},{1,0},{0,1},{0,-1}};
char a[MAX_N][MAX_N];
int dist[MAX_N][MAX_N][4], sd[MAX_N][MAX_N], dp[MAX_N][MAX_N];
int x1,x2,y1,y2;
priority_queue<data> Q_;
inline void Push(int x,int y,int z) {
if(x>=0 && x<n && y>=0 && y<m && a[x][y]!='#' && dp[x][y]==origin) {
Q_.push(data(x,y,z));
}
}
# | 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... |