Kayaks

#include <cstdio>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>

#define all(x) (x).begin(),x.end()
#define mp make_pair

using namespace std;
int main()
{
    int n,m;
    cin >> n >> m;
    vector<string> inp(n);
    for(int i=0;i<n;i++)
        cin >> inp[i];
    vector<int> pos(9);
    vector<int> dist(9);
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
        {
            char c = inp[i][j];
            if(c >= '1' && c <= '9')
                dist[c-'1'] = m-j;
        }
    vector<pair<int,int> > dd(9);
    for(int i=0;i<9;i++)
        dd[i] = mp(dist[i],i);
    sort(all(dd));
    int p=1;
    pos[dd[0].second] = p;
    for(int i=1;i<9;i++)
    {
        if(dd[i].first != dd[i-1].first)
            p++;
        pos[dd[i].second] = p;
    }
    for(int i=0;i<9;i++)
        cout << pos[i] << endl;
}

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