제출 #306470

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
306470		MarcoMeijer	Palembang Bridges (APIO15_bridge)	C++14	22 / 100	63 ms	6640 KiB

bridge

#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
//===================//
//  Added libraries  //
//===================//
 
//===================//
//end added libraries//
//===================//
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 1e5+2;

ll k, n;
char p[MX], q[MX];
ll s[MX], t[MX];

ll ans = 0;

void program() {
    IN(k,n);
    RE(i,n) IN(p[i],s[i],q[i],t[i]);

    if(k == 1) {
        RE(i,n) if(p[i] == q[i]) {
            ans += abs(s[i]-t[i]);
        }

        
        ll deltaX = 0;
        priority_queue<ll,vll,greater<ll>> pq;
        RE(i,n) if(p[i] != q[i]) {
            ans += 1;
            ans += s[i]+t[i];
            deltaX -= 2;
            pq.push(s[i]);
            pq.push(t[i]);
        }

        ll bst = INF;
        ll last = 0;
        while(!pq.empty()) {
            ll x = pq.top(); pq.pop();
            if(x != last) {
                bst = min(bst, ans + deltaX*last);
                last = x;
            }
            deltaX += 2;
            ans -= 2ll*x;
        }
        bst = min(bst, ans + deltaX*last);

        OUTL(bst);
        return;
    }
}

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