oj.uz

Submission #826637

# Submission time Handle Problem Language Result Execution time Memory
826637 2023-08-15T18:40:56 Z cig32 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 301 ms 262144 KB 
#include "bits/stdc++.h"
using namespace std;
#define double long double
const int MAXN = 13000000;
const int MOD = 1e9 + 7;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
  if(p==0) return 1 % MOD;
  int r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
int inv(int b) { 
  return bm(b, MOD-2);
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }
int n, m, s, nxt;
pair<int, int> cmds[MAXN];
int adj[MAXN];
int id;
int ps[MAXN];
int cur[MAXN];
void add_command(int u, int v) {
  cmds[id] = {u,v};
  ps[u]++;
  id++;
}
void construct(int b, int p) { 
  for(int j=b%p; j<n; j+=p) {
    if(j+p < n) add_command(nxt + j/p, (nxt + j/p + 1) * 2 + 1); //adj[nxt + j/p].push_back((nxt + j/p + 1) * 2 + 1);
    if(j-p >= 0) add_command(nxt + j/p, (nxt + j/p - 1) * 2 + 1); //adj[nxt + j/p].push_back((nxt + j/p - 1) * 2 + 1);
    add_command(nxt + j/p, j * 2); //adj[nxt + j/p].push_back(j * 2 + 0);
  }
  add_command(b, (nxt + b/p) * 2); //adj[b].push_back((nxt + b/p) * 2 + 0);
  for(int j=b%p; j<n; j+=p) {
    nxt++;
  }
}
void solve(int tc) {
  cin >> n >> m;
  s = sqrt(n);
  nxt = n;
  int st, en;
  int bruh[s+1][s];
  for(int i=1; i<=s; i++) {
    for(int j=0; j<i; j++) {
      bruh[i][j] = -1;
    }
  }
  for(int i=0; i<m; i++) {
    int b, p;
    cin >> b >> p;
    if(i == 0) st = b;
    if(i == 1) en = b;
    if(p <= s && bruh[p][b%p] == -1) {
      bruh[p][b%p] = nxt;
      construct(b, p);
    }
    else if(p > s) {
      construct(b, p);
    }
    else {
      add_command(b, (bruh[p][b%p] + b/p) * 2);
      //adj[b].push_back((bruh[p][b%p] + b/p) * 2 + 0);
    }
  }
  for(int i=1; i<MAXN; i++) ps[i]+=ps[i-1];
  for(int i=0; i<MAXN; i++) cur[i]=ps[i]-1;
  for(int i=0; i<id; i++) {
    int u = cmds[i].first, v = cmds[i].second;
    adj[cur[u]] = v;
    cur[u]--;
  }
  int k = nxt;
  int dist[k];
  bool vis[k];
  for(int i=0; i<k; i++) dist[i] = 1e9, vis[i] = 0;
  dist[st] = 0;
  deque<int> dq;
  dq.push_back(st);
  while(dq.size()) {
    int f = dq.front();
    dq.pop_front();
    if(!vis[f]) {
      vis[f] = 1;
      int l, r;
      if(f==0) l=0, r=ps[0]-1;
      else l=ps[f-1], r=ps[f]-1;
      for(int y=l; y<=r; y++) {
        int x = adj[y];
        if(!vis[x / 2] && dist[x / 2] > dist[f] + (x % 2)) {
          dist[x / 2] = dist[f] + (x % 2);
          if(x % 2 == 0) dq.push_front(x / 2);
          else dq.push_back(x / 2);
        }
      }
    }
  }
  cout<<(dist[en]==1e9?-1:dist[en])<<"\n";
}
int32_t main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
// 勿忘初衷

Compilation message

skyscraper.cpp: In function 'void solve(int)':
skyscraper.cpp:105:17: warning: 'en' may be used uninitialized in this function [-Wmaybe-uninitialized]
  105 |   cout<<(dist[en]==1e9?-1:dist[en])<<"\n";
      |          ~~~~~~~^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 102056 KB Output is correct
