| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1026084 |
2024-07-17T14:13:50 Z |
tolbi |
Game (eJOI20_game) |
C++17 |
|
1 ms |
432 KB |
#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;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 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 |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
432 KB |
Output is correct |
| 5 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 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 |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| 13 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 14 |
Halted |
0 ms |
0 KB |
- |
