Kayaks

#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;

int main() {
  int y, x;
  cin >> y >> x;
  int dist[9];
  for(int i = 0; i < y; ++i) {
    string s;
    cin >> s;
    for(int j = s.size() - 2; j > 0; --j) {
      if(s[j] != '.') {
	dist[s[j] - '1'] = j;
	break;
      }
    }
  }
  int pos[9];
  int place = 1;
  for(int j = x; j >= 0; --j) {
    vector<int> v;
    for(int i = 0; i < 9; ++i) {
      if(dist[i] == j) {
	v.push_back(i);
      }
    }
    if(!v.empty()) {
      for(int i : v) {
	pos[i] = place;
      }
      ++place;
    }
  }
  for(int i = 0; i < 9; ++i) {
    cout << pos[i] << "\n";
  }
  return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED