oj.uz

답안 #957185

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
957185 2024-04-03T06:51:34 Z Vladth11 추월 (IOI23_overtaking) C++17
100 / 100
 3476 ms 1013900 KB 
#include <bits/stdc++.h>
#include "overtaking.h"

using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;

const int NMAX = 31000001;
const ll INF = 1e18;

const pii NEUTRU = {0, 0};

struct Node {
    /// max(x + a, b)
    int st, dr;
    ll maxi; /// basically asta e valoarea lui f(dr)
    pii lazy;
    ll eval(ll x) {
        return max(x + lazy.first, lazy.second);
    }
};

Node aint[NMAX];
int cnt;

pii combine(pii nou, pii a) {
    return {a.first + nou.first, max(a.second + nou.first, nou.second)};
}

void propaga(int node, ll st, ll dr) {
    if(node == -1 || aint[node].lazy == NEUTRU) return;
    if(st != dr) {
        if(aint[node].st == -1) {
            aint[node].st = cnt;
            aint[cnt++] = {-1, -1, (st + dr) >> 1, NEUTRU};
        }
        if(aint[node].dr == -1) {
            aint[node].dr = cnt;
            aint[cnt++] = {-1, -1, dr, NEUTRU};
        }
        aint[aint[node].st].lazy = combine(aint[node].lazy, aint[aint[node].st].lazy);
        aint[aint[node].dr].lazy = combine(aint[node].lazy, aint[aint[node].dr].lazy);
    }
    aint[node].maxi = aint[node].eval(aint[node].maxi);
    aint[node].lazy = NEUTRU;
}
void update(int node, ll st, ll dr, ll a, ll b, pii functie) {
    propaga(node, st, dr);
    if(a <= st && dr <= b) {
        aint[node].lazy = combine(functie, aint[node].lazy);
        return;
    }
    ll mid = (st + dr) >> 1;
    if(a <= mid) {
        if(aint[node].st == -1) {
            aint[node].st = cnt;
            aint[cnt++] = {-1, -1, mid, NEUTRU};
        }
        update(aint[node].st, st, mid, a, b, functie);
    }
    if(b > mid) {
        if(aint[node].dr == -1) {
            aint[node].dr = cnt;
            aint[cnt++] = {-1, -1, dr, NEUTRU};
        }
        update(aint[node].dr, mid + 1, dr, a, b, functie);
    }
    propaga(aint[node].dr, mid + 1, dr);
    if(aint[node].dr != -1)
        aint[node].maxi = aint[aint[node].dr].maxi;
    else
        aint[node].maxi = dr;
}

ll cb(int node, ll st, ll dr, ll val, pii acum) {
    acum = combine(acum, aint[node].lazy);
    if(st == dr) {
        return st;
    }
    ll mid = (st + dr) >> 1;
    ll maxist = max(acum.first + mid, acum.second);
    if(aint[node].st != -1) {
        pii atunci = combine(acum, aint[aint[node].st].lazy);
        maxist = max(atunci.first + aint[aint[node].st].maxi, atunci.second);
    }
    if(maxist > val) {
        if(aint[node].st == -1) {
          ll stanga = max(acum.second, acum.first + st);
          ll dreapta = max(acum.first + dr, acum.second);
          val++;
          if(val <= stanga) return st;
          if(val >= dreapta) return dr;
          return val - acum.first;
        }
        return cb(aint[node].st, st, mid, val, acum);
    }
    if(aint[node].dr == -1) {
             ll stanga = max(acum.second, acum.first + st);
          ll dreapta = max(acum.first + dr, acum.second);
          val++;
          if(val <= stanga) return st;
          if(val >= dreapta) return dr;
          return val - acum.first;
    }
    return cb(aint[node].dr, mid + 1, dr, val, acum);
}

ll query(int node, ll st, ll dr, ll nr, pii acum) {
  	acum = combine(acum, aint[node].lazy);
  	if(st == dr) {
      return max(acum.first + aint[node].maxi, acum.second);
    }
  	ll mid = (st + dr) >> 1;
    if(nr <= mid) {
    	if(aint[node].st == -1)
        	 return max(acum.first + nr, acum.second);
        return query(aint[node].st, st, mid, nr, acum);
    }
    if(aint[node].dr == -1)
    	return max(acum.first + nr, acum.second);
    return query(aint[node].dr, mid + 1, dr, nr, acum);
}

