제출 #315537

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

rail

#include <bits/stdc++.h>
#include "rail.h"

using namespace std;

#define dist first
#define idx second

typedef pair<int,int> pii;

const int MN = 5001;

pii station[MN];

void findLocation(int N, int first, int location[], int stype[]) {
    for (int i=0; i<N; ++i) {
        station[i].dist = getDistance(0, i);
        station[i].idx = i;
    }

    sort(station+1, station+N);
    int closest = station[1].idx;
    int mdst = station[1].dist;

    location[0] = first;
    location[closest] = first + mdst;
    for (int i=2; i<N; ++i) {
        int cur = getDistance(closest, station[i].idx);
        if (mdst + cur == station[i].dist) {
            int offset = station[i].dist - (mdst * 2);
            location[station[i].idx] = first - offset;
        } else {
            location[station[i].idx] = first + station[i].dist;
        }
    }

    for (int i=0; i<N; ++i) {
        stype[i] = (location[i] <= first ? 1 : 2);
    }
}

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