| Task: | Kayaks |
| Sender: | Pietari Kaskela |
| Submission time: | 2015-09-09 16:51:05 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.06 s | details |
| #2 | ACCEPTED | 0.05 s | details |
| #3 | ACCEPTED | 0.06 s | details |
| #4 | ACCEPTED | 0.05 s | details |
| #5 | ACCEPTED | 0.06 s | details |
| #6 | ACCEPTED | 0.05 s | details |
| #7 | ACCEPTED | 0.05 s | details |
| #8 | ACCEPTED | 0.05 s | details |
| #9 | ACCEPTED | 0.05 s | details |
| #10 | ACCEPTED | 0.05 s | details |
| #11 | ACCEPTED | 0.05 s | details |
| #12 | ACCEPTED | 0.05 s | details |
Code
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define defmod 1000000007
using namespace std;
int main(){
int n, m; cin >> n >> m;
string s[40];
vector<pii> lol;
for(int i = 0; i < n; i++){
cin >> s[i];
int tn = 0, p;
for(int j = 0; j < m; j++){
if(s[i][j] > '0' && s[i][j] <= '9'){
tn = s[i][j]-'0';
p = m-j;
break;
}
}
if(tn)
lol.push_back({p, tn});
}
sort(lol.begin(), lol.end());
int re[10];
int pp = 1;
for(int i = 0; i < 9; i++){
//cout << i << " : " << lol[i].second << " matka " << lol[i].first << endl;
re[lol[i].second] = pp;
pp++;
if(i > 0 && lol[i].first == lol[i-1].first){
re[lol[i].second] = re[lol[i-1].second];
pp--;
}
}
for(int i = 1; i <= 9; i++)
cout << re[i] << endl;
return 0;
}Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 10 15
S..........222F S.....111.....F S...333.......F S...555.......F ... |
| correct output |
|---|
| 5
1 6 3 6 ... |
| user output |
|---|
| 5 1 6 3 6 ... |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 10 10
S.....111F S....222.F S...333..F S..444...F ... |
| correct output |
|---|
| 1
2 3 4 5 ... |
| user output |
|---|
| 1 2 3 4 5 ... |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 10 10
S...111..F S....222.F S.....333F S444.....F ... |
| correct output |
|---|
| 3
2 1 6 5 ... |
| user output |
|---|
| 3 2 1 6 5 ... |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 10 20
S..................F S...111............F S......222.........F S.........333......F ... |
| correct output |
|---|
| 9
7 5 3 1 ... |
| user output |
|---|
| 9 7 5 3 1 ... |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 20 20
S999...............F S..................F S..................F S..................F ... |
| correct output |
|---|
| 5
3 7 6 4 ... |
| user output |
|---|
| 5 3 7 6 4 ... |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 30 30
S............................F... |
| correct output |
|---|
| 1
6 5 4 3 ... |
| user output |
|---|
| 1 6 5 4 3 ... |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 30 30
S111.........................F... |
| correct output |
|---|
| 1
1 1 1 1 ... |
| user output |
|---|
| 1 1 1 1 1 ... |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 30 30
S111.........................F... |
| correct output |
|---|
| 7
6 5 3 2 ... |
| user output |
|---|
| 7 6 5 3 2 ... |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 30 30
S............................F... |
| correct output |
|---|
| 1
1 1 1 3 ... |
| user output |
|---|
| 1 1 1 1 3 ... |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 30 30
S............................F... |
| correct output |
|---|
| 5
3 3 3 1 ... |
| user output |
|---|
| 5 3 3 3 1 ... |
Test 11
Verdict: ACCEPTED
| input |
|---|
| 30 30
S............................F... |
| correct output |
|---|
| 6
5 3 5 4 ... |
| user output |
|---|
| 6 5 3 5 4 ... |
Test 12
Verdict: ACCEPTED
| input |
|---|
| 30 30
S............................F... |
| correct output |
|---|
| 5
4 3 1 2 ... |
| user output |
|---|
| 5 4 3 1 2 ... |
