oj.uz

Submission #937373

# Submission time Handle Problem Language Result Execution time Memory
937373 2024-03-04T01:39:00 Z VinhLuu Palembang Bridges (APIO15_bridge) C++17
22 / 100
 2000 ms 8260 KB 
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <bits/stdc++.h>
#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(lmao) lmao.begin(), lmao.end()

using namespace std;

typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
const int N = 2e5 + 5;
const int oo = 1e18;
const int mod = 1e9 + 7;
const int K = 1e5 + 5;

char P[N], Q[N];
int S[N], T[N], k, n, ans, s[N];
vector<int> vr;
vector<pii> h;
int cnt = 0;

namespace sub1{
    void solve(){
        int ret = oo;
        for(int i = 1; i <= cnt << 1; i ++){
            for(int j = i + 1; j <= cnt << 1; j ++){
                int kq = 0;
                for(auto [l, r] : h){
                    if(l <= vr[i - 1] && vr[i - 1] <= r) kq += 1 + vr[i - 1] - l + r - vr[i - 1];
                    else if(l <= vr[j - 1] && vr[j - 1] <= r) kq += 1 + vr[j - 1] - l + r - vr[j - 1];
                    else if(vr[i - 1] <= l && r <= vr[j - 1]) kq += 1 + min(l - vr[i - 1] + r - vr[i - 1], vr[j - 1] - l + vr[j - 1] - r);
                    else if(r <= vr[i - 1]) kq += 1 + vr[i - 1] - l + vr[i - 1] - r;
                    else kq += 1 + l - vr[j - 1] + r - vr[j - 1];
                }
                ret = min(ret, kq + ans);
            }
        }
        ans = ret;
    }
}

namespace sub2{

    int cal(int i,int j){
        int kq = 0;
        for(auto [l, r] : h){
            if(l <= i && i <= r) kq += 1 + i - l + r - i;
            else if(l <= j && j <= r) kq += 1 + j - l + r - j;
            else if(i <= l && r <= j) kq += 1 + min(l - i + r - i, j - l + j - r);
            else if(r <= i) kq += 1 + i - l + i - r;
            else kq += 1 + l - j + r - j;
        }
        return kq;
    }
    int ck(int i){
        int ret = oo;
        int l = vr[i - 1] + 1;
        int r = min((int)1e9, vr[cnt * 2 - 1] + 1);
        while(l < r - 1){
            int m1 = l + (r - l)/3, m2 = r - (r - l)/3;
            int u = cal(vr[i - 1], m1);
            int v = cal(vr[i - 1], m2);
            if(u > v) l = m1; else r = m2;
            ret = min({ret, u, v});
        }
        for(int j = l; j <= r; j ++) ret = min(ret, cal(vr[i - 1], j));
        return ret;
    }
    void solve(){
        int ret = oo;
        int le = 1, ri = 2 * cnt, mid1, mid2;
        while(le < ri - 1){
            mid1 = le + (ri - le)/3, mid2 = ri - (ri - le)/3;
            int u = ck(mid1);
            int v = ck(mid2);
            if(u > v) le = mid1; else ri = mid2;
            ret = min({ret, u, v});
        }
        for(int i = le; i <= ri; i ++) ret = min(ret, ck(i));
        ans += ret;
//        for(int i = 1; i <= cnt * 2; i ++){
//            int l = vr[i - 1] + 1;
//            int r = min((int)1e9, vr[cnt * 2 - 1] + 1);
//            while(l < r - 2){
//                int m1 = l + (r - l)/3, m2 = r - (r - l)/3;
//                int u = cal(vr[i - 1], m1);
//                int v = cal(vr[i - 1], m2);
//                if(u > v) l = m1; else r = m2;
//                ret = min({ret, u, v});
//            }
//            for(int j = l; j <= r; j ++) ret = min(ret, cal(vr[i - 1], j));
////            cerr << i << " " << ret << "f\n";
//        }
//        ans = ret + ans;
    }
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    #define task "v"
    if(fopen(task ".inp","r")){
        freopen(task ".inp","r",stdin);
        freopen(task ".out","w",stdout);
    }

    cin >> k >> n;


    for(int i = 1; i <= n; i ++){
        cin >> P[i] >> S[i] >> Q[i] >> T[i];
        if(P[i] == Q[i]){
            ans += abs(S[i] - T[i]);
            continue;
        }
        vr.pb(S[i]);
        vr.pb(T[i]);
        cnt++;
        if(S[i] > T[i]) swap(S[i], T[i]);
        h.pb({S[i], T[i]});
    }
    if(!vr.empty()){
        sort(vr.begin(), vr.end());
        int mx = 0;
        for(int i = 1; i <= cnt * 2; i ++) mx = max(mx, vr[i - 1]), s[i] = s[i - 1] + vr[i - 1];
        if(k == 1){
            int kq = oo;
            int lim = vr[cnt - 1];
            for(int j = max(vr[0], lim - (int)1e5); j <= min(vr[2 * cnt - 1], lim + (int)1e5); j ++){
                int i = lower_bound(all(vr), j) - vr.begin();
                if(i < 2 * cnt){
                    i++;}
                    kq = min(kq, cnt + j * (i - 1) - j * (2 * cnt - i + 1) - s[i - 1] + s[cnt * 2] - s[i - 1]);
            }
            ans = ans + kq;
        }else{
//            if(n <= 100) sub1 :: solve();
//            else
                sub2 :: solve();
        }
    }
    cout << ans;

}

Compilation message

bridge.cpp: In function 'int main()':
bridge.cpp:109:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  109 |         freopen(task ".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
bridge.cpp:110:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  110 |         freopen(task ".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 4 ms 4700 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 4 ms 4440 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 3 ms 4444 KB Output is correct
10 Correct 3 ms 4444 KB Output is correct
11 Correct 3 ms 4444 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 5 ms 4440 KB Output is correct
5 Correct 3 ms 4440 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 3 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 4 ms 4440 KB Output is correct
10 Correct 4 ms 4652 KB Output is correct
11 Correct 3 ms 4696 KB Output is correct
12 Correct 17 ms 8124 KB Output is correct
13 Correct 38 ms 8120 KB Output is correct
14 Correct 26 ms 7876 KB Output is correct
15 Correct 23 ms 6856 KB Output is correct
16 Correct 28 ms 8128 KB Output is correct
17 Correct 26 ms 8124 KB Output is correct
18 Correct 34 ms 8128 KB Output is correct
19 Correct 36 ms 8132 KB Output is correct
20 Correct 26 ms 8260 KB Output is correct
21 Correct 36 ms 8128 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Execution timed out 2087 ms 4444 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Execution timed out 2084 ms 4444 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Execution timed out 2061 ms 4444 KB Time limit exceeded
4 Halted 0 ms 0 KB -