# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
10357 | dohyun0324 | Robots (APIO13_robots) | C++98 | 428 ms | 130176 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<string.h>
#include<algorithm>
#include<vector>
using namespace std;
//1 : 동
//2 : 서
//3 : 남
//4 : 북
int mini,dap=2147483647,n,w,h,d[10][10][510][510],px,py,pk,check[510][510];
bool ch[5][510][510];
int xx[5]={0,0,0,1,-1};
int yy[5]={0,1,-1,0,0};
char b[510],a[510][510];
vector< pair<short,short> >arr[250010];
struct data
{
short x,y;
}go[5][510][510];
struct data2
{
int x,y,lev;
}q[250010];
struct data3
{
int x,y;
}pos[11];
void bfs2(int i,int j,int p)
{
int k,f=-1,r=-1,kx,ky,l;
# | 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... |