oj.uz

Submission #654297

# Submission time Handle Problem Language Result Execution time Memory
654297 2022-10-30T22:19:34 Z lunchbox1 Soccer (JOI17_soccer) C++17
100 / 100
 437 ms 19068 KB 
/*
 Soccer
 https://oj.uz/problem/view/JOI17_soccer
*/
#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
 
template<class T>
using min_pq = priority_queue<T, vector<T>, greater<T>>;
 
const int N = 501, K = 100000;
const LL INF = 0x3f3f3f3f3f3f3f3f;
 
int main() {
 ios::sync_with_stdio(false);
 cin.tie(NULL);
 static int xx[K], yy[K], cc[N][N];
 static LL dd[N][N][5];
 min_pq<tuple<LL, int, int, int>> pq;
 queue<pair<int, int>> qu;
 int n, m, k, a, b, c;
 LL 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, LL 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 + (LL) 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

# Verdict Execution time Memory Grader output
1 Correct 65 ms 6176 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 258 ms 17416 KB Output is correct
4 Correct 260 ms 17496 KB Output is correct
5 Correct 69 ms 6132 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 347 ms 17412 KB Output is correct
2 Correct 331 ms 17452 KB Output is correct
3 Correct 245 ms 15320 KB Output is correct
4 Correct 228 ms 17428 KB Output is correct
5 Correct 249 ms 17384 KB Output is correct
6 Correct 257 ms 17392 KB Output is correct
7 Correct 322 ms 17580 KB Output is correct
8 Correct 295 ms 17476 KB Output is correct
9 Correct 335 ms 17496 KB Output is correct
10 Correct 49 ms 6580 KB Output is correct
11 Correct 324 ms 17508 KB Output is correct
12 Correct 310 ms 17420 KB Output is correct
13 Correct 203 ms 15216 KB Output is correct
14 Correct 343 ms 17528 KB Output is correct
15 Correct 246 ms 17516 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 6176 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 258 ms 17416 KB Output is correct
4 Correct 260 ms 17496 KB Output is correct
5 Correct 69 ms 6132 KB Output is correct
6 Correct 347 ms 17412 KB Output is correct
7 Correct 331 ms 17452 KB Output is correct
8 Correct 245 ms 15320 KB Output is correct
9 Correct 228 ms 17428 KB Output is correct
10 Correct 249 ms 17384 KB Output is correct
11 Correct 257 ms 17392 KB Output is correct
12 Correct 322 ms 17580 KB Output is correct
13 Correct 295 ms 17476 KB Output is correct
14 Correct 335 ms 17496 KB Output is correct
15 Correct 49 ms 6580 KB Output is correct
16 Correct 324 ms 17508 KB Output is correct
17 Correct 310 ms 17420 KB Output is correct
18 Correct 203 ms 15216 KB Output is correct
19 Correct 343 ms 17528 KB Output is correct
20 Correct 246 ms 17516 KB Output is correct
21 Correct 78 ms 6172 KB Output is correct
22 Correct 407 ms 17456 KB Output is correct
23 Correct 346 ms 13272 KB Output is correct
24 Correct 433 ms 14460 KB Output is correct
25 Correct 323 ms 17608 KB Output is correct
26 Correct 377 ms 17696 KB Output is correct
27 Correct 233 ms 13156 KB Output is correct
28 Correct 244 ms 13752 KB Output is correct
29 Correct 341 ms 16116 KB Output is correct
30 Correct 196 ms 13268 KB Output is correct
31 Correct 341 ms 17596 KB Output is correct
32 Correct 429 ms 19068 KB Output is correct
33 Correct 272 ms 17416 KB Output is correct
34 Correct 437 ms 17568 KB Output is correct
35 Correct 185 ms 12988 KB Output is correct