2 Correct 68 ms 102076 KB Output is correct
3 Correct 70 ms 102056 KB Output is correct
4 Correct 69 ms 102028 KB Output is correct
5 Correct 71 ms 102036 KB Output is correct
6 Correct 71 ms 102020 KB Output is correct
7 Correct 76 ms 102004 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 101964 KB Output is correct
2 Correct 70 ms 102044 KB Output is correct
3 Correct 72 ms 102068 KB Output is correct
4 Correct 72 ms 102064 KB Output is correct
5 Correct 71 ms 101964 KB Output is correct
6 Correct 71 ms 101964 KB Output is correct
7 Correct 71 ms 101988 KB Output is correct
8 Correct 73 ms 101960 KB Output is correct
9 Correct 72 ms 101972 KB Output is correct
10 Correct 81 ms 102044 KB Output is correct
11 Correct 72 ms 102204 KB Output is correct
12 Correct 74 ms 102092 KB Output is correct
13 Correct 71 ms 102092 KB Output is correct
14 Correct 72 ms 102208 KB Output is correct
15 Correct 72 ms 102268 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 101988 KB Output is correct
2 Correct 72 ms 101996 KB Output is correct
3 Correct 72 ms 101992 KB Output is correct
4 Correct 71 ms 101964 KB Output is correct
5 Correct 70 ms 102056 KB Output is correct
6 Correct 74 ms 101992 KB Output is correct
7 Correct 72 ms 102028 KB Output is correct
8 Correct 70 ms 102068 KB Output is correct
9 Correct 71 ms 101972 KB Output is correct
10 Correct 82 ms 102044 KB Output is correct
11 Correct 73 ms 102284 KB Output is correct
12 Correct 72 ms 102072 KB Output is correct
13 Correct 71 ms 102104 KB Output is correct
14 Correct 71 ms 102304 KB Output is correct
15 Correct 71 ms 102300 KB Output is correct
16 Correct 80 ms 102220 KB Output is correct
17 Correct 75 ms 102552 KB Output is correct
18 Correct 71 ms 102348 KB Output is correct
19 Correct 71 ms 102248 KB Output is correct
20 Correct 70 ms 102096 KB Output is correct
21 Correct 71 ms 102100 KB Output is correct
22 Correct 70 ms 102244 KB Output is correct
23 Correct 70 ms 102276 KB Output is correct
24 Correct 73 ms 102552 KB Output is correct
25 Correct 73 ms 102372 KB Output is correct
26 Correct 72 ms 102348 KB Output is correct
27 Correct 71 ms 102292 KB Output is correct
28 Correct 71 ms 102860 KB Output is correct
29 Correct 73 ms 104500 KB Output is correct
30 Correct 71 ms 102760 KB Output is correct
31 Correct 72 ms 103364 KB Output is correct
32 Correct 71 ms 103020 KB Output is correct
33 Correct 75 ms 106888 KB Output is correct
34 Correct 76 ms 106856 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 102024 KB Output is correct
2 Correct 74 ms 102132 KB Output is correct
3 Correct 70 ms 101964 KB Output is correct
4 Correct 72 ms 101956 KB Output is correct
5 Correct 73 ms 101960 KB Output is correct
6 Correct 70 ms 102000 KB Output is correct
7 Correct 71 ms 102068 KB Output is correct
8 Correct 71 ms 102084 KB Output is correct
9 Correct 74 ms 102040 KB Output is correct
10 Correct 80 ms 102040 KB Output is correct
11 Correct 72 ms 102220 KB Output is correct
12 Correct 71 ms 102080 KB Output is correct
13 Correct 73 ms 102020 KB Output is correct
14 Correct 73 ms 102276 KB Output is correct
15 Correct 71 ms 102312 KB Output is correct
16 Correct 71 ms 102220 KB Output is correct
17 Correct 74 ms 102580 KB Output is correct
18 Correct 73 ms 102340 KB Output is correct
19 Correct 71 ms 102184 KB Output is correct
20 Correct 71 ms 102124 KB Output is correct
21 Correct 73 ms 102168 KB Output is correct
22 Correct 71 ms 102316 KB Output is correct
23 Correct 71 ms 102220 KB Output is correct
24 Correct 71 ms 102512 KB Output is correct
25 Correct 71 ms 102284 KB Output is correct
26 Correct 72 ms 102456 KB Output is correct
27 Correct 71 ms 102256 KB Output is correct
28 Correct 71 ms 102952 KB Output is correct
29 Correct 73 ms 104528 KB Output is correct
30 Correct 71 ms 102708 KB Output is correct
31 Correct 79 ms 103464 KB Output is correct
32 Correct 72 ms 103036 KB Output is correct
33 Correct 76 ms 106828 KB Output is correct
34 Correct 76 ms 106884 KB Output is correct
35 Correct 84 ms 106048 KB Output is correct
36 Correct 72 ms 102640 KB Output is correct
37 Correct 84 ms 109132 KB Output is correct
38 Correct 87 ms 108580 KB Output is correct
39 Correct 85 ms 108480 KB Output is correct
40 Correct 85 ms 108492 KB Output is correct
41 Correct 83 ms 108428 KB Output is correct
42 Correct 74 ms 102784 KB Output is correct
43 Correct 81 ms 102716 KB Output is correct
44 Correct 74 ms 102476 KB Output is correct
45 Correct 102 ms 121152 KB Output is correct
46 Correct 101 ms 121036 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 101980 KB Output is correct
2 Correct 73 ms 101964 KB Output is correct
3 Correct 70 ms 102072 KB Output is correct
4 Correct 70 ms 102072 KB Output is correct
5 Correct 71 ms 101960 KB Output is correct
6 Correct 71 ms 102060 KB Output is correct
7 Correct 79 ms 102084 KB Output is correct
8 Correct 73 ms 101992 KB Output is correct
9 Correct 71 ms 101964 KB Output is correct
10 Correct 71 ms 102120 KB Output is correct
11 Correct 71 ms 102256 KB Output is correct
12 Correct 77 ms 102072 KB Output is correct
13 Correct 73 ms 102040 KB Output is correct
14 Correct 71 ms 102236 KB Output is correct
15 Correct 71 ms 102208 KB Output is correct
16 Correct 81 ms 102144 KB Output is correct
17 Correct 74 ms 102604 KB Output is correct
18 Correct 71 ms 102228 KB Output is correct
19 Correct 79 ms 102236 KB Output is correct
20 Correct 74 ms 102288 KB Output is correct
21 Correct 70 ms 102060 KB Output is correct
22 Correct 72 ms 102296 KB Output is correct
23 Correct 73 ms 102220 KB Output is correct
24 Correct 73 ms 102560 KB Output is correct
25 Correct 71 ms 102348 KB Output is correct
26 Correct 74 ms 102576 KB Output is correct
27 Correct 79 ms 102356 KB Output is correct
28 Correct 73 ms 102860 KB Output is correct
29 Correct 73 ms 104444 KB Output is correct
30 Correct 72 ms 102664 KB Output is correct
31 Correct 71 ms 103348 KB Output is correct
32 Correct 71 ms 103024 KB Output is correct
33 Correct 76 ms 106828 KB Output is correct
34 Correct 76 ms 106832 KB Output is correct
35 Correct 79 ms 106064 KB Output is correct
36 Correct 79 ms 102760 KB Output is correct
37 Correct 82 ms 109148 KB Output is correct
38 Correct 88 ms 108396 KB Output is correct
39 Correct 83 ms 108436 KB Output is correct
40 Correct 83 ms 108484 KB Output is correct
41 Correct 84 ms 108468 KB Output is correct
42 Correct 74 ms 102732 KB Output is correct
43 Correct 74 ms 102672 KB Output is correct
44 Correct 74 ms 102444 KB Output is correct
45 Correct 101 ms 121136 KB Output is correct
46 Correct 101 ms 121076 KB Output is correct
47 Correct 123 ms 131748 KB Output is correct
48 Correct 81 ms 111376 KB Output is correct
49 Correct 78 ms 107804 KB Output is correct
50 Correct 84 ms 107980 KB Output is correct
51 Correct 92 ms 114732 KB Output is correct
52 Correct 94 ms 115860 KB Output is correct
53 Correct 82 ms 105524 KB Output is correct
54 Correct 72 ms 103420 KB Output is correct
55 Correct 73 ms 104508 KB Output is correct
56 Correct 76 ms 103784 KB Output is correct
57 Correct 96 ms 119648 KB Output is correct
58 Correct 76 ms 105364 KB Output is correct
59 Correct 80 ms 106564 KB Output is correct
60 Correct 80 ms 108120 KB Output is correct
61 Correct 82 ms 107044 KB Output is correct
62 Correct 101 ms 121692 KB Output is correct
63 Correct 240 ms 193512 KB Output is correct
64 Correct 301 ms 214488 KB Output is correct
65 Runtime error 186 ms 262144 KB Execution killed with signal 9
66 Halted 0 ms 0 KB -