Task: | Kayaks |
Sender: | PSG.LGD |
Submission time: | 2020-10-03 15:52:37 +0300 |
Language: | C++ (C++11) |
Status: | READY |
Result: | RUNTIME ERROR |
test | verdict | time | |
---|---|---|---|
#1 | RUNTIME ERROR | 0.01 s | details |
#2 | RUNTIME ERROR | 0.01 s | details |
#3 | RUNTIME ERROR | 0.01 s | details |
#4 | RUNTIME ERROR | 0.01 s | details |
#5 | RUNTIME ERROR | 0.01 s | details |
#6 | RUNTIME ERROR | 0.01 s | details |
#7 | RUNTIME ERROR | 0.01 s | details |
#8 | RUNTIME ERROR | 0.01 s | details |
#9 | RUNTIME ERROR | 0.01 s | details |
#10 | RUNTIME ERROR | 0.01 s | details |
#11 | RUNTIME ERROR | 0.01 s | details |
#12 | RUNTIME ERROR | 0.01 s | details |
Compiler report
input/code.cpp: In function 'int main()': input/code.cpp:24:31: warning: iteration 10 invokes undefined behavior [-Waggressive-loop-optimizations] prefix[i] = prefix[i-1] + prefix[i]; ~~~~~~~~~~^ input/code.cpp:20:20: note: within this loop for (int i=1; i<31; i++) { ~^~~
Code
#include <iostream> #include <queue> using namespace std; int n, m; string str; int map[10], cnt; bool q[31]; int prefix[10]; int main() { cin >> n >> m; for (int i=0; i<n; i++) { cin >> str; for (int j=0; j<m; j++) { if (str[j] <= '9' && str[j] > '0') { map[str[j]-'0'] = m-j-3; q[m-j-3] = true; break; } } } for (int i=1; i<31; i++) { if (!q[i]) { prefix[i] += 1; } prefix[i] = prefix[i-1] + prefix[i]; } // for (auto i:prefix) cout << i << " "; cout << endl; for (int i=1; i<10; i++) { if (map[i]) cout << map[i] - prefix[map[i]] << "\n"; } }
Test details
Test 1
Verdict: RUNTIME ERROR
input |
---|
10 15
S..........222F S.....111.....F S...333.......F S...555.......F ... |
correct output |
---|
5
1 6 3 6 ... |
user output |
---|
(empty) |
Test 2
Verdict: RUNTIME ERROR
input |
---|
10 10
S.....111F S....222.F S...333..F S..444...F ... |
correct output |
---|
1
2 3 4 5 ... |
user output |
---|
(empty) |
Test 3
Verdict: RUNTIME ERROR
input |
---|
10 10
S...111..F S....222.F S.....333F S444.....F ... |
correct output |
---|
3
2 1 6 5 ... |
user output |
---|
(empty) |
Test 4
Verdict: RUNTIME ERROR
input |
---|
10 20
S..................F S...111............F S......222.........F S.........333......F ... |
correct output |
---|
9
7 5 3 1 ... |
user output |
---|
(empty) |
Test 5
Verdict: RUNTIME ERROR
input |
---|
20 20
S999...............F S..................F S..................F S..................F ... |
correct output |
---|
5
3 7 6 4 ... |
user output |
---|
(empty) |
Test 6
Verdict: RUNTIME ERROR
input |
---|
30 30
S............................F... |
correct output |
---|
1
6 5 4 3 ... |
user output |
---|
(empty) |
Test 7
Verdict: RUNTIME ERROR
input |
---|
30 30
S111.........................F... |
correct output |
---|
1
1 1 1 1 ... |
user output |
---|
(empty) |
Test 8
Verdict: RUNTIME ERROR
input |
---|
30 30
S111.........................F... |
correct output |
---|
7
6 5 3 2 ... |
user output |
---|
(empty) |
Test 9
Verdict: RUNTIME ERROR
input |
---|
30 30
S............................F... |
correct output |
---|
1
1 1 1 3 ... |
user output |
---|
(empty) |
Test 10
Verdict: RUNTIME ERROR
input |
---|
30 30
S............................F... |
correct output |
---|
5
3 3 3 1 ... |
user output |
---|
(empty) |
Test 11
Verdict: RUNTIME ERROR
input |
---|
30 30
S............................F... |
correct output |
---|
6
5 3 5 4 ... |
user output |
---|
(empty) |
Test 12
Verdict: RUNTIME ERROR
input |
---|
30 30
S............................F... |
correct output |
---|
5
4 3 1 2 ... |
user output |
---|
(empty) |