제출 #581358

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
581358		Josia	Rail (IOI14_rail)	C++14	0 / 100	71 ms	504 KiB

rail

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

void findLocation(int N, int first, int location[], int stype[]) {
    vector<int> distancesFromZero;
    for (int i=0; i<N; i++) {
        if (i == 0) {
            distancesFromZero.push_back(0); continue;
        }
        distancesFromZero.push_back(getDistance(0, i));
    }

    int nextRight = min_element(distancesFromZero.begin(), distancesFromZero.end())-distancesFromZero.begin();
    stype[nextRight] = 2;
    location[nextRight] = distancesFromZero[nextRight];

    
    vector<int> distancesFromNextRight;
    for (int i=0; i<N; i++) {
        if (i == nextRight) {
            distancesFromNextRight.push_back(0); continue;
        }
        distancesFromNextRight.push_back(getDistance(0, i));
    }


    for (int i=0; i<N; i++) {
        if (distancesFromZero[nextRight] + distancesFromNextRight[i] == distancesFromZero[i]) {
            stype[i] = 1;
            location[i] = location[nextRight]-distancesFromNextRight[i];
        }

        if (distancesFromZero[i] + distancesFromZero[nextRight] == distancesFromNextRight[i]) {
            stype[i] = 2;
            location[i] = distancesFromZero[i];
        }
    }
}

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