제출 #889054

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
889054		aguss	철로 (IOI14_rail)	C++14	30 / 100	45 ms	604 KiB

rail

#include "rail.h"
#include <bits/stdc++.h>
#define _USE_MATH_DEFINES
#define endl "\n"
#define sp " "
#define f1(i, x) for(auto &i : x)
#define f2(i, x) for(ll i = 0; i < x; i++)
#define raya() cout << endl << "====================================" << endl
using namespace std;
typedef long long ll;
void findLocation(int N, int first, int location[], int stype[]){
    vector<pair<int, int>> a;
    for(int i = 1; i < N; i++) a.push_back({getDistance(0, i), i});
    sort(a.begin(), a.end());
    int f = a[0].second;
    set<int> b;
    for(int i = 0; i < N; i++)
        if(getDistance(f, i) == abs(getDistance(0, f) - getDistance(0, i)) and i != f)
            b.insert(i);
    for(int i = 0; i < N; i++){
        if(b.count(i)){
            location[i] = first - getDistance(i, f) + getDistance(0, f) ;
            stype[i] = 1;
        } else {
            location[i] = first + getDistance(0, i);
            stype[i] = 2;
        }
    }
}

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