oj.uz

Submission #409455

# Submission time Handle Problem Language Result Execution time Memory
409455 2021-05-20T19:06:06 Z duality Long Distance Coach (JOI17_coach) C++11
100 / 100
 299 ms 15768 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

LLI T;
LLI S[200001],pre[200000];
bool comp(LLI a,LLI b) {
    if ((a % T) == (b % T)) return a < b;
    else return (a % T) < (b % T);
}
pair<LLI,int> p[200000];
LLI dp[200000];
struct line { LLI m,b; };
bool bad(line a,line b,line c) {
    return (b.b-a.b)*(b.m-c.m) >= (c.b-b.b)*(a.m-b.m);
}
vector<line> hull;
int main() {
    int i;
    LLI X;
    int N,M,W;
    scanf("%lld %d %d %d %lld",&X,&N,&M,&W,&T);
    for (i = 0; i < N; i++) scanf("%lld",&S[i]);
    S[N++] = X,sort(S,S+N,comp);
    for (i = 0; i < M; i++) scanf("%lld %d",&p[i].first,&p[i].second);
    sort(p,p+M);

    int j = 0,k;
    for (i = 0; i < M; i++) pre[i] = p[i].second+((i == 0) ? 0:pre[i-1]);
    hull.pb((line){1,0});
    for (i = 0; i < M; i++) {
        while ((j < N) && ((S[j] % T) < p[i].first)) j++;
        dp[i] = W*((X-p[i].first)/T+1)+((i == 0) ? 0:dp[i-1]);
        if ((j < N) && ((i == M-1) || ((S[j] % T) < p[i+1].first))) {
            LLI s = S[j];
            while ((j < N) && ((S[j] % T) < ((i == M-1) ? T:p[i+1].first))) s = min(s,S[j]),j++;
            int l = 0,r = (int) hull.size()-1;
            LLI x = W*(s/T);
            while (l < r) {
                int m = (l+r) / 2;
                if (hull[m].m*x+hull[m].b < hull[m+1].m*x+hull[m+1].b) r = m;
                else l = m+1;
            }
            dp[i] = min(dp[i],hull[l].m*x+hull[l].b+pre[i]+i*x);
            /*LLI c = 0;
            for (k = i; k >= 0; k--) {
                c += p[k].second;
                dp[i] = min(dp[i],c+((k == 0) ? 0:dp[k-1])+(LLI) W*(i-k+1)*(s/T));
            }*/
        }
        line l = {-i,dp[i]-pre[i]};
        while ((hull.size() >= 2) && bad(hull[hull.size()-2],hull.back(),l)) hull.pop_back();
        hull.pb(l);
    }
    printf("%lld\n",dp[M-1]+(LLI) W*(X/T+1));

    return 0;
}

Compilation message

coach.cpp: In function 'int main()':
coach.cpp:81:15: warning: unused variable 'k' [-Wunused-variable]
   81 |     int j = 0,k;
      |               ^
coach.cpp:75:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |     scanf("%lld %d %d %d %lld",&X,&N,&M,&W,&T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
coach.cpp:76:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |     for (i = 0; i < N; i++) scanf("%lld",&S[i]);
      |                             ~~~~~^~~~~~~~~~~~~~
coach.cpp:78:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   78 |     for (i = 0; i < M; i++) scanf("%lld %d",&p[i].first,&p[i].second);
      |                             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 272 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 204 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 272 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 2 ms 332 KB Output is correct
39 Correct 2 ms 332 KB Output is correct
40 Correct 3 ms 332 KB Output is correct
41 Correct 3 ms 332 KB Output is correct
42 Correct 2 ms 332 KB Output is correct
43 Correct 2 ms 332 KB Output is correct
44 Correct 2 ms 332 KB Output is correct
45 Correct 2 ms 332 KB Output is correct
46 Correct 2 ms 448 KB Output is correct
47 Correct 2 ms 332 KB Output is correct
48 Correct 2 ms 332 KB Output is correct
49 Correct 2 ms 332 KB Output is correct
50 Correct 2 ms 332 KB Output is correct
51 Correct 2 ms 332 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 272 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 2 ms 332 KB Output is correct
39 Correct 2 ms 332 KB Output is correct
40 Correct 3 ms 332 KB Output is correct
41 Correct 3 ms 332 KB Output is correct
42 Correct 2 ms 332 KB Output is correct
43 Correct 2 ms 332 KB Output is correct
44 Correct 2 ms 332 KB Output is correct
45 Correct 2 ms 332 KB Output is correct
46 Correct 2 ms 448 KB Output is correct
47 Correct 2 ms 332 KB Output is correct
48 Correct 2 ms 332 KB Output is correct
49 Correct 2 ms 332 KB Output is correct
50 Correct 2 ms 332 KB Output is correct
51 Correct 2 ms 332 KB Output is correct
52 Correct 199 ms 7992 KB Output is correct
53 Correct 242 ms 13868 KB Output is correct
54 Correct 197 ms 12996 KB Output is correct
55 Correct 196 ms 13208 KB Output is correct
56 Correct 198 ms 13508 KB Output is correct
57 Correct 197 ms 13252 KB Output is correct
58 Correct 200 ms 13764 KB Output is correct
59 Correct 196 ms 13100 KB Output is correct
60 Correct 198 ms 12868 KB Output is correct
61 Correct 197 ms 13124 KB Output is correct
62 Correct 201 ms 13192 KB Output is correct
63 Correct 231 ms 15768 KB Output is correct
64 Correct 172 ms 13880 KB Output is correct
65 Correct 294 ms 13832 KB Output is correct
66 Correct 292 ms 13748 KB Output is correct
67 Correct 299 ms 13908 KB Output is correct
68 Correct 294 ms 13804 KB Output is correct
69 Correct 201 ms 13636 KB Output is correct
70 Correct 202 ms 13532 KB Output is correct
71 Correct 197 ms 13524 KB Output is correct
72 Correct 197 ms 13512 KB Output is correct
73 Correct 202 ms 13628 KB Output is correct
74 Correct 205 ms 13636 KB Output is correct
75 Correct 200 ms 13672 KB Output is correct
76 Correct 200 ms 13764 KB Output is correct
77 Correct 197 ms 13488 KB Output is correct
78 Correct 203 ms 13696 KB Output is correct
79 Correct 199 ms 13124 KB Output is correct
80 Correct 200 ms 13252 KB Output is correct