제출 #447540

#제출 시각아이디문제언어결과실행 시간메모리
447540bigoT-Covering (eJOI19_covering)C++14
0 / 100
3 ms332 KiB
#include <bits/stdc++.h> #include <cmath> using namespace std; typedef unsigned long long ll; #define pii pair<int,int> int main() { int n, m; cin >> n >> m; vector<vector<int>>vec(n, vector<int>(m)); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> vec[i][j]; } } int k; cin >> k; vector<pii>spe(k); for (int i = 0; i < k; i++) cin >> spe[i].first >> spe[i].second; ll ans = 0; for (int i = 0; i < k; i++) { vector<int>vec1; vec1.push_back(vec[spe[i].first][spe[i].second]); vec1.push_back(vec[spe[i].first + 1][spe[i].second]); vec1.push_back(vec[spe[i].first - 1][spe[i].second]); vec1.push_back(vec[spe[i].first][spe[i].second + 1]); vec1.push_back(vec[spe[i].first][spe[i].second - 1]); sort(vec1.begin(), vec1.end()); for (int i = 4; i >= 1; i--) { ans += vec1[i]; } vec1.resize(0); } cout << ans; }
#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...