oj.uz

Submission #842653

# Submission time Handle Problem Language Result Execution time Memory
842653 2023-09-03T07:34:15 Z flashmt Closing Time (IOI23_closing) C++17
59 / 100
 1000 ms 28040 KB 
#include "closing.h"
#ifdef LOCAL
#include "Debug.h"
#else
#define debug(...) 42
#endif
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const long long oo = (1LL << 62) - 10;

int n;
vector<pair<int, int>> a[N];
vector<int> idPath, idTree, trees[N];

vector<long long> bfs(int s)
{
  vector<long long> dist(n, -1);
  queue<int> q;
  dist[s] = 0;
  q.push(s);
  while (!empty(q))
  {
    int x = q.front();
    q.pop();
    for (auto [y, w] : a[x])
      if (dist[y] < 0)
      {
        dist[y] = dist[x] + w;
        q.push(y);
      }
  }
  return dist;
}

int findPath(int x, int goal, int par, vector<int> &path)
{
  path.push_back(x);
  if (x == goal)
    return 1;
  for (auto [y, _] : a[x])
    if (y != par)
    {
      if (findPath(y, goal, x, path))
        return 1;
    }
  path.pop_back();
  return 0;
}

void dfs(int x)
{
  trees[idTree[x]].push_back(x);
  for (auto [y, _] : a[x])
    if (idTree[y] < 0)
    {
      idTree[y] = idTree[x];
      dfs(y);
    }
}

int max_score(int N, int A, int B, long long budget, vector<int> U, vector<int> V, vector<int> W)
{
  n = N;
  for (int i = 0; i < n; i++)
    a[i].clear();
  for (int i = 0; i < size(U); i++)
  {
    a[U[i]].push_back({V[i], W[i]});
    a[V[i]].push_back({U[i], W[i]});
  }

  auto distA = bfs(A);
  auto distB = bfs(B);
  auto distAB = distA[B];

  if (distAB > budget * 2)
  {
    vector<long long> allDists = distA;
    for (auto d : distB)
      allDists.push_back(d);
    sort(begin(allDists), end(allDists));
    int ans = 0;
    for (auto d : allDists)
      if (d <= budget)
      {
        ans++;
        budget -= d;
      }
    return ans;
  }

  // O(n^3)
  vector<int> path;
  findPath(A, B, -1, path);
  idPath.assign(n, -1);
  idTree.assign(n, -1);
  int len = size(path);
  for (int i = 0; i < len; i++)
  {
    idPath[path[i]] = idTree[path[i]] = i;
    trees[i].clear();
  }
  for (int x : path)
    dfs(x);

  int ans = 0;
  for (int l = 0; l < len; l++)
  {
    vector<long long> f(n * 2 + 1, oo);
    f[0] = 0;
    int cnt = 0;
    for (int r = len - 1; r >= 0; r--)
    {
      long long curCost = 0;
      int curAns = 0;

      vector<long long> c1;
      for (int i = 0; i < n; i++)
      {
        if (idTree[i] > l && idTree[i] < r)
          continue;

        if (idTree[i] < r) // A
        {
          if (idPath[i] < 0) c1.push_back(distA[i]);
          else curCost += distA[i], curAns++;
        }
        else if (idTree[i] > l) // B
        {
          if (idPath[i] < 0) c1.push_back(distB[i]);
          else curCost += distB[i], curAns++;
        }
        else // AB
        {
          if (idPath[i] >= 0)
            curCost += max(distA[i], distB[i]), curAns += 2;
        }
      }

      if (curCost > budget)
        break;

      long long rem = budget - curCost;

      // add new tree to f
      if (r <= l)
      {
        for (int x : trees[r])
          if (idPath[x] < 0)
          {
            auto minDist = min(distA[x], distB[x]);
            auto maxDist = max(distA[x], distB[x]);
            for (int i = cnt; i >= 0; i--)
            {
              f[i + 1] = min(f[i + 1], f[i] + minDist);
              f[i + 2] = min(f[i + 2], f[i] + maxDist);
            }
            cnt += 2;
          }
      }

      sort(begin(c1), end(c1));
      vector<long long> costFor(size(c1) + 1);
      for (int i = 0; i < size(c1); i++)
        costFor[i + 1] = costFor[i] + c1[i];

      for (int i = 0; i <= cnt; i++)
        if (f[i] > rem) break;
        else
        {
          int u = upper_bound(begin(costFor), end(costFor), rem - f[i]) - begin(costFor);
          ans = max(ans, curAns + i + u - 1);
        }
    }
  }

  return ans;
}

Compilation message

closing.cpp: In function 'int max_score(int, int, int, long long int, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:67:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |   for (int i = 0; i < size(U); i++)
      |                   ~~^~~~~~~~~
