Submission #1026910

#TimeUsernameProblemLanguageResultExecution timeMemory
1026910ArthuroWichPalembang Bridges (APIO15_bridge)C++17
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> using namespace std; #define int long long int void solve() { int k, n, extra = 0, ans = 0; cin >> k >> n; vector<pair<int, int>> a; for (int i = 0; i < n; i++) { char p, q; int s, t; cin >> p >> s >> q >> t; if (p == q) { extra += abs(s-t); } if (p == 'A') { a.push_back({s, t}); } else { a.push_back({t, s}); } } sort(a.begin(), a.end()); if (k == 1) { int b; pair<int, int> m = a[a.size()/2-(a.size()%2==0)]; b = m.first; for (auto [i, j] : a) { ans += abs(i-b); ans += abs(j-b); } cout << ans << endl; } else { cout << 0 << endl; } } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); int t; t = 1; while(t--) { solve(); } }
#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...