oj.uz

답안 #848214

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
848214 2023-09-11T15:49:08 Z haxorman 추월 (IOI23_overtaking) C++17
39 / 100
 3500 ms 17744 KB 
#include "overtaking.h"
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int mxN = 1007;

int n, len, x, m, y, t[mxN][mxN], e[mxN][mxN], gt[mxN][mxN], pref[mxN][mxN];
vector<int> s, vec;
vector<pair<int,int>> arr;

int cur_ind;
bool cmp(int a, int b) {
    if (t[a][cur_ind] == t[b][cur_ind]) {
        return arr[a].second < arr[b].second;
    }
    return t[a][cur_ind] < t[b][cur_ind];
}

void init(int32_t L, int32_t N, std::vector<long long> T, std::vector<int32_t> W, int32_t X, int32_t M, std::vector<int32_t> S)
{
    n = N, len = L, m = M, x = X;

    vector<int> inds;
    for (int i = 0; i < n; ++i) {
        arr.push_back({T[i], W[i]});
        vec.push_back(T[i]);

        inds.push_back(i);
    }
    sort(arr.begin(), arr.end());
    sort(vec.begin(), vec.end());
    for (int i = 0; i < n; ++i) {
        t[i][0] = arr[i].first;
    }

    for (int i = 0; i < m; ++i) {
        s.push_back(S[i]);
    }
    
    for (int j = 1; j < m; ++j) {
        for (int i = 0; i < n; ++i) {
            e[i][j] = t[i][j - 1] + arr[i].second * (s[j] - s[j - 1]);
        }
        cur_ind = j - 1;
        sort(inds.begin(), inds.end(), cmp);
        
        int mx = 0;
        for (auto i : inds) {
            mx = max(mx, e[i][j]);
            t[i][j] = mx;
        }
    }
}

