oj.uz

Submission #733028

# Submission time Handle Problem Language Result Execution time Memory
733028 2023-04-30T03:14:51 Z vjudge1 Collecting Mushrooms (NOI18_collectmushrooms) C++17
60 / 100
 2000 ms 3804 KB 
#include <bits/stdc++.h>
#define sts stable_sort
#define B begin()
#define rB rbegin()
#define E end()
#define rE rend()
#define F first
#define S second
#define pb push_back
#define ppb pop_back()
#define pf push_front
#define ppf pop_front()
#define eb emplace_back
#define ll long long
#define ui unsigned int
#define ull unsigned long long

using namespace std;

const int MAXN = 1e9 + 48;
const int MOD = 1e9 + 7;
const ll INF = 9223372036854775807LL;
const ll inf = 2147483647;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    int x, y, d, k; cin >> x >> y >> d >> k;
    vector<pair<int, int> > m, s;

    for(int i = 1; i <= x; i++){
        for(int j = 1; j <= y; j++){
            char c; cin >> c;
            if(c == 'M'){
                m.pb({i, j});
            }else if(c == 'S'){
                s.pb({i, j});
            }
        }
    }
    map<pair<int, int>, int> ma;

    int ans = 0;
    for(int i = 0; i < m.size(); i++){
        for(int j = 0; j < s.size(); j++){
            int a = abs(m[i].F - s[j].F), b = abs(m[i].S - s[j].S);

            if(a <= d && b <= d){
                ma[m[i]]++;
            }
            if(ma[m[i]] >= k){
                ans++;
                break;
            }
        }
    }

    cout << ans << "\n";

    return 0;
}
/**



**/

Compilation message

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 316 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 260 ms 568 KB Output is correct
9 Correct 55 ms 428 KB Output is correct
10 Correct 4 ms 340 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 34 ms 340 KB Output is correct
3 Correct 209 ms 984 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 5 ms 588 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 464 KB Output is correct
2 Correct 6 ms 460 KB Output is correct
3 Correct 5 ms 568 KB Output is correct
4 Correct 9 ms 468 KB Output is correct
5 Correct 4 ms 468 KB Output is correct

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2076 ms 3804 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 316 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 260 ms 568 KB Output is correct
9 Correct 55 ms 428 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 34 ms 340 KB Output is correct
13 Correct 209 ms 984 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 5 ms 588 KB Output is correct
16 Correct 5 ms 464 KB Output is correct
17 Correct 6 ms 460 KB Output is correct
18 Correct 5 ms 568 KB Output is correct
19 Correct 9 ms 468 KB Output is correct
20 Correct 4 ms 468 KB Output is correct
21 Execution timed out 2076 ms 3804 KB Time limit exceeded
22 Halted 0 ms 0 KB -