oj.uz

Submission #1078506

# Submission time Handle Problem Language Result Execution time Memory
1078506 2024-08-27T18:59:59 Z aykhn Closing Time (IOI23_closing) C++17
35 / 100
 1000 ms 270556 KB 
#include <bits/stdc++.h>
#include "closing.h"
 
using namespace std;

#define int long long
 
struct BIT
{
  int n;
  vector<long long> ft;
  void init(int N)
  {
    n = N + 5;
    ft.assign(n + 5, 0);
  }
  void add(int pos, long long val)
  {
    for (pos = pos + 1; pos <= n; pos += pos & -pos) ft[pos] += val;
  }
  long long get(int pos, long long res = 0)
  {
    for (pos = pos + 1; pos > 0; pos -= pos & -pos) res += ft[pos];
    return res;
  }
};
 
const int MXN = 2e5 + 5;
 
int n, x, y;
long long k;
vector<array<long long, 2>> adj[MXN];
long long d[2][MXN], p[3][MXN];
vector<int> pt, PT;
int IN[MXN];

void dfs(int a, int p, int t)
{
  PT.push_back(a);
  if (a != p && a == y) pt = PT;
  for (const array<long long, 2> &v : adj[a])
  {
    if (v[0] == p) continue;
    d[t][v[0]] = d[t][a] + v[1];
    dfs(v[0], a, t);
  }
  PT.pop_back();
}
void getcomp(int a, int p, vector<int> &comp)
{
  for (array<long long, 2> &v : adj[a])
  {
    if (v[0] == p || IN[v[0]]) continue;
    getcomp(v[0], a, comp);
  }
  comp.push_back(a);
}
#undef int long long
int max_score(int N, int X, int Y, long long K, vector<int> U, vector<int> V, vector<int> W)
{
  #define int long long
  n = N, x = X, y = Y, k = K;
  for (int i = 0; i < n; i++)
  {
    d[0][i] = d[1][i] = 0;
    adj[i].clear();
    IN[i] = 0;
  }
  for (int i = 0; i < n - 1; i++)
  {
    adj[U[i]].push_back({V[i], W[i]});
    adj[V[i]].push_back({U[i], W[i]});
  }
  dfs(x, x, 0);
  dfs(y, y, 1);
  int ans = 0;
  {
    vector<long long> v;
    for (int i = 0; i < n; i++) v.push_back(min(d[0][i], d[1][i]));
    sort(v.begin(), v.end());
    long long k1 = k;
    for (int i = 0; i < n; i++)
    {
      k1 -= v[i];
      if (k1 < 0) break;
      ans++;
    }
  }
  vector<int> cc[n];
  for (int i = 0; i < pt.size(); i++) 
  {
    IN[pt[i]] = 1;
    getcomp(pt[i], pt[i], cc[pt[i]]);
    cc[i].pop_back();
  }
  vector<array<int, 2>> v[2];
  for (int i = 0; i < n; i++)
  {
    v[1].push_back({max(d[0][i], d[1][i]), i});
    if (IN[i]) continue;
    v[0].push_back({min(d[0][i], d[1][i]), i});
  }
  sort(v[0].begin(), v[0].end());
  sort(v[1].begin(), v[1].end());
  vector<int> vv = pt;
  for (int take = 0; take < n; take++)
  {
    vector<int> in(n, 0);
    int cc = 0, res = 0;
    for (int i = 0; i <= take; i++) cc += v[1][i][0], in[v[1][i][1]] = 1, res += 2;
    if (cc > k) continue;
    for (int &i : pt) 
    {
      if (!in[i]) res++, cc += min(d[0][i], d[1][i]);
    }
    if (cc > k) continue;
    for (array<int, 2> &val : v[0])
    {
      if (in[val[1]]) continue;
      cc += val[0];
      if (cc > k) break;
      res++;
    }
    ans = max(ans, res);
  }
  return ans;
  #undef int
}

Compilation message

closing.cpp:58:12: warning: extra tokens at end of #undef directive
   58 | #undef int long long
      |            ^~~~
closing.cpp: In function 'int max_score(int, int, int, long long int, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:90:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |   for (int i = 0; i < pt.size(); i++)
      |                   ~~^~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct

