oj.uz

Submission #966549

# Submission time Handle Problem Language Result Execution time Memory
966549 2024-04-20T03:36:00 Z nguyentunglam Overtaking (IOI23_overtaking) C++17
65 / 100
 3500 ms 22608 KB 
#include "overtaking.h"
#include<bits/stdc++.h>
using namespace std;

const int N = 1010;

int n, m;

int order[N], _order[N][N];

long long t[N], w[N], s[N], f[N][N], g[N][N];

void init(int L, int N, std::vector<long long> T, std::vector<int> W, int X, int M, std::vector<int> S) {
  n = N; m = M;
  for(int i = 0; i < n; i++) w[i] = W[i], t[i] = T[i];
  for(int i = 0; i < m; i++) s[i] = S[i];
  w[n] = X;
  for(int i = 0; i < n; i++) order[i] = i;
  for(int i = 0; i < n; i++) f[i][0] = t[i];
  for(int j = 1; j < m; j++) {
    sort(order, order + n, [&] (const int &x, const int &y) {
     if (f[x][j - 1] != f[y][j - 1]) return f[x][j - 1] < f[y][j - 1];
     return w[x] < w[y];
    });
    long long slowest = 0;
    for(int cur = 0; cur < n; cur++) {
      int i = order[cur];
      f[i][j] = max(slowest, f[i][j - 1] + w[i] * (s[j] - s[j - 1]));
      slowest = f[i][j];
    }
  }

  for(int j = 1; j < m; j++) {
    sort(order, order + n, [&] (const int &x, const int &y) {
     if (f[x][j - 1] != f[y][j - 1]) return f[x][j - 1] < f[y][j - 1];
     return w[x] < w[y];
    });
    for(int cur = 0; cur < n; cur++) {
      int i = order[cur];
      g[j][cur] = f[i][j];
      if (cur) g[j][cur] = max(g[j][cur], g[j][cur - 1]);
    }
    for(int i = 0; i < n; i++) _order[i][j] = order[i];
  }
}

long long arrival_time(long long Y) {
  long long pre = Y;
  for(int j = 1; j < m; j++) {
    int l = 0, r = n - 1, last = -1;
    while (l <= r) {
      int mid = l + r >> 1;
      int k = _order[mid][j];
      if (pre > f[k][j - 1]) {
        last = mid;
        l = mid + 1;
      } else r = mid - 1;
    }

    long long nxt = pre + w[n] * (s[j] - s[j - 1]);
    if (last != -1) {
      nxt = max(nxt, g[j][last]);
    }
    pre = nxt;
//    cout << pre << " ";
  }
  return pre;
}

#ifdef ngu
int main()
{
  freopen ("task.inp", "r", stdin);
  freopen ("task.out", "w", stdout);
    int L, N, X, M, Q;
    assert(5 == scanf("%d %d %d %d %d", &L, &N, &X, &M, &Q));
    std::vector<long long> T(N);
    for (int i = 0; i < N; i++)
        assert(1 == scanf("%lld", &T[i]));
    std::vector<int> W(N);
    for (int i = 0; i < N; i++)
        assert(1 == scanf("%d", &W[i]));
    std::vector<int> S(M);
    for (int i = 0; i < M; i++)
        assert(1 == scanf("%d", &S[i]));
    std::vector<long long> Y(Q);
    for (int i = 0; i < Q; i++)
        assert(1 == scanf("%lld", &Y[i]));

    fclose(stdin);

    init(L, N, T, W, X, M, S);
    std::vector<long long> res(Q);
    for (int i = 0; i < Q; i++)
        res[i] = arrival_time(Y[i]);

    for (int i = 0; i < Q; i++)
        printf("%lld\n", res[i]);
    fclose(stdout);
    return 0;
}
#endif // ngu

Compilation message

overtaking.cpp: In function 'long long int arrival_time(long long int)':
overtaking.cpp:52:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   52 |       int mid = l + r >> 1;
      |                 ~~^~~

