# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
261476 | brcode | Robots (APIO13_robots) | C++14 | 1424 ms | 144596 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 <iostream>
#include <bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimization ("Ofast")
using namespace std;
const int MAXN = 501;
char grid[MAXN][MAXN];
int dp[MAXN][MAXN][10][10];
vector<pair<int,int>> res[MAXN*MAXN];
pair<int,int> visited[MAXN][MAXN][5];
pair<int,int> bot[10];
int dx[6] = {0,0,1,0,-1};
int dy[6] = {0,1,0,-1,0};
int n,h,w;
bool check(int i,int j){
if(i<=0||j<=0||i>w||j>h||grid[i][j] == 'x'){
return false;
}
return true;
}
pair<int,int> dfs(int i,int j,int dir){
if(visited[i][j][dir]!=make_pair(0,0)){
return visited[i][j][dir];
}
if(grid[i][j]!='x' && grid[i][j]!='C' && grid[i][j]!='A'){
if(check(i+dx[dir],j+dy[dir])){
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... |