Submission #1180528

#TimeUsernameProblemLanguageResultExecution timeMemory
1180528mishasimT-Covering (eJOI19_covering)C++20
0 / 100
1 ms836 KiB
#include <iostream> using namespace std; #define endl '\n' long long n,m,klk,r,c,res,all; long long k[10006][10006]; int main() { ios_base :: sync_with_stdio(0);cin.tie(0);cout.tie(0); cin>>n>>m; for(int i = 0 ; i<n ; i++) { for(int j = 0 ; j<m ; j++)cin>>k[i][j]; } cin>>klk; for(int i = 1 ; i <=klk ; i++) { cin>>r>>c; all = k[r][c]+k[r-1][c]+k[r+1][c]+k[r][c-1]+k[r][c+1]; res+=all-min(k[r-1][c],min(k[r+1][c],min(k[r][c-1],k[r][c+1]))); cout<<all<<endl; } cout<<res; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...