oj.uz

Submission #841880

# Submission time Handle Problem Language Result Execution time Memory
841880 2023-09-02T08:00:20 Z hcng Overtaking (IOI23_overtaking) C++17
65 / 100
 3500 ms 33440 KB 
#include <bits/stdc++.h>
#include "overtaking.h"
using namespace std;
 
#define long long long
 
long l, n, x, m;
vector<long> w, s;
vector<vector<long>> t, e, v, pre;
 
void init(int L, int N, vector<long> T, vector<int> W, int X, int M, vector<int> S) {
    
    l = L, x = X, m = M, n = N;
    s.assign(S.begin(), S.end());
    w.assign(W.begin(), W.end());
    t.resize(m); t[0].assign(T.begin(), T.end());
    w.push_back(X); t[0].push_back(0);
    e.assign(m, vector<long>(n + 1));
    v.assign(m, vector<long>(n));
    pre.assign(m, vector<long>(n));
    
    for (long i = 1; i < m; i++) {
        t[i] = vector<long>(n + 1);
        for (long j = 0; j < n; j++) {
            v[i][j] = j;
            e[i][j] = t[i - 1][j] + w[j] * (s[i] - s[i - 1]);
        }
        sort(v[i].begin(), v[i].end(),
             [&](const long &a, const long &b) {
                 return t[i - 1][a] < t[i - 1][b];
             }
        );
        pre[i][0] = e[i][v[i][0]];
        for (long j = 1; j < n; j++) {
            pre[i][j] = max(e[i][v[i][j]], pre[i][j - 1]);
        }
        for (long j = 0; j < n; j++) {
            long L = 0, R = j - 1;
            while (L < R) {
                M = (L + R + 1) / 2;
                if (t[i - 1][v[i][M]] < t[i - 1][v[i][j]]) L = M;
                else R = M - 1;
            }
            if (t[i - 1][v[i][j]] == t[i - 1][v[i][0]]) t[i][v[i][j]] = e[i][v[i][j]];
            else t[i][v[i][j]] = max(e[i][v[i][j]], pre[i][L]);
        }
    }
}
 
long arrival_time(long y) {
    
    t[0][n] = y;
    
    for (long i = 1; i < m; i++) {
        e[i][n] = t[i - 1][n] + w[n] * (s[i] - s[i - 1]);
        long L = 0, R = n - 1;
        while (L < R) {
            long M = (L + R + 1) / 2;
            if (t[i - 1][v[i][M]] < t[i - 1][n]) L = M;
            else R = M - 1;
        }
        if (t[i - 1][n] <= t[i - 1][v[i][0]]) t[i][n] = e[i][n];
        else t[i][n] = max(e[i][n], pre[i][L]);
    }
    
    return t[m - 1][n];
}

Subtask #0
0.0 / 0.0

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 6 ms 436 KB Output is correct
9 Correct 6 ms 604 KB Output is correct
10 Correct 6 ms 676 KB Output is correct
11 Correct 6 ms 684 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 776 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 592 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 600 KB Output is correct
40 Correct 1 ms 600 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 5 ms 604 KB Output is correct
9 Correct 6 ms 436 KB Output is correct
10 Correct 6 ms 604 KB Output is correct
11 Correct 6 ms 676 KB Output is correct
12 Correct 6 ms 684 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 776 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 592 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 600 KB Output is correct
47 Correct 1 ms 600 KB Output is correct
48 Correct 112 ms 31924 KB Output is correct
49 Correct 304 ms 32004 KB Output is correct
50 Correct 323 ms 32004 KB Output is correct
51 Correct 300 ms 31824 KB Output is correct
52 Correct 321 ms 32004 KB Output is correct
53 Correct 323 ms 32004 KB Output is correct
54 Correct 325 ms 32004 KB Output is correct
55 Correct 130 ms 32084 KB Output is correct
56 Correct 348 ms 31828 KB Output is correct
57 Correct 354 ms 32080 KB Output is correct
58 Correct 331 ms 32000 KB Output is correct
59 Correct 407 ms 32008 KB Output is correct
60 Correct 350 ms 32008 KB Output is correct
61 Correct 346 ms 32008 KB Output is correct
62 Correct 27 ms 604 KB Output is correct
63 Correct 2 ms 600 KB Output is correct
64 Correct 416 ms 16576 KB Output is correct
65 Correct 250 ms 16268 KB Output is correct
66 Correct 712 ms 32004 KB Output is correct
67 Correct 698 ms 32040 KB Output is correct
68 Correct 806 ms 32080 KB Output is correct
69 Correct 529 ms 32012 KB Output is correct
70 Correct 539 ms 32000 KB Output is correct
71 Correct 510 ms 31824 KB Output is correct
72 Correct 583 ms 31828 KB Output is correct
73 Correct 557 ms 32004 KB Output is correct
74 Correct 527 ms 31996 KB Output is correct
75 Correct 764 ms 32012 KB Output is correct
76 Correct 677 ms 31824 KB Output is correct
77 Correct 812 ms 32116 KB Output is correct
78 Correct 325 ms 32336 KB Output is correct

Subtask #5
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 5 ms 604 KB Output is correct
9 Correct 6 ms 436 KB Output is correct
10 Correct 6 ms 604 KB Output is correct
11 Correct 6 ms 676 KB Output is correct
12 Correct 6 ms 684 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 776 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 592 KB Output is correct
41 Correct 1 ms 600 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 1 ms 604 KB Output is correct
49 Correct 1 ms 604 KB Output is correct
50 Correct 2 ms 604 KB Output is correct
51 Correct 1 ms 604 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 1 ms 604 KB Output is correct
54 Correct 1 ms 604 KB Output is correct
55 Correct 1 ms 604 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 1 ms 600 KB Output is correct
58 Correct 1 ms 600 KB Output is correct
59 Correct 112 ms 31924 KB Output is correct
60 Correct 304 ms 32004 KB Output is correct
61 Correct 323 ms 32004 KB Output is correct
62 Correct 300 ms 31824 KB Output is correct
63 Correct 321 ms 32004 KB Output is correct
64 Correct 323 ms 32004 KB Output is correct
65 Correct 325 ms 32004 KB Output is correct
66 Correct 130 ms 32084 KB Output is correct
67 Correct 348 ms 31828 KB Output is correct
68 Correct 354 ms 32080 KB Output is correct
69 Correct 331 ms 32000 KB Output is correct
70 Correct 407 ms 32008 KB Output is correct
71 Correct 350 ms 32008 KB Output is correct
72 Correct 346 ms 32008 KB Output is correct
73 Correct 27 ms 604 KB Output is correct
74 Correct 2 ms 600 KB Output is correct
75 Correct 416 ms 16576 KB Output is correct
76 Correct 250 ms 16268 KB Output is correct
77 Correct 712 ms 32004 KB Output is correct
78 Correct 698 ms 32040 KB Output is correct
79 Correct 806 ms 32080 KB Output is correct
80 Correct 529 ms 32012 KB Output is correct
81 Correct 539 ms 32000 KB Output is correct
82 Correct 510 ms 31824 KB Output is correct
83 Correct 583 ms 31828 KB Output is correct
84 Correct 557 ms 32004 KB Output is correct
85 Correct 527 ms 31996 KB Output is correct
86 Correct 764 ms 32012 KB Output is correct
87 Correct 677 ms 31824 KB Output is correct
88 Correct 812 ms 32116 KB Output is correct
89 Correct 325 ms 32336 KB Output is correct
90 Execution timed out 3537 ms 33440 KB Time limit exceeded
91 Halted 0 ms 0 KB -