Submission #1026084

#	Time	Username	Problem	Language	Result	Execution time	Memory
1026084		tolbi	Game (eJOI20_game)	C++17	20 / 100	1 ms	432 KiB

game

#include <bits/stdc++.h>
using namespace std;
struct DSU{
	vector<vector<array<int,2>>> par;
	vector<vector<int>> sz;
	DSU(int n, int m){
		par.resize(n,vector<array<int,2>>(m));
		sz.resize(n,vector<int>(m,1));
		for (int i = 0; i < n; ++i)
		{
			for (int j = 0; j < m; ++j){
				par[i][j]={i,j};
			}
		}
	}
	array<int,2> find(array<int,2> node){
		if (par[node[0]][node[1]]==node) return node;
		return par[node[0]][node[1]]=find(par[node[0]][node[1]]);
	}
	void merge(array<int,2> a, array<int,2> b){
		a=find(a);
		b=find(b);
		if (a==b) return;
		sz[a[0]][a[1]]+=sz[b[0]][b[1]];
		sz[b[0]][b[1]]=0;
		par[b[0]][b[1]]=a;
	}
};
int main(){
	int n,m;cin>>n>>m;
	DSU dsu(n,m);
	vector<int> LMAO;
	vector<vector<int>> say(n,vector<int>(m));
	for (int i = 0; i < n+1; ++i)
	{
		string str;cin>>str;
		for (int j = 0; j < m; j++){
			if (i-1>=0 && i<n){
				if (str[j]=='0'){
					dsu.merge({i,j},{i-1,j});
				}
			}
			if (i<n && str[j]=='1') say[i][j]++;
			if (i-1>=0 && str[j]=='1') say[i-1][j]++;
		}
	}
	for (int i = 0; i < n; i++){
		string str;cin>>str;
		for (int j = 0; j <= m; j++){
			if (j-1>=0 && j<m){
				if (str[j]=='0'){
					dsu.merge({i,j},{i,j-1});
				}
			}
			if (j<m && str[j]=='1') say[i][j]++;
			if (j-1>=0 && str[j]=='1') say[i][j-1]++;
		}
	}
	for (int i = 0; i < n; i++){
		for (int j = 0; j < m; j++){
			if (say[i][j]==4) continue;
			if (dsu.find({i,j})!=array<int,2>{i,j}) continue;
			LMAO.push_back(dsu.sz[i][j]);
		}
	}
	sort(LMAO.begin(), LMAO.end());
	/*
	cout<<LMAO.size()<<endl;
	for (int i = 0; i < LMAO.size(); ++i)
	{
		cout<<LMAO[i]<<" ";
	}
	cout<<endl;
	*/
	if (LMAO.size()==1){
		cout<<-LMAO.back()<<endl;
	}
	else if (LMAO.size()==2){
		if (LMAO[0]>2){
			//ben verdim adam lmao[0]-2 tane aldi ben 2 aldim adam ikinciyi aldi
			cout<<2-(LMAO[0]-2+LMAO[1])<<endl;
		}
		else cout<<LMAO[1]-LMAO[0]<<endl;
	}
	else cout<<"N/A"<<endl;
}

• Subtask 1: 20 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20