oj.uz

Submission #937144

# Submission time Handle Problem Language Result Execution time Memory
937144 2024-03-03T14:21:09 Z VinhLuu Palembang Bridges (APIO15_bridge) C++17
17 / 100
 2000 ms 7104 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 = 1e5 + 5;
const int oo = 1e16;
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];

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;
    vector<int> vr;
    vector<pii> h;
    int cnt = 0;
    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(all(vr));
    for(int i = 1; i <= cnt * 2; i ++) s[i] = s[i - 1] + vr[i - 1];
    if(k == 1){
        int kq = oo;

        for(int i = 1; i <= cnt * 2; i ++){
//            cout << i << " " << vr[i - 1] << " " << s[i - 1] << " " << cnt + vr[i - 1] * (i - 1) - vr[i - 1] * (2 * cnt - i) - s[i - 1] + s[cnt << 1] - s[i] << "l\n";
            kq = min(kq, cnt + vr[i - 1] * (i - 1) - vr[i - 1] * (2 * cnt - i) - s[i - 1] + s[cnt << 1] - s[i]);
        }
        ans = ans + kq;
    }else{
        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;
    }}
    cout << ans;

}

Compilation message

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

Subtask #1
8.0 / 8.0

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

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 1 ms 2516 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2600 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Incorrect 18 ms 7104 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 3 ms 2648 KB Output is correct
4 Correct 4 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 4 ms 2648 KB Output is correct
8 Correct 5 ms 2396 KB Output is correct
9 Correct 4 ms 2396 KB Output is correct
10 Correct 6 ms 2392 KB Output is correct
11 Correct 4 ms 2396 KB Output is correct
12 Correct 6 ms 2396 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 3 ms 2396 KB Output is correct
4 Correct 4 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 3 ms 2648 KB Output is correct
8 Correct 6 ms 2652 KB Output is correct
9 Correct 4 ms 2396 KB Output is correct
10 Correct 6 ms 2396 KB Output is correct
11 Correct 5 ms 2396 KB Output is correct
12 Correct 6 ms 2392 KB Output is correct
13 Execution timed out 2061 ms 2396 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 4 ms 2396 KB Output is correct
5 Correct 2 ms 2648 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 3 ms 2396 KB Output is correct
8 Correct 5 ms 2396 KB Output is correct
9 Correct 4 ms 2396 KB Output is correct
10 Correct 6 ms 2396 KB Output is correct
11 Correct 4 ms 2396 KB Output is correct
12 Correct 6 ms 2396 KB Output is correct
13 Execution timed out 2081 ms 2396 KB Time limit exceeded
14 Halted 0 ms 0 KB -