Submission #887930

#	Time	Username	Problem	Language	Result	Execution time	Memory
887930		Kutan	Palembang Bridges (APIO15_bridge)	C++14	9 / 100	6 ms	468 KiB

bridge

// Cao Quang Hung
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
 
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long , long long>
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define dem(x) __builtin_popcount(x)
#define Mask(x) (1LL << (x))
#define BIT(x, i) ((x) >> (i) & 1)
#define ln '\n'
#define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
///mt19937 rnd(time(0));
 
const int INF = 1e9 , mod = 1e9 + 7;
 
template <class T1, class T2>
inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; }
 
template <class T1 , class T2>
inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;}
 
template <class T>
inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; }
 
template <class T>
inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; }
 
template <class T>
inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; }
 
template <class T>
inline T product (const T &x , const T &y) { return 1LL * x * y % mod; }
 
#define PROB "a"
void file(){
    if(fopen(PROB".inp", "r")){
        freopen(PROB".inp","r",stdin);
        freopen(PROB".out","w",stdout);
    }
}
void sinh_(){
//    srand(time(0));
//    freopen(PROB".inp" , "w" , stdout);
//    int n;
}
 
typedef long long ll;
typedef double db;
const int N = 2e5 + 5;
int k, n;
ll Ans = 0;
pii segment[N];
int numseg = 0, numpoint;
vector<int> compress;
 
void readip(){
    cin >> k >> n;
    REP(i, 1, n) {
        char a, b; int l, r;
        cin >> a >> l >> b >> r;
        Ans += abs(r - l);
        if (a == b) continue;
        ++Ans;
        if (l > r) swap(l, r);
        segment[++numseg] = {l, r};
        compress.eb(l);
        compress.eb(r);
    }
    sort(ALL(compress));
    compress.erase(unique(ALL(compress)), compress.end());
    numpoint = compress.size();
 
    if (numpoint == 0) {
        cout << Ans << ln;
        exit(false);
    }
 
    sort(segment + 1, segment + numseg + 1);
    REP(i, 1, numseg) {
        // cout << segment[i].fi << ' ' << segment[i].second << ln;
        segment[i].first = lower_bound(ALL(compress), segment[i].first) - compress.begin() + 1;
        segment[i].second = lower_bound(ALL(compress), segment[i].second) - compress.begin() + 1;
    }
 
}
 
namespace sub1 {
    bool check() {
        return k == 1;
    }
 
    vector<pair<ll, int>> pref, suf;
    void solve() {
        pref.assign(numpoint + 2, {0, 0});
        suf.assign(numpoint + 2, {0, 0});
        REP(i, 1, numseg) {
            pref[segment[i].second].first += compress[segment[i].second - 1];
            pref[segment[i].second].second++;
 
            suf[segment[i].first].first += compress[segment[i].first - 1];
            suf[segment[i].first].second++;
        }
 
        REP(i, 1, numpoint)  {
            pref[i].first += pref[i - 1].first;
            pref[i].second += pref[i - 1].second;
        }
 
        REPD(i, numpoint - 1, 1) {
            suf[i].first += suf[i + 1].first;
            suf[i].second += suf[i + 1].second;
        }
 
 
        ll res = 1e18;
        REP(i, 1, numpoint) {
            int x = compress[i - 1];
            ll tmp = 1LL * x * pref[i].second - pref[i].first
                    + suf[i].first - 1LL * x * suf[i].second;
            tmp *= 2;
            minimize(res, tmp);
        }
        cout << Ans + res << ln;
    }
};
 
namespace sub2 {
    void solve() {
        ll res = 1e18;
        REP(i, 1, numpoint) REP(j, i + 1, numpoint) {
            ll sum = 0;
            REP(s, 1, numseg) {
                if (segment[s].first > i && segment[s].se < j) 
                sum += min(compress[segment[s].first - 1] - compress[i - 1] , 
                          compress[j - 1] - compress[segment[s].se - 1]);
                else if (segment[s].second <= i)
                    sum += compress[i - 1] - compress[segment[s].second - 1];
                else if (segment[s].first >= j)
                    sum += compress[segment[s].first - 1] - compress[j - 1];
            }
            minimize(res, sum);
        }
        cout << Ans + res * 2 << ln;
    }
};


namespace sub3 {

    vector<int> cnt;

    void ins(int x) {
        REPD(i, x - 1, 1) ++cnt[i];
    }

    void del(int x) {
        REPD(i, x - 1, 1) --cnt[i];
    }
    