ll panaAcum[1001];

void init(int L, int N, std::vector<long long> T, std::vector<int> W, int X, int M, std::vector<int> S) {
    vector <int> indici;
    aint[cnt++] = {-1, -1, INF, NEUTRU};
    for(int i = 0; i < N; i++) {
        indici.push_back(i);
        panaAcum[i] = T[i];
    }
    sort(indici.begin(), indici.end(), [&W](const int &a, const int &b) {
        return W[a] > W[b];
    });
    while(indici.size() && W[indici.back()] <= X) {
        indici.pop_back();
    }
    for(int i = 1; i < M; i++) { /// de la 1
        //debug(i);
        sort(indici.begin(), indici.end(), [&W, &panaAcum](const int &a, const int &b) {
            return ((pii){panaAcum[a], W[a]} < (pii){panaAcum[b], W[b]});
        });
        ll maxim = 0;
        vector <ll> unde;
        for(int j = 0; j < indici.size(); j++) {
            unde.push_back(cb(0, 0, INF, panaAcum[indici[j]], NEUTRU));

        }
        update(0, 0, INF, 0, INF, {1LL * X * (S[i] - S[i - 1]), 0});
        for(int j = 0; j < indici.size(); j++) {
            panaAcum[indici[j]] += 1LL * W[indici[j]] * (S[i] - S[i - 1]);
            maxim = max(maxim, panaAcum[indici[j]]);
            panaAcum[indici[j]] = maxim;
            update(0, 0, INF, unde[j], INF, {0, maxim});

        }
    }
}

long long arrival_time(long long Y) {
    return query(0, 0, INF, Y, NEUTRU);
}

Compilation message

