| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 882777 | 2023-12-03T17:30:16 Z | efedmrlr | Palembang Bridges (APIO15_bridge) | C++17 | 0 ms | 348 KB |
#include <bits/stdc++.h>
using namespace std;
#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)), __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl
#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 3e5+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,q,K;
int ans = 0;
struct Inter {
int l, r;
Inter(int left, int right) {
l = left;
r = right;
}
Inter() {
l = 0;
r = 0;
}
const bool operator<(const Inter &oth) {
return l + r < oth.l + oth.r;
}
void print() {
cout<<"l:"<<l<<" r:"<<r<<"\n";
}
};
vector<Inter> arr;
struct MedianSet {
set<array<int,2> > l,r;
int lsum, rsum;
MedianSet() {
l.clear(); r.clear();
lsum = 0ll;
rsum = 0ll;
}
int size() {
return l.size() + r.size();
}
int median() {
if(size() == 0ll) return 0;
return (*r.begin())[0];
}
void balance() {
while((int)l.size() < (int)r.size() - 1) {
l.insert(*r.begin());
rsum -= (*r.begin())[0];
lsum += (*r.begin())[0];
r.erase(r.begin());
}
while(l.size() > r.size()) {
r.insert(*prev(l.end()));
lsum -= (*prev(l.end()))[0];
rsum += (*prev(l.end()))[0];
l.erase(prev(l.end()));
}
}
void add_el(array<int,2> x) {
if(x[0] < median()) {
l.insert(x);
lsum += x[0];
}
else {
r.insert(x);
rsum += x[0];
}
balance();
}
void delete_el(array<int,2> x) {
if(l.find(x) != l.end()) {
l.erase(x);
lsum -= x[0];
}
else if(r.find(x) != r.end()) {
r.erase(x);
rsum -= x[0];
}
else assert(0);
balance();
}
int find_val() {
return (median() * l.size() - lsum) + (rsum - median() * r.size());
}
};
inline void solve() {
cin>>K>>n;
for(int i = 0; i<n; i++) {
int b,d;
char a,c;
cin>>a>>b>>c>>d;
if(a == c) {
ans += abs(b-d);
}
else {
arr.pb(Inter(min(b,d), max(b,d)));
}
}
n = arr.size();
if(n == 0) {
cout<<ans<<"\n";
}
sort(arr.begin(), arr.end());
MedianSet st1, st2;
for(int i = 0; i<n; i++) {
// arr[i].print();
st2.add_el({arr[i].l, i * 2ll});
st2.add_el({arr[i].r, i * 2ll + 1ll});
}
if(K == 1) {
cout<<st2.find_val() + ans + n<<"\n";
return;
}
int res = INF;
for(int i = 0; i<n; i++) {
int cur = 0;
cur += st1.find_val() + st2.find_val();
// dbg(st1.find_val()); dbg(st2.find_val());
// dbg(cur);
st1.add_el({arr[i].l, i * 2ll});
st1.add_el({arr[i].r, i * 2ll + 1});
st2.delete_el({arr[i].l, i * 2ll});
st2.delete_el({arr[i].r, i * 2ll + 1});
// dbg(i);
res = min(res, cur);
}
res = min(res, st1.find_val() + st2.find_val());
cout<<res + ans + n<<"\n";
}
signed main() {
fastio();
int test = 1;
//cin>>test;
while(test--) {
solve();
}
}
Compilation message
| # | 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 | 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 | - |