Submission #1145060

#	Time	Username	Problem	Language	Result	Execution time	Memory
1145060		Noproblem29	Cell Automaton (JOI23_cell)	C++20	16 / 100	337 ms	133456 KiB

cell

#include<bits/stdc++.h>
using namespace std;
#ifndef BADGNU
#pragma GCC target("sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;
#define ll long long
#define int ll
#define ld long double
#define y1 cheza
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
const int N=1e5+100;
const int M=5001;
const int B=447;
const int mod=998244353;
const ll INF=1e18;
const int dx[]={1,-1,0,0};
const int dy[]={0,0,1,-1};
const double eps=1e-6;
bool check(int x,int y){
    if(x<0||y<0||x>4000||y>4000)return 0;
    return 1;   
}
int n,q;
pair<int,int>a[N];
int d[4003][4003];
int dp[4002];
void test(){
    cin>>n>>q;
    memset(d,-1,sizeof(d));
    queue<pair<int,int>>s;
    for(int i=1;i<=n;i++){
        cin>>a[i].first>>a[i].second;
        a[i].first+=2000;
        a[i].second+=2000;
        s.push(a[i]);
        d[a[i].first][a[i].second]=0;
    }
    while(s.size()){
        auto [x,y]=s.front();
        s.pop();
        dp[d[x][y]]++;
        for(int k=0;k<4;k++){
            int i=x+dx[k];
            int j=y+dy[k];
            if(check(i,j)&&d[i][j]==-1){
                d[i][j]=d[x][y]+1;
                s.push({i,j});
            }
        }
    }
    for(int t;q--;){
        cin>>t;
        cout<<dp[t]<<'\n';
    }
}



/*

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

• Subtask 1: 4 / 4
• Subtask 2: 12 / 12
• Subtask 3: 0 / 8
• Subtask 4: 0 / 8
• Subtask 5: 0 / 17
• Subtask 6: 0 / 25
• Subtask 7: 0 / 26