제출 #1146310

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1146310		aarb_.tomatexd	철로 (IOI14_rail)	C++20	30 / 100	31 ms	588 KiB

rail

#include "rail.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long 

//int getDistance(int i, int j);

void findLocation(int N, int first, int location[], int stype[]){
    int n = N;
    int minD = 2147483647;
    int primerD;
    for(int i= 1; i<n;i++){
        int a = getDistance(0,i);
        if(a <= minD){
            minD = a;
            primerD = i;
        }
    }
    stype[0] = 1;
    stype[primerD] = 2;
    int sl = getDistance(0,primerD);
    location[primerD] = first + sl;
    location[0] = first;
    
    
    //tengo el primer D, y el primer C
    for(int i=1;i<n;i++){
        if(i!=primerD){
            int sero = getDistance(i, 0);
            int de = getDistance(i, primerD);
            if(sero < de){
                stype[i] = 2;
                location[i] = first + sero;
            }else{
                stype[i] = 1;
                location[i] = first - ( de - sl);
            }
        }
    }
    
    
    /*
    for(int i=0;i<n;i++){
        if(i==0){
            stype[i] = 1;
        }else{
            stype[i] = 2;
        }
    }
    location[0] = first;
    for(int i=1;i<n;i++){
        int dis = getDistance(0,i);
        location[i] = first + dis;
    }
    */
}

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