oj.uz

답안 #925567

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925567 2024-02-12T05:18:33 Z vjudge1 Collecting Mushrooms (NOI18_collectmushrooms) C++17
79 / 100
 2000 ms 15364 KB 
/*
no more temmy :(
*/

#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;
// #include<icecream.hpp>
// using namespace icecream;
#define ll long long
#define int ll
#define ld long double
#define y1 cheza
// mt19937 rng(1983413);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
const int N=5e5+100;
const int M=1e6;
const int B=317;
const int mod=998244353;
const int INF=1e18;
const int lg=64;
const int dx[]={1,-1,0,0};
const int dy[]={0,0,1,-1};
const double eps=1e-9;
int n,m,d,k;
int dist(pair<int,int>x,pair<int,int>y){
    return max(abs(x.first-y.first),abs(x.second-y.second));
}
int pref[N];
void test(){
    cin>>n>>m>>d>>k;
    vector<pair<int,int>>a,b;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            char x;
            cin>>x;
            if(x=='M'){
                a.push_back({i,j});
            }
            if(x=='S'){
                b.push_back({i,j});
            }
        }
    }
    if(n==1){
        for(auto i:b){
            pref[i.second]++;
        }
        for(int i=1;i<=m;i++){
            pref[i]+=pref[i-1];

        }
        int ans=0;
        for(auto i:a){
            int l=max(i.second-d,1ll);
            int r=min(i.second+d,m);
            if(pref[r]-pref[l-1]>=k){
                ans++;
            }
        }
        cout<<ans<<'\n';
        return;
    }
    if(b.size()<k){
        cout<<0<<'\n';
        return;
    }
    int ans=0;
    for(auto i:a){
        int res=0;
        for(auto j:b){
            if(dist(i,j)<=d){
                res++;
            }
            if(res>=k){
                break;
            }
        }
        if(res>=k){
            ans++;
        }
    }
    cout<<ans<<'\n';
}
/*

*/  
 
signed main(){
    // ic.prefix("debug->| ");
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // cout.tie(nullptr);
    long long t2=1;
    //  cin>>t2;
    for(int i=1;i<=t2;i++){
        test();
    }
    
    return 0;
 
}

Compilation message

mushrooms.cpp: In function 'void test()':
mushrooms.cpp:68:16: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   68 |     if(b.size()<k){
      |        ~~~~~~~~^~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 604 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 0 ms 344 KB Output is correct
2 Correct 1 ms 604 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 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 1 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 3 ms 348 KB Output is correct
3 Correct 6 ms 856 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct

Subtask #4
23.0 / 23.0

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

Subtask #5
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 10436 KB Output is correct
2 Correct 11 ms 12256 KB Output is correct
3 Correct 11 ms 12236 KB Output is correct
4 Correct 13 ms 12296 KB Output is correct
5 Correct 13 ms 15364 KB Output is correct

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 604 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 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 6 ms 856 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 3 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 15 ms 10436 KB Output is correct
22 Correct 11 ms 12256 KB Output is correct
23 Correct 11 ms 12236 KB Output is correct
24 Correct 13 ms 12296 KB Output is correct
25 Correct 13 ms 15364 KB Output is correct
26 Execution timed out 2049 ms 5572 KB Time limit exceeded
27 Halted 0 ms 0 KB -