oj.uz

Submission #971331

# Submission time Handle Problem Language Result Execution time Memory
971331 2024-04-28T11:26:07 Z socpite Palembang Bridges (APIO15_bridge) C++14
9 / 100
 2000 ms 692 KB 
#include<bits/stdc++.h>
using namespace std;
 
long long INF = 1e18;
 
vector<int> cp;
 
vector<pair<int, int>> vec;
 
int k, n;
 
int main(){
    cin >> k >> n;
    long long ans = INF;
    long long base = 0;
    for(int i = 0; i < n; i++){
        char t1, t2;
        pair<int, int> p;
        cin >> t1 >> p.first >> t2 >> p.second;
        cp.push_back(p.first);
        cp.push_back(p.second);
        if(p.first > p.second)swap(p.first, p.second);
        base += p.second - p.first;
        if(t1 != t2) {
            base++;
            vec.push_back(p);
        }
    }
    sort(cp.begin(), cp.end());
    // cp.erase(unique(cp.begin(), cp.end()), cp.end());
    for(auto x: cp){
        for(auto y: cp){
            long long sum = 0;
            for(auto p: vec){
                if(p.first <= x && x <= p.second)continue;
                if(p.first <= y && y <= p.second)continue;
                sum += min(min(abs(x - p.first), abs(x - p.second)), min(abs(y - p.first), abs(y - p.second)));
            }
            ans = min(ans, sum);
            // cout << x << " " << y << " " << sum << endl;
        }
    }
    cout << base + ans*2;
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 14.0

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

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Correct 10 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 4 ms 440 KB Output is correct
8 Correct 17 ms 348 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 15 ms 348 KB Output is correct
11 Correct 8 ms 348 KB Output is correct
12 Correct 19 ms 648 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 5 ms 348 KB Output is correct
4 Correct 10 ms 344 KB Output is correct
5 Correct 3 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 5 ms 348 KB Output is correct
8 Correct 14 ms 436 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 15 ms 440 KB Output is correct
11 Correct 9 ms 344 KB Output is correct
12 Correct 17 ms 344 KB Output is correct
13 Execution timed out 2045 ms 348 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Correct 13 ms 344 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 4 ms 432 KB Output is correct
8 Correct 14 ms 344 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 15 ms 692 KB Output is correct
11 Correct 8 ms 600 KB Output is correct
12 Correct 14 ms 444 KB Output is correct
13 Execution timed out 2056 ms 348 KB Time limit exceeded
14 Halted 0 ms 0 KB -