oj.uz

Submission #725325

# Submission time Handle Problem Language Result Execution time Memory
725325 2023-04-17T09:23:40 Z quiet_space Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 430 ms 112456 KB 
#include <queue>
#include <cstdio>
#include <cctype>
#include <vector>
#include <bitset>
#include <algorithm>
using namespace std;
#define FOR(i,j,k) for(int i=j; i<=k; ++i)
#define ROF(i,j,k) for(int i=j; i>=k; --i)
inline int read (void) {
  int x = 0, f = 1, ch = getchar();
  while(!isdigit(ch)) { if(ch == '-') f = -f; ch = getchar(); }
  while(isdigit(ch)) { x = x * 10 + ch - '0'; ch = getchar(); }
  return x * f;
}
const int maxn = 30005;
struct Node {
  int pos, fot, dis;
};
bitset <maxn> b[maxn];
vector <int> v[maxn];
queue <Node> q;
int d[maxn];
int main (void) {
  int n = read(), m = read(), p0 = -1, p1 = -1;
  FOR(i,1,m) {
    int x = read(), y = read();
    if(p0 == -1) p0 = x;
    else if(p1 == -1) p1 = x;
    v[x].push_back(y);
  }
  d[p0] = 1;
  for(auto&it:v[p0])
    if(!b[p0].test(it)) {
      b[p0].set(it);
      q.push((Node) {p0, it, 1});
    }
  while(!d[p1] && !q.empty()) {
    Node cur = q.front(); q.pop();
    int x = cur.pos, y = cur.fot, z = cur.dis;
    if(x - y >= 0 && !b[x-y].test(y)) {
      b[x-y].set(y);
      q.push((Node) {x-y, y, z+1});
      if(!d[x-y]) {
        d[x-y] = z+1;
        for(auto&it:v[x-y])
          if(!b[x-y].test(it)) {
            b[x-y].set(it);
            q.push((Node) {x-y, it, z+1});
          }
      }
    }
    if(x + y < n && !b[x+y].test(y)) {
      b[x+y].set(y);
      q.push((Node) {x+y, y, z+1});
      if(!d[x+y]) {
        d[x+y] = z+1;
        for(auto&it:v[x+y])
          if(!b[x+y].test(it)) {
            b[x+y].set(it);
            q.push((Node) {x+y, it, z+1});
          }
      }
    }
  }
  printf("%d\n", d[p1]-1);
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 1008 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 1000 KB Output is correct
7 Correct 1 ms 1004 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1000 KB Output is correct
3 Correct 1 ms 1004 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 1004 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1132 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 1236 KB Output is correct
13 Correct 1 ms 1392 KB Output is correct
14 Correct 1 ms 1364 KB Output is correct
15 Correct 1 ms 1364 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1004 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 1236 KB Output is correct
13 Correct 1 ms 1396 KB Output is correct
14 Correct 1 ms 1364 KB Output is correct
15 Correct 1 ms 1364 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 2 ms 3284 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 5 ms 8404 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 4 ms 6356 KB Output is correct
24 Correct 5 ms 7380 KB Output is correct
25 Correct 2 ms 2388 KB Output is correct
26 Correct 5 ms 7288 KB Output is correct
27 Correct 5 ms 7636 KB Output is correct
28 Correct 6 ms 8404 KB Output is correct
29 Correct 6 ms 8276 KB Output is correct
30 Correct 5 ms 8296 KB Output is correct
31 Correct 5 ms 8276 KB Output is correct
32 Correct 5 ms 8276 KB Output is correct
33 Correct 7 ms 8320 KB Output is correct
34 Correct 6 ms 8296 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 1004 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 1236 KB Output is correct
13 Correct 1 ms 1364 KB Output is correct
14 Correct 1 ms 1364 KB Output is correct
15 Correct 1 ms 1396 KB Output is correct
16 Correct 1 ms 1008 KB Output is correct
17 Correct 3 ms 3284 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 1012 KB Output is correct
20 Correct 5 ms 8312 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 4 ms 6356 KB Output is correct
24 Correct 5 ms 7412 KB Output is correct
25 Correct 2 ms 2388 KB Output is correct
26 Correct 5 ms 7284 KB Output is correct
27 Correct 5 ms 7636 KB Output is correct
28 Correct 6 ms 8440 KB Output is correct
29 Correct 6 ms 8304 KB Output is correct
30 Correct 6 ms 8276 KB Output is correct
31 Correct 6 ms 8292 KB Output is correct
32 Correct 5 ms 8276 KB Output is correct
33 Correct 7 ms 8308 KB Output is correct
34 Correct 6 ms 8304 KB Output is correct
35 Correct 7 ms 6900 KB Output is correct
36 Correct 2 ms 2004 KB Output is correct
37 Correct 5 ms 6004 KB Output is correct
38 Correct 7 ms 7764 KB Output is correct
39 Correct 3 ms 1560 KB Output is correct
40 Correct 4 ms 1660 KB Output is correct
41 Correct 5 ms 2900 KB Output is correct
42 Correct 6 ms 7636 KB Output is correct
43 Correct 6 ms 8052 KB Output is correct
44 Correct 7 ms 8692 KB Output is correct
45 Correct 16 ms 9108 KB Output is correct
46 Correct 10 ms 9068 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 1000 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 2 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 996 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 1236 KB Output is correct
13 Correct 1 ms 1364 KB Output is correct
14 Correct 1 ms 1364 KB Output is correct
15 Correct 1 ms 1396 KB Output is correct
16 Correct 1 ms 1008 KB Output is correct
17 Correct 2 ms 3324 KB Output is correct
18 Correct 1 ms 1016 KB Output is correct
19 Correct 1 ms 1000 KB Output is correct
20 Correct 5 ms 8404 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 4 ms 6356 KB Output is correct
24 Correct 5 ms 7384 KB Output is correct
25 Correct 2 ms 2420 KB Output is correct
26 Correct 5 ms 7252 KB Output is correct
27 Correct 5 ms 7676 KB Output is correct
28 Correct 6 ms 8360 KB Output is correct
29 Correct 7 ms 8276 KB Output is correct
30 Correct 5 ms 8304 KB Output is correct
31 Correct 5 ms 8276 KB Output is correct
32 Correct 5 ms 8276 KB Output is correct
33 Correct 7 ms 8308 KB Output is correct
34 Correct 6 ms 8312 KB Output is correct
35 Correct 6 ms 6868 KB Output is correct
36 Correct 2 ms 2004 KB Output is correct
37 Correct 5 ms 6004 KB Output is correct
38 Correct 7 ms 7800 KB Output is correct
39 Correct 4 ms 1528 KB Output is correct
40 Correct 3 ms 1656 KB Output is correct
41 Correct 4 ms 2808 KB Output is correct
42 Correct 5 ms 7636 KB Output is correct
43 Correct 7 ms 8056 KB Output is correct
44 Correct 6 ms 8740 KB Output is correct
45 Correct 14 ms 9064 KB Output is correct
46 Correct 12 ms 9044 KB Output is correct
47 Correct 10 ms 13288 KB Output is correct
48 Correct 4 ms 1620 KB Output is correct
49 Correct 4 ms 1620 KB Output is correct
50 Correct 3 ms 1492 KB Output is correct
51 Correct 49 ms 78736 KB Output is correct
52 Correct 58 ms 87756 KB Output is correct
53 Correct 15 ms 18772 KB Output is correct
54 Correct 33 ms 61244 KB Output is correct
55 Correct 46 ms 77928 KB Output is correct
56 Correct 66 ms 112356 KB Output is correct
57 Correct 2 ms 2516 KB Output is correct
58 Correct 62 ms 111600 KB Output is correct
59 Correct 60 ms 103868 KB Output is correct
60 Correct 59 ms 103888 KB Output is correct
61 Correct 56 ms 98848 KB Output is correct
62 Correct 90 ms 112456 KB Output is correct
63 Correct 133 ms 111988 KB Output is correct
64 Correct 162 ms 111820 KB Output is correct
65 Correct 216 ms 111912 KB Output is correct
66 Correct 430 ms 112052 KB Output is correct
67 Correct 221 ms 111904 KB Output is correct