| Task: | Kartta |
| Sender: | Perdex |
| Submission time: | 2015-01-29 15:50:27 +0200 |
| Language: | Java |
| Status: | READY |
| Result: | 12 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 12 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| #4 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.40 s | 1 | details |
| #2 | WRONG ANSWER | 0.43 s | 2 | details |
| #3 | WRONG ANSWER | 0.46 s | 3 | details |
| #4 | WRONG ANSWER | 0.56 s | 4 | details |
Code
public class Q6 {
public static void main(String[] fuckingCopyRightBreaker){
IO io = new IO();
int n = io.nextInt(), m = io.nextInt(), h = io.nextInt();
int[][] map = new int[n][m];
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
map[i][j] = io.nextInt();
}
}
for(int i = 0; i < 40; i++){
for(int j = 0; j < n; j++){
for(int k = 0; k < m; k++){
char c = 'V';
if(map[j][k] < i + 1)
c = 'S';
io.print(c);
}
io.println();
}
}
for(int i = 0; i < h; i++){
io.println(1 + " " + (i + 1));
}
io.close();
}
}
Test details
Test 1
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 100 100 40 40 11 38 24 5 31 40 10 17 33 1... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| VVVVVVVVVVVVVVVVVVVVVVVVVVVVVV... |
Test 2
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 100 100 200 200 71 185 86 113 84 170 60 17... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| VVVVVVVVVVVVVVVVVVVVVVVVVVVVVV... |
Test 3
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 100 1000 824 172 828 721 509 73 437 530... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| VVVVVVVVVVVVVVVVVVVVVVVVVVVVVV... |
Test 4
Group: 4
Verdict: WRONG ANSWER
| input |
|---|
| 100 100 10000 7110 9439 3392 1630 368 8481 1... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| VVVVVVVVVVVVVVVVVVVVVVVVVVVVVV... |
