Task: | Kayaks |
Sender: | Anonyymit Algoritmistit |
Submission time: | 2015-09-09 17:25:07 +0300 |
Language: | Java |
Status: | READY |
Result: | ACCEPTED |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.17 s | details |
#2 | ACCEPTED | 0.17 s | details |
#3 | ACCEPTED | 0.17 s | details |
#4 | ACCEPTED | 0.17 s | details |
#5 | ACCEPTED | 0.19 s | details |
#6 | ACCEPTED | 0.17 s | details |
#7 | ACCEPTED | 0.18 s | details |
#8 | ACCEPTED | 0.17 s | details |
#9 | ACCEPTED | 0.17 s | details |
#10 | ACCEPTED | 0.17 s | details |
#11 | ACCEPTED | 0.16 s | details |
#12 | ACCEPTED | 0.18 s | details |
Code
/* * To change this license header, choose License Headers in Project Properties. * To change this template file, choose Tools | Templates * and open the template in the editor. */ //package kilo; import java.util.Arrays; import java.util.HashMap; /** * * @author asjuvone */ public class Kayaks { public static void main(String[] args) { IO io = new IO(); int n = io.nextInt(); int m = io.nextInt(); // HashMap<Character, Integer> teams = new HashMap(); // for (int i = 1; i <= 9; i++) { // teams.put((char)i, 0); // } int standing = 1; int[][] a = new int[n][m]; for (int i = 0; i < n; i++) { String next = io.next(); for (int j = 0; j < m; j++) { a[i][j] = next.charAt(j) - '0'; } } int[] standingit = new int[10]; for (int j = m-2; j > 0; j--) { boolean kasvataStanding = false; for (int i = 0; i < n; i++) { //System.out.println("Luetaan rivi " + i + " paikka " + j); if (a[i][j] < 0) continue; if (a[i][j] > 9) continue; //System.out.println("Löytyi " + a[i][j]); if (standingit[a[i][j]] == 0) { standingit[a[i][j]] = standing; kasvataStanding = true; } } if (kasvataStanding) standing++; } //System.out.println(Arrays.toString(standingit)); for (int i = 1; i < standingit.length; i++) { io.println(standingit[i]); } io.close(); } }
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 ... |