    void solve() {
        cnt.assign(numpoint + 2, 0);
        REP(i, 1, numseg) 
            Ans -= compress[segment[i].se - 1] - compress[segment[i].fi - 1];
        
        sort(segment + 1, segment + numseg + 1, [&] (const pii &x, const pii &y) {
            return compress[x.fi - 1] + compress[x.se - 1] < compress[y.fi - 1] + compress[y.se - 1];
        });

        // REP(i, 1, numseg) cout << compress[segment[i].fi - 1] << ' ' << compress[segment[i].se - 1] << ln;
        // cout << ln;


        ll res = 1e18;
        REP(lid, 1, numpoint - 1) {
            REP(i, 1, numpoint) cnt[i] = 0;

            int L = compress[lid - 1];
            int R = compress[lid];
            int sum = L + R;
            int pt = 1, num = 0;

            ll S = 0;
            while(pt <= numseg && compress[segment[pt].fi - 1] + compress[segment[pt].se - 1] <= sum) {
                S += abs(compress[segment[pt].fi - 1] - L);
                S += abs(compress[segment[pt].se - 1] - L);
                ++pt;
            }
            
            REP(i, pt, numseg) {
                S += abs(compress[segment[i].fi - 1] - R);
                S += abs(compress[segment[i].se - 1] - R);  
                ins(segment[i].fi);
                ins(segment[i].se);
                num += 2;
            }

            minimize(res, S);

            REP(rid, lid + 2, numpoint) {
                assert(R == compress[rid - 2]);
                int tmp = cnt[rid - 1];
                S -= tmp;
                S += (num - tmp);
                sum = L + compress[rid - 1];
                while(pt <= numseg && compress[segment[pt].fi - 1] + compress[segment[pt].se - 1] <= sum) {
                    S -= abs(compress[segment[pt].fi - 1] - R); 
                    S += abs(compress[segment[pt].fi - 1] - L);
                    
                    S -= abs(compress[segment[pt].se - 1] - R); 
                    S += abs(compress[segment[pt].se - 1] - L);
                    
                    del(segment[pt].fi);
                    del(segment[pt].se);
                    
                    num -= 2;
                    ++pt;
                }

                minimize(res, S);

                R = compress[rid - 1];
            }
        }
        // if (res == 1e18) res = 0;    
        cout << Ans + res << ln;
    }
};

void solve(){       
    // if (sub1::check()) {
    //     sub1::solve();
    //     return;
    // }

    if (numpoint <= 2) {
        cout << Ans << ln;
        return;
    }

    if (n <= 100) {
        sub2::solve();
        return;
    }
  
    if (n <= 1000) {
        sub3::solve();
        return;
    }
}
 
int main(){
    sinh_();
    io_faster
    file();
    int t = 1;
//    cin >> t;
    while (t--){
        readip();
        solve();
    }
}

Compilation message (stderr)

bridge.cpp: In function 'void readip()':
bridge.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridge.cpp:146:5: note: in expansion of macro 'REP'
  146 |     REP(i, 1, n) {
      |     ^~~
bridge.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridge.cpp:167:5: note: in expansion of macro 'REP'
  167 |     REP(i, 1, numseg) {
      |     ^~~
bridge.cpp: In function 'void sub1::solve()':
bridge.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridge.cpp:184:9: note: in expansion of macro 'REP'
  184 |         REP(i, 1, numseg) {
      |         ^~~
bridge.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridge.cpp:192:9: note: in expansion of macro 'REP'
  192 |         REP(i, 1, numpoint)  {
      |         ^~~
bridge.cpp:93:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   93 | #define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
      |                             ^
bridge.cpp:197:9: note: in expansion of macro 'REPD'
  197 |         REPD(i, numpoint - 1, 1) {
      |         ^~~~
bridge.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridge.cpp:204:9: note: in expansion of macro 'REP'
  204 |         REP(i, 1, numpoint) {
      |         ^~~
bridge.cpp: In function 'void sub2::solve()':
bridge.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridge.cpp:218:9: note: in expansion of macro 'REP'
  218 |         REP(i, 1, numpoint) REP(j, i + 1, numpoint) {
      |         ^~~
bridge.cpp:92:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridge.cpp:218:29: note: in expansion of macro 'REP'
  218 |         REP(i, 1, numpoint) REP(j, i + 1, numpoint) {
      |                             ^~~
bridge.cpp:92:28: warning: unnecessary parentheses in declaration of 's' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridge.cpp:220:13: note: in expansion of macro 'REP'
  220 |             REP(s, 1, numseg) {
      |             ^~~
bridge.cpp: In function 'void sub3::ins(int)':
bridge.cpp:93:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   93 | #define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
      |                             ^
bridge.cpp:241:9: note: in expansion of macro 'REPD'
  241 |         REPD(i, x - 1, 1) ++cnt[i];
      |         ^~~~
bridge.cpp: In function 'void sub3::del(int)':
bridge.cpp:93:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   93 | #define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
      |                             ^
bridge.cpp:245:9: note: in expansion of macro 'REPD'
  245 |         REPD(i, x - 1, 1) --cnt[i];
      |         ^~~~
bridge.cpp: In function 'void sub3::solve()':
bridge.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridge.cpp:250:9: note: in expansion of macro 'REP'
  250 |         REP(i, 1, numseg)
      |         ^~~
bridge.cpp:92:28: warning: unnecessary parentheses in declaration of 'lid' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridge.cpp:262:9: note: in expansion of macro 'REP'
  262 |         REP(lid, 1, numpoint - 1) {
      |         ^~~
bridge.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridge.cpp:263:13: note: in expansion of macro 'REP'
  263 |             REP(i, 1, numpoint) cnt[i] = 0;
      |             ^~~
bridge.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridge.cpp:277:13: note: in expansion of macro 'REP'
  277 |             REP(i, pt, numseg) {
      |             ^~~
bridge.cpp:92:28: warning: unnecessary parentheses in declaration of 'rid' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
bridge.cpp:287:13: note: in expansion of macro 'REP'
  287 |             REP(rid, lid + 2, numpoint) {
      |             ^~~
bridge.cpp: In function 'void file()':
bridge.cpp:125:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |         freopen(PROB".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
bridge.cpp:126:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  126 |         freopen(PROB".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 14
• Subtask 3: 9 / 9
• Subtask 4: 0 / 32
• Subtask 5: 0 / 37