oj.uz

Submission #733817

# Submission time Handle Problem Language Result Execution time Memory
733817 2023-05-01T10:40:00 Z vjudge1 Collecting Mushrooms (NOI18_collectmushrooms) C++17
60 / 100
 2000 ms 5068 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector <pair<ll,ll>> v;
ll r, c, d, li;
bool check(ll a, ll b) {
    if(a < r && b < c && a >= 0 && b >= 0) return 1;
    else return 0;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> r >> c;
    cin >> d >> li;
    char ch[r][c];
    for(ll i = 0; i < r; i++) {
        for(ll j = 0; j < c; j++) {
            cin >> ch[i][j];
            if(ch[i][j] == 'M') {
                v.push_back({i, j});
            }
        }
    }
    ll ans = 0;
    for(ll i = 0; i < v.size(); i++) {
        ll s = 0;
        for(ll k = v[i].first - d; k <= v[i].first + d; k++) {
            for(ll q = v[i].second - d; q <= v[i].second + d; q++) {
                if(check(k, q) == 0) continue;
                if(ch[k][q] == 'S') s++;
            }
        }
        if(s >= li) ans++;
    }
    cout << ans;
}

Compilation message

mushrooms.cpp: In function 'int main()':
mushrooms.cpp:25:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     for(ll i = 0; i < v.size(); i++) {
      |                   ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 174 ms 448 KB Output is correct
3 Correct 186 ms 428 KB Output is correct
4 Correct 38 ms 340 KB Output is correct
5 Correct 10 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 174 ms 448 KB Output is correct
3 Correct 186 ms 428 KB Output is correct
4 Correct 38 ms 340 KB Output is correct
5 Correct 10 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 57 ms 368 KB Output is correct
9 Correct 45 ms 364 KB Output is correct
10 Correct 2 ms 212 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 311 ms 508 KB Output is correct
2 Correct 44 ms 468 KB Output is correct
3 Correct 14 ms 468 KB Output is correct
4 Correct 300 ms 512 KB Output is correct
5 Correct 6 ms 468 KB Output is correct

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2063 ms 5068 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 174 ms 448 KB Output is correct
3 Correct 186 ms 428 KB Output is correct
4 Correct 38 ms 340 KB Output is correct
5 Correct 10 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 57 ms 368 KB Output is correct
9 Correct 45 ms 364 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 311 ms 508 KB Output is correct
17 Correct 44 ms 468 KB Output is correct
18 Correct 14 ms 468 KB Output is correct
19 Correct 300 ms 512 KB Output is correct
20 Correct 6 ms 468 KB Output is correct
21 Execution timed out 2063 ms 5068 KB Time limit exceeded
22 Halted 0 ms 0 KB -