Subtask #1
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1029 ms 270556 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 2 ms 4952 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 3 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 5212 KB Output is correct
17 Correct 2 ms 5212 KB Output is correct
18 Correct 3 ms 4956 KB Output is correct
19 Correct 3 ms 5212 KB Output is correct
20 Correct 3 ms 5212 KB Output is correct
21 Correct 4 ms 5924 KB Output is correct
22 Correct 5 ms 5976 KB Output is correct
23 Correct 5 ms 6492 KB Output is correct
24 Correct 5 ms 6492 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 2 ms 4952 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 3 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 5212 KB Output is correct
17 Correct 2 ms 5212 KB Output is correct
18 Correct 3 ms 4956 KB Output is correct
19 Correct 3 ms 5212 KB Output is correct
20 Correct 3 ms 5212 KB Output is correct
21 Correct 4 ms 5924 KB Output is correct
22 Correct 5 ms 5976 KB Output is correct
23 Correct 5 ms 6492 KB Output is correct
24 Correct 5 ms 6492 KB Output is correct
25 Correct 4 ms 5212 KB Output is correct
26 Correct 13 ms 5724 KB Output is correct
27 Correct 7 ms 5724 KB Output is correct
28 Correct 73 ms 43840 KB Output is correct
29 Correct 57 ms 31956 KB Output is correct
30 Correct 15 ms 10028 KB Output is correct
31 Correct 86 ms 49356 KB Output is correct
32 Correct 87 ms 49236 KB Output is correct

Subtask #5
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 4952 KB Output is correct
6 Correct 2 ms 4952 KB Output is correct
7 Runtime error 6 ms 10076 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 4952 KB Output is correct
6 Correct 2 ms 4952 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 3 ms 4956 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 2 ms 5212 KB Output is correct
18 Correct 2 ms 5212 KB Output is correct
19 Runtime error 6 ms 10076 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 4952 KB Output is correct
6 Correct 2 ms 4952 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 3 ms 4956 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 2 ms 5212 KB Output is correct
18 Correct 2 ms 5212 KB Output is correct
19 Correct 3 ms 4956 KB Output is correct
20 Correct 3 ms 5212 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 4 ms 5924 KB Output is correct
23 Correct 5 ms 5976 KB Output is correct
24 Correct 5 ms 6492 KB Output is correct
25 Correct 5 ms 6492 KB Output is correct
26 Runtime error 6 ms 10076 KB Execution killed with signal 11
27 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 4952 KB Output is correct
6 Correct 2 ms 4952 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 3 ms 4956 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 2 ms 5212 KB Output is correct
18 Correct 2 ms 5212 KB Output is correct
19 Correct 3 ms 4956 KB Output is correct
20 Correct 3 ms 5212 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 4 ms 5924 KB Output is correct
23 Correct 5 ms 5976 KB Output is correct
24 Correct 5 ms 6492 KB Output is correct
25 Correct 5 ms 6492 KB Output is correct
26 Correct 4 ms 5212 KB Output is correct
27 Correct 13 ms 5724 KB Output is correct
28 Correct 7 ms 5724 KB Output is correct
29 Correct 73 ms 43840 KB Output is correct
30 Correct 57 ms 31956 KB Output is correct
31 Correct 15 ms 10028 KB Output is correct
32 Correct 86 ms 49356 KB Output is correct
33 Correct 87 ms 49236 KB Output is correct
34 Runtime error 6 ms 10076 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 4952 KB Output is correct
6 Correct 2 ms 4952 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 3 ms 4956 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 2 ms 5212 KB Output is correct
18 Correct 2 ms 5212 KB Output is correct
19 Correct 3 ms 4956 KB Output is correct
20 Correct 3 ms 5212 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 4 ms 5924 KB Output is correct
23 Correct 5 ms 5976 KB Output is correct
24 Correct 5 ms 6492 KB Output is correct
25 Correct 5 ms 6492 KB Output is correct
26 Correct 4 ms 5212 KB Output is correct
27 Correct 13 ms 5724 KB Output is correct
28 Correct 7 ms 5724 KB Output is correct
29 Correct 73 ms 43840 KB Output is correct
30 Correct 57 ms 31956 KB Output is correct
31 Correct 15 ms 10028 KB Output is correct
32 Correct 86 ms 49356 KB Output is correct
33 Correct 87 ms 49236 KB Output is correct
34 Runtime error 6 ms 10076 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -