Kartta

#include <bits/stdc++.h>
using namespace std;
const int N = 200, H = 10001;
int grid[N][N];
char g[40][N][N];
vector<int> ans[H];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, m, h;
  cin >> n >> m >> h;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      cin >> grid[i][j];
    }
  }
  for (int k = 0; k < h; ++k) {
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < m; ++j) {
        g[k][i][j] = 1 + (grid[i][j] >= k + 1);
      }
    }
  }
  for (int k = 0; k < 40; ++k) {
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < m; ++j) {
        if (!g[k][i][j]) cout << 'L';
        else cout << (g[k][i][j] == 1 ? 'S' : 'V');
      }
      cout << '\n';
    }
  }
  for (int i = 1; i <= h; ++i) {
    cout << 1 << ' ' << i << '\n';
  }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: RUNTIME ERROR

Test 3

Group: 3

Verdict: RUNTIME ERROR

Test 4

Group: 4

Verdict: RUNTIME ERROR