제출 #50254

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

rail

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

using namespace std;

const int N = 5e3 + 2;

int dist[N][N];

void findLocation(int N, int first, int location[], int stype[]){
      location[0] = first;
      stype[0] = 1;
      if(N <= 1) return ;
      for(int i = 0; i < N; i ++){
            for(int j = i + 1; j < N; j ++){
                  dist[i][j] = dist[j][i] = getDistance(i, j);
            }
      }
      vector <int> rd, rc, ld, lc;
      int a = 1, b = 0;
      for(int i = 2; i < N; i ++){
            if(dist[0][i] < dist[0][a])
                  a = i;
      }
      rd.push_back(a);
      for(int i = 1; i < N; i ++){
            if(i == a) continue;
            if(dist[a][i] < dist[a][b])
                  b = i;
      }
      if(b)
            rc.push_back(b);
      for(int i = 1; i < N; i ++){
            if(i == a || i == b) continue;
            int x = dist[0][i], c = dist[a][i], d = dist[a][b], mn = dist[0][a];
            if(x - mn == c - d * 2){
                  rd.push_back(i);
            }
            if(x - mn == c)
                  lc.push_back(i);
      }
      for(int i : rd){
            location[i] = dist[0][i] + first;
            stype[i] = 2;
      }
      for(int i : lc){
            location[i] = location[a] - dist[a][i];
            stype[i] = 1;
      }
}

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