제출 #763712

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

rail

#include "rail.h"

#include <bits/stdc++.h>

using namespace std;
void findLocation(int n,int first,int location[],int stype[]){
    vector<pair<int,int>> v;
    for(int i = 1;i<n;i++){
        v.push_back({getDistance(0,i),i});
    }
    sort(v.begin(),v.end());
    int x = v[0].second;
    stype[0] = 1;
    location[0]= first;
    stype[x] = 2;
    location[x] = v[0].first+first;
    for(int i = 1;i<n;i++){
        if(i==x)continue;
        int dis1 = getDistance(0,i);
        int dis2 = getDistance(x,i);
        if(dis2<dis1){
            stype[i] = 1;
            location[i] = first-(dis2-v[0].first);
        }else{
            stype[i] = 2;
            location[i] = first+dis1;
        }
    }
}
/*
int main(){
    int S[] = {10,2,20,30,1};

    cout<<findMaxAttraction(5,2,7,S);
}*/

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