oj.uz

답안 #441378

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
441378 2021-07-05T06:11:30 Z Karliver Palembang Bridges (APIO15_bridge) C++14
100 / 100
 102 ms 5736 KB 
	
 #include <bits/stdc++.h>
 
 #define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
 #define all(v) (v).begin(), (v).end()
 using namespace  std;
 #define forn(i,n) for (int i = 0; i < (n); ++i)
 #define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
 using ll = long long;
 int mod = (ll)1e9 + 7;
 #define PI acos(-1)
 typedef pair<int, int> pairs;
 
 const int INF = 1e9 + 1;
 const int N = 2e5 + 100;
 const double eps = 1e-7;
 
 template <class T> using V = vector<T>;  
 template <class T> using VV = V<V<T>>;  
 
 template <typename XPAX>
 void ckma(XPAX &x, XPAX y) {
     x = (x < y ? y : x);
 }
 template <typename XPAX>
 void ckmi(XPAX &x, XPAX y) {
     x = (x > y ? y : x);
 }
 void __print(int x) {cerr << x;}
 void __print(long x) {cerr << x;}
 void __print(long long x) {cerr << x;}
 void __print(unsigned x) {cerr << x;}
 void __print(unsigned long x) {cerr << x;}
 void __print(unsigned long long x) {cerr << x;}
 void __print(float x) {cerr << x;}
 void __print(double x) {cerr << x;}
 void __print(long double x) {cerr << x;}
 void __print(char x) {cerr << '\'' << x << '\'';}
 void __print(const char *x) {cerr << '\"' << x << '\"';}
 void __print(const string &x) {cerr << '\"' << x << '\"';}
 void __print(bool x) {cerr << (x ? "true" : "false");}
 
 template<typename T, typename V>
 void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
 template<typename T>
 void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
 void _print() {cerr << "]\n";}
 template <typename T, typename... V>
 void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
 #define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
 priority_queue<int> lf;
 priority_queue<int, V<int>, greater<int>> rf;
 ll lsum, rsum;
 void ins(int x) {
 	int med = (lf.size() ? lf.top() : INF);
 	if(x <= med) {
 		lf.push(x);
 		lsum += x;
 	}
 	else {
 		rf.push(x);
 		rsum += x;
 	}

 	if(rf.size() + 1 < lf.size()) {
 		int ns = lf.top();
        lf.pop();
        lsum -= ns;
        rsum += ns;
        rf.push(ns);
    }

    if(lf.size() < rf.size()) {
        int ns = rf.top();
        rf.pop();
        rsum -= ns;
        lsum += ns;
        lf.push(ns);
    }
}
 void solve() {
 
 
 	int n, k;
 	cin >> k >> n;

    V<pairs> ps{{0, 0}};

    auto cmp = [&](pairs a, pairs b) {
        return a.first + a.second < b.first + b.second;
    };

    ll same = 0;
    forn(i, n) {
        char a, b;
        int x,  y;
        cin >> a >> x >> b >> y;

        if(a == b)same += abs(x - y);
        else 
            ps.push_back({x, y});
    }

    sort(all(ps), cmp);

    n = ps.size() - 1;

    same += n;


    V<ll> pr(n + 1, 0);
    lsum = rsum = 0;
    for(int i = 1;i <= n;++i) {
        ins(ps[i].first);
        ins(ps[i].second);

        pr[i] = rsum - lsum;
    }

    ll ans = pr[n];

    if(k == 2) {
        while(lf.size())lf.pop();

        while(rf.size())rf.pop();
        lsum = rsum = 0;
        for(int i = n;i;--i) {
            ins(ps[i].first);
            ins(ps[i].second);
            ckmi(ans, pr[i - 1] + rsum - lsum);
        }
    }

    cout << ans + same << '\n';

 }
 void test_case() {
     int t;
     cin >> t;
     forn(p, t) {
 
         //cout << "Case #" << p + 1 << ": ";
         solve();
     }
 }
 int main() {
 
     ios::sync_with_stdio(false);
     cin.tie(0);
 
     solve();
 
 }

Subtask #1
8.0 / 8.0

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

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 352 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 30 ms 3844 KB Output is correct
13 Correct 59 ms 5568 KB Output is correct
14 Correct 47 ms 4544 KB Output is correct
15 Correct 35 ms 3512 KB Output is correct
16 Correct 40 ms 4928 KB Output is correct
17 Correct 48 ms 5376 KB Output is correct
18 Correct 47 ms 5404 KB Output is correct
19 Correct 57 ms 5568 KB Output is correct
20 Correct 39 ms 5320 KB Output is correct
21 Correct 52 ms 5176 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
32.0 / 32.0

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

Subtask #5
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 45 ms 3912 KB Output is correct
26 Correct 72 ms 4528 KB Output is correct
27 Correct 98 ms 5028 KB Output is correct
28 Correct 99 ms 5736 KB Output is correct
29 Correct 102 ms 5384 KB Output is correct
30 Correct 50 ms 3024 KB Output is correct
31 Correct 52 ms 4724 KB Output is correct
32 Correct 75 ms 5364 KB Output is correct
33 Correct 76 ms 4960 KB Output is correct
34 Correct 79 ms 5408 KB Output is correct
35 Correct 54 ms 5312 KB Output is correct
36 Correct 77 ms 5128 KB Output is correct
37 Correct 37 ms 3912 KB Output is correct