답안 #695134

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
695134	2023-02-04T18:32:43 Z	NeroZein	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	10 / 100	11 ms	16436 KB

skyscraper

#include <bits/stdc++.h>
using namespace std; 

const int N = 2003;
const int M = 30004; 

int n, m;
int b[M];
int p[M];
int cost[N][N];

set<int> v[N];

inline void bfs() {
  queue<pair<int, int>> q;
  memset(cost, -1, sizeof cost);
  q.emplace(b[0], 0);
  cost[b[0]][p[0]] = 0; 
  while (!q.empty()) {
    auto src = q.front();
    q.pop();
    if (src.first == b[1]) {
      cout << src.second; 
      exit(0);
    }
    for (auto c : v[src.first]) {
      int l = src.first - c;
      int r = src.first + c;
      if (l >= 0 && cost[l][c] == -1) {
        cost[l][c] = src.second + 1; 
        q.emplace(l, cost[l][c]);
        v[l].insert(c);
      }
      if (r <= n && cost[r][c] == -1) {
        cost[r][c] = src.second + 1;
        q.emplace(r, cost[r][c]);
        v[r].insert(c);
      }
    }
  }
}

signed main() {
  cin >> n >> m;
  for (int i = 0; i < m; ++i) {
    cin >> b[i] >> p[i];
    v[b[i]].insert(p[i]);
  }
  bfs();
  cout << -1 << '\n';
  return 0; 
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	16084 KB	Output is correct
2	Correct	6 ms	16084 KB	Output is correct
3	Correct	6 ms	16084 KB	Output is correct
4	Correct	7 ms	16084 KB	Output is correct
5	Correct	6 ms	16084 KB	Output is correct
6	Correct	6 ms	16084 KB	Output is correct
7	Correct	6 ms	16084 KB	Output is correct

Subtask #2

0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	16084 KB	Output is correct
2	Correct	8 ms	16212 KB	Output is correct
3	Correct	7 ms	16084 KB	Output is correct
4	Correct	7 ms	15984 KB	Output is correct
5	Correct	6 ms	15996 KB	Output is correct
6	Correct	7 ms	16084 KB	Output is correct
7	Correct	7 ms	16084 KB	Output is correct
8	Correct	7 ms	15984 KB	Output is correct
9	Correct	7 ms	16084 KB	Output is correct
10	Correct	7 ms	16084 KB	Output is correct
11	Correct	8 ms	16084 KB	Output is correct
12	Correct	7 ms	16084 KB	Output is correct
13	Correct	7 ms	16084 KB	Output is correct
14	Incorrect	11 ms	16432 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #3

0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	16084 KB	Output is correct
2	Correct	7 ms	16084 KB	Output is correct
3	Correct	7 ms	16096 KB	Output is correct
4	Correct	7 ms	16084 KB	Output is correct
5	Correct	7 ms	16084 KB	Output is correct
6	Correct	7 ms	16084 KB	Output is correct
7	Correct	7 ms	16084 KB	Output is correct
8	Correct	7 ms	16096 KB	Output is correct
9	Correct	9 ms	16084 KB	Output is correct
10	Correct	7 ms	16048 KB	Output is correct
11	Correct	8 ms	16084 KB	Output is correct
12	Correct	7 ms	16064 KB	Output is correct
13	Correct	7 ms	16084 KB	Output is correct
14	Incorrect	11 ms	16340 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #4

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	16084 KB	Output is correct
2	Correct	9 ms	16084 KB	Output is correct
3	Correct	6 ms	16084 KB	Output is correct
4	Correct	9 ms	16084 KB	Output is correct
5	Correct	8 ms	16088 KB	Output is correct
6	Correct	7 ms	16084 KB	Output is correct
7	Correct	7 ms	16084 KB	Output is correct
8	Correct	7 ms	16036 KB	Output is correct
9	Correct	7 ms	16084 KB	Output is correct
10	Correct	7 ms	16116 KB	Output is correct
11	Correct	8 ms	16084 KB	Output is correct
12	Correct	7 ms	16084 KB	Output is correct
13	Correct	7 ms	16084 KB	Output is correct
14	Incorrect	11 ms	16436 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #5

0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	16036 KB	Output is correct
2	Correct	6 ms	16084 KB	Output is correct
3	Correct	6 ms	16084 KB	Output is correct
4	Correct	6 ms	16084 KB	Output is correct
5	Correct	7 ms	16088 KB	Output is correct
6	Correct	7 ms	16084 KB	Output is correct
7	Correct	7 ms	16084 KB	Output is correct
8	Correct	9 ms	16136 KB	Output is correct
9	Correct	7 ms	16084 KB	Output is correct
10	Correct	7 ms	16084 KB	Output is correct
11	Correct	9 ms	16084 KB	Output is correct
12	Correct	7 ms	16116 KB	Output is correct
13	Correct	8 ms	16084 KB	Output is correct
14	Incorrect	10 ms	16340 KB	Output isn't correct
15	Halted	0 ms	0 KB	-