oj.uz

Submission #826657

# Submission time Handle Problem Language Result Execution time Memory
826657 2023-08-15T19:08:52 Z cig32 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 400 ms 262144 KB 
#include "bits/stdc++.h"
using namespace std;
#define double long double
const int MAXN = 14000000;
const int MAXN2 = 10400000;
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[MAXN2];
short cur[MAXN2];
int dq[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 = ceil(sqrt(n));
  nxt = n;
  int st, en;
  unordered_map<int, int> bruh[30001];
  for(int i=0; i<m; i++) {
    int b, p;
    cin >> b >> p;
    if(i == 0) st = b;
    if(i == 1) en = b;
    if(!bruh[p].count(b%p)) {
      bruh[p][b%p] = nxt;
      construct(b, p);
    }
    else {
      add_command(b, (bruh[p][b%p] + b/p) * 2);
    }
  }
  for(int i=1; i<MAXN2; i++) ps[i]+=ps[i-1];
  for(int i=0; i<MAXN2; i++) cur[i]=0;
  for(int i=0; i<id; i++) {
    int u = cmds[i].first, v = cmds[i].second;
    adj[cur[u]+(u==0?0:ps[u-1])] = v;
    cur[u]++;
  }
  int k = nxt;
  int dist[k];
  bitset<MAXN2> vis;
  //bool vis[k];
  for(int i=0; i<k; i++) dist[i] = 1e9, vis[i] = 0;
  dist[st] = 0;
  int head=0, tail=1;
  dq[0]=st;
  while(head!=tail) {
    int f = dq[head];
    head=(head+1)%MAXN;
    if(!vis[f]) {
      vis[f] = 1;
      if(f==en)break;
      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) {
            head=(head+MAXN-1)%MAXN;
            dq[head]=x/2;
          }
          else dq[tail++]=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:80:8: warning: 'st' may be used uninitialized in this function [-Wmaybe-uninitialized]
   80 |   dq[0]=st;
      |   ~~~~~^~~
skyscraper.cpp:86:7: warning: 'en' may be used uninitialized in this function [-Wmaybe-uninitialized]
   86 |       if(f==en)break;
      |       ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 64200 KB Output is correct
2 Correct 49 ms 64256 KB Output is correct
3 Correct 47 ms 64212 KB Output is correct
4 Correct 49 ms 64276 KB Output is correct
5 Correct 50 ms 64212 KB Output is correct
6 Correct 48 ms 64424 KB Output is correct
7 Correct 47 ms 64204 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 64216 KB Output is correct
2 Correct 46 ms 64184 KB Output is correct
3 Correct 45 ms 64228 KB Output is correct
4 Correct 47 ms 64232 KB Output is correct
5 Correct 49 ms 64200 KB Output is correct
6 Correct 46 ms 64236 KB Output is correct
7 Correct 52 ms 64216 KB Output is correct
8 Correct 48 ms 64268 KB Output is correct
9 Correct 47 ms 64244 KB Output is correct
10 Correct 46 ms 64324 KB Output is correct
11 Correct 46 ms 64484 KB Output is correct
12 Correct 46 ms 64300 KB Output is correct
13 Correct 46 ms 64304 KB Output is correct
14 Correct 49 ms 64600 KB Output is correct
15 Correct 47 ms 64520 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 64228 KB Output is correct
2 Correct 46 ms 64204 KB Output is correct
3 Correct 45 ms 64208 KB Output is correct
4 Correct 48 ms 64180 KB Output is correct
5 Correct 47 ms 64212 KB Output is correct
6 Correct 45 ms 64228 KB Output is correct
7 Correct 50 ms 64204 KB Output is correct
8 Correct 47 ms 64228 KB Output is correct
9 Correct 50 ms 64208 KB Output is correct
10 Correct 46 ms 64356 KB Output is correct
11 Correct 50 ms 64520 KB Output is correct
12 Correct 46 ms 64244 KB Output is correct
13 Correct 47 ms 64200 KB Output is correct
14 Correct 47 ms 64524 KB Output is correct
15 Correct 47 ms 64580 KB Output is correct
16 Correct 49 ms 64356 KB Output is correct
17 Correct 48 ms 64840 KB Output is correct
18 Correct 49 ms 64576 KB Output is correct
19 Correct 48 ms 64500 KB Output is correct
20 Correct 48 ms 64332 KB Output is correct
21 Correct 46 ms 64460 KB Output is correct
22 Correct 47 ms 64508 KB Output is correct
23 Correct 51 ms 64616 KB Output is correct
24 Correct 49 ms 64956 KB Output is correct
25 Correct 48 ms 64716 KB Output is correct
26 Correct 47 ms 64600 KB Output is correct
27 Correct 47 ms 64528 KB Output is correct
28 Correct 51 ms 65248 KB Output is correct
29 Correct 49 ms 66896 KB Output is correct
30 Correct 48 ms 64972 KB Output is correct
31 Correct 48 ms 65688 KB Output is correct
32 Correct 51 ms 65356 KB Output is correct
33 Correct 53 ms 69508 KB Output is correct
34 Correct 56 ms 69248 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 64200 KB Output is correct
2 Correct 46 ms 64292 KB Output is correct
3 Correct 47 ms 64180 KB Output is correct
4 Correct 48 ms 64196 KB Output is correct
5 Correct 47 ms 64192 KB Output is correct
6 Correct 49 ms 64368 KB Output is correct
7 Correct 46 ms 64168 KB Output is correct
8 Correct 51 ms 64180 KB Output is correct
9 Correct 46 ms 64184 KB Output is correct
10 Correct 49 ms 64320 KB Output is correct
11 Correct 54 ms 64456 KB Output is correct
12 Correct 47 ms 64260 KB Output is correct
13 Correct 47 ms 64268 KB Output is correct
14 Correct 47 ms 64524 KB Output is correct
15 Correct 49 ms 64608 KB Output is correct
16 Correct 47 ms 64448 KB Output is correct
17 Correct 49 ms 64844 KB Output is correct
18 Correct 53 ms 64552 KB Output is correct
19 Correct 46 ms 64468 KB Output is correct
20 Correct 56 ms 64332 KB Output is correct
21 Correct 47 ms 64480 KB Output is correct
22 Correct 46 ms 64536 KB Output is correct
23 Correct 52 ms 64864 KB Output is correct
24 Correct 54 ms 64976 KB Output is correct
25 Correct 52 ms 64664 KB Output is correct
26 Correct 47 ms 64620 KB Output is correct
27 Correct 47 ms 64640 KB Output is correct
28 Correct 48 ms 65268 KB Output is correct
29 Correct 49 ms 66944 KB Output is correct
30 Correct 47 ms 64940 KB Output is correct
31 Correct 51 ms 65644 KB Output is correct
32 Correct 47 ms 65224 KB Output is correct
33 Correct 51 ms 69532 KB Output is correct
34 Correct 50 ms 69260 KB Output is correct
35 Correct 55 ms 69252 KB Output is correct
36 Correct 49 ms 65244 KB Output is correct
37 Correct 62 ms 71648 KB Output is correct
38 Correct 61 ms 71544 KB Output is correct
39 Correct 62 ms 71560 KB Output is correct
40 Correct 59 ms 71524 KB Output is correct
41 Correct 60 ms 71656 KB Output is correct
42 Correct 49 ms 64884 KB Output is correct
43 Correct 51 ms 64940 KB Output is correct
44 Correct 50 ms 64732 KB Output is correct
45 Correct 84 ms 85804 KB Output is correct
46 Correct 81 ms 84988 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 64260 KB Output is correct
2 Correct 44 ms 64240 KB Output is correct
3 Correct 48 ms 64284 KB Output is correct
4 Correct 47 ms 64232 KB Output is correct
5 Correct 47 ms 64200 KB Output is correct
6 Correct 47 ms 64224 KB Output is correct
7 Correct 50 ms 64324 KB Output is correct
8 Correct 47 ms 64224 KB Output is correct
9 Correct 47 ms 64300 KB Output is correct
10 Correct 47 ms 64336 KB Output is correct
11 Correct 47 ms 64528 KB Output is correct
12 Correct 47 ms 64296 KB Output is correct
13 Correct 46 ms 64228 KB Output is correct
14 Correct 47 ms 64588 KB Output is correct
15 Correct 47 ms 64500 KB Output is correct
16 Correct 47 ms 64408 KB Output is correct
17 Correct 48 ms 64920 KB Output is correct
18 Correct 47 ms 64584 KB Output is correct
19 Correct 47 ms 64428 KB Output is correct
20 Correct 47 ms 64332 KB Output is correct
21 Correct 47 ms 64404 KB Output is correct
22 Correct 48 ms 64488 KB Output is correct
23 Correct 51 ms 64624 KB Output is correct
24 Correct 48 ms 64892 KB Output is correct
25 Correct 47 ms 64684 KB Output is correct
26 Correct 46 ms 64596 KB Output is correct
27 Correct 47 ms 64640 KB Output is correct
28 Correct 48 ms 65244 KB Output is correct
29 Correct 50 ms 66888 KB Output is correct
30 Correct 48 ms 64972 KB Output is correct
31 Correct 48 ms 65668 KB Output is correct
32 Correct 50 ms 65264 KB Output is correct
33 Correct 54 ms 69504 KB Output is correct
34 Correct 55 ms 69268 KB Output is correct
35 Correct 57 ms 69208 KB Output is correct
36 Correct 48 ms 65216 KB Output is correct
37 Correct 57 ms 71708 KB Output is correct
38 Correct 59 ms 71572 KB Output is correct
39 Correct 59 ms 71468 KB Output is correct
40 Correct 60 ms 71500 KB Output is correct
41 Correct 59 ms 71580 KB Output is correct
42 Correct 50 ms 64960 KB Output is correct
43 Correct 48 ms 64952 KB Output is correct
44 Correct 50 ms 64668 KB Output is correct
45 Correct 83 ms 85720 KB Output is correct
46 Correct 76 ms 84984 KB Output is correct
47 Correct 79 ms 94032 KB Output is correct
48 Correct 67 ms 75476 KB Output is correct
49 Correct 63 ms 72128 KB Output is correct
50 Correct 59 ms 71556 KB Output is correct
51 Correct 74 ms 79580 KB Output is correct
52 Correct 74 ms 80632 KB Output is correct
53 Correct 58 ms 68988 KB Output is correct
54 Correct 48 ms 65560 KB Output is correct
55 Correct 52 ms 66700 KB Output is correct
56 Correct 53 ms 65992 KB Output is correct
57 Correct 62 ms 81328 KB Output is correct
58 Correct 53 ms 67584 KB Output is correct
59 Correct 62 ms 68660 KB Output is correct
60 Correct 56 ms 69800 KB Output is correct
61 Correct 57 ms 69556 KB Output is correct
62 Correct 78 ms 86316 KB Output is correct
63 Correct 226 ms 163256 KB Output is correct
64 Correct 266 ms 185704 KB Output is correct
65 Correct 400 ms 238672 KB Output is correct
66 Runtime error 197 ms 262144 KB Execution killed with signal 11
67 Halted 0 ms 0 KB -