제출 #635178

#제출 시각아이디문제언어결과실행 시간메모리
635178finn__Palembang Bridges (APIO15_bridge)C++17
22 / 100
128 ms5892 KiB
#include <bits/stdc++.h> using namespace std; int main() { size_t n, k; cin >> k >> n; vector<long> home, work; vector<long> positions; long cost = 0; for (size_t i = 0; i < n; i++) { char p, q; long s, t; cin >> p >> s >> q >> t; if (p != q) { home.push_back(s); work.push_back(t); positions.push_back(s); positions.push_back(t); } else { cost += abs(s - t); } } if (positions.empty()) { cout << cost << '\n'; return 0; } sort(positions.begin(), positions.end()); long median = positions[positions.size() / 2]; for (size_t i = 0; i < home.size(); i++) { cost += abs(home[i] - median) + abs(work[i] - median) + 1; } cout << cost << '\n'; }
#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...