oj.uz

Submission #1010301

# Submission time Handle Problem Language Result Execution time Memory
1010301 2024-06-28T17:14:12 Z GrindMachine Palembang Bridges (APIO15_bridge) C++17
41 / 100
 2000 ms 5868 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll k,n; cin >> k >> n;
    vector<array<ll,3>> a;
    ll same_side = 0;
    map<ll,ll> mp;

    rep1(i,n){
        char p,q; ll x,y;
        cin >> p >> x >> q >> y;
        if(p == q){
            same_side += abs(x-y);
        }
        else{
            if(x > y) swap(x,y);
            a.pb({x+y,x,y});
        }
    }

    sort(all(a));
    auto b = a;
    a.clear();

    auto go = [&](vector<array<ll,3>> &curr){
        map<ll,ll> mp;
        ll sum = 0;

        for(auto [val,x,y] : curr){
            mp[x]++, mp[y]++;
            sum += x+y;
        }

        mp[-1] = 0;
        ll coeff = -2*sz(curr);
        ll res = inf2;

        for(auto [x,c] : mp){
            coeff += 2*c;
            sum -= 2*x*c;
            amin(res,coeff*x+sum);
        }

        return res;
    };

    ll ans = inf2;

    while(!b.empty()){
        a.pb(*b.begin());
        b.erase(b.begin());
        ll res = go(a)+go(b);
        amin(ans,res);
    }

    if(a.empty()) ans = 0;
    ans += same_side+sz(a);
    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 4 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 4 ms 344 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 416 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 460 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 480 KB Output is correct
9 Correct 1 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 2 ms 348 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory 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 1 ms 348 KB Output is correct
9 Correct 1 ms 476 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 480 KB Output is correct
13 Correct 4 ms 348 KB Output is correct
14 Correct 39 ms 348 KB Output is correct
15 Correct 171 ms 600 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 17 ms 344 KB Output is correct
18 Correct 19 ms 348 KB Output is correct
19 Correct 4 ms 348 KB Output is correct
20 Correct 97 ms 644 KB Output is correct
21 Correct 134 ms 604 KB Output is correct
22 Correct 102 ms 604 KB Output is correct
23 Correct 5 ms 348 KB Output is correct
24 Correct 96 ms 604 KB Output is correct

Subtask #5
0 / 37.0

# Verdict Execution time Memory 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 1 ms 348 KB Output is correct
8 Correct 1 ms 480 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 456 KB Output is correct
13 Correct 4 ms 348 KB Output is correct
14 Correct 41 ms 344 KB Output is correct
15 Correct 165 ms 600 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 13 ms 348 KB Output is correct
18 Correct 19 ms 528 KB Output is correct
19 Correct 4 ms 348 KB Output is correct
20 Correct 96 ms 604 KB Output is correct
21 Correct 139 ms 632 KB Output is correct
22 Correct 95 ms 604 KB Output is correct
23 Correct 4 ms 348 KB Output is correct
24 Correct 95 ms 628 KB Output is correct
25 Execution timed out 2069 ms 5868 KB Time limit exceeded
26 Halted 0 ms 0 KB -