oj.uz

답안 #971335

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971335 2024-04-28T11:28:12 Z socpite Palembang Bridges (APIO15_bridge) C++14
9 / 100
 2000 ms 600 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;
	assert(k == 2);
    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;
        if(p.first > p.second)swap(p.first, p.second);
        base += p.second - p.first;
        if(t1 != t2) {
            base++;
            vec.push_back(p);
        }
        cp.push_back(p.first);
        cp.push_back(p.second);
    }
    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

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 11 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 4 ms 436 KB Output is correct
8 Correct 17 ms 348 KB Output is correct
9 Correct 10 ms 348 KB Output is correct
10 Correct 17 ms 348 KB Output is correct
11 Correct 11 ms 344 KB Output is correct
12 Correct 16 ms 436 KB Output is correct

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 6 ms 348 KB Output is correct
4 Correct 14 ms 440 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 428 KB Output is correct
8 Correct 15 ms 344 KB Output is correct
9 Correct 9 ms 344 KB Output is correct
10 Correct 20 ms 348 KB Output is correct
11 Correct 9 ms 344 KB Output is correct
12 Correct 15 ms 348 KB Output is correct
13 Execution timed out 2076 ms 348 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 6 ms 348 KB Output is correct
4 Correct 13 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 4 ms 600 KB Output is correct
8 Correct 15 ms 436 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 16 ms 348 KB Output is correct
11 Correct 9 ms 348 KB Output is correct
12 Correct 18 ms 348 KB Output is correct
13 Execution timed out 2084 ms 348 KB Time limit exceeded
14 Halted 0 ms 0 KB -