oj.uz

Submission #848492

# Submission time Handle Problem Language Result Execution time Memory
848492 2023-09-12T19:13:11 Z Rifal Overtaking (IOI23_overtaking) C++17
65 / 100
 3500 ms 19028 KB 
#include "overtaking.h"
#include<bits/stdc++.h>
using namespace std;
const int Max = 1e3 + 5;
vector<long long> sta;
vector<pair<long long, long long>> bus;
vector<long long> v[Max], Mx[Max];
long long n, m, x;
void init(int L, int N, std::vector<long long> T, std::vector<int> W, int X, int M, std::vector<int> S)
{
    n = N, m = M; x = X;
    for(int i = 0; i < M; i++) sta.push_back(S[i]);
    for(int i = 0; i < N; i++) bus.push_back({T[i],W[i]});
    bus.push_back({-1,X});
    int siz = bus.size();
    long long cur[siz-1];
    for(int i = 0; i < siz-1; i++) {
        cur[i] = bus[i].first;
    }
    for(int i = 1; i < m; i++) {
        priority_queue<pair<pair<long long, long long>,int>, vector<pair<pair<long long,long long>,int>>, greater<pair<pair<long long, long long>,int>>> pq;
        pair<long long, long long> mx = {-1,-1};
        for(int j = 0; j < siz-1; j++) {
        //    cout << cur[j] << ' ' << bus[j].second << ' ' << sta[i] << ' ' << sta[i-1] << ' ' << j << endl;
            pq.push({{cur[j],cur[j] + bus[j].second * (sta[i]-sta[i-1])},j});
        }
        vector<long long> exp;
        while(!pq.empty()) {
            pair<pair<long long, long long>,int> tp = pq.top(); pq.pop();
            v[i].push_back(tp.first.first); exp.push_back(tp.first.second);
            if(mx.first < tp.first.second) {
                mx.first = tp.first.second;
                mx.second = tp.first.first;
            }
            if(mx.second == tp.first.first) {
                cur[tp.second] = tp.first.second;
            }
            else {
                cur[tp.second] = mx.first;
            }
 
        }
        long long mx2 = 0;
        for(int j = 0; j < exp.size(); j++) {
            mx2 = max(mx2,exp[j]);
            Mx[i].push_back(mx2);
        }
    }
}
 
