oj.uz

답안 #775150

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
775150 2023-07-06T08:18:19 Z vjudge1 T-Covering (eJOI19_covering) C++17
0 / 100
 1 ms 340 KB 
#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);
//give me five point
int32_t main(){
    faster
    int n,m;cin>>n>>m;
    if(m*n<6){
        cout<<"No"<<'\n';
        return 0;
    }
    int dizi[n+1][m+1];
    for(int i=0;i<n;i++)dizi[i][0]=0;
    for(int j=0;j<m;j++)dizi[0][j]=0;
    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;
        int maxi=0;
        int ort=dizi[a][b];
    //int ust=dizi[a+1][b],alt=dizi[a-1][b],sag=dizi[a][b+1],sol=dizi[a][b-1];
        int ust=0,alt=0,sag=0,sol=0;
        if(a+1<=n)ust=dizi[a+1][b];
        if(a-1>0)alt=dizi[a-1][b];
        if(b+1<=m)sag=dizi[a][b+1];
        if(b-1>0)sol=dizi[a][b-1];
        int cev1=max(alt,ust)+sag+sol+ort;
        int cev2=max(sag,sol)+alt+ust+ort;
        maxi=max(cev1,cev2);
        /////////////////////////////////////
        int tust=0,talt=0,kag=0,kol=0,cus=0,cul=0,cas=0,cal=0;
        if(a+2<=n)tust=dizi[a+2][b];
        if(a-2>0)talt=dizi[a-2][b];
        if(b+2<=m)kag=dizi[a][b+2];
        if(b-2>0)kol=dizi[a][b-2];
        if((a+1<=n) && (b+1<=m))cus=dizi[a+1][b+1];
        if((a+1<=n) && (b-1>0))cul=dizi[a+1][b-1];
        if((a-1>0) && (b+1<=m))cas=dizi[a-1][b+1];
        if((a-1>0) && (b-1>0))cal=dizi[a-1][b-1];
        cev1=max(cul,cus)+ort+ust+tust;
        maxi=max(maxi,cev1);
        cev1=max(cas,cus)+ort+sag+kag;
        maxi=max(maxi,cev1);
        cev1=max(cal,cas)+ort+alt+talt;
        maxi=max(maxi,cev1);
        cev1=max(cul,cal)+ort+kol+sol;
        maxi=max(maxi,cev1);
        //cout<<ust<<" "<<sag<<" "<<sol<<" "<<alt<<" "<<tust<<" "<<talt<<" "<<kol<<" "<<kag<<" "<<cul<<" "<<cus<<" "<<cal<<" "<<cas<<endl;
        ans+=maxi;
    }
    cout<<ans<<'\n';
    return 0;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -