Submission #34187

#TimeUsernameProblemLanguageResultExecution timeMemory
34187nibnalinPalembang Bridges (APIO15_bridge)C++14
22 / 100
156 ms6732 KiB
#include <iostream> #include <cstdio> #include <vector> #include <algorithm> using namespace std; typedef long long int lli; const lli maxn = lli(1e5)+5; lli S[maxn], T[maxn]; int main(void) { lli k, n, res = 0; string p, q; scanf("%lld%lld", &k, &n); vector<lli> A; for(lli i = 0;i < n;i++) { cin >> p >> S[i] >> q >> T[i]; if(p == q) res += abs(S[i]-T[i]); else { res++; A.push_back(S[i]), A.push_back(T[i]); } } sort(A.begin(), A.end()); if(!A.empty()) { lli x = A[lli(A.size())/2]; for(auto it: A) res += abs(it-x); } printf("%lld\n", res); }

Compilation message (stderr)

bridge.cpp: In function 'int main()':
bridge.cpp:17:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld", &k, &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...