# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1093954 | Trisanu_Das | Robots (APIO13_robots) | C++17 | 936 ms | 57536 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<bits/stdc++.h>
#define X first
#define Y second
using namespace std;
typedef pair<int,int> pii;
const int inf = 1e9, N = 505;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
int n, w, h, dt[9][9][N][N];
char ipt[N][N];
bool vis[N][N][4], solved[9][9];
pii ini[9], nxt[N][N][4];
queue<pii>q;
vector<pair<int,pii> > vec;
bool valid (int A, int B) {
if(A < 1 || A > h) return false;
if(B < 1 || B > w) return false;
if(ipt[A][B] == 'x') return false;
return true;
}
void calc(int A, int B, int i) {
if(vis[A][B][i]) return;
Compilation message (stderr)
# | 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... |