Submission #252479

#TimeUsernameProblemLanguageResultExecution timeMemory
252479eohomegrownapps철로 (IOI14_rail)C++14
8 / 100
76 ms504 KiB
#include "rail.h"
#include <bits/stdc++.h>
using namespace std;
int n;

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

void findLocation(int N, int first, int location[], int stype[]){
    //1: lhs (up-down)
    //2: rhs (down-up)
    n=N;
    location[0]=first;
    stype[0]=1;
    if (n==1){
        return;
    }
    vector<pair<int,int>> distfrom0(n);
    distfrom0[0]={0,0};
    for (int i = 1; i<n; i++){
        distfrom0[i]={getDistance(0,i),i};
    }
    sort(distfrom0.begin(),distfrom0.end());
    for (int i = 1; i<n; i++){
        location[distfrom0[i].second]=distfrom0[i].first+first;
        stype[distfrom0[i].second]=2;
    }
    return;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...