# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
466728 | mtxas | T-Covering (eJOI19_covering) | C++14 | 2 ms | 332 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>
#define ll long long
#define pii pair<int, int>
#define fi first
#define se second
#define pll pair<ll, ll>
#define mii map<int, int>
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(x) ((int)x.size())
#define turbo() cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false)
#define _fre() freopen("input.txt", "r", stdin)
#define _for(a, b, c) for(int (a) = (b); (a) < (c); (a)++)
#define _foreq(a, b, c) for(int (a) = (b); (a) <= (c); (a)++)
#define _forneq(a, b, c) for(int (a) = (b); (a) >= (c); (a)--)
#define _forn(a, b, c) for(int (a) = (b); (a) > (c); (a)--)
using namespace std;
/**********************************************************************************
STRUCTS
**********************************************************************************/
/**********************************************************************************
VARIABLES
**********************************************************************************/
const int maxk = 1001, inf = 1e9+10;
int r[maxk], c[maxk];
int n, m;
vector<vi> table, val;
int dy[4] = {1, 0, -1, 0};
int dx[4] = {0, 1, 0, -1};
/**********************************************************************************
FUNCTIONS
**********************************************************************************/
bool validSpecCell(int r, int c){
bool valid = 1;
valid &= (!(r == 1 && (c == 1 || c==m)));
valid &= (!(r == n && (c==1 || c== m)));
return valid;
}
/**********************************************************************************
MAIN
**********************************************************************************/
int main(){
//_fre();
turbo();
cin>>n>>m;
table.resize(n+2, vi(m+2, 0));
val.resize(n+2, vi(m+2, 0));
_foreq(i, 1, n)_foreq(j, 1, m) cin>>table[i][j];
int k; cin>>k;
_for(i, 0, k) cin>>r[i]>>c[i], r[i]++, c[i]++;
_for(i, 0, k)
if(!validSpecCell(r[i], c[i])) {cout<<"No"; return 0;}
ll ans = 0;
_for(i, 0, k){
int rr = r[i], cc = c[i];
val[rr][cc] = 0;
int minVal = inf;
_for(dir, 0, 4){
int nr = rr + dy[dir], nc = cc + dx[dir];
val[rr][cc] += table[nr][nc];
minVal = min(minVal, table[nr][nc]);
}
val[rr][cc] -= minVal;
ans += val[rr][cc];
}
cout<<ans;
}
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... |