Submission #660611

#TimeUsernameProblemLanguageResultExecution timeMemory
660611iosif_andrei_Robots (APIO13_robots)C++14
0 / 100
2 ms312 KiB
#include <bits/stdc++.h> using namespace std; typedef pair <int, int> pr; int k, n, m, a[501][501][9]; char c[501][501]; const int inf = 1000000000; pr up[501][501], down[501][501], left[501][501], right[501][501]; int main() { cin >> k >> m >> n; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { cin >> c[i][j]; if (isdigit(c[i][j])) c[i][j]--; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...