제출 #96745

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
96745		SecretAgent007	철로 (IOI14_rail)	C++17	30 / 100	72 ms	504 KiB

rail

#include "rail.h"
#include <bits/stdc++.h>
using namespace std;
/*
int dist[109][109];

int getDistance(int a, int b){
    return dist[a][b];
}
*/
void findLocation(int N, int first, int location[], int stype[]){
	stype[0] = 1;
	location[0] = first;
	int stat = 0;
	int maxi = INT_MAX;
	for(int i = 1; i < N; i++){
        if(maxi > getDistance(0,i)){
            maxi = getDistance(0,i);
            stat = i;
        }
	}
	stype[stat] = 2;
	location[stat] = first+maxi;
	//cout << stat << ' ' << maxi << endl;
	for(int i = 1; i < N; i++){
        if(i == stat) continue;
        if(getDistance(0,i) == getDistance(stat, i)+maxi){
            stype[i] = 1;
            location[i] = first+maxi-getDistance(stat, i);
        }else{
            stype[i] = 2;
            location[i] = first+getDistance(0,i);
        }
	}
}
/*
int main(){
    int n;
    cin >> n;
    int first;
    cin >> first;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            cin >> dist[i][j];
        }
    }
    int location[n];
    int stype[n];
    findLocation(n,first, location,stype);
    for(int a : location) cout << a << ' ';
    cout << endl;
    for(int a : stype) cout << a << ' ';
    cout << endl;
}*/
/*
3 4
0 12 4
12 0 8
4 8 0
*/

• Subtask 1: 8 / 8
• Subtask 2: 22 / 22
• Subtask 3: 0 / 26
• Subtask 4: 0 / 44