제출 #1310250

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1310250		dgarcia09	Collecting Mushrooms (NOI18_collectmushrooms)	C++20	60 / 100	170 ms	327680 KiB

mushrooms

#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#define endl '\n' 
#define fr first
#define sc second
#define vc vector<int>
using namespace std;

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); 	cout.tie(0);
    cout.setf(ios::fixed);
    cout.precision(0);

    int r, c, d, k;
    cin >> r >> c >> d >> k;
    char arr[r+1][c+1];
    vector<pair<int, int>> h, a;

    for(int i = 1; i <= r; i++){
        for(int j= 1 ;j <= c; j++){
            cin >> arr[i][j];
            if(arr[i][j] == 'M') h.push_back({i,j});
            if(arr[i][j] == 'S') a.push_back({i,j});
        }
    }

    int res[h.size()][a.size()];

    for(int i = 0; i < h.size(); i++){
        for(int j = 0; j < a.size(); j++){
            res[i][j] = max(abs(h[i].fr - a[j].fr), abs(h[i].sc - a[j].sc));
        }
    }
    
    vc hon(h.size(), 0);

    for(int i = 0; i < h.size(); i++){
        for(int j = 0; j < a.size(); j++){
            if(res[i][j] <= d) hon[i]++;
        }
    }

    int cont = 0;
    for(int i : hon){
        if(i >= k) cont++;
    }

    cout << cont << endl;

    return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 18 / 18
• Subtask 4: 23 / 23
• Subtask 5: 0 / 19
• Subtask 6: 0 / 21