oj.uz

답안 #1098836

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1098836 2024-10-10T08:08:20 Z trinhbaongoc3006 Palembang Bridges (APIO15_bridge) C++17
0 / 100
 1 ms 460 KB 
#include <bits/stdc++.h>
#define INF int64_t(1e9)
#define pii pair <int, int>
#define pll pair <long long, long long>
#define mp make_pair
#define file "test"
using namespace std;
const int nmax = 2e5 + 5;
const long long mod = 1e9 + 7;

int n,k;
long long sLow = 0 , sUp = 0, pref[nmax];
long long res = 0;
multiset <int> low, up;
vector <pii> v;
bool cmp(pii a, pii b)
{
    return (a.first + a.second < b.first + b.second);
}
void add(int val)
{
    int a = (low.size() ? *low.rbegin() : -1);
    if (a < val)
    {
        up.insert(val);
        sUp += val;
        if (up.size()  > low.size() )
        {
            int w = *up.begin();
            low.insert(w);
            up.erase(up.find(w));
            sUp-=w;
            sLow+=w;
        }
    }
    else
    {
        low.insert(val);
        sLow += val;
        if (low.size() > up.size() +1);
        {
            int w = *low.rbegin();
            up.insert(w);
            low.erase(low.find(w));
            sUp += w;
            sLow -= w;
        }
    }
}
void ers(int val)
{
    if (up.find(val) != up.end()) up.erase(up.find(val)),sUp-=val;
    else low.erase(low.find(val)),sLow-=val;
    if (low.empty())
    {
        low.insert(*up.begin());
        sLow+=*up.begin();
        sUp-=*up.begin();
        up.erase(up.find(*up.begin()));
    }
}
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    //freopen(file".inp","r",stdin);
    //freopen(file".out","w",stdout);
    cin >> k >> n;
    v.push_back(mp(0,0));
    for (int i=1;i<=n;i++)
    {
        char a, b;
        int x, y;
        cin >> a >> x >> b >> y;
        if (a == b) res += abs(x-y);
        else
        {
            v.push_back(mp(x,y));
        }
    }
    n = v.size() - 1;
    res+=n;
    sort(v.begin(), v.end(), cmp);
    for (int i=1;i<=n+1;i++)
    {
        //cout << v[i].first << " " << v[i].second << "\n";
        add(v[i].first);
        add(v[i].second);
        //cout << *low.rbegin() <<" ";

        pref[i] = sUp - sLow;
    }
    long long ans = pref[n];
    if (k == 2)
    {
        up.clear();
        low.clear();
        sUp = 0;
        sLow = 0;
        for (int i=n;i;i--)
        {
            add(v[i].first);
            add(v[i].second);
            ans = min(ans, sUp - sLow + pref[i-1]);
        }
    }
    cout << ans + res ;
return 0;
}

Compilation message

bridge.cpp: In function 'void add(int)':
bridge.cpp:40:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   40 |         if (low.size() > up.size() +1);
      |         ^~
bridge.cpp:41:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   41 |         {
      |         ^

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 396 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Incorrect 1 ms 344 KB Output isn't correct
4 Halted 0 ms 0 KB -