long long arrival_time(long long Y)
{
    long long now = Y;
    for(int i = 1; i < m; i++) {
     /*   cout << "KKKKKKKKKKKKKKKK" << endl;
        for(int j = 0; j < v[i].size(); j++)  {
            cout << v[i][j] << ' ';
        }cout << endl;
        for(int j = 0; j < Mx[i].size(); j++)  {
            cout << Mx[i][j] << ' ';
        }cout << endl;
        cout << "KKKKKKKKKKKKK" << endl;*/
        int j = lower_bound(v[i].begin(),v[i].end(),now)-v[i].begin();
        if(j == 0) {
         ///   cout << '1' << ' ' << now << endl;
            now += x * (sta[i]-sta[i-1]);
        }
        else {
         ///   cout << '2' << ' ' << now << ' ' << Mx[i][j-1] << endl;
            now = max(now+x * (sta[i]-sta[i-1]),Mx[i][j-1]);
        }
 
    }
    return now;
}
/*
6 4 10 4 2
20 10 40 0
5 20 20 30
0 1 3 6
0
50*/

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:44:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |         for(int j = 0; j < exp.size(); j++) {
      |                        ~~^~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 2 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 3 ms 572 KB Output is correct
10 Correct 3 ms 568 KB Output is correct
11 Correct 4 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 484 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 2 ms 600 KB Output is correct
14 Correct 1 ms 344 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 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 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 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 600 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 640 KB Output is correct
20 Correct 1 ms 604 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 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 600 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 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 600 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 600 KB Output is correct
39 Correct 1 ms 604 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 1 ms 344 KB Output is correct
2 Correct 1 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 3 ms 572 KB Output is correct
11 Correct 3 ms 568 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 1 ms 348 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 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 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 640 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 600 KB Output is correct
33 Correct 1 ms 600 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 604 KB Output is correct
41 Correct 1 ms 600 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 600 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 600 KB Output is correct
48 Correct 142 ms 17492 KB Output is correct
49 Correct 255 ms 17668 KB Output is correct
50 Correct 247 ms 17748 KB Output is correct
51 Correct 248 ms 17668 KB Output is correct
52 Correct 254 ms 17492 KB Output is correct
53 Correct 257 ms 17492 KB Output is correct
54 Correct 247 ms 17664 KB Output is correct
55 Correct 144 ms 17376 KB Output is correct
56 Correct 253 ms 17664 KB Output is correct
57 Correct 253 ms 17672 KB Output is correct
58 Correct 249 ms 17856 KB Output is correct
59 Correct 260 ms 17492 KB Output is correct
60 Correct 241 ms 17596 KB Output is correct
61 Correct 250 ms 17868 KB Output is correct
62 Correct 17 ms 600 KB Output is correct
63 Correct 2 ms 604 KB Output is correct
64 Correct 253 ms 9124 KB Output is correct
65 Correct 213 ms 9340 KB Output is correct
66 Correct 490 ms 17672 KB Output is correct
67 Correct 503 ms 17744 KB Output is correct
68 Correct 472 ms 17748 KB Output is correct
69 Correct 335 ms 17488 KB Output is correct
70 Correct 317 ms 17488 KB Output is correct
71 Correct 331 ms 17636 KB Output is correct
72 Correct 335 ms 17660 KB Output is correct
73 Correct 394 ms 17496 KB Output is correct
74 Correct 351 ms 17488 KB Output is correct
75 Correct 440 ms 17648 KB Output is correct
76 Correct 437 ms 17764 KB Output is correct
77 Correct 516 ms 17668 KB Output is correct
78 Correct 265 ms 17668 KB Output is correct

Subtask #5
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 3 ms 572 KB Output is correct
11 Correct 3 ms 568 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 1 ms 348 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 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 484 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 600 KB Output is correct
26 Correct 1 ms 344 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 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 600 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 640 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 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 600 KB Output is correct
44 Correct 1 ms 600 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 1 ms 604 KB Output is correct
51 Correct 1 ms 604 KB Output is correct
52 Correct 1 ms 600 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 600 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 1 ms 600 KB Output is correct
59 Correct 142 ms 17492 KB Output is correct
60 Correct 255 ms 17668 KB Output is correct
61 Correct 247 ms 17748 KB Output is correct
62 Correct 248 ms 17668 KB Output is correct
63 Correct 254 ms 17492 KB Output is correct
64 Correct 257 ms 17492 KB Output is correct
65 Correct 247 ms 17664 KB Output is correct
66 Correct 144 ms 17376 KB Output is correct
67 Correct 253 ms 17664 KB Output is correct
68 Correct 253 ms 17672 KB Output is correct
69 Correct 249 ms 17856 KB Output is correct
70 Correct 260 ms 17492 KB Output is correct
71 Correct 241 ms 17596 KB Output is correct
72 Correct 250 ms 17868 KB Output is correct
73 Correct 17 ms 600 KB Output is correct
74 Correct 2 ms 604 KB Output is correct
75 Correct 253 ms 9124 KB Output is correct
76 Correct 213 ms 9340 KB Output is correct
77 Correct 490 ms 17672 KB Output is correct
78 Correct 503 ms 17744 KB Output is correct
79 Correct 472 ms 17748 KB Output is correct
80 Correct 335 ms 17488 KB Output is correct
81 Correct 317 ms 17488 KB Output is correct
82 Correct 331 ms 17636 KB Output is correct
83 Correct 335 ms 17660 KB Output is correct
84 Correct 394 ms 17496 KB Output is correct
85 Correct 351 ms 17488 KB Output is correct
86 Correct 440 ms 17648 KB Output is correct
87 Correct 437 ms 17764 KB Output is correct
88 Correct 516 ms 17668 KB Output is correct
89 Correct 265 ms 17668 KB Output is correct
90 Execution timed out 3540 ms 19028 KB Time limit exceeded
91 Halted 0 ms 0 KB -