Submission #244195

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
244195	2020-07-02 18:41:52	MatesV13	Raspad (COI17_raspad)	C++11	9 / 100	6023 ms	768 KiB

raspad

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;
long long n, m, v[1005][55], ans; char c;
/*int par[1005][55];
inline int kompinx(int a1, int a2, int b1, int b2){
  if (par[a1][a2]==a1*m+a2) return par[a1][a2];
  par[b1][b2] = kompinx((par[a1][a2]-1)/m+1, (par[a1][a2]-1)%m+1, b1, b2);
}*/
bool bio[1005][55];
void dfs(int x, int y){
  bio[x][y]=0;
  if (bio[x+1][y]) dfs(x+1, y);
  if (bio[x-1][y]) dfs(x-1, y);
  if (bio[x][y+1]) dfs(x, y+1);
  if (bio[x][y-1]) dfs(x, y-1);
}
long long ufind (int l, int r){
  int sol=0;
  for (int i=l; i<=r; i++)
    for (int j=1; j<=m; j++)
      bio[i][j]=v[i][j];
  for (int i=l; i<=r; i++)
    for (int j=1; j<=m; j++)
      if (bio[i][j]){
        sol++;
        dfs(i, j);
      }
  return sol;
}
int main (){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 9 / 9
• Subtask 2: 0 / 17
• Subtask 3: 0 / 35
• Subtask 4: 0 / 39