overtaking.cpp: In function 'void init(int, int, std::vector<long long int>, std::vector<int>, int, int, std::vector<int>)':
overtaking.cpp:141:50: warning: capture of variable 'panaAcum' with non-automatic storage duration
  141 |         sort(indici.begin(), indici.end(), [&W, &panaAcum](const int &a, const int &b) {
      |                                                  ^~~~~~~~
overtaking.cpp:124:4: note: 'll panaAcum [1001]' declared here
  124 | ll panaAcum[1001];
      |    ^~~~~~~~
overtaking.cpp:146:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  146 |         for(int j = 0; j < indici.size(); j++) {
      |                        ~~^~~~~~~~~~~~~~~
overtaking.cpp:151:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  151 |         for(int j = 0; j < indici.size(); j++) {
      |                        ~~^~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 263 ms 970820 KB Output is correct
2 Correct 261 ms 971092 KB Output is correct
3 Correct 277 ms 970836 KB Output is correct
4 Correct 265 ms 970836 KB Output is correct
5 Correct 262 ms 971092 KB Output is correct
6 Correct 262 ms 970964 KB Output is correct
7 Correct 266 ms 971060 KB Output is correct
8 Correct 286 ms 971140 KB Output is correct
9 Correct 262 ms 971088 KB Output is correct
10 Correct 291 ms 971376 KB Output is correct
11 Correct 260 ms 971016 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 261 ms 970856 KB Output is correct
2 Correct 260 ms 971048 KB Output is correct
3 Correct 263 ms 970896 KB Output is correct
4 Correct 265 ms 971028 KB Output is correct
5 Correct 263 ms 970872 KB Output is correct
6 Correct 263 ms 970952 KB Output is correct
7 Correct 261 ms 971088 KB Output is correct
8 Correct 261 ms 971072 KB Output is correct
9 Correct 285 ms 971084 KB Output is correct
10 Correct 263 ms 970944 KB Output is correct
11 Correct 269 ms 971180 KB Output is correct
12 Correct 264 ms 971096 KB Output is correct
13 Correct 260 ms 971124 KB Output is correct
14 Correct 277 ms 971060 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 318 ms 970836 KB Output is correct
2 Correct 263 ms 970820 KB Output is correct
3 Correct 261 ms 971092 KB Output is correct
4 Correct 277 ms 970836 KB Output is correct
5 Correct 265 ms 970836 KB Output is correct
6 Correct 261 ms 970856 KB Output is correct
7 Correct 260 ms 971048 KB Output is correct
8 Correct 263 ms 970896 KB Output is correct
9 Correct 285 ms 970844 KB Output is correct
10 Correct 285 ms 971088 KB Output is correct
11 Correct 275 ms 970836 KB Output is correct
12 Correct 275 ms 970908 KB Output is correct
13 Correct 275 ms 970836 KB Output is correct
14 Correct 287 ms 970992 KB Output is correct
15 Correct 278 ms 971284 KB Output is correct
16 Correct 281 ms 970840 KB Output is correct
17 Correct 280 ms 970924 KB Output is correct
18 Correct 276 ms 970900 KB Output is correct
19 Correct 275 ms 970924 KB Output is correct
20 Correct 273 ms 971048 KB Output is correct
21 Correct 269 ms 970836 KB Output is correct
22 Correct 269 ms 971108 KB Output is correct
23 Correct 276 ms 970868 KB Output is correct
24 Correct 278 ms 970976 KB Output is correct
25 Correct 278 ms 970844 KB Output is correct
26 Correct 275 ms 971012 KB Output is correct
27 Correct 277 ms 971056 KB Output is correct
28 Correct 295 ms 971052 KB Output is correct
29 Correct 272 ms 971096 KB Output is correct
30 Correct 273 ms 970836 KB Output is correct
31 Correct 274 ms 970832 KB Output is correct
32 Correct 285 ms 970832 KB Output is correct
33 Correct 275 ms 971064 KB Output is correct
34 Correct 276 ms 970936 KB Output is correct
35 Correct 306 ms 970908 KB Output is correct
36 Correct 276 ms 971236 KB Output is correct
37 Correct 275 ms 971060 KB Output is correct
38 Correct 258 ms 970868 KB Output is correct
39 Correct 261 ms 970836 KB Output is correct
40 Correct 277 ms 970840 KB Output is correct

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 318 ms 970836 KB Output is correct
2 Correct 263 ms 970820 KB Output is correct
3 Correct 261 ms 971092 KB Output is correct
4 Correct 277 ms 970836 KB Output is correct
5 Correct 265 ms 970836 KB Output is correct
6 Correct 262 ms 971092 KB Output is correct
7 Correct 262 ms 970964 KB Output is correct
8 Correct 266 ms 971060 KB Output is correct
9 Correct 286 ms 971140 KB Output is correct
10 Correct 262 ms 971088 KB Output is correct
11 Correct 291 ms 971376 KB Output is correct
12 Correct 260 ms 971016 KB Output is correct
13 Correct 261 ms 970856 KB Output is correct
14 Correct 260 ms 971048 KB Output is correct
15 Correct 263 ms 970896 KB Output is correct
16 Correct 285 ms 970844 KB Output is correct
17 Correct 285 ms 971088 KB Output is correct
18 Correct 275 ms 970836 KB Output is correct
19 Correct 275 ms 970908 KB Output is correct
20 Correct 275 ms 970836 KB Output is correct
21 Correct 287 ms 970992 KB Output is correct
22 Correct 278 ms 971284 KB Output is correct
23 Correct 281 ms 970840 KB Output is correct
24 Correct 280 ms 970924 KB Output is correct
25 Correct 276 ms 970900 KB Output is correct
26 Correct 275 ms 970924 KB Output is correct
27 Correct 273 ms 971048 KB Output is correct
28 Correct 269 ms 970836 KB Output is correct
29 Correct 269 ms 971108 KB Output is correct
30 Correct 276 ms 970868 KB Output is correct
31 Correct 278 ms 970976 KB Output is correct
32 Correct 278 ms 970844 KB Output is correct
33 Correct 275 ms 971012 KB Output is correct
34 Correct 277 ms 971056 KB Output is correct
35 Correct 295 ms 971052 KB Output is correct
36 Correct 272 ms 971096 KB Output is correct
37 Correct 273 ms 970836 KB Output is correct
38 Correct 274 ms 970832 KB Output is correct
39 Correct 285 ms 970832 KB Output is correct
40 Correct 275 ms 971064 KB Output is correct
41 Correct 276 ms 970936 KB Output is correct
42 Correct 306 ms 970908 KB Output is correct
43 Correct 276 ms 971236 KB Output is correct
44 Correct 275 ms 971060 KB Output is correct
45 Correct 258 ms 970868 KB Output is correct
46 Correct 261 ms 970836 KB Output is correct
47 Correct 277 ms 970840 KB Output is correct
48 Correct 1600 ms 971136 KB Output is correct
49 Correct 1743 ms 971216 KB Output is correct
50 Correct 1809 ms 971344 KB Output is correct
51 Correct 1763 ms 971220 KB Output is correct
52 Correct 2015 ms 971316 KB Output is correct
53 Correct 1988 ms 971224 KB Output is correct
54 Correct 1919 ms 971216 KB Output is correct
55 Correct 1441 ms 971164 KB Output is correct
56 Correct 1697 ms 971220 KB Output is correct
57 Correct 1677 ms 971228 KB Output is correct
58 Correct 1746 ms 971220 KB Output is correct
59 Correct 1693 ms 971272 KB Output is correct
60 Correct 1715 ms 971048 KB Output is correct
61 Correct 1724 ms 971216 KB Output is correct
62 Correct 319 ms 971248 KB Output is correct
63 Correct 328 ms 971252 KB Output is correct
64 Correct 990 ms 971180 KB Output is correct
65 Correct 973 ms 971212 KB Output is correct
66 Correct 1920 ms 971252 KB Output is correct
67 Correct 1705 ms 971300 KB Output is correct
68 Correct 1730 ms 971248 KB Output is correct
69 Correct 2009 ms 971224 KB Output is correct
70 Correct 2012 ms 971260 KB Output is correct
71 Correct 2011 ms 971220 KB Output is correct
72 Correct 2206 ms 971220 KB Output is correct
73 Correct 2063 ms 971132 KB Output is correct
74 Correct 2171 ms 971224 KB Output is correct
75 Correct 349 ms 971116 KB Output is correct
76 Correct 323 ms 971244 KB Output is correct
77 Correct 259 ms 971172 KB Output is correct
78 Correct 1774 ms 971188 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 318 ms 970836 KB Output is correct
2 Correct 263 ms 970820 KB Output is correct
3 Correct 261 ms 971092 KB Output is correct
4 Correct 277 ms 970836 KB Output is correct
5 Correct 265 ms 970836 KB Output is correct
6 Correct 262 ms 971092 KB Output is correct
7 Correct 262 ms 970964 KB Output is correct
8 Correct 266 ms 971060 KB Output is correct
9 Correct 286 ms 971140 KB Output is correct
10 Correct 262 ms 971088 KB Output is correct
11 Correct 291 ms 971376 KB Output is correct
12 Correct 260 ms 971016 KB Output is correct
13 Correct 261 ms 970856 KB Output is correct
14 Correct 260 ms 971048 KB Output is correct
15 Correct 263 ms 970896 KB Output is correct
16 Correct 265 ms 971028 KB Output is correct
17 Correct 263 ms 970872 KB Output is correct
18 Correct 263 ms 970952 KB Output is correct
19 Correct 261 ms 971088 KB Output is correct
20 Correct 261 ms 971072 KB Output is correct
21 Correct 285 ms 971084 KB Output is correct
22 Correct 263 ms 970944 KB Output is correct
23 Correct 269 ms 971180 KB Output is correct
24 Correct 264 ms 971096 KB Output is correct
25 Correct 260 ms 971124 KB Output is correct
26 Correct 277 ms 971060 KB Output is correct
27 Correct 285 ms 970844 KB Output is correct
28 Correct 285 ms 971088 KB Output is correct
29 Correct 275 ms 970836 KB Output is correct
30 Correct 275 ms 970908 KB Output is correct
31 Correct 275 ms 970836 KB Output is correct
32 Correct 287 ms 970992 KB Output is correct
33 Correct 278 ms 971284 KB Output is correct
34 Correct 281 ms 970840 KB Output is correct
35 Correct 280 ms 970924 KB Output is correct
36 Correct 276 ms 970900 KB Output is correct
37 Correct 275 ms 970924 KB Output is correct
38 Correct 273 ms 971048 KB Output is correct
39 Correct 269 ms 970836 KB Output is correct
40 Correct 269 ms 971108 KB Output is correct
41 Correct 276 ms 970868 KB Output is correct
42 Correct 278 ms 970976 KB Output is correct
43 Correct 278 ms 970844 KB Output is correct
44 Correct 275 ms 971012 KB Output is correct
45 Correct 277 ms 971056 KB Output is correct
46 Correct 295 ms 971052 KB Output is correct
47 Correct 272 ms 971096 KB Output is correct
48 Correct 273 ms 970836 KB Output is correct
49 Correct 274 ms 970832 KB Output is correct
50 Correct 285 ms 970832 KB Output is correct
51 Correct 275 ms 971064 KB Output is correct
52 Correct 276 ms 970936 KB Output is correct
53 Correct 306 ms 970908 KB Output is correct
54 Correct 276 ms 971236 KB Output is correct
55 Correct 275 ms 971060 KB Output is correct
56 Correct 258 ms 970868 KB Output is correct
57 Correct 261 ms 970836 KB Output is correct
58 Correct 277 ms 970840 KB Output is correct
59 Correct 1600 ms 971136 KB Output is correct
60 Correct 1743 ms 971216 KB Output is correct
61 Correct 1809 ms 971344 KB Output is correct
62 Correct 1763 ms 971220 KB Output is correct
63 Correct 2015 ms 971316 KB Output is correct
64 Correct 1988 ms 971224 KB Output is correct
65 Correct 1919 ms 971216 KB Output is correct
66 Correct 1441 ms 971164 KB Output is correct
67 Correct 1697 ms 971220 KB Output is correct
68 Correct 1677 ms 971228 KB Output is correct
69 Correct 1746 ms 971220 KB Output is correct
70 Correct 1693 ms 971272 KB Output is correct
71 Correct 1715 ms 971048 KB Output is correct
72 Correct 1724 ms 971216 KB Output is correct
73 Correct 319 ms 971248 KB Output is correct
74 Correct 328 ms 971252 KB Output is correct
75 Correct 990 ms 971180 KB Output is correct
76 Correct 973 ms 971212 KB Output is correct
77 Correct 1920 ms 971252 KB Output is correct
78 Correct 1705 ms 971300 KB Output is correct
79 Correct 1730 ms 971248 KB Output is correct
80 Correct 2009 ms 971224 KB Output is correct
81 Correct 2012 ms 971260 KB Output is correct
82 Correct 2011 ms 971220 KB Output is correct
83 Correct 2206 ms 971220 KB Output is correct
84 Correct 2063 ms 971132 KB Output is correct
85 Correct 2171 ms 971224 KB Output is correct
86 Correct 349 ms 971116 KB Output is correct
87 Correct 323 ms 971244 KB Output is correct
88 Correct 259 ms 971172 KB Output is correct
89 Correct 1774 ms 971188 KB Output is correct
90 Correct 1702 ms 974252 KB Output is correct
91 Correct 2210 ms 1006028 KB Output is correct
92 Correct 2212 ms 1005616 KB Output is correct
93 Correct 2132 ms 1006212 KB Output is correct
94 Correct 2152 ms 1005832 KB Output is correct
95 Correct 2136 ms 1006164 KB Output is correct
96 Correct 2159 ms 1006204 KB Output is correct
97 Correct 1482 ms 974296 KB Output is correct
98 Correct 2065 ms 1005792 KB Output is correct
99 Correct 2041 ms 1006980 KB Output is correct
100 Correct 2004 ms 1006072 KB Output is correct
101 Correct 2021 ms 1005632 KB Output is correct
102 Correct 2050 ms 1005760 KB Output is correct
103 Correct 2172 ms 1006068 KB Output is correct
104 Correct 1284 ms 1004000 KB Output is correct
105 Correct 1361 ms 1008096 KB Output is correct
106 Correct 2310 ms 1013496 KB Output is correct
107 Correct 2180 ms 1013732 KB Output is correct
108 Correct 2108 ms 1013836 KB Output is correct
109 Correct 2055 ms 1013628 KB Output is correct
110 Correct 2091 ms 1013900 KB Output is correct
111 Correct 2314 ms 1006168 KB Output is correct
112 Correct 2252 ms 1006220 KB Output is correct
113 Correct 2770 ms 1007588 KB Output is correct
114 Correct 3364 ms 1008560 KB Output is correct
115 Correct 2572 ms 1006560 KB Output is correct
116 Correct 2467 ms 1007248 KB Output is correct
117 Correct 493 ms 1009928 KB Output is correct
118 Correct 527 ms 1009844 KB Output is correct
119 Correct 537 ms 1007544 KB Output is correct
120 Correct 509 ms 1010496 KB Output is correct
121 Correct 517 ms 1011108 KB Output is correct
122 Correct 2247 ms 1000304 KB Output is correct
123 Correct 3355 ms 1007856 KB Output is correct
124 Correct 3445 ms 1008480 KB Output is correct
125 Correct 3476 ms 1008264 KB Output is correct