#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() {};
int k, n;
namespace case1 {
ii b[N];
void sol() {
int cur = -1;
long long ans = LLONG_MAX;
vector<ii> ev;
int num_greater = 0, sum_gre = 0;
long long final_sum = 0, tot_sum = 0, sum_greater = 0;
for(int i = 1; i <= n; ++i) {
char a, b; int x, y;
cin >> a >> x >> b >> y;
if (a == b) {
final_sum += abs(x - y);
continue ;
}
num_greater += 2;
if (x > y) swap(x, y);
ev.push_back(_mp(x, x));
ev.push_back(_mp(y, y));
sum_greater += x + y;
sum_gre += 2;
}
tot_sum = sum_greater;
sort(ev.begin(), ev.end());
for(int i = 0; i < sz(ev); ++i) {
int j = i;
while (j + 1 < sz(ev) and ev[j + 1].fi == ev[i].fi) ++j;
for(int k = i; k <= j; ++k) {
--num_greater;
sum_greater -= ev[k].se;
}
int x = ev[i].fi;
ans = min(ans,
sum_greater - 1LL * num_greater * x +
1LL * (sum_gre - num_greater) * x - (tot_sum - sum_greater) + sum_gre/2);
i = j;
}
cout << ans + final_sum;
}
};
void main_code() {
cin >> k >> n;
if (k == 1) {
case1::sol();
return ;
}
}
/* Let the river flows naturally */
Compilation message
bridge.cpp: In function 'void case1::sol()':
bridge.cpp:51:13: warning: unused variable 'cur' [-Wunused-variable]
51 | int cur = -1;
| ^~~
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 time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
