답안 #23773

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
23773 2017-05-25T17:47:24 Z rubabredwan Palembang Bridges (APIO15_bridge) C++14
9 / 100
29 ms 2020 KB
/*  Bismillahir Rahmanir Rahim  */

#include <bits/stdc++.h>

using namespace std;

const int N = 105;
const long long oo = 1e18;

int k, n; 
long long pos[N][2];
char fk[N][2];

int main(){
    cin >> k >> n;
    for(int i = 1; i <= n; i++){
        for(int j = 0; j <= 1; j++){
            cin >> fk[i][j] >> pos[i][j];
        }
    }
    long long ret = oo;
    for(int i = 1; i <= n; i++){
        for(int a = 0; a <= 1; a++){
            for(int j = 1; j <= n; j++){
                for(int b = 0; b <= 1; b++){
                    long long ans = 0;
                    for(int f = 1; f <= n; f++){
                        if(fk[f][0] == fk[f][1]){
                            ans += abs(pos[f][1] - pos[f][0]);
                            continue;
                        }
                        long long aa = 1LL + abs(pos[f][0] - pos[i][a]) + abs(pos[f][1] - pos[i][a]);
                        long long bb = 1LL + abs(pos[f][0] - pos[j][b]) + abs(pos[f][1] - pos[j][b]);
                        ans += min(aa, bb);
                    }
                    ret = min(ret, ans);
                }
            }
        }
    }
    cout << ret << endl;
    return 0;
}

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2020 KB Output is correct
2 Correct 0 ms 2020 KB Output is correct
3 Incorrect 0 ms 2020 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2020 KB Output is correct
2 Correct 0 ms 2020 KB Output is correct
3 Incorrect 0 ms 2020 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2020 KB Output is correct
2 Correct 0 ms 2020 KB Output is correct
3 Correct 16 ms 2020 KB Output is correct
4 Correct 13 ms 2020 KB Output is correct
5 Correct 3 ms 2020 KB Output is correct
6 Correct 0 ms 2020 KB Output is correct
7 Correct 16 ms 2020 KB Output is correct
8 Correct 16 ms 2020 KB Output is correct
9 Correct 23 ms 2020 KB Output is correct
10 Correct 19 ms 2020 KB Output is correct
11 Correct 26 ms 2020 KB Output is correct
12 Correct 23 ms 2020 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2020 KB Output is correct
2 Correct 0 ms 2020 KB Output is correct
3 Correct 19 ms 2020 KB Output is correct
4 Correct 16 ms 2020 KB Output is correct
5 Correct 3 ms 2020 KB Output is correct
6 Correct 0 ms 2020 KB Output is correct
7 Correct 29 ms 2020 KB Output is correct
8 Correct 16 ms 2020 KB Output is correct
9 Correct 26 ms 2020 KB Output is correct
10 Correct 23 ms 2020 KB Output is correct
11 Correct 19 ms 2020 KB Output is correct
12 Correct 19 ms 2020 KB Output is correct
13 Incorrect 0 ms 2020 KB Output isn't correct
14 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2020 KB Output is correct
2 Correct 0 ms 2020 KB Output is correct
3 Correct 16 ms 2020 KB Output is correct
4 Correct 16 ms 2020 KB Output is correct
5 Correct 3 ms 2020 KB Output is correct
6 Correct 0 ms 2020 KB Output is correct
7 Correct 16 ms 2020 KB Output is correct
8 Correct 16 ms 2020 KB Output is correct
9 Correct 23 ms 2020 KB Output is correct
10 Correct 16 ms 2020 KB Output is correct
11 Correct 16 ms 2020 KB Output is correct
12 Correct 19 ms 2020 KB Output is correct
13 Incorrect 0 ms 2020 KB Output isn't correct
14 Halted 0 ms 0 KB -