Submission #869043

#TimeUsernameProblemLanguageResultExecution timeMemory
86904312345678Palembang Bridges (APIO15_bridge)C++17
22 / 100
31 ms3668 KiB
#include <bits/stdc++.h> using namespace std; int k, n, b, d; char a, c; vector<int> v; long long res; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>k>>n; for (int i=0; i<n; i++) { cin>>a>>b>>c>>d; if (a==c) { res+=abs(b-d); continue; } v.push_back(b); v.push_back(d); res++; } sort(v.begin(), v.end()); int md=v[v.size()/2]; for (auto x:v) res+=abs(x-md); cout<<res; }
#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...