oj.uz

답안 #637612

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
637612 2022-09-02T13:13:18 Z stoyan_malinin Long Distance Coach (JOI17_coach) C++14
100 / 100
 145 ms 25076 KB 
#include <algorithm>
#include <iostream>
#include <vector>
#include <cmath>
#include <set>

using namespace std;

const int MAXN = 2e5;
const int64_t inf = 1e18;
const int64_t MAXX = 1e12;

struct Line
{
    int64_t a, b;

    Line(){}
    Line(double a, double b)
    {
        this->a = a;
        this->b = b;
    }

    int64_t get(int64_t x)
    {
        return a*x + b;
    }
};

double intersect(const Line &A, const Line &B)
{
    return double(B.b-A.b)/double(A.a-B.a);
}

struct ConvexHullTrick
{
    vector <Line> v;
    vector <double> to;

    void add(const Line &l)
    {
        while(v.size()>=2 && to.back()>=intersect(v[v.size()-2], l))
        {
            v.pop_back();
            to.pop_back();
        }

        if(v.empty()==true)
        {
            v.push_back(l);
        }
        else
        {
            to.push_back(intersect(v.back(), l));
            v.push_back(l);
        }
    }

    int64_t get(double x)
    {
        auto it = upper_bound(to.begin(), to.end(), x);
        return v[it-to.begin()].get(x);
    }
};

struct Passanger
{
    int64_t d, c;

    Passanger(){}
    Passanger(int64_t d, int64_t c) : d(d), c(c) {}
};

int64_t X, n, m, W, T;
int64_t sources[MAXN+5];
Passanger passangers[MAXN+5];
Passanger passangersPref[MAXN+5];

int64_t depart[MAXN+5];
int64_t endWaterPoints[MAXN+5];
int64_t endWaterPointsPrefix[MAXN+5];

int findLastPassangerBefore(int64_t rem)
{
    int l = 0, r = m - 1, mid;
    while(l+1<r)
    {
        mid = (l+r)/2;

        if(passangers[mid].d<rem) l = mid;
        else r = mid - 1;
    }

    if(passangers[r].d<rem) return r;
    if(passangers[l].d<rem) return l;
    return -1;
}

void init()
{
    sort(sources, sources+n);
    sort(passangers, passangers+m,
    [](const Passanger& A, const Passanger& B)
    {
        if(A.d!=B.d) return A.d<B.d;
        return A.c<B.c;
    });

    for(int i = 0;i<m;i++) depart[i] = -1;

    for(int i = 0;i<n;i++)
    {
        int ind = findLastPassangerBefore(sources[i]%T);
        if(ind!=-1 && depart[ind]==-1) depart[ind] = sources[i];
    }
    {
        int ind = findLastPassangerBefore(X%T);
        if(ind!=-1 && depart[ind]==-1) depart[ind] = X;
    }
}

int64_t dp[MAXN+5];

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> X >> n >> m >> W >> T;
    for(int i = 0;i<n;i++) cin >> sources[i];
    for(int i = 0;i<m;i++) cin >> passangers[i].d >> passangers[i].c;
    init();

    int64_t driverWater = X/T + 1;

    int64_t endWaterPointsSum = 0;
    for(int i = 0;i<m;i++)
    {
        endWaterPoints[i] = ((X-passangers[i].d+(T-1))/T)*T + passangers[i].d;
        endWaterPointsSum += endWaterPoints[i];

        endWaterPointsPrefix[i] = endWaterPoints[i];
        if(i!=0) endWaterPointsPrefix[i] += endWaterPointsPrefix[i-1];
    }

    int64_t beginWaterPointsSum = 0;
    for(int i = 0;i<m;i++) beginWaterPointsSum += passangers[i].d;

    passangersPref[0] = passangers[0];
    for(int i = 1;i<m;i++)
    {
        passangersPref[i].d = passangersPref[i-1].d + passangers[i].d;
        passangersPref[i].c = passangersPref[i-1].c + passangers[i].c;
    }

    ConvexHullTrick cht;

    for(int i = 0;i<m;i++)
    {
        dp[i] = inf;
        if(i!=0) dp[i] = dp[i-1];
        else dp[i] = 0;

        {
                int64_t lastDp = ((i==0)?0:dp[i-1]);
                int64_t lastEWPP = ((i==0)?0:endWaterPointsPrefix[i-1]);
                int64_t lastC = ((i==0)?0:passangersPref[i-1].c);
                int64_t lastD = ((i==0)?0:passangersPref[i-1].d);

                cht.add(Line(W*(-i), lastDp - lastC + ((-lastD + lastEWPP)/T)*W));
        }

        if(depart[i]!=-1)
        {
            int64_t based = (depart[i]/T)*T;
            int64_t basedDiv = depart[i]/T;
            int64_t val1 = ((passangersPref[i].d - endWaterPointsPrefix[i])/T)*W + basedDiv*(i+1)*W + passangersPref[i].c;
            int64_t val2 = cht.get(basedDiv);

            dp[i] = min(dp[i], val1 + val2);
        }
    }

    int64_t ans = dp[m-1] + ((endWaterPointsSum-beginWaterPointsSum)/T)*W + driverWater*W;
    cout << ans << '\n';
}
/*
19 1 4 8 7
10
1 20
2 10
4 5
6 5
*/

Compilation message

coach.cpp: In function 'int main()':
coach.cpp:175:21: warning: unused variable 'based' [-Wunused-variable]
  175 |             int64_t based = (depart[i]/T)*T;
      |                     ^~~~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct

Subtask #2
30.0 / 30.0

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

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 504 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 1 ms 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 1 ms 468 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 1 ms 468 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 504 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 1 ms 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 1 ms 468 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 133 ms 14352 KB Output is correct
53 Correct 130 ms 20076 KB Output is correct
54 Correct 109 ms 19276 KB Output is correct
55 Correct 108 ms 19416 KB Output is correct
56 Correct 113 ms 19812 KB Output is correct
57 Correct 115 ms 19464 KB Output is correct
58 Correct 112 ms 20104 KB Output is correct
59 Correct 108 ms 19404 KB Output is correct
60 Correct 108 ms 19220 KB Output is correct
61 Correct 107 ms 19404 KB Output is correct
62 Correct 114 ms 19388 KB Output is correct
63 Correct 83 ms 25076 KB Output is correct
64 Correct 101 ms 20284 KB Output is correct
65 Correct 125 ms 20044 KB Output is correct
66 Correct 129 ms 20104 KB Output is correct
67 Correct 125 ms 20056 KB Output is correct
68 Correct 127 ms 20144 KB Output is correct
69 Correct 132 ms 19804 KB Output is correct
70 Correct 137 ms 19888 KB Output is correct
71 Correct 133 ms 19788 KB Output is correct
72 Correct 145 ms 19848 KB Output is correct
73 Correct 137 ms 19888 KB Output is correct
74 Correct 135 ms 20024 KB Output is correct
75 Correct 134 ms 20004 KB Output is correct
76 Correct 132 ms 19984 KB Output is correct
77 Correct 114 ms 19788 KB Output is correct
78 Correct 116 ms 20172 KB Output is correct
79 Correct 128 ms 19404 KB Output is correct
80 Correct 130 ms 19428 KB Output is correct