oj.uz

Submission #283658

# Submission time Handle Problem Language Result Execution time Memory
283658 2020-08-26T04:51:13 Z rama_pang Golf (JOI17_golf) C++14
30 / 100
 10000 ms 28808 KB 
#include <bits/stdc++.h>
using namespace std;

class Boundary {
 public:
  
};

void Read(int &S, int &T, int &U, int &V, int &N, 
          vector<int> &A, vector<int> &B, 
          vector<int> &C, vector<int> &D) {

  cin >> S >> T >> U >> V >> N;
  A.resize(N), B.resize(N), C.resize(N), D.resize(N);

  vector<int> xcoord = {S, U};
  vector<int> ycoord = {T, V};
  for (int i = 0; i < N; i++) {
    cin >> A[i] >> B[i] >> C[i] >> D[i];
    xcoord.emplace_back(A[i]);
    xcoord.emplace_back(B[i]);
    ycoord.emplace_back(C[i]);
    ycoord.emplace_back(D[i]);
  }

  sort(begin(xcoord), end(xcoord));
  sort(begin(ycoord), end(ycoord));
  xcoord.resize(unique(begin(xcoord), end(xcoord)) - begin(xcoord));
  ycoord.resize(unique(begin(ycoord), end(ycoord)) - begin(ycoord));

  const auto GetPosition = [&](const vector<int> &a, int x) {
    return lower_bound(begin(a), end(a), x) - begin(a);
  };

  S = GetPosition(xcoord, S);
  T = GetPosition(ycoord, T);
  U = GetPosition(xcoord, U);
  V = GetPosition(ycoord, V);

  for (int i = 0; i < N; i++) {
    A[i] = GetPosition(xcoord, A[i]);
    B[i] = GetPosition(xcoord, B[i]);
    C[i] = GetPosition(ycoord, C[i]);
    D[i] = GetPosition(ycoord, D[i]);
  }
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);

  int S, T, U, V, N;
  vector<int> A, B, C, D;
  Read(S, T, U, V, N, A, B, C, D);

  vector<array<int, 4>> walls; // (type 0 = vertical, 1 = horizontal)
  vector<array<int, 5>> lines; // (type 0 = vertical, 1 = horizontal)
  for (int i = 0; i < N; i++) {
    walls.push_back({A[i], C[i], D[i], 0});
    walls.push_back({B[i], C[i], D[i], 0});
    walls.push_back({C[i], A[i], B[i], 1});
    walls.push_back({D[i], A[i], B[i], 1});
    
    lines.push_back({A[i], C[i], D[i], 0, i * 4 + 0});
    lines.push_back({B[i], C[i], D[i], 0, i * 4 + 1});
    lines.push_back({C[i], A[i], B[i], 1, i * 4 + 2});
    lines.push_back({D[i], A[i], B[i], 1, i * 4 + 3});
  }
  lines.push_back({S, T, T, 0, N * 4 + 0});
  lines.push_back({T, S, S, 1, N * 4 + 0});
  lines.push_back({U, V, V, 0, N * 4 + 1});
  lines.push_back({V, U, U, 1, N * 4 + 1});

  vector<vector<int>> adj(4 * N + 6);
  auto AddEdge = [&](int u, int v) {
    adj[u].emplace_back(v);
  };

  for (auto &l : lines) {
    int lft = 0, rgt = 2 * N + 2;
    for (const auto &w : walls) {
      if (l[3] != w[3] && w[1] < l[0] && l[0] < w[2]) {
        if (w[0] < l[1]) {
          lft = max(lft, w[0]);
        }
        if (l[2] < w[0]) {
          rgt = min(rgt, w[0]);
        }
      }
    }
    l[1] = lft, l[2] = rgt;
  }

  for (int i = 0; i < (int) lines.size(); i++) {
    for (int j = i + 1; j < (int) lines.size(); j++) if (i != j) {
      if (lines[i][3] != lines[j][3]) {
        bool c1 = lines[i][1] <= lines[j][0] && lines[j][0] <= lines[i][2];
        bool c2 = lines[j][1] <= lines[i][0] && lines[i][0] <= lines[j][2];
        if (c1 && c2) {
          AddEdge(i, j);
          AddEdge(j, i);
        }
      }
    }
  }

  const int SRC = N * 4 + 4;
  const int TGT = N * 4 + 5;

  for (int i = 0; i < (int) lines.size(); i++) {
    if (lines[i][3] == 0) { // vertical
      if (lines[i][0] == S && lines[i][1] <= T && T <= lines[i][2]) {
        AddEdge(SRC, i);
      }
      if (lines[i][0] == U && lines[i][1] <= V && V <= lines[i][2]) {
        AddEdge(i, TGT);
      }
    } else { // horizontal
      if (lines[i][0] == T && lines[i][1] <= S && S <= lines[i][2]) {
        AddEdge(SRC, i);
      }
      if (lines[i][0] == V && lines[i][1] <= U && U <= lines[i][2]) {
        AddEdge(i, TGT);
      }
    }
  }

  queue<int> q;
  vector<int> dist(4 * N + 6, -1);
  q.emplace(SRC);
  dist[SRC] = 0;
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (auto v : adj[u]) {
      if (dist[v] == -1) {
        dist[v] = dist[u] + 1;
        q.emplace(v);
      }
    }
  }
  cout << dist[TGT] - 1 << "\n";
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 73 ms 1272 KB Output is correct
6 Correct 77 ms 1356 KB Output is correct
7 Correct 71 ms 1144 KB Output is correct
8 Correct 72 ms 1144 KB Output is correct
9 Correct 74 ms 1144 KB Output is correct
10 Correct 79 ms 1188 KB Output is correct
11 Correct 72 ms 1144 KB Output is correct
12 Correct 73 ms 1272 KB Output is correct
13 Correct 72 ms 1144 KB Output is correct
14 Correct 79 ms 1144 KB Output is correct
15 Correct 10 ms 512 KB Output is correct
16 Correct 32 ms 768 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 73 ms 1272 KB Output is correct
6 Correct 77 ms 1356 KB Output is correct
7 Correct 71 ms 1144 KB Output is correct
8 Correct 72 ms 1144 KB Output is correct
9 Correct 74 ms 1144 KB Output is correct
10 Correct 79 ms 1188 KB Output is correct
11 Correct 72 ms 1144 KB Output is correct
12 Correct 73 ms 1272 KB Output is correct
13 Correct 72 ms 1144 KB Output is correct
14 Correct 79 ms 1144 KB Output is correct
15 Correct 10 ms 512 KB Output is correct
16 Correct 32 ms 768 KB Output is correct
17 Correct 86 ms 1176 KB Output is correct
18 Correct 70 ms 1148 KB Output is correct
19 Correct 70 ms 1016 KB Output is correct
20 Correct 74 ms 1144 KB Output is correct
21 Correct 75 ms 1144 KB Output is correct
22 Correct 74 ms 1144 KB Output is correct
23 Correct 74 ms 1216 KB Output is correct
24 Correct 77 ms 1016 KB Output is correct
25 Correct 72 ms 1144 KB Output is correct
26 Correct 75 ms 1148 KB Output is correct
27 Correct 13 ms 640 KB Output is correct
28 Correct 39 ms 888 KB Output is correct
29 Correct 39 ms 888 KB Output is correct

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 73 ms 1272 KB Output is correct
6 Correct 77 ms 1356 KB Output is correct
7 Correct 71 ms 1144 KB Output is correct
8 Correct 72 ms 1144 KB Output is correct
9 Correct 74 ms 1144 KB Output is correct
10 Correct 79 ms 1188 KB Output is correct
11 Correct 72 ms 1144 KB Output is correct
12 Correct 73 ms 1272 KB Output is correct
13 Correct 72 ms 1144 KB Output is correct
14 Correct 79 ms 1144 KB Output is correct
15 Correct 10 ms 512 KB Output is correct
16 Correct 32 ms 768 KB Output is correct
17 Correct 86 ms 1176 KB Output is correct
18 Correct 70 ms 1148 KB Output is correct
19 Correct 70 ms 1016 KB Output is correct
20 Correct 74 ms 1144 KB Output is correct
21 Correct 75 ms 1144 KB Output is correct
22 Correct 74 ms 1144 KB Output is correct
23 Correct 74 ms 1216 KB Output is correct
24 Correct 77 ms 1016 KB Output is correct
25 Correct 72 ms 1144 KB Output is correct
26 Correct 75 ms 1148 KB Output is correct
27 Correct 13 ms 640 KB Output is correct
28 Correct 39 ms 888 KB Output is correct
29 Correct 39 ms 888 KB Output is correct
30 Execution timed out 10023 ms 28808 KB Time limit exceeded
31 Halted 0 ms 0 KB -