| Task: | Kartta |
| Sender: | juhoh |
| Submission time: | 2015-01-29 17:13:15 +0200 |
| Language: | C++ |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | OUTPUT LIMIT EXCEEDED | 0 |
| #4 | OUTPUT LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.11 s | 1 | details |
| #2 | WRONG ANSWER | 0.40 s | 2 | details |
| #3 | OUTPUT LIMIT EXCEEDED | 0.00 s | 3 | details |
| #4 | OUTPUT LIMIT EXCEEDED | 0.00 s | 4 | details |
Code
#include <iostream>
#include <string>
#include <cmath>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef int ll;
int main() {
ios_base::sync_with_stdio(false);
ll n, m, h;
cin >> n >> m >> h;
ll map[n*m];
for (ll i = 0; i < n*m; ++i) {
cin >> map[i];
}
for (ll x = 1; x <= h; ++x) {
for (ll i = 0; i < n*m; ++i) {
cout << (map[i] >= x ? 'V' : 'S');
if (i % m == m - 1) {
cout << '\n';
}
}
}
for (ll x = 1; x <= h; ++x) {
cout << x << ' ';
for (ll i = 1; i < x; ++i) {
cout << i << ' ';
}
cout << '\n';
}
return 0;
}
Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
| 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: OUTPUT LIMIT EXCEEDED
| input |
|---|
| 100 100 1000 824 172 828 721 509 73 437 530... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| (empty) |
Test 4
Group: 4
Verdict: OUTPUT LIMIT EXCEEDED
| input |
|---|
| 100 100 10000 7110 9439 3392 1630 368 8481 1... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| (empty) |
