oj.uz

Submission #925575

# Submission time Handle Problem Language Result Execution time Memory
925575 2024-02-12T05:27:17 Z vjudge1 Collecting Mushrooms (NOI18_collectmushrooms) C++17
79 / 100
 2000 ms 7260 KB 
// By ObeliX
#include <bits/stdc++.h>
#pragma GCC target( "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#include <unordered_map>
#include <cstddef>
#include <cassert>
#include <bitset>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>

using namespace std;

const long long N = 1e6 + 5;
const long long MOD = 1e7 + 7;
const long long inf = 1e18;

long long n , m , d , k;

int main(){
    //freopen( "cinema.in" , "r" , stdin );
    //freopen( "cinema.out" , "w" , stdout );
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m >> d >> k;
    char c[n+5][m+5];
    for ( int i = 0 ; i <= n + 1 ; i++ ) {
        for ( int j = 0 ; j <= m + 1 ; j++ ) {
            c[i][j] = '.';
        }
    }
    long long cnt1 = 0 , cnt2 = 0;
    for ( int i = 1 ; i <= n ; i++ ) {
        for ( int j = 1 ; j <= m ; j++ ) {
            cin >> c[i][j];
            if ( c[i][j] == 'S' ) {
                cnt1++;
            }
            if ( c[i][j] == 'M' ) {
                cnt2++;
            }
        }
    }
    if ( d == max( n , m ) && cnt1 >= k ) {
        cout << cnt2 ;
    }
    else {
        if ( d == 1 && k == 1 ) {
            long long ans = 0;
            for ( int i = 1 ; i <= n ; i++ ) {
                for ( int j = 1 ; j <= m ; j++ ) {
                    if ( c[i][j] == 'M' ) {
                        if ( c[i][j-1] == 'S' || c[i-1][j] == 'S' || c[i+1][j] == 'S' || c[i][j+1] == 'S' ||c[i+1][j-1] == 'S' ||c[i-1][j+1] == 'S' ||c[i-1][j-1] == 'S' ||c[i+1][j+1] == 'S') {
                            ans++;
                        }
                    }
                }
            }
            cout << ans;
        }
        else {
            if ( n == 1 ) {
                long long scan[m+5];
                for ( int i = 0 ; i <= m ; i++ ) {
                    scan[i] = 0;
                }
                for ( int i = 1 ; i <= m ; i++ ) {
                    if ( c[1][i] == 'S' ) {
                        scan[min( m + 1 , i + d + 1 )]--;
                        scan[max( 1ll , i - d )]++;
                    }
                }
                long long ans = 0;
                for ( int i = 1 ; i <= m ; i++ ) {
                    scan[i] += scan[i-1];
                    if ( c[1][i] == 'M' && scan[i] >= k ) {
                        ans++;
                    }
                }
                cout << ans;
            }
            else {
                vector <pair<long long , long long>> v1 , v2;
                for ( int i = 1 ; i <= n ; i++ ) {
                    for ( int j = 1 ; j <= m ; j++ ) {
                        if ( c[i][j] == 'M' ) {
                            v2.push_back( { i , j } );
                        }
                        else if ( c[i][j] == 'S' ) {
                            v1.push_back( { i , j } );
                        }
                    }
                }
                long long ans = 0;
                for ( auto it : v2 ) {
                    long long x = it.first , y = it.second;
                    long long cnt = 0;
                    for ( auto it1 : v1 ) {
                        long long x1 = it1.first , y1 = it1.second;
                        if ( max( abs( x - x1 ) , abs( y1 - y ) ) <= d ) {
                            cnt++;
                        }
                    }
                    if ( cnt >= k ) {
                        ans++;
                    }
                }
                cout << ans ;
            }
        }
    }
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 57 ms 604 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #4
23.0 / 23.0

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

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7256 KB Output is correct
2 Correct 9 ms 7260 KB Output is correct
3 Correct 12 ms 7260 KB Output is correct
4 Correct 14 ms 7260 KB Output is correct
5 Correct 11 ms 7260 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 57 ms 604 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 3 ms 604 KB Output is correct
18 Correct 4 ms 604 KB Output is correct
19 Correct 4 ms 604 KB Output is correct
20 Correct 3 ms 604 KB Output is correct
21 Correct 11 ms 7256 KB Output is correct
22 Correct 9 ms 7260 KB Output is correct
23 Correct 12 ms 7260 KB Output is correct
24 Correct 14 ms 7260 KB Output is correct
25 Correct 11 ms 7260 KB Output is correct
26 Execution timed out 2054 ms 5568 KB Time limit exceeded
27 Halted 0 ms 0 KB -