Subtask #0
0.0 / 0.0

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 2 ms 6488 KB Output is correct
6 Correct 3 ms 8536 KB Output is correct
7 Correct 4 ms 10588 KB Output is correct
8 Correct 5 ms 10588 KB Output is correct
9 Correct 6 ms 10588 KB Output is correct
10 Correct 5 ms 10812 KB Output is correct
11 Correct 5 ms 10696 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 2 ms 10588 KB Output is correct
6 Correct 3 ms 13280 KB Output is correct
7 Correct 3 ms 13916 KB Output is correct
8 Correct 4 ms 13916 KB Output is correct
9 Correct 3 ms 13916 KB Output is correct
10 Correct 3 ms 13912 KB Output is correct
11 Correct 3 ms 13912 KB Output is correct
12 Correct 3 ms 13916 KB Output is correct
13 Correct 3 ms 13916 KB Output is correct
14 Correct 3 ms 13912 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 2 ms 8540 KB Output is correct
13 Correct 2 ms 8536 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 2 ms 8540 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 3 ms 8792 KB Output is correct
18 Correct 2 ms 8540 KB Output is correct
19 Correct 2 ms 8540 KB Output is correct
20 Correct 2 ms 8540 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 2 ms 8536 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8656 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 2 ms 8540 KB Output is correct
30 Correct 2 ms 8540 KB Output is correct
31 Correct 2 ms 8540 KB Output is correct
32 Correct 2 ms 8540 KB Output is correct
33 Correct 2 ms 8540 KB Output is correct
34 Correct 2 ms 8540 KB Output is correct
35 Correct 2 ms 8540 KB Output is correct
36 Correct 2 ms 8540 KB Output is correct
37 Correct 2 ms 8540 KB Output is correct
38 Correct 2 ms 8540 KB Output is correct
39 Correct 2 ms 8540 KB Output is correct
40 Correct 2 ms 8536 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 2 ms 6488 KB Output is correct
7 Correct 3 ms 8536 KB Output is correct
8 Correct 4 ms 10588 KB Output is correct
9 Correct 5 ms 10588 KB Output is correct
10 Correct 6 ms 10588 KB Output is correct
11 Correct 5 ms 10812 KB Output is correct
12 Correct 5 ms 10696 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 2 ms 8540 KB Output is correct
19 Correct 2 ms 8540 KB Output is correct
20 Correct 2 ms 8536 KB Output is correct
21 Correct 2 ms 8540 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 3 ms 8792 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 2 ms 8540 KB Output is correct
30 Correct 2 ms 8540 KB Output is correct
31 Correct 2 ms 8536 KB Output is correct
32 Correct 2 ms 8540 KB Output is correct
33 Correct 2 ms 8656 KB Output is correct
34 Correct 2 ms 8540 KB Output is correct
35 Correct 2 ms 8540 KB Output is correct
36 Correct 2 ms 8540 KB Output is correct
37 Correct 2 ms 8540 KB Output is correct
38 Correct 2 ms 8540 KB Output is correct
39 Correct 2 ms 8540 KB Output is correct
40 Correct 2 ms 8540 KB Output is correct
41 Correct 2 ms 8540 KB Output is correct
42 Correct 2 ms 8540 KB Output is correct
43 Correct 2 ms 8540 KB Output is correct
44 Correct 2 ms 8540 KB Output is correct
45 Correct 2 ms 8540 KB Output is correct
46 Correct 2 ms 8540 KB Output is correct
47 Correct 2 ms 8536 KB Output is correct
48 Correct 76 ms 20392 KB Output is correct
49 Correct 157 ms 20444 KB Output is correct
50 Correct 148 ms 20520 KB Output is correct
51 Correct 146 ms 20564 KB Output is correct
52 Correct 143 ms 20564 KB Output is correct
53 Correct 145 ms 20544 KB Output is correct
54 Correct 138 ms 20560 KB Output is correct
55 Correct 88 ms 20224 KB Output is correct
56 Correct 147 ms 20564 KB Output is correct
57 Correct 149 ms 20560 KB Output is correct
58 Correct 143 ms 20520 KB Output is correct
59 Correct 147 ms 20516 KB Output is correct
60 Correct 154 ms 20564 KB Output is correct
61 Correct 146 ms 20520 KB Output is correct
62 Correct 16 ms 10840 KB Output is correct
63 Correct 4 ms 14172 KB Output is correct
64 Correct 265 ms 17148 KB Output is correct
65 Correct 174 ms 18516 KB Output is correct
66 Correct 426 ms 20548 KB Output is correct
67 Correct 419 ms 20548 KB Output is correct
68 Correct 480 ms 20548 KB Output is correct
69 Correct 146 ms 20564 KB Output is correct
70 Correct 158 ms 20560 KB Output is correct
71 Correct 153 ms 20528 KB Output is correct
72 Correct 151 ms 20524 KB Output is correct
73 Correct 149 ms 20564 KB Output is correct
74 Correct 147 ms 20520 KB Output is correct
75 Correct 410 ms 20564 KB Output is correct
76 Correct 396 ms 20552 KB Output is correct
77 Correct 386 ms 20756 KB Output is correct
78 Correct 128 ms 20492 KB Output is correct

