Submission #1026089

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1026089	2024-07-17 14:27:36	tolbi	Game (eJOI20_game)	C++17	20 / 100	1 ms	596 KiB

game

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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