oj.uz

답안 #651517

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
651517 2022-10-19T07:22:01 Z lunchbox Soccer (JOI17_soccer) C++17
100 / 100
 457 ms 19044 KB 
/*
author: lunchbox
problem link: https://oj.uz/problem/submit/JOI17_soccer
*/
#include <bits/stdc++.h>
using namespace std;

#define sz(v) static_cast<int>((v).size())
#define long long long

template<class T>
using min_pq = priority_queue<T, vector<T>, greater<T>>;

#ifdef LOCAL
  #define dbg(...) printf("\033[1;34m% 4d \033[32m|\033[0m ", __LINE__), printf(__VA_ARGS__)
#else
  #define dbg(...) 0
#endif

const int N = 501, K = 100000;
const long INF = 0x3f3f3f3f3f3f3f3f;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  static int xx[K], yy[K], cc[N][N];
  static long dd[N][N][5];
  min_pq<tuple<long, int, int, int>> pq;
  queue<pair<int, int>> qu;
  int n, m, k, a, b, c;
  long ans;

  auto ad_qu = [&](int x, int y, int d) {
    if (x >= 0 && x < n && y >= 0 && y < m && cc[x][y] == -1) {
      cc[x][y] = d;
      qu.push({x, y});
    }
  };
  auto ad_pq = [&](int x, int y, int t, long d) {
    if (x >= 0 && x < n && y >= 0 && y < m && dd[x][y][t] > d) {
      dd[x][y][t] = d;
      pq.push({d, x, y, t});
    }
  };

  cin >> n >> m, n++, m++;
  cin >> a >> b >> c;
  cin >> k;
  for (int i = 0; i < k; i++)
    cin >> xx[i] >> yy[i];
  for (int i = 0; i < n; i++)
    fill(cc[i], cc[i] + m, -1);
  for (int i = 0; i < k - 1; i++)
    ad_qu(xx[i], yy[i], 0);
  while (!qu.empty()) {
    auto [x, y] = qu.front();

    qu.pop();
    ad_qu(x + 1, y, cc[x][y] + 1);
    ad_qu(x - 1, y, cc[x][y] + 1);
    ad_qu(x, y + 1, cc[x][y] + 1);
    ad_qu(x, y - 1, cc[x][y] + 1);
  }
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      fill(dd[i][j], dd[i][j] + 5, INF);
  ad_pq(xx[0], yy[0], 0, 0);
  while (!pq.empty()) {
    auto [d, x, y, t] = pq.top();

    pq.pop();
    if (dd[x][y][t] != d)
      continue;
    if (t == 0) {
      ad_pq(x, y, 1, d + b);
      ad_pq(x, y, 2, d + b);
      ad_pq(x, y, 3, d + b);
      ad_pq(x, y, 4, d + b);
      ad_pq(x - 1, y, 0, d + c);
      ad_pq(x + 1, y, 0, d + c);
      ad_pq(x, y + 1, 0, d + c);
      ad_pq(x, y - 1, 0, d + c);
    } else {
      ad_pq(x, y, 0, d + (long) c * cc[x][y]);
      if (t == 1)
        ad_pq(x + 1, y, 1, d + a);
      else if (t == 2)
        ad_pq(x - 1, y, 2, d + a);
      else if (t == 3)
        ad_pq(x, y + 1, 3, d + a);
      else
        ad_pq(x, y - 1, 4, d + a);
    }
  }
  ans = INF;
  for (int i = 0; i <= 4; i++)
    ans = min(ans, dd[xx[k - 1]][yy[k - 1]][i]);
  printf("%lld\n", ans);
  return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 6092 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 278 ms 17464 KB Output is correct
4 Correct 257 ms 17340 KB Output is correct
5 Correct 74 ms 6128 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 346 ms 17424 KB Output is correct
2 Correct 342 ms 17408 KB Output is correct
3 Correct 272 ms 15228 KB Output is correct
4 Correct 235 ms 17368 KB Output is correct
5 Correct 251 ms 17472 KB Output is correct
6 Correct 282 ms 17396 KB Output is correct
7 Correct 361 ms 17516 KB Output is correct
8 Correct 314 ms 17488 KB Output is correct
9 Correct 333 ms 17564 KB Output is correct
10 Correct 53 ms 6576 KB Output is correct
11 Correct 325 ms 17460 KB Output is correct
12 Correct 321 ms 17388 KB Output is correct
13 Correct 204 ms 15304 KB Output is correct
14 Correct 338 ms 17664 KB Output is correct
15 Correct 278 ms 17508 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 6092 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 278 ms 17464 KB Output is correct
4 Correct 257 ms 17340 KB Output is correct
5 Correct 74 ms 6128 KB Output is correct
6 Correct 346 ms 17424 KB Output is correct
7 Correct 342 ms 17408 KB Output is correct
8 Correct 272 ms 15228 KB Output is correct
9 Correct 235 ms 17368 KB Output is correct
10 Correct 251 ms 17472 KB Output is correct
11 Correct 282 ms 17396 KB Output is correct
12 Correct 361 ms 17516 KB Output is correct
13 Correct 314 ms 17488 KB Output is correct
14 Correct 333 ms 17564 KB Output is correct
15 Correct 53 ms 6576 KB Output is correct
16 Correct 325 ms 17460 KB Output is correct
17 Correct 321 ms 17388 KB Output is correct
18 Correct 204 ms 15304 KB Output is correct
19 Correct 338 ms 17664 KB Output is correct
20 Correct 278 ms 17508 KB Output is correct
21 Correct 93 ms 6172 KB Output is correct
22 Correct 457 ms 17352 KB Output is correct
23 Correct 432 ms 13268 KB Output is correct
24 Correct 451 ms 14468 KB Output is correct
25 Correct 360 ms 17372 KB Output is correct
26 Correct 442 ms 17672 KB Output is correct
27 Correct 251 ms 13180 KB Output is correct
28 Correct 266 ms 13764 KB Output is correct
29 Correct 336 ms 16208 KB Output is correct
30 Correct 212 ms 13280 KB Output is correct
31 Correct 368 ms 17584 KB Output is correct
32 Correct 412 ms 19044 KB Output is correct
33 Correct 290 ms 17364 KB Output is correct
34 Correct 421 ms 17532 KB Output is correct
35 Correct 220 ms 13132 KB Output is correct