oj.uz

Submission #817915

# Submission time Handle Problem Language Result Execution time Memory
817915 2023-08-09T20:11:44 Z ihceker T-Covering (eJOI19_covering) C++14
5 / 100
 147 ms 11800 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;

int32_t main(){
	int n,m;
	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;
		if((a==0 || a==n-1) && (b==0 || b==m-1)){
			ans=-1;
			break;
		}
		if(a==0 || a==n-1 || b==0 || b==m-1){
			ans+=arr[a][b];
			if(a-1>=0)ans+=arr[a-1][b];
			if(a+1<n)ans+=arr[a+1][b];
			if(b-1>=0)ans+=arr[a][b-1];
			if(b+1<m)ans+=arr[a][b+1];
		}
		else{
			ans+=arr[a][b]+arr[a-1][b]+arr[a+1][b]+arr[a][b-1]+arr[a][b+1];
			ans-=min({arr[a-1][b],arr[a+1][b],arr[a][b-1],arr[a][b+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 640 KB Output is correct
3 Correct 15 ms 1464 KB Output is correct
4 Correct 46 ms 3780 KB Output is correct
5 Correct 147 ms 11800 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 308 KB Output is correct
2 Incorrect 5 ms 596 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 212 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 1 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 640 KB Output is correct
3 Correct 15 ms 1464 KB Output is correct
4 Correct 46 ms 3780 KB Output is correct
5 Correct 147 ms 11800 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Incorrect 6 ms 596 KB Output isn't correct
8 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 640 KB Output is correct
3 Correct 15 ms 1464 KB Output is correct
4 Correct 46 ms 3780 KB Output is correct
5 Correct 147 ms 11800 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Incorrect 6 ms 596 KB Output isn't correct
8 Halted 0 ms 0 KB -