oj.uz

답안 #853946

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
853946 2023-09-25T15:52:30 Z evenvalue 추월 (IOI23_overtaking) C++17
65 / 100
 3500 ms 30044 KB 
#include "overtaking.h"
#include <bits/stdc++.h>
using namespace std;

template<typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using max_heap = priority_queue<T, vector<T>, less<T>>;

using int64 = long long;
using ld = long double;

constexpr int kInf = 1e9 + 10;
constexpr int64 kInf64 = 1e15 + 10;
constexpr int kMod = 1e9 + 7;

struct Bus {
  int index;
  int64 depart; //the time taken by the bus to reach a checkpoint (aka the time it departs).
  int64 time; //the fastest time taken by the bus to travel 1km.

  bool operator<(const Bus &other) const {
    return (depart != other.depart ? depart < other.depart : time < other.time);
  }
};

struct Checkpoint {
  int stop; //distance from the airport
  vector<Bus> order; //order of buses coming into the checkpoint
};

int kLength;
int kBuses;
vector<Bus> buses;
int kCheckpoints;
vector<Checkpoint> checkpoints;
vector<vector<int>> position;
int64 kTime;

void init(int L, int N, vector<int64> T, vector<int> W, int X, int M, vector<int> S) {
  kLength = L;
  kTime = X;

  for (int i = 0, j = 0; i < N; i++) {
    if (W[i] <= X) continue;
    buses.push_back({j,T[i], W[i]});
    j++;
  }

  kBuses = buses.size();
  kCheckpoints = M;

  for (int i = 0; i < kCheckpoints; i++) {
    checkpoints.push_back({S[i]});
  }

  assert(checkpoints[0].stop == 0);

  for (int i = 0; i < kBuses; i++) {
    checkpoints[0].order.push_back(buses[i]);
  }
  sort(checkpoints[0].order.begin(), checkpoints[0].order.end());

  for (int i = 1; i < kCheckpoints; i++) {
    const int64 dist = checkpoints[i].stop - checkpoints[i - 1].stop;
    int64 prev = 0;
    for (const Bus &bus : checkpoints[i - 1].order) {
      const int64 reach = max(prev, dist * bus.time + bus.depart);
      checkpoints[i].order.push_back({bus.index, reach, bus.time});
      prev = reach;
    }
    sort(checkpoints[i].order.begin(), checkpoints[i].order.end());
  }

  position = vector<vector<int>>(kBuses, vector<int>(kCheckpoints));
  for (int i = 0; i < kCheckpoints; i++) {
    const vector<Bus> &order = checkpoints[i].order;
    for (int j = 0; j < kBuses; j++) {
      position[order[j].index][i] = j;
    }
  }

//  for (const Checkpoint &checkpoint : checkpoints) {
//    cout << checkpoint.stop << ":";
//    for (const Bus &bus : checkpoint.order) {
//      cout << " (" << bus.depart << ", " << bus.time << ")";
//    }
//    cout << '\n';
//  }
}

int binary_search(const vector<Bus> &order, const int64 time) {
  int lo = 0, hi = kBuses;
  while (lo < hi) {
    const int mid = (lo + hi) / 2;
    if (order[mid].depart >= time) {
      hi = mid;
    } else {
      lo = mid + 1;
    }
  }
  return lo;
}

