oj.uz

Submission #817928

# Submission time Handle Problem Language Result Execution time Memory
817928 2023-08-09T20:33:51 Z ihceker T-Covering (eJOI19_covering) C++14
15 / 100
 142 ms 11932 KB 
#include<bits/stdc++.h>
#define int long long
#define MOD 1000000007
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

using namespace std;

int n,m;
set<pair<int,int>>s;

int f(int x,int y){
	if(x<0 || x>=n || y<0 || y>=m)return 0;
	if(s.count({x,y}))return 0;
	return 1;
}

int32_t main(){
	cin>>n>>m;
	int arr[n][m];
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++)cin>>arr[i][j];
	}
	int k;
	cin>>k;
	int ans=0;
	for(int i=0;i<k;i++){
		int a,b;
		cin>>a>>b;
		s.insert({a,b});
	}
	for(auto i:s){
		int x=i.ff;
		int y=i.ss;
		int z=(f(x-1,y)+f(x+1,y)+f(x,y-1)+f(x,y+1));
		if(z<=2){
			ans=-1;
			break;
		}
		if(z==3){
			ans+=arr[x][y];
			if(f(x-1,y))ans+=arr[x-1][y];
			if(f(x+1,y))ans+=arr[x+1][y];
			if(f(x,y-1))ans+=arr[x][y-1];
			if(f(x,y+1))ans+=arr[x][y+1];
		}
		else{
			ans+=arr[x][y]+arr[x-1][y]+arr[x+1][y]+arr[x][y-1]+arr[x][y+1];
			ans-=min({arr[x-1][y],arr[x+1][y],arr[x][y-1],arr[x][y+1]});
		}
	}
	if(ans==-1)cout<<"No"<<endl;
	else cout<<ans<<endl;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 5 ms 468 KB Output is correct
3 Correct 18 ms 1072 KB Output is correct
4 Correct 43 ms 2636 KB Output is correct
5 Correct 141 ms 8100 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 468 KB Output is correct
3 Correct 19 ms 1060 KB Output is correct
4 Correct 54 ms 3772 KB Output is correct
5 Correct 142 ms 11932 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Incorrect 4 ms 468 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 15.0

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

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 5 ms 468 KB Output is correct
3 Correct 18 ms 1072 KB Output is correct
4 Correct 43 ms 2636 KB Output is correct
5 Correct 141 ms 8100 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 19 ms 1060 KB Output is correct
9 Correct 54 ms 3772 KB Output is correct
10 Correct 142 ms 11932 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Incorrect 4 ms 468 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 5 ms 468 KB Output is correct
3 Correct 18 ms 1072 KB Output is correct
4 Correct 43 ms 2636 KB Output is correct
5 Correct 141 ms 8100 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 19 ms 1060 KB Output is correct
9 Correct 54 ms 3772 KB Output is correct
10 Correct 142 ms 11932 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Incorrect 4 ms 468 KB Output isn't correct
13 Halted 0 ms 0 KB -