Submission #370197

#	Time	Username	Problem	Language	Result	Execution time	Memory
370197		soroush	Raspad (COI17_raspad)	C++14	26 / 100	6056 ms	13036 KiB

raspad

//*
#pragma GCC optimize("O2")
//#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx,avx2,sse,sse2,fma")
//*/
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int , int> pii;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 1e5 + 10;
const ll mod = 1e9+7;
const ld PI = acos((ld)-1);

#define pb push_back
#define endl '\n'
#define dokme(x) cout << x , exit(0)
#define migmig ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define ms(x , y) memset(x , y , sizeof x)
ll pw(ll a, ll b, ll md = mod){ll res = 1;while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}

int n , m;
int a[maxn][51];
int par[maxn * 51];

int getpar(int v){
	return((par[v] == v) ? v : par[v] = getpar(par[v]));
}

bool merge(int u , int v){
	if((u = getpar(u)) == (v = getpar(v)))
		return(0);
	par[u] = v;
	return(1);
}

ll solve(int st){
	ll ans = 0 , sum = 0;
	for(int i = st ; i <= n ; i ++){
		for(int j = 1 ; j <= m ; j ++)
			ans += a[i][j] , par[i*m + j] = i * m + j;
		if(i^st)
			for(int j = 1 ; j <= m ; j ++)
				if(a[i][j] && a[i - 1][j])
					ans -= merge(i * m + j , i * m - m + j);
		for(int j = 2 ; j <= m ; j ++)
			if(a[i][j] && a[i][j - 1])
				ans -= merge(i * m + j , i * m + j - 1);
		sum += ans;
	}
	return(sum);
}

int32_t main(){
	migmig;
	cin >> n >> m;
	for(int i = 1 ; i <= n ; i ++)
		for(int j = 1 ; j <= m ; j ++){
			char c;
			cin >> c;
			a[i][j] = (c == '1');
		}
	ll ans = 0;
	for(int i = 1 ; i <= n ; i ++)
		ans += solve(i);
	cout << ans;
	return(0);
}

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