oj.uz

Submission #660611

# Submission time Handle Problem Language Result Execution time Memory
660611 2022-11-22T15:39:34 Z iosif_andrei_ Robots (APIO13_robots) C++14
0 / 100
 2 ms 312 KB 
#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;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 312 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 312 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 312 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 312 KB Output isn't correct
2 Halted 0 ms 0 KB -