Submission #1094387

#TimeUsernameProblemLanguageResultExecution timeMemory
1094387ShaShiPalembang Bridges (APIO15_bridge)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h> #define int long long // #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") #define F first #define S second #define mp make_pair #define pb push_back #define all(x) x.begin(), x.end() #define kill(x) cout << x << "\n", exit(0); #define pii pair<int, int> #define pll pair<long long, long long> #define endl "\n" using namespace std; typedef long long ll; // typedef __int128_t lll; typedef long double ld; const int MAXN = (int)1e6 + 7; const int MOD = 998244353; const ll INF = (ll)1e18 + 7; int n, m, k, tmp, t, tmp2, tmp3, tmp4, u, v, w, flag, q, ans, N, l, r, mid; vector<pii> vec; map<int, int> cnt; char ch, ch2; int32_t main() { #ifdef LOCAL freopen("inp.in", "r", stdin); freopen("res.out", "w", stdout); #else ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); #endif cin >> k >> n; for (int i=1; i<=n; i++) { cin >> ch >> u >> ch2 >> v; if (ch == ch2) ans += abs(u-v); else cnt[u]++, cnt[v]++, vec.pb({u, v}); } tmp = 0; for (auto cur: cnt) { tmp += cur.S; if (tmp+tmp >= n) { tmp = cur.F; break; } } for (auto cur:cnt) ans += abs(cur.F-tmp)*cur.S; cout << ans << endl; 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...