제출 #57968

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
57968	2018-07-16 14:53:17	aome	Rail (IOI14_rail)	C++17	100 / 100	122 ms	1712 KiB

rail

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "rail.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 5005;
int dis[2][N];
void findLocation(int n, int first, int location[], int stype[]) {
  location[0] = first, stype[0] = 1;
  for (int i = 1; i < n; ++i) {
    dis[0][i] = getDistance(0, i);
  }
  int p1 = 1;
  for (int i = 2; i < n; ++i) {
    if (dis[0][p1] > dis[0][i]) p1 = i;
  }
  location[p1] = location[0] + dis[0][p1], stype[p1] = 2;
  vector<int> vecl, vecr;
  // cout << "#p1 " << p1 << '\n';
  for (int i = 1; i < n; ++i) {
    if (i == p1) continue;
    dis[1][i] = getDistance(p1, i);
    // cout << "#dis1 " << i << ' ' << dis[1][i] << '\n';
    if (dis[0][i] == dis[0][p1] + dis[1][i] && dis[1][i] <= dis[0][p1]) {
      location[i] = location[p1] - dis[1][i], stype[i] = 1;
      // cout << "ax " << i << '\n';
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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