Kayaks

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

using namespace std;

bool cmp(pair<int, int> a, pair<int, int> b) {
    return a.second > b.second;
}

int main() {
    int n, m;
    cin >> n >> m;

    vector<pair<int, int>> position;
    string st;

    for (int i = 0; i < n; i++) {
        cin >> st;
        for (int j = 0; j < m; j++) {
            if (isdigit(st[j])) {
                position.push_back({(int)st[j] - '0' - 1, j});
                break;
            }
        }
    }
    int N = position.size();
    
    // for (int i = 0; i < N; i++)
    //     cout << position[i].first << " " << position[i].second << endl;
    // cout << endl;
    sort(position.begin(), position.end(), cmp);
    // for (int i = 0; i < N; i++)
    //     cout << position[i].first << " " << position[i].second << endl;
    // cout << endl;

    vector<int> ranks;
    ranks.reserve(n + 1);
    int i = 0;
    int c_rank = 1;
    while (i < N) {
        ranks[position[i].first] = c_rank; 
        if (i + 1 < N && position[i + 1].second < position[i].second)
            c_rank++;

        i++;
    }

    for (int i = 0; i < N; i++)
        cout << ranks[i] << endl;

    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