제출 #1262087

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1262087		iordache_	T-Covering (eJOI19_covering)	C++20	5 / 100	39 ms	8260 KiB

covering

#include <bits/stdc++.h>
#define pb push_back
#define int long long
using namespace std;
const int N=1e6+5;

signed main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n,m;
    cin>>n>>m;
    vector<vector<int>> v(n+5,vector<int>(m+5));
    for(int i=1;i<=n;++i) for(int j=1;j<=m;++j) cin>>v[i][j];
    int k;cin>>k;
    bool ok=1;
    int ans=0;
    for(int i=1;i<=k;++i)
    {
        int x,y;cin>>x>>y;++x,++y;
        ok&=((x==1)+(x==n)+(y==1)+(y==m)<=1);
        if(!ok) continue;
        int score=v[x][y]+v[x-1][y]+v[x+1][y]+v[x][y-1]+v[x][y+1];
        int mx=0;
        if(x!=n&&y!=1&&y!=m) mx=max(mx,score-v[x-1][y]);
        if(x!=1&&y!=1&&y!=m) mx=max(mx,score-v[x+1][y]);
        if(x!=1&&x!=n&&y!=m) mx=max(mx,score-v[x][y-1]);
        if(x!=1&&x!=n&&y!=1) mx=max(mx,score-v[x][y+1]);
        ans+=mx;
    }
    if(!ok) {cout<<"No";return 0;}
    cout<<ans;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 30