oj.uz

답안 #604344

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
604344 2022-07-25T04:24:20 Z Plurm Event Hopping (BOI22_events) C++11
0 / 100
 1500 ms 101784 KB 
#include <bits/stdc++.h>
using namespace std;

vector<int> g[100005];
int dist[5005][5005];
int main() {
  memset(dist, 0x3F, sizeof(dist));
  int n, q;
  scanf("%d%d", &n, &q);
  vector<pair<int, int>> events;
  for (int i = 1; i <= n; i++) {
    int s, e;
    scanf("%d%d", &s, &e);
    events.push_back({s, e});
  }
  for (int i = 0; i < n; i++) {
    int mx = -1;
    int midx = -1;
    for (int j = 0; j < n; j++) {
      if (i == j)
        continue;
      if (events[j].first <= events[i].second &&
          events[i].second <= events[j].second) {
        if (events[j].second > mx) {
          mx = events[j].second;
          midx = j;
        }
      }
    }
    if (midx != -1)
      g[i].push_back(midx);
  }
  queue<int> pq;
  for (int i = 0; i < n; i++) {
    dist[i][i] = 0;
    pq.push(i);
    while (!pq.empty()) {
      int u = pq.front();
      pq.pop();
      for (int v : g[u]) {
        if (dist[i][v] > dist[i][u] + 1) {
          dist[i][v] = dist[i][u] + 1;
          pq.push(v);
        }
      }
    }
  }
  for (int i = 0; i < q; i++) {
    int s, e;
    scanf("%d%d", &s, &e);
    if (dist[s - 1][e - 1] > 1e9)
      printf("impossible\n");
    else
      printf("%d\n", dist[s - 1][e - 1]);
    // can e be reached by s?, if yes, what is the shortest path?
  }
  return 0;
}

Compilation message

events.cpp: In function 'int main()':
events.cpp:9:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |   scanf("%d%d", &n, &q);
      |   ~~~~~^~~~~~~~~~~~~~~~
events.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     scanf("%d%d", &s, &e);
      |     ~~~~~^~~~~~~~~~~~~~~~
events.cpp:50:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |     scanf("%d%d", &s, &e);
      |     ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 100592 KB Output is correct
2 Execution timed out 1591 ms 101716 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 100672 KB Output is correct
2 Correct 38 ms 100600 KB Output is correct
3 Correct 48 ms 100704 KB Output is correct
4 Correct 45 ms 100704 KB Output is correct
5 Incorrect 40 ms 100628 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 100672 KB Output is correct
2 Correct 38 ms 100600 KB Output is correct
3 Correct 48 ms 100704 KB Output is correct
4 Correct 45 ms 100704 KB Output is correct
5 Incorrect 40 ms 100628 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 100672 KB Output is correct
2 Correct 38 ms 100600 KB Output is correct
3 Correct 48 ms 100704 KB Output is correct
4 Correct 45 ms 100704 KB Output is correct
5 Incorrect 40 ms 100628 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1569 ms 101784 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 100592 KB Output is correct
2 Execution timed out 1591 ms 101716 KB Time limit exceeded
3 Halted 0 ms 0 KB -