# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
775573 | vjudge1 | T-Covering (eJOI19_covering) | C++17 | 2 ms | 676 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mid (start+end)/2
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);
//bana beş puan ver
bool stop=true;
int32_t main(){
faster
int n,m;cin>>n>>m;
int dizi[n+1][m+1];
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cin>>dizi[i][j];
}
}
int k;cin>>k;
int ans=0;
for(int i=0;i<k;i++){
int a,b;cin>>a>>b;
a++;b++;
int zi[4];
if(a<=0 || b<=0 || a>n || b>m){
stop=false;
}
int maxi=0,cev1=0,cev2=0;
int ort=dizi[a][b];
zi[0]=dizi[a+1][b];
zi[1]=dizi[a-1][b];
zi[2]=dizi[a][b+1];
zi[3]=dizi[a][b-1];
sort(zi,zi+n);
for(int i=1;i<4;i++){
maxi+=zi[i];
}
maxi+=ort;
ans+=maxi;
}
if(stop)cout<<ans<<'\n';
else cout<<"No"<<'\n';
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |