Kartta

#include <iostream>
#include <vector>
#include<algorithm>
#include <set>
#include <map>
using namespace std;
using ll = long long;
ll t[100][100];
ll k[41][100][100];
 
int main() {
  ll n, m, h;
  cin >> n >> m >> h;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      cin >> t[i][j];
    }
  }
  for (int i = 1; i <= h; ++i) {
    for (int l = 0; l < n; l++) {
      for (int j = 0; j < m; j++) {
        if (t[l][j] < i) k[i][l][j] = 0;
        else k[i][l][j] = 1;
      }
    }
  }
  for (int i = h+1; i <= 40; ++i) {
    for (int l = 0; l < n; l++) {
      for (int j = 0; j < m; j++) {
        k[i][l][j] = 0;
      }
    }
  }
  for (int l = 1; l <= 40; ++l) {
    //cout << l << endl;
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < m; ++j) {
        if (k[l][i][j]) cout << "V" << " ";
        else cout << "S" << " ";
      }
      cout << endl;
    }
  }
  for (int i = 1; i <= h; ++i) {
    cout << 1 << " " << i << endl;
  }
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: RUNTIME ERROR

Test 3

Group: 3

Verdict: RUNTIME ERROR

Test 4

Group: 4

Verdict: RUNTIME ERROR