# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
98260 | dalgerok | Jetpack (COCI16_jetpack) | C++17 | 44 ms | 15096 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>
using namespace std;
const int N = 1e5 + 5;
int n = 10, m;
char a[11][N];
int d[11][N];
pair < int, int > p[11][N];
inline bool check(int x, int y){
return 1 <= x && x <= n && 1 <= y && y <= m && a[x][y] == '.';
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> m;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
cin >> a[i][j];
}
}
memset(d, -1, sizeof(d));
queue < pair < int, int > > q;
q.push(make_pair(n, 1));
d[n][1] = 0;
while(!q.empty()){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |