Kayaks

#include <bits/stdc++.h>
#define UNVISITED -1
#define _ ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0), cout.precision(15);
using namespace std;

typedef long long int64;
typedef pair<int, int> ii;

int main(){ _
    int n, m;   cin >> n >> m;
    vector< vector<char> > place(n, vector<char> (m, ' '));
    for(int i = 0; i < n; ++i)
        for(int j = 0; j < m; ++j)
            cin >> place[i][j];

    vector<int> rank(10, -1);
    int counter = 1;
    for(int c = m - 1; c >= 0; --c){
        bool flag = false;
        for(int r = 0; r < n; ++r){
            if(place[r][c] >= '1' && place[r][c] <= '9'){
                int team = place[r][c] - '0';
                if(rank[team] == -1){
                    rank[team] = counter;
                    flag = true;
                }
            }
        }
        if(flag)    ++counter;
    }

    for(int i = 1; i <= 9; ++i)
        cout << rank[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