Submission #1093525

#TimeUsernameProblemLanguageResultExecution timeMemory
1093525RiverFlowPalembang Bridges (APIO15_bridge)C++14
22 / 100
46 ms7440 KiB
#include <bits/stdc++.h> #define nl "\n" #define no "NO" #define yes "YES" #define fi first #define se second #define vec vector #define task "main" #define _mp make_pair #define ii pair<int, int> #define sz(x) (int)x.size() #define all(x) x.begin(), x.end() #define evoid(val) return void(std::cout << val) #define FOR(i, a, b) for(int i = (a); i <= (b); ++i) #define FOD(i, b, a) for(int i = (b); i >= (a); --i) #define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin()) using namespace std; template<typename U, typename V> bool maxi(U &a, V b) { if (a < b) { a = b; return 1; } return 0; } template<typename U, typename V> bool mini(U &a, V b) { if (a > b) { a = b; return 1; } return 0; } const int N = (int)2e5 + 9; const int mod = (int)1e9 + 7; void prepare(); void main_code(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); if (fopen(task".inp", "r")) { freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); } const bool MULTITEST = 0; prepare(); int num_test = 1; if (MULTITEST) cin >> num_test; while (num_test--) { main_code(); } } void prepare() {}; pair<int, int> c[N]; void main_code() { int k, n; cin >> k >> n; long long ans = 0; vec<ii> px; long long s1 = 0, s2 = 0; for(int i = 1; i <= n; ++i) { char a, b; int x, y; cin >> a >> x >> b >> y; if (a == b) { ans += abs(x - y); continue ; } if (x > y) swap(x, y); c[i] = _mp(x, y); ++ans; s2 += x + y; px.push_back(_mp(x, i)); px.push_back(_mp(y, 0)); px.push_back(_mp(y + 1, -i)); } sort(px.begin(), px.end()); int cl = 0, cr = sz(px) / 3; long long s3 = 0; long long res = LLONG_MAX; if (sz(px) == 0) res = 0; for(int i = 0, j = 0; i < sz(px); i = j + 1) { while (j + 1 < sz(px) and px[j + 1].fi == px[i].fi) ++j; for(int k = i; k <= j; ++k) { if (px[k].second > 0) { auto [l, r] = c[px[k].second]; s2 -= l + r; s3 += r - l; --cr; } else if (px[k].second < 0) { auto [l, r] = c[-px[k].second]; s3 -= r - l; s1 += -l - r; ++cl; } } int x = px[i].first; res = min(res, 2LL * x * cl + s1 + s3 + s2 - 2LL * cr * x); } cout << ans + res; } /* Let the river flows naturally */

Compilation message (stderr)

bridge.cpp: In function 'void main_code()':
bridge.cpp:78:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   78 |                 auto [l, r] = c[px[k].second];
      |                      ^
bridge.cpp:83:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   83 |                 auto [l, r] = c[-px[k].second];
      |                      ^
bridge.cpp: In function 'int main()':
bridge.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bridge.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
#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...