Submission #585519

#TimeUsernameProblemLanguageResultExecution timeMemory
585519Do_you_copyPalembang Bridges (APIO15_bridge)C++14
22 / 100
43 ms5168 KiB
#include <bits/stdc++.h> #define taskname "test" #define fi first #define se second #define pb push_back #define faster ios_base::sync_with_stdio(0); cin.tie(0); using namespace std; using ll = long long; using pii = pair <int, int>; ll min(const ll &a, const ll &b){ return (a < b) ? a : b; } ll max(const ll &a, const ll &b){ return (a > b) ? a : b; } const ll Mod = 1000000007; const int maxN = 2e5; int k, n; ll suf[maxN], pre[maxN]; void Init(){ ll ans = 0; cin >> k >> n; vector <ll> v; for (int i = 1; i <= n; ++i){ char p, q; int s, t; cin >> p >> s >> q >> t; if (p != q){ ++ans; v.pb(s); v.pb(t); } else{ ans += abs(s - t); } } v.push_back(0); sort(v.begin(), v.end()); if (k == 1){ int m = v.size(); ll tem = LLONG_MAX; for (int i = 1; i < m; ++i){ pre[i] = pre[i - 1] + v[i]; } for (int i = m - 1; i > 0; --i){ suf[i] = suf[i + 1] + v[i]; } for (int i = 1; i < m; ++i){ tem = min(tem, v[i] * (i - 1) - pre[i - 1] + suf[i + 1] - v[i] * (m - i - 1)); } if (m == 1) tem = 0; cout << ans + tem; } } int main(){ if (fopen(taskname".txt", "r")){ freopen(taskname".txt", "r", stdin); } faster Init(); }

Compilation message (stderr)

bridge.cpp: In function 'int main()':
bridge.cpp:61:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |         freopen(taskname".txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
#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...