Submission #1202318

#	Time	Username	Problem	Language	Result	Execution time	Memory
1202318		t9unkubj	Virus Experiment (JOI19_virus)	C++20	20 / 100	2096 ms	124648 KiB

virus

#ifdef t9unkubj
#include"my_template.h"
//#include"my_template_no_debug.h"
#else
#define dbg(...) 199958
#pragma GCC optimize("O3")
#include"bits/stdc++.h"
using namespace std;
using uint=unsigned;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
using i128=__int128;
template<class T>using vc=vector<T>;
template<class T>using vvc=vc<vc<T>>;
template<class T>using vvvc=vc<vvc<T>>;
template<class T>using vvvvc=vc<vvvc<T>>;
template<class T>using smpq=priority_queue<T,vc<T>,greater<T>>;
template<class T>using bipq=priority_queue<T>;
using vi=vc<int>;
using vvi=vvc<int>;
using vl=vc<ll>;
using vvl=vvc<ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(j);i<(ll)(n);i++)
#define DREP(i,n,m) for(ll i=(n);i>=(m);i--)
#define drep(i,n) for(ll i=(ll(n)-1);i>=0;i--)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pb push_back
template<class T,class F>
bool chmin(T &x, F y){
    if(x>y){
        x=y;
        return true;
    }
    return false;
}
template<class T, class F>
bool chmax(T &x, F y){
    if(x<y){
        x=y;
        return true;
    }
    return false;
}
template<class T>
T sum(const vector<T>&v){
    return accumulate(all(v),T(0));
}
template<class T>
T min(const vector<T>&v){
    return *min_element(all(v));
}
template<class T>
T max(const vector<T>&v){
    return *max_element(all(v));
}
void YesNo(bool y){
    cout<<(y?"Yes":"No")<<endl;
}
void Yes(){
    cout<<"Yes"<<endl;
}
void No(){
    cout<<"No"<<endl;
}
template<class T>
void unique(vc<T>&a){
    a.erase(unique(all(a)),a.end());
}
vvi readgraph(int n,int m,int off = -1){
    vvi g(n);
    rep(i, m){
        int u,v;
        cin>>u>>v;
        u+=off,v+=off;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    return g;
}
vvi readtree(int n,int off=-1){
    return readgraph(n,n-1,off);
}
template<class T>
vc<T> presum(vc<T> &a){
    vc<T> ret(a.size()+1);
    rep(i,a.size())ret[i+1]=ret[i]+a[i];
    return ret;
}
template<class T, class F>
vc<T> &operator+=(vc<T> &a,F b){
    for (auto&v:a)v += b;
    return a;
}
template<class T, class F>
vc<T> &operator-=(vc<T>&a,F b){
    for (auto&v:a)v-=b;
    return a;
}
ostream&operator<<(ostream&os,i128 num) {
    if(num==0){
        os<<"0";
        return os;
    }
    if(num<0){
        os<<"-";
        num=-num;
    }
    string res;
    while(num){
        res+='0'+static_cast<int>(num%10);
        num/=10;
    }
    reverse(all(res));
    os<<res;
    return os;
}

istream&operator>>(istream& is,i128&num) {
    string s;
    is>>s;
    bool neg=0;
    num=0;
    if(s[0]=='-'){
        neg=1;
        s=s.substr(1);
    }
    for(auto&c:s){
        if (c>='0'&&c<='9'){
            num=num*10+(c-'0');
        }else{
            is.setstate(ios::failbit);
            return is;
        }
    }
    if(neg){
        num=-num;
    }
    return is;
}

void scan(int&a) { cin >> a; }
void scan(ll&a) { cin >> a; }
void scan(string&a) { cin >> a; }
void scan(char&a) { cin >> a; }
void scan(uint&a) { cin >> a; }
void scan(ull&a) { cin >> a; }
void scan(bool&a) { cin >> a; }
void scan(ld&a){ cin>> a; }
void scan(i128&a){ cin>> a; }
template<class T> void scan(vector<T>&a) { for(auto&x:a) scan(x); }
void read() {}
template<class Head, class... Tail> void read(Head&head, Tail&... tail) { scan(head); read(tail...); }
#define INT(...) int __VA_ARGS__; read(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; read(__VA_ARGS__);
#define ULL(...) ull __VA_ARGS__; read(__VA_ARGS__);
#define STR(...) string __VA_ARGS__; read(__VA_ARGS__);
#define CHR(...) char __VA_ARGS__; read(__VA_ARGS__);
#define DBL(...) double __VA_ARGS__; read(__VA_ARGS__);
#define LD(...) ld __VA_ARGS__; read(__VA_ARGS__);
#define I128(...) i128 __VA_ARGS__; read(__VA_ARGS__);
#define VC(type, name, ...) vector<type> name(__VA_ARGS__); read(name);
#define VVC(type, name, size, ...) vector<vector<type>> name(size, vector<type>(__VA_ARGS__)); read(name);

void print(int a) { cout << a; }
void print(ll a) { cout << a; }
void print(string a) { cout << a; }
void print(char a) { cout << a; }
void print(uint a) { cout << a; }
void print(bool a) { cout << a; }
void print(ull a) { cout << a; }
void print(double a) { cout << a; }
void print(ld a){ cout<< a; }
void print(i128 a){ cout<< a; }
template<class T> void print(vector<T>a) { for(int i=0;i<(int)a.size();i++){if(i)cout<<" ";print(a[i]);}cout<<endl;}
void PRT() { cout <<endl; return ; }
template<class T> void PRT(T a) { print(a); cout <<endl; return; }
template<class Head, class... Tail> void PRT(Head head, Tail ... tail) { print(head); cout << " "; PRT(tail...); return; }
struct ioset{
    ioset(){
        cin.tie(0)->sync_with_stdio(0);
        #ifdef t9unkubj
        cout<<fixed<<setprecision(6);
        #else
        cout<<fixed<<setprecision(20);
        #endif
    }
}ioset_______;
struct MY_TIMER{
    double start_time;
    MY_TIMER(){
        start_time=clock();
    }
    double out(){
        return (clock()-start_time)/double(CLOCKS_PER_SEC);
    }
}TIMER;
#endif

struct scc{
	vector<vector<int>>g;
	vector<vector<int>>inv;
	int n;
	scc(int n):n(n),g(n),inv(n){}
	void add(int x,int y){
		g[x].emplace_back(y);
		inv[y].emplace_back(x);
	}
	vector<vector<int>> do_scc(){
		vector<int>seen(n),seen2(n);
		vector<vector<int>>ret;
		vector<int>num;
		for(int i=0;i<n;i++){
			if(!seen[i]){
				auto dfs=[&](auto&dfs,int now,int pre)->void{
					seen[now]=1;
					for(auto x:g[now]){
						if(x==pre)continue;
						if(!seen[x])dfs(dfs,x,now);
					}
					num.emplace_back(now);
				};
				dfs(dfs,i,-1);
			}
		}
		for(int i=n-1;i>=0;i--){
			int x=num[i];
			if(!seen2[x]){
				vector<int>res;
				seen2[x]=1;
				auto dfs=[&](auto&dfs,int now,int pre)->void{
					seen2[now]=1;
					for(auto x:inv[now]){
						if(x==pre)continue;
						if(!seen2[x])dfs(dfs,x,now);
					}
					res.emplace_back(now);
				};
				dfs(dfs,x,-1);
				ret.push_back(res);
			}
		}
		return ret;
	}
};

template<class T,auto op,int extra>
struct base_dsu{
        vector<int>par;
        vector<T>data;
        base_dsu(int n):par(n,-1){
            static_assert(!extra,"e is needed");
        }
        base_dsu(int n,T e):par(n,-1),data(n,e){}
        T& operator[](int i){
            static_assert(extra,"No data");
            return data[leader(i)];
        }
        int root(int x){
            if(par[x]<0)return x;
            else return par[x]=root(par[x]);
        }
        bool same(int x,int y){
            return root(x)==root(y);
        }
        bool merge(int x,int y){
            x=root(x);
            y=root(y);
            if(x==y)return false;
            if(par[x]>par[y])swap(x,y);
            par[x]+=par[y];
            par[y]=x;
            if(extra){
                data[x]=op(data[y],data[x]);
            }
            return true;
        }
        int size(int x){
            return -par[root(x)];
        }
        int leader(int x){
            return root(x);
        }

};
int tf323(int a,int b){return a;}
using dsu=base_dsu<int,tf323,0>;
template<class T,auto op>
using extra_dsu=base_dsu<T,op,1>;

void solve(){
    INT(m,r,c);
    STR(s);
    VVC(int,u,r,c);
    vc<int>ren(16);
    map<char,int>inv;
    //
    inv['E']=0;
    inv['S']=1;
    inv['W']=2;
    inv['N']=3;
    rep(i,16){
        vc<int>v;
        while(v.size()<2e5){
            for(auto&x:s){
                v.push_back(i>>inv[x]&1);
            }
        }
        vc<int>val(v.size());
        drep(i,v.size()){
            if(i+1<v.size()&&v[i]){
                chmax(val[i],val[i+1]+v[i]);
            }
            chmax(val[i],v[i]);
        }
        ren[i]=max(val);
    }   
    dbg(ren);
    vc<int>dx{0,1,0,-1},dy{1,0,-1,0};
    dsu dsu(r*c);
    while(1){
        scc scc(r*c);
        rep(i,r)rep(j,c){
            unordered_map<int,int>ma;
            rep(k,4){
                uint ni=i+dx[k];
                uint nj=j+dy[k];
                if(ni<r&&nj<c){
                    ma[dsu.leader(ni*c+nj)]|=1<<k;
                }
            }
            for(auto&[x,y]:ma){
                if(u[i][j]&&ren[y]>=u[i][j]&&x!=dsu.leader(i*c+j))scc.add(x,dsu.leader(i*c+j));
            }
        }
        int update=0;
        for(auto&x:scc.do_scc()){
            update|=x.size()>1;
            rep(i,x.size()-1)dsu.merge(x[i],x[i+1]);
        }

        if(update==0){
            int mi=1e9;
            rep(j,r*c){
                if(dsu.leader(j)==j&&u[j/c][j%c]){
                    if(scc.g[j].size()==0){
                        chmin(mi,dsu.size(j));
                    }
                }
            }
            int ans=0;
            rep(j,r*c){
                if(dsu.leader(j)==j&&u[j/c][j%c]){
                    if(scc.g[j].size()==0&&dsu.size(j)==mi){
                        ans+=mi;
                    }
                }
            }
            cout<<mi<<" "<<ans<<"\n";
            return;
        }
    }

}
signed main(){
    int t=1;
    //cin>>t;
    while(t--)solve();
}
/*
ある状況がvalidかは炉リハで事前計算
一人だけで感染させられる人々を集めて連結成分を作る

*/

• Subtask 1: 14 / 14
• Subtask 2: 6 / 6
• Subtask 3: 0 / 80