# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1127628 | Dedibeat | Robots (APIO13_robots) | C++20 | 29 ms | 19524 KiB |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int n, w, h;
tuple<int, int, int> nxt[500][500][4];
pair<int, int> stop[500][500][4];
bool vis[500][500][4];
vector<string> grid;
void compute_next();
void compute_stop();
void compute_adj();
vector<int> adj[500 * 500];
int main(){
ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
cin >> n >> w >> h;
grid.assign(h, "");
vector<int> robots;
for(int i = 0; i < h; i++){
cin >> grid[i];
for(int j = 0; j < w; j++){
if(grid[i][j] > '0' && grid[i][j] <= '9')
robots.push_back(i * w + j);
}
}
compute_next();
compute_stop();
compute_adj();
int r1 = robots[0], r2 = robots[1];
int N = h * w;
# | 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... |