Submission #585501

#TimeUsernameProblemLanguageResultExecution timeMemory
585501abcvuitunggioPalembang Bridges (APIO15_bridge)C++17
22 / 100
39 ms4976 KiB
#include <iostream> #include <vector> #include <algorithm> #define int long long using namespace std; int k,n,s,t,res; char p,q; vector <pair <int, int> > v; vector <int> v2; signed main(){ ios_base::sync_with_stdio(NULL);cin.tie(nullptr); cin >> k >> n; for (int i=0;i<n;i++){ cin >> p >> s >> q >> t; if (p==q){ res+=abs(s-t); continue; } v.push_back(make_pair(min(s,t),max(s,t))); } res+=k*v.size(); if (k==1){ for (auto i:v){ v2.push_back(i.first); v2.push_back(i.second); } sort(v2.begin(),v2.end()); for (int i:v2) res+=abs(i-v2[v2.size()/2]); 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...