long long arrival_time(long long Y)
{
    y = Y;
    t[n][0] = y;
    for (int j = 1; j < m; ++j) {
        e[n][j] = t[n][j - 1] + x * (s[j] - s[j - 1]);
        
        t[n][j] = e[n][j];
        for (int i = 0; i < n; ++i) {
            if (t[i][j - 1] < t[n][j - 1]) {
                t[n][j] = max(t[n][j], e[i][j]);
            }
        }
    }
    return t[n][m - 1];
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 2 ms 4440 KB Output is correct
7 Correct 3 ms 4440 KB Output is correct
8 Correct 4 ms 4440 KB Output is correct
9 Correct 3 ms 4444 KB Output is correct
10 Correct 3 ms 4440 KB Output is correct
11 Correct 3 ms 4440 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6744 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 2 ms 12632 KB Output is correct
6 Correct 3 ms 16728 KB Output is correct
7 Correct 4 ms 17244 KB Output is correct
8 Correct 4 ms 17240 KB Output is correct
9 Correct 4 ms 17240 KB Output is correct
10 Correct 5 ms 17240 KB Output is correct
11 Correct 4 ms 17240 KB Output is correct
12 Correct 4 ms 17240 KB Output is correct
13 Correct 5 ms 17244 KB Output is correct
14 Correct 3 ms 17240 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 6744 KB Output is correct
9 Correct 2 ms 6488 KB Output is correct
10 Correct 2 ms 6488 KB Output is correct
11 Correct 2 ms 6488 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 2 ms 6488 KB Output is correct
14 Correct 2 ms 6488 KB Output is correct
15 Correct 3 ms 6488 KB Output is correct
16 Correct 2 ms 6488 KB Output is correct
17 Correct 2 ms 6488 KB Output is correct
18 Correct 2 ms 6488 KB Output is correct
19 Correct 2 ms 6488 KB Output is correct
20 Correct 2 ms 6488 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 2 ms 6488 KB Output is correct
23 Correct 2 ms 4440 KB Output is correct
24 Correct 2 ms 4440 KB Output is correct
25 Correct 2 ms 4440 KB Output is correct
26 Correct 2 ms 4440 KB Output is correct
27 Correct 2 ms 4440 KB Output is correct
28 Correct 2 ms 6492 KB Output is correct
29 Correct 2 ms 6488 KB Output is correct
30 Correct 2 ms 6488 KB Output is correct
31 Correct 2 ms 6488 KB Output is correct
32 Correct 2 ms 6488 KB Output is correct
33 Correct 2 ms 6488 KB Output is correct
34 Correct 3 ms 6488 KB Output is correct
35 Correct 2 ms 6488 KB Output is correct
36 Correct 2 ms 6492 KB Output is correct
37 Correct 2 ms 6488 KB Output is correct
38 Correct 2 ms 6488 KB Output is correct
39 Correct 2 ms 6488 KB Output is correct
40 Correct 2 ms 6488 KB Output is correct

Subtask #4
0.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 2 ms 4440 KB Output is correct
8 Correct 3 ms 4440 KB Output is correct
9 Correct 4 ms 4440 KB Output is correct
10 Correct 3 ms 4444 KB Output is correct
11 Correct 3 ms 4440 KB Output is correct
12 Correct 3 ms 4440 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6744 KB Output is correct
16 Correct 2 ms 6488 KB Output is correct
17 Correct 2 ms 6488 KB Output is correct
18 Correct 2 ms 6488 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6488 KB Output is correct
21 Correct 2 ms 6488 KB Output is correct
22 Correct 3 ms 6488 KB Output is correct
23 Correct 2 ms 6488 KB Output is correct
24 Correct 2 ms 6488 KB Output is correct
25 Correct 2 ms 6488 KB Output is correct
26 Correct 2 ms 6488 KB Output is correct
27 Correct 2 ms 6488 KB Output is correct
28 Correct 1 ms 4440 KB Output is correct
29 Correct 2 ms 6488 KB Output is correct
30 Correct 2 ms 4440 KB Output is correct
31 Correct 2 ms 4440 KB Output is correct
32 Correct 2 ms 4440 KB Output is correct
33 Correct 2 ms 4440 KB Output is correct
34 Correct 2 ms 4440 KB Output is correct
35 Correct 2 ms 6492 KB Output is correct
36 Correct 2 ms 6488 KB Output is correct
37 Correct 2 ms 6488 KB Output is correct
38 Correct 2 ms 6488 KB Output is correct
39 Correct 2 ms 6488 KB Output is correct
40 Correct 2 ms 6488 KB Output is correct
41 Correct 3 ms 6488 KB Output is correct
42 Correct 2 ms 6488 KB Output is correct
43 Correct 2 ms 6492 KB Output is correct
44 Correct 2 ms 6488 KB Output is correct
45 Correct 2 ms 6488 KB Output is correct
46 Correct 2 ms 6488 KB Output is correct
47 Correct 2 ms 6488 KB Output is correct
48 Correct 1045 ms 17744 KB Output is correct
49 Execution timed out 3602 ms 17496 KB Time limit exceeded
50 Halted 0 ms 0 KB -

Subtask #5
0.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 2 ms 4440 KB Output is correct
8 Correct 3 ms 4440 KB Output is correct
9 Correct 4 ms 4440 KB Output is correct
10 Correct 3 ms 4444 KB Output is correct
11 Correct 3 ms 4440 KB Output is correct
12 Correct 3 ms 4440 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6744 KB Output is correct
16 Correct 1 ms 6488 KB Output is correct
17 Correct 2 ms 12632 KB Output is correct
18 Correct 3 ms 16728 KB Output is correct
19 Correct 4 ms 17244 KB Output is correct
20 Correct 4 ms 17240 KB Output is correct
21 Correct 4 ms 17240 KB Output is correct
22 Correct 5 ms 17240 KB Output is correct
23 Correct 4 ms 17240 KB Output is correct
24 Correct 4 ms 17240 KB Output is correct
25 Correct 5 ms 17244 KB Output is correct
26 Correct 3 ms 17240 KB Output is correct
27 Correct 2 ms 6488 KB Output is correct
28 Correct 2 ms 6488 KB Output is correct
29 Correct 2 ms 6488 KB Output is correct
30 Correct 2 ms 6492 KB Output is correct
31 Correct 2 ms 6488 KB Output is correct
32 Correct 2 ms 6488 KB Output is correct
33 Correct 3 ms 6488 KB Output is correct
34 Correct 2 ms 6488 KB Output is correct
35 Correct 2 ms 6488 KB Output is correct
36 Correct 2 ms 6488 KB Output is correct
37 Correct 2 ms 6488 KB Output is correct
38 Correct 2 ms 6488 KB Output is correct
39 Correct 1 ms 4440 KB Output is correct
40 Correct 2 ms 6488 KB Output is correct
41 Correct 2 ms 4440 KB Output is correct
42 Correct 2 ms 4440 KB Output is correct
43 Correct 2 ms 4440 KB Output is correct
44 Correct 2 ms 4440 KB Output is correct
45 Correct 2 ms 4440 KB Output is correct
46 Correct 2 ms 6492 KB Output is correct
47 Correct 2 ms 6488 KB Output is correct
48 Correct 2 ms 6488 KB Output is correct
49 Correct 2 ms 6488 KB Output is correct
50 Correct 2 ms 6488 KB Output is correct
51 Correct 2 ms 6488 KB Output is correct
52 Correct 3 ms 6488 KB Output is correct
53 Correct 2 ms 6488 KB Output is correct
54 Correct 2 ms 6492 KB Output is correct
55 Correct 2 ms 6488 KB Output is correct
56 Correct 2 ms 6488 KB Output is correct
57 Correct 2 ms 6488 KB Output is correct
58 Correct 2 ms 6488 KB Output is correct
59 Correct 1045 ms 17744 KB Output is correct
60 Execution timed out 3602 ms 17496 KB Time limit exceeded
61 Halted 0 ms 0 KB -