#83165 (C++11（廃止可能性あり）) No.168 ものさし

• 問題: No.168 ものさし
• ユーザー: tnakao0123
• 提出日時: 2016-03-24 17:00:28
• 言語: C++11（廃止可能性あり） (gcc 13.3.0)
• 結果: AC
• 実行時間: 47 ms / 2,000 ms
• コード長: 2,431 bytes
• コンパイル時間: 870 ms
• コンパイル使用メモリ: 89,280 KB
• 実行使用メモリ: 11,392 KB
• 最終ジャッジ日時: 2024-12-24 07:13:20
• 合計ジャッジ時間: 1,928 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

ファイルパターン	結果
sample	AC * 4
other	AC * 19

ソースコード

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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
/* -*- coding: utf-8 -*-
 *
 * 168.cc: No.168 ものさし - yukicoder
 */
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;
/* constant */
const int MAX_N = 1000;
const int MAX_M = MAX_N * (MAX_N - 1) / 2;
/* typedef */
typedef long long ll;
struct Edge {
  ll d;
  int i, j;
  Edge() {}
  Edge(ll _d, int _i, int _j): d(_d), i(_i), j(_j) {}
  bool operator<(const Edge &e) const { return d < e.d; }
  void print() { printf("%lld[%d,%d]\n", d, i, j); }
};
struct UFT {
  int links[MAX_N], ranks[MAX_N], sizes[MAX_N];
  void clear(int n) {
    for (int i = 0; i < n; i++) links[i] = i, ranks[i] = sizes[i] = 1;
  }
  UFT() {}
  UFT(int n) { clear(n); }
  int root(int i) {
    int i0 = i;
    while (links[i0] != i0) i0 = links[i0];
    return (links[i] = i0);
  }
  int rank(int i) { return ranks[root(i)]; }
  int size(int i) { return sizes[root(i)]; }
  bool same(int i, int j) { return root(i) == root(j); }
  int merge(int i0, int i1) {
    int r0 = root(i0), r1 = root(i1), mr;
    if (r0 == r1) return r0;
    if (ranks[r0] == ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      ranks[r0]++;
      mr = r0;
    }
    else if (ranks[r0] > ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      mr = r0;
    }
    else {
      links[r0] = r1;
      sizes[r1] += sizes[r0];
      mr = r1;
    }
    return mr;
  }
};
/* global variables */
ll xs[MAX_N], ys[MAX_N];
Edge es[MAX_M];
UFT uft;
/* subroutines */
/* main */
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> xs[i] >> ys[i];
  
  int m = 0;
  for (int i = 0; i < n; i++)
    for (int j = i + 1; j < n; j++) {
      ll dx = xs[j] - xs[i], dy = ys[j] - ys[i];
      es[m++] = Edge(dx * dx + dy * dy, i, j);
    }
  sort(es, es + m);
  //for (int i = 0; i < m; i++) es[i].print();
  uft.clear(n);
  ll maxd2 = 0;
  for (int i = 0; i < m; i++) {
    Edge &ei = es[i];
    if (! uft.same(ei.i, ei.j)) {
      uft.merge(ei.i, ei.j);
      maxd2 = ei.d;
      if (uft.same(0, n - 1)) break;
    }
  }
  //printf("maxd2=%lld\n", maxd2);
  printf("%lld\n", (ll)ceill(sqrtl((long double)maxd2) / 10) * 10);
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX