oj.uz

Submission #441646

# Submission time Handle Problem Language Result Execution time Memory
441646 2021-07-05T16:34:28 Z nots0fast T-Covering (eJOI19_covering) C++17
100 / 100
 142 ms 15232 KB 
#include <bits/stdc++.h>
using namespace std;
#define mp(a,b) make_pair(a,b)
#define ff first
#define setp setprecision
#define ss second
#define fori(v) for(ll i=0; i<v; i++)
#define forj(v) for(ll j=0; j<v; j++)
#define fork(v) for(ll k=0; k<v; k++)
#define forl(v) for(ll l=0; l<v; l++)
#define fort(v) for(ll t=0; t<v; t++)
#define forz(v) for(ll z=0; z<v; z++)
#define forx(v) for(ll x=0; x<v; x++)
#define fory(v) for(ll y=0; y<v; y++)
#define ll long long
#define ld long double
#define pb(a) push_back(a)
#define mt make_tuple
#define MAX (int)(2*pow(10,6) + 5)
// #define cout out
// #define cin in
ll inf = pow(10, 18) + 100;
ll INF = pow(10, 9);
ll modulo = pow(10, 9) + 7;
double eps = 1e-10;

// start time 18 : 23

ll dx[4] = {-1, 0, 1, 0};
ll dy[4] = {0 , 1, 0, -1};

void deal(){
	ll n, m;
	cin>>n>>m;
	vector<vector<bool> > chosen(n, vector<bool>(m, 0));
	vector<vector<bool> > seen(n, vector<bool>(m, 0));
	vector<vector<ll> > arr(n, vector<ll>(m));
	fori(n){
		forj(m){
			cin>>arr[i][j];
		}
	}
	ll q;
	cin>>q;
	fori(q){
		ll ri, ci;
		cin>>ri>>ci;
		chosen[ri][ci] = 1;
	}
	ll s = 0;
	fori(n){
		forj(m){
			if(chosen[i][j] && !seen[i][j]){
				vector<pair<ll,ll> > bfs(1, mp(i,j));
				seen[i][j] = 1;
				vector<ll> tot(2, 0);
				fork((ll)bfs.size()){
					ll x = bfs[k].ff, y = bfs[k].ss;
					tot[chosen[x][y]]++;
					forl(4){
						ll x1 = x+dx[l] , y1 = y + dy[l];
						if(x1 > -1 && y1 > -1 && x1 < n && y1 < m && !seen[x1][y1]){
							if(!chosen[x][y] && !chosen[x1][y1]){
								continue;
							}
							seen[x1][y1] = 1;
							bfs.pb(mp(x1,y1));
						}
					}
				}
				if(tot[0] < tot[1] * 3){
					cout<<"No";
					return;
				}
				ll mn = inf;
				for(auto& [x,y] : bfs){
					s+=arr[x][y];
					if(!chosen[x][y]){
						mn = min(mn, arr[x][y]);
					}
				}
				if(tot[0] > tot[1] * 3){
					s-=mn;
				}
			}
		}
	}
	cout<<s;
}


int main(){
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	deal();  
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 9 ms 1100 KB Output is correct
4 Correct 27 ms 2840 KB Output is correct
5 Correct 89 ms 8524 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 10 ms 1228 KB Output is correct
4 Correct 32 ms 2764 KB Output is correct
5 Correct 88 ms 8524 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 9 ms 1100 KB Output is correct
4 Correct 28 ms 2764 KB Output is correct
5 Correct 88 ms 8524 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 6 ms 716 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 10 ms 1200 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 9 ms 1100 KB Output is correct
4 Correct 27 ms 2840 KB Output is correct
5 Correct 89 ms 8524 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 3 ms 588 KB Output is correct
8 Correct 10 ms 1228 KB Output is correct
9 Correct 32 ms 2764 KB Output is correct
10 Correct 88 ms 8524 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 9 ms 1100 KB Output is correct
14 Correct 28 ms 2764 KB Output is correct
15 Correct 88 ms 8524 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 6 ms 716 KB Output is correct
19 Correct 3 ms 460 KB Output is correct
20 Correct 10 ms 1200 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 3 ms 588 KB Output is correct
23 Correct 9 ms 1100 KB Output is correct
24 Correct 27 ms 2844 KB Output is correct
25 Correct 87 ms 8524 KB Output is correct

Subtask #7
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 9 ms 1100 KB Output is correct
4 Correct 27 ms 2840 KB Output is correct
5 Correct 89 ms 8524 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 3 ms 588 KB Output is correct
8 Correct 10 ms 1228 KB Output is correct
9 Correct 32 ms 2764 KB Output is correct
10 Correct 88 ms 8524 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 9 ms 1100 KB Output is correct
14 Correct 28 ms 2764 KB Output is correct
15 Correct 88 ms 8524 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 6 ms 716 KB Output is correct
19 Correct 3 ms 460 KB Output is correct
20 Correct 10 ms 1200 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 3 ms 588 KB Output is correct
28 Correct 9 ms 1100 KB Output is correct
29 Correct 27 ms 2844 KB Output is correct
30 Correct 87 ms 8524 KB Output is correct
31 Correct 142 ms 15232 KB Output is correct
32 Correct 89 ms 8944 KB Output is correct
33 Correct 102 ms 12576 KB Output is correct
34 Correct 112 ms 8932 KB Output is correct
35 Correct 107 ms 12708 KB Output is correct