oj.uz

답안 #1005967

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1005967 2024-06-23T09:47:50 Z andecaandeci Collecting Mushrooms (NOI18_collectmushrooms) C++17
100 / 100
 11 ms 8284 KB 
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long int ull;
const ll md = 1e9+7;
const int ukr = 2e5+10;
int read() {
    int ketek = 0; bool ne=0;
    register char c = getchar();
    while(c == ' ' or c =='\n') c =getchar();
    if(c=='-'){ne = 1; c = getchar();}
    while(c >= '0' and c <='9') { ketek = (ketek<<3)+(ketek<<1)+c-'0'; c = getchar();}
    if(ne) ketek*=-1;
    return ketek;
}   
void print(int x) {
    if (x < 0) {putchar('-');x = -x;}
    int len = 0, buf[10];
    if (x == 0) {putchar('0');return;}
    while (x > 0) {buf[len++] = x % 10; x/=10;}
    while (len > 0) {putchar('0' + buf[--len]);}
}
void File_Work(){
  freopen("test.in","r",stdin);
  freopen("test.out","w",stdout);
}
int n, m, a, b, c, d, id;
struct babi{
    ll x, y, id;
};
struct babis{
    ll x, y;
};
ll gcd(ll a, ll b) {
   if (b == 0) return a;
   return gcd(b, a % b);
}
ll pgkt(ll rnx, ll rny){
    if(rny == 0) return 1;
    ll nwrn = pgkt(rnx, rny/2);
    if(rny%2){
        return (((nwrn*nwrn)%md)*rnx)%md;
    }else{
        return (nwrn*nwrn)%md;
    }
}
vector<int> v;
string s;
void solve(){
    cin >> n >> m >> a >> b;
    int ar[n+2][m+2];
    bool vis[n+2][m+2];
    memset(ar, 0, sizeof(ar));
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            char f;
            vis[i][j] = 0; 
            cin >> f;
            if(f == '.') continue;
            if(f == 'M'){
                vis[i][j] = 1;
            }else{
                ar[max(1, i-a)][max(1, j-a)] += 1;
                ar[min(n+1, i+a+1)][max(1, j-a)] -= 1;
                ar[max(1, i-a)][min(m+1, j+a+1)] -= 1;
                ar[min(n+1, i+a+1)][min(m+1, j+a+1)] += 1;
            }
        }
    }
    int tot = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            ar[i][j] += ar[i-1][j] + ar[i][j-1] - ar[i-1][j-1];
            //cout << ar[i][j] << " ";
            if(ar[i][j] >= b && vis[i][j]){
                tot++;
            }
        }
        //cout << "\n";
    }
    cout << tot;
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
  int t =1;
    //cin >> t;
    for(int i = 1; i <= t; i++){
        //cout << "Case " << i << ": ";
        solve();
    }
}

Compilation message

mushrooms.cpp: In function 'int read()':
mushrooms.cpp:10:19: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   10 |     register char c = getchar();
      |                   ^
mushrooms.cpp: In function 'void File_Work()':
mushrooms.cpp:25:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |   freopen("test.in","r",stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
mushrooms.cpp:26:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |   freopen("test.out","w",stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1496 KB Output is correct
2 Correct 3 ms 1628 KB Output is correct
3 Correct 3 ms 1884 KB Output is correct
4 Correct 3 ms 1628 KB Output is correct
5 Correct 3 ms 1628 KB Output is correct

Subtask #5
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 8284 KB Output is correct
2 Correct 9 ms 8284 KB Output is correct
3 Correct 11 ms 8028 KB Output is correct
4 Correct 11 ms 8156 KB Output is correct
5 Correct 10 ms 8028 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 1496 KB Output is correct
17 Correct 3 ms 1628 KB Output is correct
18 Correct 3 ms 1884 KB Output is correct
19 Correct 3 ms 1628 KB Output is correct
20 Correct 3 ms 1628 KB Output is correct
21 Correct 11 ms 8284 KB Output is correct
22 Correct 9 ms 8284 KB Output is correct
23 Correct 11 ms 8028 KB Output is correct
24 Correct 11 ms 8156 KB Output is correct
25 Correct 10 ms 8028 KB Output is correct
26 Correct 10 ms 3420 KB Output is correct
27 Correct 8 ms 3420 KB Output is correct
28 Correct 8 ms 3420 KB Output is correct
29 Correct 8 ms 3420 KB Output is correct
30 Correct 8 ms 3368 KB Output is correct