int64 arrival_time(int64 Y) {
  int64 ans = Y;
  for (int i = 0; i < kCheckpoints - 1; i++) {
    const int dist = checkpoints[i + 1].stop - checkpoints[i].stop;
    const Checkpoint &checkpoint = checkpoints[i];
    int j = binary_search(checkpoint.order, ans);
    ans += dist * kTime;
    if (j != 0) {
      const int k = position[checkpoint.order[j - 1].index][i + 1];
      ans = max(ans, checkpoints[i + 1].order[k].depart);
    }
  }
  return ans;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 500 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 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 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 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 788 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 856 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 804 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 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 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 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 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 604 KB Output is correct

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 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 0 ms 344 KB Output is correct
6 Correct 1 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 4 ms 348 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 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 788 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 856 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 804 KB Output is correct
26 Correct 1 ms 604 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 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 600 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 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 91 ms 28460 KB Output is correct
49 Correct 264 ms 28816 KB Output is correct
50 Correct 257 ms 28496 KB Output is correct
51 Correct 269 ms 28756 KB Output is correct
52 Correct 259 ms 28596 KB Output is correct
53 Correct 260 ms 28704 KB Output is correct
54 Correct 263 ms 28632 KB Output is correct
55 Correct 89 ms 28496 KB Output is correct
56 Correct 267 ms 28496 KB Output is correct
57 Correct 266 ms 28592 KB Output is correct
58 Correct 266 ms 28604 KB Output is correct
59 Correct 274 ms 28600 KB Output is correct
60 Correct 264 ms 28536 KB Output is correct
61 Correct 267 ms 28500 KB Output is correct
62 Correct 16 ms 604 KB Output is correct
63 Correct 2 ms 600 KB Output is correct
64 Correct 301 ms 14428 KB Output is correct
65 Correct 248 ms 14424 KB Output is correct
66 Correct 660 ms 28500 KB Output is correct
67 Correct 705 ms 28496 KB Output is correct
68 Correct 694 ms 28948 KB Output is correct
69 Correct 418 ms 28752 KB Output is correct
70 Correct 396 ms 28592 KB Output is correct
71 Correct 408 ms 28600 KB Output is correct
72 Correct 395 ms 28592 KB Output is correct
73 Correct 389 ms 28592 KB Output is correct
74 Correct 406 ms 28600 KB Output is correct
75 Correct 8 ms 604 KB Output is correct
76 Correct 8 ms 604 KB Output is correct
77 Correct 8 ms 604 KB Output is correct
78 Correct 242 ms 28596 KB Output is correct

Subtask #5
0.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 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 0 ms 344 KB Output is correct
6 Correct 1 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 4 ms 348 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 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 500 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 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 788 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 856 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 804 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 604 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 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 600 KB Output is correct
52 Correct 1 ms 604 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 0 ms 344 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 1 ms 604 KB Output is correct
59 Correct 91 ms 28460 KB Output is correct
60 Correct 264 ms 28816 KB Output is correct
61 Correct 257 ms 28496 KB Output is correct
62 Correct 269 ms 28756 KB Output is correct
63 Correct 259 ms 28596 KB Output is correct
64 Correct 260 ms 28704 KB Output is correct
65 Correct 263 ms 28632 KB Output is correct
66 Correct 89 ms 28496 KB Output is correct
67 Correct 267 ms 28496 KB Output is correct
68 Correct 266 ms 28592 KB Output is correct
69 Correct 266 ms 28604 KB Output is correct
70 Correct 274 ms 28600 KB Output is correct
71 Correct 264 ms 28536 KB Output is correct
72 Correct 267 ms 28500 KB Output is correct
73 Correct 16 ms 604 KB Output is correct
74 Correct 2 ms 600 KB Output is correct
75 Correct 301 ms 14428 KB Output is correct
76 Correct 248 ms 14424 KB Output is correct
77 Correct 660 ms 28500 KB Output is correct
78 Correct 705 ms 28496 KB Output is correct
79 Correct 694 ms 28948 KB Output is correct
80 Correct 418 ms 28752 KB Output is correct
81 Correct 396 ms 28592 KB Output is correct
82 Correct 408 ms 28600 KB Output is correct
83 Correct 395 ms 28592 KB Output is correct
84 Correct 389 ms 28592 KB Output is correct
85 Correct 406 ms 28600 KB Output is correct
86 Correct 8 ms 604 KB Output is correct
87 Correct 8 ms 604 KB Output is correct
88 Correct 8 ms 604 KB Output is correct
89 Correct 242 ms 28596 KB Output is correct
90 Execution timed out 3548 ms 30044 KB Time limit exceeded
91 Halted 0 ms 0 KB -