Task: | Kayaks |
Sender: | Ollie |
Submission time: | 2016-10-15 13:18:30 +0300 |
Language: | C++ |
Status: | READY |
Result: | ACCEPTED |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.04 s | details |
#2 | ACCEPTED | 0.04 s | details |
#3 | ACCEPTED | 0.03 s | details |
#4 | ACCEPTED | 0.04 s | details |
#5 | ACCEPTED | 0.06 s | details |
#6 | ACCEPTED | 0.03 s | details |
#7 | ACCEPTED | 0.04 s | details |
#8 | ACCEPTED | 0.03 s | details |
#9 | ACCEPTED | 0.04 s | details |
#10 | ACCEPTED | 0.04 s | details |
#11 | ACCEPTED | 0.04 s | details |
#12 | ACCEPTED | 0.04 s | details |
Compiler report
input/code.cpp: In function 'int main()': input/code.cpp:37:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i=1;i<a.size();i++) { ^
Code
#include <bits/stdc++.h> #define _ ios_base::sync_with_stdio(0);cin.tie(); #define ll long long #define vi vector<int> #define pb push_back #define pii pair<int, int> #define vpii vector<pii> using namespace std; char img[50][50]; bool isnum(char c) { return c >= '1' && c <= '9'; } int main() { _ int n, m; cin >> n >> m; for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { cin >> img[i][j]; } } vector<pair<int,char>> a; for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { char c = img[i][j]; if(!isnum(c)) continue; while(isnum(img[i][j])) j++; a.pb({-j, c}); } } sort(a.begin(), a.end()); int place = 1; map<int,int> places; places[a[0].second-'0'] = 1; for(int i=1;i<a.size();i++) { if(a[i].first != a[i-1].first) { place++; } places[a[i].second-'0'] = place; } for(int i=1;i<=9;i++) { cout << places[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 ... |