oj.uz

답안 #612455

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

vector<short> g[100005];
vector<short> rg[100005];
short dist[5005][5005];
short fastqueue[8 * 1048576];
int hidx = 0;
int tidx = 0;
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++) {
    vector<int> tmp;
    for (int j = 0; j < n; j++) {
      if (i == j)
        continue;
      if (events[j].first <= events[i].second &&
          events[i].second <= events[j].second) {
        g[i].push_back((short)j);
        rg[j].push_back((short)i);
      }
    }
    if (!g[i].empty()) {
      sort(g[i].begin(), g[i].end(), [&events](int x, int y) {
        return events[x].second < events[y].second;
      });
      int x = g[i].back();
      g[i].clear();
      g[i].push_back(x);
    }
  }
  for (int i = 0; i < n; i++) {
    if (!rg[i].empty()) {
      sort(rg[i].begin(), rg[i].end(), [&events](int x, int y) {
        return events[x].second < events[y].second;
      });
      int x = rg[i].front();
      rg[i].clear();
      g[x].push_back(i);
    }
  }
  for (int i = 0; i < n; i++) {
    dist[i][i] = 0;
    fastqueue[tidx++] = i;
    while (hidx != tidx) {
      short u = fastqueue[hidx++];
      for (short v : g[u]) {
        if (dist[i][v] > dist[i][u] + 1) {
          dist[i][v] = dist[i][u] + 1;
          fastqueue[tidx++] = v;
        }
      }
    }
  }
  for (int i = 0; i < q; i++) {
    int s, e;
    scanf("%d%d", &s, &e);
    if (dist[s - 1][e - 1] > n)
      printf("impossible\n");
    else
      printf("%hd\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:13:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |   scanf("%d%d", &n, &q);
      |   ~~~~~^~~~~~~~~~~~~~~~
events.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |     scanf("%d%d", &s, &e);
      |     ~~~~~^~~~~~~~~~~~~~~~
events.cpp:65:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     scanf("%d%d", &s, &e);
      |     ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 53972 KB Output is correct
2 Execution timed out 1565 ms 57164 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 54012 KB Output is correct
2 Correct 21 ms 54028 KB Output is correct
3 Correct 33 ms 55028 KB Output is correct
4 Correct 31 ms 54532 KB Output is correct
5 Correct 32 ms 54964 KB Output is correct
6 Incorrect 41 ms 54780 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 54012 KB Output is correct
2 Correct 21 ms 54028 KB Output is correct
3 Correct 33 ms 55028 KB Output is correct
4 Correct 31 ms 54532 KB Output is correct
5 Correct 32 ms 54964 KB Output is correct
6 Incorrect 41 ms 54780 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 54012 KB Output is correct
2 Correct 21 ms 54028 KB Output is correct
3 Correct 33 ms 55028 KB Output is correct
4 Correct 31 ms 54532 KB Output is correct
5 Correct 32 ms 54964 KB Output is correct
6 Incorrect 41 ms 54780 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 53972 KB Output is correct
2 Execution timed out 1565 ms 57164 KB Time limit exceeded
3 Halted 0 ms 0 KB -