closing.cpp:165:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  165 |       for (int i = 0; i < size(c1); i++)
      |                       ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9820 KB Output is correct

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 28040 KB Output is correct
2 Correct 109 ms 27732 KB Output is correct
3 Correct 66 ms 12316 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9820 KB Output is correct
2 Correct 2 ms 9820 KB Output is correct
3 Correct 2 ms 9820 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 2 ms 9820 KB Output is correct
6 Correct 3 ms 9820 KB Output is correct
7 Correct 3 ms 9820 KB Output is correct
8 Correct 3 ms 9820 KB Output is correct
9 Correct 2 ms 9820 KB Output is correct
10 Correct 2 ms 9820 KB Output is correct
11 Correct 2 ms 9820 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9820 KB Output is correct
2 Correct 2 ms 9820 KB Output is correct
3 Correct 2 ms 9820 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 2 ms 9820 KB Output is correct
6 Correct 3 ms 9820 KB Output is correct
7 Correct 3 ms 9820 KB Output is correct
8 Correct 3 ms 9820 KB Output is correct
9 Correct 2 ms 9820 KB Output is correct
10 Correct 2 ms 9820 KB Output is correct
11 Correct 2 ms 9820 KB Output is correct
12 Correct 2 ms 9820 KB Output is correct
13 Correct 2 ms 9604 KB Output is correct
14 Correct 4 ms 9820 KB Output is correct
15 Correct 2 ms 9820 KB Output is correct
16 Correct 3 ms 9820 KB Output is correct
17 Correct 3 ms 9820 KB Output is correct
18 Correct 3 ms 9820 KB Output is correct
19 Correct 3 ms 9820 KB Output is correct
20 Correct 3 ms 9820 KB Output is correct
21 Correct 292 ms 9880 KB Output is correct
22 Correct 3 ms 9816 KB Output is correct
23 Correct 53 ms 9892 KB Output is correct
24 Correct 50 ms 9820 KB Output is correct

