Task: | Kayaks |
Sender: | idan |
Submission time: | 2016-10-15 14:57:39 +0300 |
Language: | C++ |
Status: | READY |
Result: | ACCEPTED |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.02 s | details |
#2 | ACCEPTED | 0.03 s | details |
#3 | ACCEPTED | 0.03 s | details |
#4 | ACCEPTED | 0.04 s | details |
#5 | ACCEPTED | 0.04 s | details |
#6 | ACCEPTED | 0.03 s | details |
#7 | ACCEPTED | 0.04 s | details |
#8 | ACCEPTED | 0.05 s | details |
#9 | ACCEPTED | 0.05 s | details |
#10 | ACCEPTED | 0.04 s | details |
#11 | ACCEPTED | 0.03 s | details |
#12 | ACCEPTED | 0.04 s | details |
Compiler report
input/code.cpp: In function 'int main()': input/code.cpp:16:48: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d" , &numberOfBoats, &lengthOfRoute); ^ input/code.cpp:20:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result] scanf("%s",buffer); ^
Code
#include <stdio.h> #include <stdlib.h> #include <string.h> int rank[10] = { 0}; char buffer[50]; int rankCounter[31] = {0}; int rankTable[31] = {0}; int main() { int i = 0, j = 0; int numberOfBoats = 0; int lengthOfRoute = 0; scanf("%d %d" , &numberOfBoats, &lengthOfRoute); for( i = 0; i < numberOfBoats; i++) { scanf("%s",buffer); for(j = lengthOfRoute - 2; j >= 0; j--) { if(buffer[j] != '.') { rank[buffer[j] == 'S' ? 10 : buffer[j] - '0'] = j; break; } } } for(i = 0 ; i < numberOfBoats; i++) { //printf("%d , %d " , i , rank[i]); } for(i = 0 ; i < numberOfBoats; i++) { rankCounter[rank[i]]++; } j = 1; for(i = lengthOfRoute - 2; i >= 0; i--) { if(rankCounter[i]) { rankTable[i] = j++; } } for(i = 1; i < 10; i++) { printf("%d\n" , rankTable[rank[i]]); } }
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 ... |