제출 #442723

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
442723		The_Panonian_Sailor	T-Covering (eJOI19_covering)	C++14	0 / 100	1 ms	332 KiB

covering

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
    long m,n;
    cin>>m>>n;
    int a1, b1, c1, d1;
    vector<vector<int>> a;
    long k;
    int x,y;
    for(int i=0; i<m; i++)
    {
        for(int j=0; j<n; j++)
        {
            cin>>x;
            a[i].push_back(x);
        }
    }
    cin>>k;
    vector<int>r;
    vector<int>c;
    long zbir=0;
    for(int i=0; i<k; i++)
    {
        cin>>x>>y;
        r.push_back(x);
        c.push_back(y);
    }
    for(int i=0; i<k; i++)
    {
        if((r[i]==m-1 && c[i]==n-1)
                ||(r[i]==m-1 && c[i]==0)
                ||(r[i]==0 && c[i]==n-1)
                ||(r[i]==0 && c[i]==0))
        {
            cout<<"No"<<endl;
            return 0;
        }
        else if(r[i]==0)
        {
            zbir+=a[r[i]][c[i]]+a[r[i]][c[i-1]]
                  +a[r[i]][c[i+1]]+a[r[i+1]][c[i]];
            continue;
        }
        else if(r[i]==m-1)
        {
            zbir+=a[r[i]][c[i]]+a[r[i]][c[i-1]]
                  +a[r[i]][c[i+1]]+a[r[i-1]][c[i]];
            continue;
        }
        else if(c[i]==0)
        {
            zbir+=a[r[i]-1][c[i]]+a[r[i]][c[i]]
                  +a[r[i]+1][c[i]]+a[r[i]][c[i]+1];
            continue;
        }
        else if(c[i]==n-1)
        {
            zbir+=a[r[i]-1][c[i]]+a[r[i]][c[i]]
                  +a[r[i]+1][c[i]]+a[r[i]][c[i]-1];
            continue;
        }
        else
        {
            a1=a[r[i]][c[i-1]];
            b1=a[r[i-1]][c[i]];
            c1=a[r[i+1]][c[i]];
            d1=a[r[i]][c[i+1]];
            if(a1<b1){swap(a1,b1);}
            if(a1<c1){swap(a1,c1);}
            if(c1<d1){swap(c1,d1);}
            if(b1<d1){swap(b1,d1);}
            if(b1<c1){swap(b1,c1);}
            if(a1<d1){swap(a1,d1);}
            zbir+=a1+b1+c1;
        }
    }
    cout<<zbir<<endl;
    return 0;
}

• Subtask 1: 0 / 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