oj.uz

답안 #1067384

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1067384 2024-08-20T16:11:11 Z juicy 버스 (JOI14_bus) C++17
85 / 100
 154 ms 25108 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

const int N = 1e5 + 5, M = 3e5 + 5, inf = 1e9;

int n, m, q;
int s[M], t[M], x[M], y[M], dp[M], best[N];

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

  cin >> n >> m;
  vector<array<int, 3>> events;
  for (int i = 1; i <= m; ++i) {
    cin >> s[i] >> t[i] >> x[i] >> y[i];
    events.push_back({x[i], i, 1});
    events.push_back({y[i], i, 0});
  }
  sort(events.begin(), events.end());
  fill(best + 1, best + n + 1, -inf);
  vector<array<int, 2>> cands;
  for (auto [_, i, type] : events) {
    if (!type) {
      best[t[i]] = max(best[t[i]], dp[i]);
      if (t[i] == n && dp[i] != -inf) {
        cands.push_back({y[i], dp[i]});
      } 
    } else {
      if (s[i] == 1) {
        dp[i] = x[i];
      } else {
        dp[i] = best[s[i]];
      }
    }
  }
  for (int i = 1; i < cands.size(); ++i) {
    cands[i][1] = max(cands[i][1], cands[i - 1][1]);
  }
  auto qry = [&](int x) {
    int it = lower_bound(cands.begin(), cands.end(), array<int, 2>{x, inf}) - cands.begin();
    return it == 0 ? -1 : cands[it - 1][1];
  };
  cin >> q;
  while (q--) {
    int x; cin >> x;
    cout << qry(x) << "\n";
  }
  return 0;
}

Compilation message

bus.cpp: In function 'int main()':
bus.cpp:43:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |   for (int i = 1; i < cands.size(); ++i) {
      |                   ~~^~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 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 504 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 0 ms 348 KB Output is correct
10 Correct 0 ms 348 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 2652 KB Output is correct
14 Correct 1 ms 600 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 14 ms 2184 KB Output is correct
3 Correct 14 ms 2136 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 10 ms 1116 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 24676 KB Output is correct
2 Correct 134 ms 24868 KB Output is correct
3 Correct 135 ms 25108 KB Output is correct
4 Correct 133 ms 24900 KB Output is correct
5 Correct 135 ms 25012 KB Output is correct
6 Correct 139 ms 25012 KB Output is correct
7 Correct 135 ms 24512 KB Output is correct
8 Correct 131 ms 24756 KB Output is correct
9 Correct 130 ms 24952 KB Output is correct
10 Correct 134 ms 23736 KB Output is correct
11 Correct 126 ms 23728 KB Output is correct
12 Correct 127 ms 23736 KB Output is correct
13 Correct 127 ms 23912 KB Output is correct
14 Correct 127 ms 23724 KB Output is correct
15 Correct 127 ms 23728 KB Output is correct
16 Correct 39 ms 8896 KB Output is correct
17 Correct 39 ms 8984 KB Output is correct

Subtask #4
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 148 ms 25016 KB Output is correct
2 Correct 141 ms 25056 KB Output is correct
3 Correct 143 ms 25016 KB Output is correct
4 Correct 142 ms 25012 KB Output is correct
5 Correct 143 ms 24896 KB Output is correct
6 Correct 142 ms 25020 KB Output is correct
7 Correct 142 ms 24500 KB Output is correct
8 Correct 147 ms 24980 KB Output is correct
9 Correct 144 ms 25008 KB Output is correct
10 Correct 142 ms 23732 KB Output is correct
11 Correct 154 ms 23724 KB Output is correct
12 Correct 140 ms 23776 KB Output is correct
13 Correct 139 ms 23736 KB Output is correct
14 Correct 140 ms 23908 KB Output is correct
15 Correct 139 ms 23728 KB Output is correct
16 Correct 49 ms 9656 KB Output is correct