Subtask #5
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 2 ms 6488 KB Output is correct
7 Correct 3 ms 8536 KB Output is correct
8 Correct 4 ms 10588 KB Output is correct
9 Correct 5 ms 10588 KB Output is correct
10 Correct 6 ms 10588 KB Output is correct
11 Correct 5 ms 10812 KB Output is correct
12 Correct 5 ms 10696 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 3 ms 13280 KB Output is correct
19 Correct 3 ms 13916 KB Output is correct
20 Correct 4 ms 13916 KB Output is correct
21 Correct 3 ms 13916 KB Output is correct
22 Correct 3 ms 13912 KB Output is correct
23 Correct 3 ms 13912 KB Output is correct
24 Correct 3 ms 13916 KB Output is correct
25 Correct 3 ms 13916 KB Output is correct
26 Correct 3 ms 13912 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 2 ms 8540 KB Output is correct
30 Correct 2 ms 8540 KB Output is correct
31 Correct 2 ms 8536 KB Output is correct
32 Correct 2 ms 8540 KB Output is correct
33 Correct 2 ms 8540 KB Output is correct
34 Correct 2 ms 8540 KB Output is correct
35 Correct 3 ms 8792 KB Output is correct
36 Correct 2 ms 8540 KB Output is correct
37 Correct 2 ms 8540 KB Output is correct
38 Correct 2 ms 8540 KB Output is correct
39 Correct 1 ms 6492 KB Output is correct
40 Correct 2 ms 8540 KB Output is correct
41 Correct 2 ms 8540 KB Output is correct
42 Correct 2 ms 8536 KB Output is correct
43 Correct 2 ms 8540 KB Output is correct
44 Correct 2 ms 8656 KB Output is correct
45 Correct 2 ms 8540 KB Output is correct
46 Correct 2 ms 8540 KB Output is correct
47 Correct 2 ms 8540 KB Output is correct
48 Correct 2 ms 8540 KB Output is correct
49 Correct 2 ms 8540 KB Output is correct
50 Correct 2 ms 8540 KB Output is correct
51 Correct 2 ms 8540 KB Output is correct
52 Correct 2 ms 8540 KB Output is correct
53 Correct 2 ms 8540 KB Output is correct
54 Correct 2 ms 8540 KB Output is correct
55 Correct 2 ms 8540 KB Output is correct
56 Correct 2 ms 8540 KB Output is correct
57 Correct 2 ms 8540 KB Output is correct
58 Correct 2 ms 8536 KB Output is correct
59 Correct 76 ms 20392 KB Output is correct
60 Correct 157 ms 20444 KB Output is correct
61 Correct 148 ms 20520 KB Output is correct
62 Correct 146 ms 20564 KB Output is correct
63 Correct 143 ms 20564 KB Output is correct
64 Correct 145 ms 20544 KB Output is correct
65 Correct 138 ms 20560 KB Output is correct
66 Correct 88 ms 20224 KB Output is correct
67 Correct 147 ms 20564 KB Output is correct
68 Correct 149 ms 20560 KB Output is correct
69 Correct 143 ms 20520 KB Output is correct
70 Correct 147 ms 20516 KB Output is correct
71 Correct 154 ms 20564 KB Output is correct
72 Correct 146 ms 20520 KB Output is correct
73 Correct 16 ms 10840 KB Output is correct
74 Correct 4 ms 14172 KB Output is correct
75 Correct 265 ms 17148 KB Output is correct
76 Correct 174 ms 18516 KB Output is correct
77 Correct 426 ms 20548 KB Output is correct
78 Correct 419 ms 20548 KB Output is correct
79 Correct 480 ms 20548 KB Output is correct
80 Correct 146 ms 20564 KB Output is correct
81 Correct 158 ms 20560 KB Output is correct
82 Correct 153 ms 20528 KB Output is correct
83 Correct 151 ms 20524 KB Output is correct
84 Correct 149 ms 20564 KB Output is correct
85 Correct 147 ms 20520 KB Output is correct
86 Correct 410 ms 20564 KB Output is correct
87 Correct 396 ms 20552 KB Output is correct
88 Correct 386 ms 20756 KB Output is correct
89 Correct 128 ms 20492 KB Output is correct
90 Execution timed out 3539 ms 22608 KB Time limit exceeded
91 Halted 0 ms 0 KB -