Kayaks

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int n, m;
int res[15];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m;
	vector<pair<int, int>> v;
	for (int cl = 0; cl < n; ++cl) {
		string cs;
		cin >> cs;
		for (int i = m-1; i >= 0; --i) {
			if (cs[i] >= '1' && cs[i] <= '9') {
				int cn = cs[i]-'0';
				int cpos = (m-1)-i;
				v.push_back({cpos, cn});
				break;
			}
		}
	}
	sort(v.begin(), v.end());
	int mxdist = 0;
	int crank = 0;
	for (auto a : v) {
		int cd = a.first;
		int ct = a.second;
		if (cd > mxdist) {
			mxdist = cd;
			crank++;
		}
		res[ct] = crank;
	}
	for (int i = 1; i <= 9; ++i) {
		cout << res[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