oj.uz

Submission #699942

# Submission time Handle Problem Language Result Execution time Memory
699942 2023-02-18T11:23:03 Z Abrar_Al_Samit Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 81284 KB 
#include<bits/stdc++.h>
using namespace std;

const int nax = 3e4 + 3;
const int INF = 1e9;

int b[nax], p[nax];
vector<int>doges[nax];

unordered_map<long long,int>dist;

int get(int x, int y) {
  long long H = x * 10000000LL + y;
  if(dist.find(H)!=dist.end()) return dist[H];
  return INF;
}
void put(int x, int y, int val) {
  long long H = x * 10000000LL + y;
  dist[H] = val;
}
void PlayGround() {
  int n, m;
  cin>>n>>m;

  for(int i=0; i<m; ++i) {
    cin>>b[i]>>p[i];
    doges[b[i]].push_back(p[i]);
  }

  put(b[0], 0, 0);

  queue<tuple<int,int,int>>q;
  q.push({b[0], 0, 0});

  int lim = 30000 * 200;

  while(!q.empty()) {
    assert(dist.size()<lim);
    auto x = q.front();
    q.pop();
    int ss, j, d;
    tie(ss, j, d) = x;
    if(d!=get(ss, j)) continue;


    if(j==0) {
      for(int z : doges[ss]) {
        if(get(ss, z)>d) {
          put(ss, z, d);
          q.emplace(ss, z, d);
        }
      }
    } else {
      if(ss+j<n) {
        if(get(ss+j, j)>d+1) {
          put(ss+j, j, d+1);
          q.emplace(ss+j, j, d+1);
        }
        if(get(ss+j, 0)>d+1) {
          put(ss+j, 0, d+1);
          q.emplace(ss+j, 0, d+1);
        }
      }
      if(ss-j>=0) {
        if(get(ss-j, j)>d+1) {
          put(ss-j, j, d+1);
          q.emplace(ss-j, j, d+1);
        }
        if(get(ss-j, 0)>d+1) {
          put(ss-j, 0, d+1);
          q.emplace(ss-j, 0, d+1);
        }
      }
    }
  }
  int ans = get(b[1], 0);
  if(ans==INF) ans = -1;
  cout<<ans<<'\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  PlayGround();
  return 0;
}

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from skyscraper.cpp:1:
skyscraper.cpp: In function 'void PlayGround()':
skyscraper.cpp:38:23: warning: comparison of integer expressions of different signedness: 'std::unordered_map<long long int, int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   38 |     assert(dist.size()<lim);
      |            ~~~~~~~~~~~^~~~

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 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

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 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 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 2 ms 1236 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 2 ms 1348 KB Output is correct
15 Correct 2 ms 1348 KB Output is correct

Subtask #3
14.0 / 14.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 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 2 ms 1236 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 2 ms 1348 KB Output is correct
15 Correct 2 ms 1364 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 4 ms 1656 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 2 ms 1236 KB Output is correct
21 Correct 1 ms 1012 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 2 ms 1364 KB Output is correct
24 Correct 4 ms 1620 KB Output is correct
25 Correct 3 ms 1376 KB Output is correct
26 Correct 3 ms 1364 KB Output is correct
27 Correct 2 ms 1364 KB Output is correct
28 Correct 6 ms 2260 KB Output is correct
29 Correct 13 ms 3660 KB Output is correct
30 Correct 5 ms 1752 KB Output is correct
31 Correct 8 ms 2468 KB Output is correct
32 Correct 7 ms 2132 KB Output is correct
33 Correct 28 ms 6216 KB Output is correct
34 Correct 26 ms 6216 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 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 2 ms 1236 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 2 ms 1236 KB Output is correct
15 Correct 2 ms 1236 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 4 ms 1620 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 1 ms 1236 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 2 ms 1364 KB Output is correct
24 Correct 4 ms 1620 KB Output is correct
25 Correct 3 ms 1364 KB Output is correct
26 Correct 3 ms 1364 KB Output is correct
27 Correct 3 ms 1364 KB Output is correct
28 Correct 6 ms 2260 KB Output is correct
29 Correct 13 ms 3684 KB Output is correct
30 Correct 4 ms 1748 KB Output is correct
31 Correct 7 ms 2480 KB Output is correct
32 Correct 5 ms 2132 KB Output is correct
33 Correct 26 ms 6188 KB Output is correct
34 Correct 26 ms 6136 KB Output is correct
35 Correct 30 ms 6116 KB Output is correct
36 Correct 6 ms 1876 KB Output is correct
37 Correct 57 ms 10816 KB Output is correct
38 Correct 61 ms 8020 KB Output is correct
39 Correct 51 ms 7856 KB Output is correct
40 Correct 49 ms 7828 KB Output is correct
41 Correct 48 ms 7880 KB Output is correct
42 Correct 6 ms 1748 KB Output is correct
43 Correct 6 ms 1636 KB Output is correct
44 Correct 5 ms 1612 KB Output is correct
45 Correct 135 ms 22096 KB Output is correct
46 Correct 136 ms 22096 KB Output is correct

Subtask #5
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 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 936 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 2 ms 1236 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 2 ms 1236 KB Output is correct
15 Correct 2 ms 1236 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 5 ms 1620 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 2 ms 1236 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 3 ms 1364 KB Output is correct
24 Correct 4 ms 1620 KB Output is correct
25 Correct 3 ms 1364 KB Output is correct
26 Correct 3 ms 1364 KB Output is correct
27 Correct 2 ms 1364 KB Output is correct
28 Correct 8 ms 2260 KB Output is correct
29 Correct 12 ms 3632 KB Output is correct
30 Correct 4 ms 1748 KB Output is correct
31 Correct 7 ms 2480 KB Output is correct
32 Correct 7 ms 2116 KB Output is correct
33 Correct 28 ms 6216 KB Output is correct
34 Correct 34 ms 6208 KB Output is correct
35 Correct 31 ms 6072 KB Output is correct
36 Correct 5 ms 1876 KB Output is correct
37 Correct 56 ms 10752 KB Output is correct
38 Correct 47 ms 7868 KB Output is correct
39 Correct 45 ms 7820 KB Output is correct
40 Correct 50 ms 7872 KB Output is correct
41 Correct 47 ms 7804 KB Output is correct
42 Correct 6 ms 1748 KB Output is correct
43 Correct 6 ms 1748 KB Output is correct
44 Correct 5 ms 1620 KB Output is correct
45 Correct 138 ms 22220 KB Output is correct
46 Correct 137 ms 22128 KB Output is correct
47 Correct 445 ms 40692 KB Output is correct
48 Correct 5 ms 1620 KB Output is correct
49 Correct 5 ms 1632 KB Output is correct
50 Correct 4 ms 1492 KB Output is correct
51 Correct 137 ms 15408 KB Output is correct
52 Correct 246 ms 21092 KB Output is correct
53 Correct 28 ms 6956 KB Output is correct
54 Correct 4 ms 2224 KB Output is correct
55 Correct 7 ms 3248 KB Output is correct
56 Correct 14 ms 4704 KB Output is correct
57 Correct 188 ms 21052 KB Output is correct
58 Correct 23 ms 6052 KB Output is correct
59 Correct 31 ms 6616 KB Output is correct
60 Correct 36 ms 7544 KB Output is correct
61 Correct 32 ms 7080 KB Output is correct
62 Correct 214 ms 24032 KB Output is correct
63 Execution timed out 1084 ms 81284 KB Time limit exceeded
64 Halted 0 ms 0 KB -