oj.uz

답안 #775544

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
775544 2023-07-06T13:46:35 Z vjudge1 T-Covering (eJOI19_covering) C++17
5 / 100
 49 ms 8908 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);
//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++;
        
        if(a<=0 || b<=0 || a>n || b>m){
            stop=false;
        }
        int maxi=0,cev1=0,cev2=0;
        int ort=dizi[a][b];
        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];
        cev1=max(alt,ust)+sag+sol;
        cev2=max(sag,sol)+alt+ust;
        maxi=max(cev1,cev2);
        ans+=maxi+ort;
    }
    if(stop)cout<<ans<<'\n';
    else cout<<"No"<<'\n';
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 5 ms 1492 KB Output is correct
4 Correct 15 ms 3428 KB Output is correct
5 Correct 49 ms 8908 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 15.0

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

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 5 ms 1492 KB Output is correct
4 Correct 15 ms 3428 KB Output is correct
5 Correct 49 ms 8908 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Incorrect 2 ms 592 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 5 ms 1492 KB Output is correct
4 Correct 15 ms 3428 KB Output is correct
5 Correct 49 ms 8908 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Incorrect 2 ms 592 KB Output isn't correct
8 Halted 0 ms 0 KB -