Submission #1144919

#	Time	Username	Problem	Language	Result	Execution time	Memory
1144919		Noproblem29	Cell Automaton (JOI23_cell)	C++20	4 / 100	20 ms	37192 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>300||y>300)return 0;
    return 1;   
}
int n,q;
pair<int,int>a[N];
int c[52][302][302];  
int dp[52];
void test(){
    cin>>n>>q;
    for(int i=1;i<=n;i++){
        cin>>a[i].first>>a[i].second;
        a[i].first+=100;
        a[i].second+=100;
        c[0][a[i].first][a[i].second]=2;
    }
    for(int t=0;t<=50;t++){
        for(int i=0;i<=300;i++){
            for(int j=0;j<=300;j++){
                if(c[t][i][j]==0){
                    for(int k=0;k<4;k++){
                        int x=i+dx[k];
                        int y=j+dy[k];
                        if(check(x,y)&&c[t][x][y]==2){
                            c[t+1][i][j]=2;
                            break;
                        }    
                    }
                }
                if(c[t][i][j]==1){
                    c[t+1][i][j]=0;
                }
                if(c[t][i][j]==2){
                    c[t+1][i][j]=1;
                    dp[t]++;
                }
            }
        }
    }
    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: 0 / 12
• Subtask 3: 0 / 8
• Subtask 4: 0 / 8
• Subtask 5: 0 / 17
• Subtask 6: 0 / 25
• Subtask 7: 0 / 26