oj.uz

답안 #1054335

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1054335 2024-08-12T08:53:09 Z idas Palembang Bridges (APIO15_bridge) C++17
63 / 100
 2000 ms 12980 KB 
#include <bits/stdc++.h>
#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(nullptr)
#define FOR(i, begin, end) for(int i=(begin); i<(end); i++)
#define pb push_back
#define s second
#define f first

using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

const int N=1e5+10;
int k, n;
ll ans, p[N];
vector<ll> a;
vector<pii> inf;
map<int, int> in;

bool cmp(pii a, pii b) {
    return (a.f+a.s)<(b.f+b.s);
}

ll s[4];
void fix(int in, multiset<int> &a, multiset<int> &b) {
    int tot=a.size()+b.size();
    while(a.size()>(tot+1)/2) {
        int val=*a.rbegin();
        a.erase(a.find(val));
        s[in]-=val;
        b.insert(val);
        s[in+1]+=val;
    }
    while(b.size()>tot/2) {
        int val=*b.begin();
        b.erase(b.find(val));
        s[in+1]-=val;
        a.insert(val);
        s[in]+=val;
    }
}

ll calc() {
    return s[1]-s[0]+s[3]-s[2];
}

int main() {
    FAST_IO;
    cin >> k >> n;
    FOR(i, 0, n) {
        char c1, c2; int x1, x2;
        cin >> c1 >> x1 >> c2 >> x2;
        if(c1==c2) {
            ans+=abs(x1-x2);
        }
        else {
            inf.pb({x1,x2});
            a.pb(x1);
            a.pb(x2);
        }
    }
    sort(a.begin(), a.end());
    n=a.size();
    ans+=n/2;
    if(n==0) {
        cout << ans;
        return 0;
    }
    multiset<int> l, r, le, ri;
    sort(inf.begin(), inf.end(), cmp);
    FOR(i, 0, inf.size()) {
        le.insert(inf[i].f);
        le.insert(inf[i].s);
        s[2]+=inf[i].f+inf[i].s;
    }
    while(le.size()>(le.size()+ri.size()+1)/2) {
        int val=*le.rbegin();
        le.erase(le.find(val));
        ri.insert(val);
        s[2]-=val; s[3]+=val;
    }
    ll ret=calc()+ans;

    if(k==1) {
        cout << ret;
        return 0;
    }

    FOR(i, 0, inf.size()) {
        int val=inf[i].f;
        if(l.empty()) l.insert(val), s[0]+=val;
        else {
            int md=*l.rbegin();
            if(val>=md) r.insert(val), s[1]+=val;
            else l.insert(val), s[0]+=val;
        }

        if(le.count(val)) le.erase(le.find(val)), s[2]-=val;
        else ri.erase(ri.find(val)), s[3]-=val;

        val=inf[i].s;
        if(l.empty()) l.insert(val), s[0]+=val;
        else {
            int md=*l.rbegin();
            if(val>=md) r.insert(val), s[1]+=val;
            else l.insert(val), s[0]+=val;
        }

        if(le.count(val)) le.erase(le.find(val)), s[2]-=val;
        else ri.erase(ri.find(val)), s[3]-=val;

        fix(0, l, r);
        fix(2, le, ri);

        ret=min(ret, ans+calc());
    }
    cout << ret;
}

Compilation message

bridge.cpp: In function 'void fix(int, std::multiset<int>&, std::multiset<int>&)':
bridge.cpp:27:19: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   27 |     while(a.size()>(tot+1)/2) {
      |           ~~~~~~~~^~~~~~~~~~
bridge.cpp:34:19: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   34 |     while(b.size()>tot/2) {
      |           ~~~~~~~~^~~~~~
bridge.cpp: In function 'int main()':
bridge.cpp:3:48: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define FOR(i, begin, end) for(int i=(begin); i<(end); i++)
      |                                                ^
bridge.cpp:71:5: note: in expansion of macro 'FOR'
   71 |     FOR(i, 0, inf.size()) {
      |     ^~~
bridge.cpp:3:48: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define FOR(i, begin, end) for(int i=(begin); i<(end); i++)
      |                                                ^
bridge.cpp:89:5: note: in expansion of macro 'FOR'
   89 |     FOR(i, 0, inf.size()) {
      |     ^~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 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 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 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

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 0 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 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 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 57 ms 12188 KB Output is correct
13 Correct 85 ms 12728 KB Output is correct
14 Correct 81 ms 11284 KB Output is correct
15 Correct 45 ms 7612 KB Output is correct
16 Correct 63 ms 12724 KB Output is correct
17 Correct 59 ms 12980 KB Output is correct
18 Correct 55 ms 12504 KB Output is correct
19 Correct 64 ms 12760 KB Output is correct
20 Correct 60 ms 12588 KB Output is correct
21 Correct 75 ms 12720 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 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 1 ms 348 KB Output is correct
11 Correct 0 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 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 344 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 0 ms 348 KB Output is correct
13 Correct 3 ms 588 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 3 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct

Subtask #5
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 1 ms 348 KB Output is correct
5 Correct 1 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 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 3 ms 592 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Execution timed out 2100 ms 12132 KB Time limit exceeded
26 Halted 0 ms 0 KB -