# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
466821 | mtxas | T-Covering (eJOI19_covering) | C++14 | 1 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
**********************************************************************************/
int n, m, k, ans = 0;
vector<vi> table;
vector<pii> specials;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
/**********************************************************************************
FUNCTIONS
**********************************************************************************/
bool isEdge(int r, int c){
return
(r==1 or r==n) and (c==1 or c==m);
}
void prepTable(){
table.resize(n+2, vi(m+2, 0));
_foreq(i, 1, n) _foreq(j, 1, m) cin>>table[i][j];
}
void getSpecialCells(){
cin>>k;
_for(i, 0, k) {
int r, c; cin>>r>>c; r++, c++;
specials.pb({r, c});
}
}
void readInput(){
cin>>n>>m;
prepTable();
getSpecialCells();
}
bool haveEdge(){
for(auto p: specials)
if(isEdge(p.fi, p.se)) return true;
return false;
}
/**********************************************************************************
MAIN
**********************************************************************************/
signed main(){
// _fre();
turbo();
readInput();
if(haveEdge()){cout<<"No"; return 0;}
for(auto [r, c]: specials){
int mn = 10000;
_for(dir, 0, 4){
int rr = r + dy[dir], cc = c + dx[dir];
ans += table[rr][cc];
mn = min(mn, table[rr][cc]);
}
ans-= mn;
}
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... |