oj.uz

답안 #882784

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
882784 2023-12-03T17:50:30 Z efedmrlr Palembang Bridges (APIO15_bridge) C++17
100 / 100
 334 ms 16048 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 = 1e16;
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";
        return;
    }
    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 = 0ll;
        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);
    }
    cout<<res + ans + n<<"\n";

}
 
signed main() {
    fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Compilation message

bridge.cpp: In function 'std::string to_string(std::string, int, int)':
bridge.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | 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...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 70 ms 14296 KB Output is correct
13 Correct 109 ms 14280 KB Output is correct
14 Correct 93 ms 13104 KB Output is correct
15 Correct 63 ms 8756 KB Output is correct
16 Correct 78 ms 14536 KB Output is correct
17 Correct 69 ms 14536 KB Output is correct
18 Correct 65 ms 14532 KB Output is correct
19 Correct 78 ms 14536 KB Output is correct
20 Correct 82 ms 14532 KB Output is correct
21 Correct 74 ms 14532 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 760 KB Output is correct

Subtask #5
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 452 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 620 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 1 ms 856 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 205 ms 15140 KB Output is correct
26 Correct 241 ms 15048 KB Output is correct
27 Correct 306 ms 15556 KB Output is correct
28 Correct 315 ms 15816 KB Output is correct
29 Correct 334 ms 15812 KB Output is correct
30 Correct 129 ms 8648 KB Output is correct
31 Correct 192 ms 15472 KB Output is correct
32 Correct 167 ms 15964 KB Output is correct
33 Correct 136 ms 15768 KB Output is correct
34 Correct 177 ms 16048 KB Output is correct
35 Correct 184 ms 15592 KB Output is correct
36 Correct 171 ms 15820 KB Output is correct
37 Correct 173 ms 15096 KB Output is correct