Subtask #4
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9820 KB Output is correct
2 Correct 2 ms 9820 KB Output is correct
3 Correct 2 ms 9820 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 2 ms 9820 KB Output is correct
6 Correct 3 ms 9820 KB Output is correct
7 Correct 3 ms 9820 KB Output is correct
8 Correct 3 ms 9820 KB Output is correct
9 Correct 2 ms 9820 KB Output is correct
10 Correct 2 ms 9820 KB Output is correct
11 Correct 2 ms 9820 KB Output is correct
12 Correct 2 ms 9820 KB Output is correct
13 Correct 2 ms 9604 KB Output is correct
14 Correct 4 ms 9820 KB Output is correct
15 Correct 2 ms 9820 KB Output is correct
16 Correct 3 ms 9820 KB Output is correct
17 Correct 3 ms 9820 KB Output is correct
18 Correct 3 ms 9820 KB Output is correct
19 Correct 3 ms 9820 KB Output is correct
20 Correct 3 ms 9820 KB Output is correct
21 Correct 292 ms 9880 KB Output is correct
22 Correct 3 ms 9816 KB Output is correct
23 Correct 53 ms 9892 KB Output is correct
24 Correct 50 ms 9820 KB Output is correct
25 Correct 12 ms 9820 KB Output is correct
26 Correct 28 ms 10324 KB Output is correct
27 Correct 19 ms 10076 KB Output is correct
28 Execution timed out 1061 ms 10332 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9820 KB Output is correct
2 Correct 2 ms 9820 KB Output is correct
3 Correct 2 ms 9820 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 2 ms 9820 KB Output is correct
6 Correct 2 ms 9820 KB Output is correct
7 Correct 2 ms 9820 KB Output is correct
8 Correct 2 ms 9820 KB Output is correct
9 Correct 2 ms 9820 KB Output is correct
10 Correct 2 ms 9820 KB Output is correct
11 Correct 3 ms 9820 KB Output is correct
12 Correct 2 ms 9820 KB Output is correct
13 Correct 3 ms 9820 KB Output is correct
14 Correct 2 ms 9820 KB Output is correct
15 Correct 3 ms 9972 KB Output is correct
16 Correct 2 ms 9828 KB Output is correct
17 Correct 2 ms 9648 KB Output is correct
18 Correct 2 ms 9820 KB Output is correct
19 Correct 2 ms 9816 KB Output is correct
20 Correct 2 ms 9820 KB Output is correct
21 Correct 2 ms 9820 KB Output is correct
22 Correct 2 ms 9820 KB Output is correct
23 Correct 2 ms 9820 KB Output is correct
24 Correct 2 ms 9820 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9820 KB Output is correct
2 Correct 2 ms 9820 KB Output is correct
3 Correct 2 ms 9820 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 2 ms 9820 KB Output is correct
6 Correct 2 ms 9820 KB Output is correct
7 Correct 3 ms 9820 KB Output is correct
8 Correct 3 ms 9820 KB Output is correct
9 Correct 3 ms 9820 KB Output is correct
10 Correct 2 ms 9820 KB Output is correct
11 Correct 2 ms 9820 KB Output is correct
12 Correct 2 ms 9820 KB Output is correct
13 Correct 2 ms 9820 KB Output is correct
14 Correct 2 ms 9604 KB Output is correct
15 Correct 4 ms 9820 KB Output is correct
16 Correct 2 ms 9820 KB Output is correct
17 Correct 3 ms 9820 KB Output is correct
18 Correct 3 ms 9820 KB Output is correct
19 Correct 2 ms 9820 KB Output is correct
20 Correct 2 ms 9820 KB Output is correct
21 Correct 2 ms 9820 KB Output is correct
22 Correct 2 ms 9820 KB Output is correct
23 Correct 3 ms 9820 KB Output is correct
24 Correct 2 ms 9820 KB Output is correct
25 Correct 3 ms 9820 KB Output is correct
26 Correct 2 ms 9820 KB Output is correct
27 Correct 3 ms 9972 KB Output is correct
28 Correct 2 ms 9828 KB Output is correct
29 Correct 2 ms 9648 KB Output is correct
30 Correct 2 ms 9820 KB Output is correct
31 Correct 2 ms 9816 KB Output is correct
32 Correct 2 ms 9820 KB Output is correct
33 Correct 2 ms 9820 KB Output is correct
34 Correct 2 ms 9820 KB Output is correct
35 Correct 2 ms 9820 KB Output is correct
36 Correct 2 ms 9820 KB Output is correct
37 Correct 3 ms 9816 KB Output is correct
38 Correct 2 ms 9820 KB Output is correct
39 Correct 2 ms 9836 KB Output is correct
40 Correct 2 ms 9820 KB Output is correct
41 Correct 2 ms 9820 KB Output is correct
42 Correct 2 ms 9820 KB Output is correct
43 Correct 4 ms 9644 KB Output is correct
44 Correct 3 ms 9816 KB Output is correct
45 Correct 2 ms 9820 KB Output is correct
46 Correct 3 ms 9820 KB Output is correct
47 Correct 3 ms 9820 KB Output is correct
48 Correct 2 ms 9820 KB Output is correct
49 Correct 2 ms 9812 KB Output is correct
50 Correct 2 ms 9816 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9820 KB Output is correct
2 Correct 2 ms 9820 KB Output is correct
3 Correct 2 ms 9820 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 2 ms 9820 KB Output is correct
6 Correct 2 ms 9820 KB Output is correct
7 Correct 3 ms 9820 KB Output is correct
8 Correct 3 ms 9820 KB Output is correct
9 Correct 3 ms 9820 KB Output is correct
10 Correct 2 ms 9820 KB Output is correct
11 Correct 2 ms 9820 KB Output is correct
12 Correct 2 ms 9820 KB Output is correct
13 Correct 2 ms 9820 KB Output is correct
14 Correct 2 ms 9604 KB Output is correct
15 Correct 4 ms 9820 KB Output is correct
16 Correct 2 ms 9820 KB Output is correct
17 Correct 3 ms 9820 KB Output is correct
18 Correct 3 ms 9820 KB Output is correct
19 Correct 3 ms 9820 KB Output is correct
20 Correct 3 ms 9820 KB Output is correct
21 Correct 3 ms 9820 KB Output is correct
22 Correct 292 ms 9880 KB Output is correct
23 Correct 3 ms 9816 KB Output is correct
24 Correct 53 ms 9892 KB Output is correct
25 Correct 50 ms 9820 KB Output is correct
26 Correct 2 ms 9820 KB Output is correct
27 Correct 2 ms 9820 KB Output is correct
28 Correct 2 ms 9820 KB Output is correct
29 Correct 2 ms 9820 KB Output is correct
30 Correct 3 ms 9820 KB Output is correct
31 Correct 2 ms 9820 KB Output is correct
32 Correct 3 ms 9820 KB Output is correct
33 Correct 2 ms 9820 KB Output is correct
34 Correct 3 ms 9972 KB Output is correct
35 Correct 2 ms 9828 KB Output is correct
36 Correct 2 ms 9648 KB Output is correct
37 Correct 2 ms 9820 KB Output is correct
38 Correct 2 ms 9816 KB Output is correct
39 Correct 2 ms 9820 KB Output is correct
40 Correct 2 ms 9820 KB Output is correct
41 Correct 2 ms 9820 KB Output is correct
42 Correct 2 ms 9820 KB Output is correct
43 Correct 2 ms 9820 KB Output is correct
44 Correct 3 ms 9816 KB Output is correct
45 Correct 2 ms 9820 KB Output is correct
46 Correct 2 ms 9836 KB Output is correct
47 Correct 2 ms 9820 KB Output is correct
48 Correct 2 ms 9820 KB Output is correct
49 Correct 2 ms 9820 KB Output is correct
50 Correct 4 ms 9644 KB Output is correct
51 Correct 3 ms 9816 KB Output is correct
52 Correct 2 ms 9820 KB Output is correct
53 Correct 3 ms 9820 KB Output is correct
54 Correct 3 ms 9820 KB Output is correct
55 Correct 2 ms 9820 KB Output is correct
56 Correct 2 ms 9812 KB Output is correct
57 Correct 2 ms 9816 KB Output is correct
58 Correct 3 ms 9816 KB Output is correct
59 Correct 3 ms 9820 KB Output is correct
60 Correct 9 ms 9816 KB Output is correct
61 Correct 13 ms 9820 KB Output is correct
62 Correct 13 ms 9856 KB Output is correct
63 Correct 3 ms 9816 KB Output is correct
64 Correct 5 ms 9820 KB Output is correct
65 Correct 26 ms 9912 KB Output is correct
66 Correct 3 ms 9820 KB Output is correct
67 Correct 3 ms 9820 KB Output is correct
68 Correct 45 ms 10076 KB Output is correct
69 Correct 308 ms 9908 KB Output is correct
70 Correct 51 ms 9820 KB Output is correct
71 Correct 31 ms 9820 KB Output is correct
72 Correct 7 ms 9820 KB Output is correct
73 Correct 3 ms 9692 KB Output is correct
74 Correct 3 ms 9648 KB Output is correct
75 Correct 3 ms 9820 KB Output is correct

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9820 KB Output is correct
2 Correct 2 ms 9820 KB Output is correct
3 Correct 2 ms 9820 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 2 ms 9820 KB Output is correct
6 Correct 2 ms 9820 KB Output is correct
7 Correct 3 ms 9820 KB Output is correct
8 Correct 3 ms 9820 KB Output is correct
9 Correct 3 ms 9820 KB Output is correct
10 Correct 2 ms 9820 KB Output is correct
11 Correct 2 ms 9820 KB Output is correct
12 Correct 2 ms 9820 KB Output is correct
13 Correct 2 ms 9820 KB Output is correct
14 Correct 2 ms 9604 KB Output is correct
15 Correct 4 ms 9820 KB Output is correct
16 Correct 2 ms 9820 KB Output is correct
17 Correct 3 ms 9820 KB Output is correct
18 Correct 3 ms 9820 KB Output is correct
19 Correct 3 ms 9820 KB Output is correct
20 Correct 3 ms 9820 KB Output is correct
21 Correct 3 ms 9820 KB Output is correct
22 Correct 292 ms 9880 KB Output is correct
23 Correct 3 ms 9816 KB Output is correct
24 Correct 53 ms 9892 KB Output is correct
25 Correct 50 ms 9820 KB Output is correct
26 Correct 12 ms 9820 KB Output is correct
27 Correct 28 ms 10324 KB Output is correct
28 Correct 19 ms 10076 KB Output is correct
29 Execution timed out 1061 ms 10332 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9820 KB Output is correct
2 Correct 2 ms 9820 KB Output is correct
3 Correct 2 ms 9820 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 2 ms 9820 KB Output is correct
6 Correct 2 ms 9820 KB Output is correct
7 Correct 3 ms 9820 KB Output is correct
8 Correct 3 ms 9820 KB Output is correct
9 Correct 3 ms 9820 KB Output is correct
10 Correct 2 ms 9820 KB Output is correct
11 Correct 2 ms 9820 KB Output is correct
12 Correct 2 ms 9820 KB Output is correct
13 Correct 2 ms 9820 KB Output is correct
14 Correct 2 ms 9604 KB Output is correct
15 Correct 4 ms 9820 KB Output is correct
16 Correct 2 ms 9820 KB Output is correct
17 Correct 3 ms 9820 KB Output is correct
18 Correct 3 ms 9820 KB Output is correct
19 Correct 3 ms 9820 KB Output is correct
20 Correct 3 ms 9820 KB Output is correct
21 Correct 3 ms 9820 KB Output is correct
22 Correct 292 ms 9880 KB Output is correct
23 Correct 3 ms 9816 KB Output is correct
24 Correct 53 ms 9892 KB Output is correct
25 Correct 50 ms 9820 KB Output is correct
26 Correct 12 ms 9820 KB Output is correct
27 Correct 28 ms 10324 KB Output is correct
28 Correct 19 ms 10076 KB Output is correct
29 Execution timed out 1061 ms 10332 KB Time limit exceeded
30 Halted 0 ms 0 KB -