oj.uz

Submission #833911

# Submission time Handle Problem Language Result Execution time Memory
833911 2023-08-22T09:27:54 Z tolbi T-Covering (eJOI19_covering) C++17
55 / 100
 151 ms 12008 KB 
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9+7;
#define tol(bi) (1LL<<((int)(bi)))
int main(){
	int h,w;
	cin>>h>>w;
	vector<vector<int>> val(h,vector<int>(w));
	for (int i = 0; i < h; ++i)
	{
		for (int j = 0; j < w; j++){
			cin>>val[i][j];
		}
	}
	int n;cin>>n;
	vector<vector<int>> arr(h,vector<int>(w,0));
	vector<pair<int,int>> spec(n); 
	for (int i = 0; i < n; i++){
		int x,y;cin>>x>>y;
		arr[x][y]=i+1;
		spec[i]={x,y};
	}
	vector<bool> vis(n,false);
	int ans=0;
	function<int(int)> dfs;
	function<void(int,int)> dallan;
	vector<int> crvis(n,false);
	set<int> st;
	dallan = [&](int x, int y)->void{
		if (x>0 && arr[x-1][y]>0) {
			st.insert(arr[x-1][y]-1);
		}
		if (x+1<h && arr[x+1][y]>0) {
			st.insert(arr[x+1][y]-1);
		}
		if (y>0 && arr[x][y-1]>0) {
			st.insert(arr[x][y-1]-1);
		}
		if (y+1<w && arr[x][y+1]>0) {
			st.insert(arr[x][y+1]-1);
		}
	};
	dfs = [&](int node)->int{
		vis[node]=true;
		if (crvis[node]) return 0;
		crvis[node]=true;
		int x = spec[node].first;
		int y = spec[node].second;
		vector<pair<int,int>> ava;
		if (x>0 && arr[x-1][y]==0) ava.push_back({x-1,y});
		if (y>0 && arr[x][y-1]==0) ava.push_back({x,y-1});
		if (x+1<h && arr[x+1][y]==0) ava.push_back({x+1,y});
		if (y+1<w && arr[x][y+1]==0) ava.push_back({x,y+1});
		if (ava.size()<3){
			crvis[node]=false;
			return -1;
		}
		int rval = -1;
		for (int i = 0; i <= ava.size(); i++){
			int cnt = 0;
			for (int j = 0; j < ava.size(); j++){
				if (i==j) continue;
				cnt++;
			}
			if (cnt!=3) continue;
			int crr = 0;
			for (int j = 0; j < ava.size(); j++){
				if (i==j) continue;
				arr[ava[j].first][ava[j].second]=-23;
				crr+=val[ava[j].first][ava[j].second];
			}
			for (int j = 0; j < ava.size(); j++){
				dallan(ava[j].first,ava[j].second);
			}
			set<int> crset;
			swap(crset,st);
			for (auto it : crset){
				int crrr=dfs(it);
				if (crrr==-1){
					crr=-1;
					break;
				}
				else{
					crr+=crrr;
				}
			}
			for (int j = 0; j < ava.size(); j++){
				if (i==j) continue;
				arr[ava[j].first][ava[j].second]=0;
			}
			if (crr!=-1) rval=max(rval,crr);
		}
		crvis[node]=false;
		if (rval==-1) return rval;
		return rval+val[x][y];
	};
	for (int i = 0; i < n; i++){
		if (vis[i]) continue;
		int rval = dfs(i);
		if (rval==-1){
			ans=-1;
			break;
		}
		else {
			ans+=rval;
		}
	}
	if (ans==-1){
		cout<<"No"<<endl;
	}
	else cout<<ans<<endl;
}

Compilation message

covering.cpp: In lambda function:
covering.cpp:59:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |   for (int i = 0; i <= ava.size(); i++){
      |                   ~~^~~~~~~~~~~~~
covering.cpp:61:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |    for (int j = 0; j < ava.size(); j++){
      |                    ~~^~~~~~~~~~~~
covering.cpp:67:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |    for (int j = 0; j < ava.size(); j++){
      |                    ~~^~~~~~~~~~~~
covering.cpp:72:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |    for (int j = 0; j < ava.size(); j++){
      |                    ~~^~~~~~~~~~~~
covering.cpp:87:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |    for (int j = 0; j < ava.size(); j++){
      |                    ~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 5 ms 596 KB Output is correct
3 Correct 15 ms 1452 KB Output is correct
4 Correct 52 ms 3772 KB Output is correct
5 Correct 151 ms 11896 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 5 ms 668 KB Output is correct
3 Correct 15 ms 1468 KB Output is correct
4 Correct 50 ms 3780 KB Output is correct
5 Correct 145 ms 11892 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 5 ms 596 KB Output is correct
3 Correct 15 ms 1448 KB Output is correct
4 Correct 43 ms 3796 KB Output is correct
5 Correct 143 ms 12008 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 8 ms 852 KB Output is correct
4 Correct 6 ms 596 KB Output is correct
5 Correct 16 ms 1492 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 5 ms 596 KB Output is correct
3 Correct 15 ms 1452 KB Output is correct
4 Correct 52 ms 3772 KB Output is correct
5 Correct 151 ms 11896 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 5 ms 668 KB Output is correct
8 Correct 15 ms 1468 KB Output is correct
9 Correct 50 ms 3780 KB Output is correct
10 Correct 145 ms 11892 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 5 ms 596 KB Output is correct
13 Correct 15 ms 1448 KB Output is correct
14 Correct 43 ms 3796 KB Output is correct
15 Correct 143 ms 12008 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 8 ms 852 KB Output is correct
19 Correct 6 ms 596 KB Output is correct
20 Correct 16 ms 1492 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 5 ms 596 KB Output is correct
23 Correct 14 ms 1464 KB Output is correct
24 Correct 44 ms 3784 KB Output is correct
25 Correct 146 ms 11896 KB Output is correct

Subtask #7
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 5 ms 596 KB Output is correct
3 Correct 15 ms 1452 KB Output is correct
4 Correct 52 ms 3772 KB Output is correct
5 Correct 151 ms 11896 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 5 ms 668 KB Output is correct
8 Correct 15 ms 1468 KB Output is correct
9 Correct 50 ms 3780 KB Output is correct
10 Correct 145 ms 11892 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 5 ms 596 KB Output is correct
13 Correct 15 ms 1448 KB Output is correct
14 Correct 43 ms 3796 KB Output is correct
15 Correct 143 ms 12008 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 8 ms 852 KB Output is correct
19 Correct 6 ms 596 KB Output is correct
20 Correct 16 ms 1492 KB Output is correct
21 Incorrect 1 ms 212 KB Output isn't correct
22 Halted 0 ms 0 KB -