| Task: | Lehmät |
| Sender: | zeriax |
| Submission time: | 2022-12-05 10:39:22 +0200 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 28 |
| #2 | ACCEPTED | 72 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 1, 2 | details |
| #2 | ACCEPTED | 0.00 s | 1, 2 | details |
| #3 | ACCEPTED | 0.00 s | 1, 2 | details |
| #4 | ACCEPTED | 0.00 s | 1, 2 | details |
| #5 | ACCEPTED | 0.00 s | 1, 2 | details |
| #6 | ACCEPTED | 0.00 s | 2 | details |
| #7 | ACCEPTED | 0.00 s | 2 | details |
| #8 | ACCEPTED | 0.00 s | 2 | details |
| #9 | ACCEPTED | 0.00 s | 2 | details |
Compiler report
input/code.cpp: In function 'int main()':
input/code.cpp:6:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
6 | scanf("%d %d", &n, &m);
| ~~~~~^~~~~~~~~~~~~~~~~
input/code.cpp:11:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
11 | scanf(" %c", &map[i][j]);
| ~~~~~^~~~~~~~~~~~~~~~~~~Code
#include <stdio.h>
int main() {
// Read input
int n, m;
scanf("%d %d", &n, &m);
char map[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf(" %c", &map[i][j]);
}
}
// Find the coordinates of the top-left and bottom-right corners of the pen
int min_x = m, min_y = n, max_x = 0, max_y = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (map[i][j] == '*') {
min_x = min_x < j ? min_x : j;
min_y = min_y < i ? min_y : i;
max_x = max_x > j ? max_x : j;
max_y = max_y > i ? max_y : i;
}
}
}
// Count the number of cows in the pen
int count = 0;
for (int i = min_y; i <= max_y; i++) {
for (int j = min_x; j <= max_x; j++) {
if (map[i][j] == '@') {
count++;
}
}
}
printf("%d\n", count);
return 0;
}
Test details
Test 1
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 3 3 *** *.* *** |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 2
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 3 3 *** *@* *** |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 3
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 10 ...@...... ..******.. @.*@@@@*.@ ..******.. ... |
| correct output |
|---|
| 4 |
| user output |
|---|
| 4 |
Test 4
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 10 10 @@...@.@@@ ..@@.@@..@ @.*******@ ..*@....*. ... |
| correct output |
|---|
| 11 |
| user output |
|---|
| 11 |
Test 5
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 10 10 ********** *@@@@@@@@* *@@@@@@@@* *@@@@@@@@* ... |
| correct output |
|---|
| 64 |
| user output |
|---|
| 64 |
Test 6
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 100 .........................@....... |
| correct output |
|---|
| 60 |
| user output |
|---|
| 60 |
Test 7
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 100 ..@@..........@......@....@@..... |
| correct output |
|---|
| 1507 |
| user output |
|---|
| 1507 |
Test 8
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 100 .@..@@..@@.@..@..@..@@..@..@..... |
| correct output |
|---|
| 3348 |
| user output |
|---|
| 3348 |
Test 9
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 100 @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@... |
| correct output |
|---|
| 7225 |
| user output |
|---|
| 7225 |
