Submission #103256

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
103256	2019-03-29 11:18:21	wxh010910	Ideal city (IOI12_city)	C++17	32 / 100	17 ms	2936 KiB

city

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 <bits/stdc++.h>
using namespace std;
struct point {
  int x, y, id;
  point(int x = 0, int y = 0, int id = 0): x(x), y(y), id(id) {
  }
};
int DistanceSum(int N, int* X, int* Y) {
  vector<point> p(N);
  for (int i = 0; i < N; ++i) {
    p[i] = point(X[i], Y[i], i);
  }
  sort(p.begin(), p.end(), [&](const point &a, const point &b) {
    return a.x < b.x || (a.x == b.x && a.y < b.y);
  });
  vector<int> to_down(N);
  vector<int> down(N, -1);
  for (int i = 0; i < N; ++i) {
    if (i && p[i].x == p[i - 1].x && p[i].y == p[i - 1].y + 1) {
      to_down[p[i].id] = to_down[p[i - 1].id];
      down[p[i].id] = p[i - 1].id;
    } else {
      to_down[p[i].id] = p[i].id;
    }
  }
  sort(p.begin(), p.end(), [&](const point &a, const point &b) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 21 / 21
• Subtask 3: 0 / 23
• Subtask 4: 0 / 45