oj.uz

Submission #826787

# Submission time Handle Problem Language Result Execution time Memory
826787 2023-08-16T03:36:34 Z cig32 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 331 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];
int dist[MAXN2];
bitset<MAXN2>vis;
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 = 120;//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) && p<=s) {
      bruh[p][b%p] = nxt;
      construct(b, p);
    }
    else if(p<=s) {
      add_command(b, (bruh[p][b%p] + b/p) * 2);
    }
    else {
      for(int j=b%p; j<n; j+=p) {
    if(j+p < n && j >= b) 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 && j <= b) 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++;
  }
    }
  }
  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;
  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:97:7: warning: 'en' may be used uninitialized in this function [-Wmaybe-uninitialized]
   97 |       if(f==en)break;
      |       ^~
skyscraper.cpp:91:8: warning: 'st' may be used uninitialized in this function [-Wmaybe-uninitialized]
   91 |   dq[0]=st;
      |   ~~~~~^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 63004 KB Output is correct
2 Correct 44 ms 62936 KB Output is correct
3 Correct 45 ms 62992 KB Output is correct
4 Correct 44 ms 62940 KB Output is correct
5 Correct 54 ms 63028 KB Output is correct
6 Correct 46 ms 63000 KB Output is correct
7 Correct 46 ms 62932 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 62916 KB Output is correct
2 Correct 45 ms 62912 KB Output is correct
3 Correct 46 ms 62936 KB Output is correct
4 Correct 45 ms 62936 KB Output is correct
5 Correct 44 ms 62924 KB Output is correct
6 Correct 48 ms 62916 KB Output is correct
7 Correct 46 ms 62988 KB Output is correct
8 Correct 45 ms 63016 KB Output is correct
9 Correct 45 ms 63052 KB Output is correct
10 Correct 45 ms 63128 KB Output is correct
11 Correct 46 ms 63240 KB Output is correct
12 Correct 47 ms 63032 KB Output is correct
13 Correct 46 ms 63036 KB Output is correct
14 Correct 51 ms 63288 KB Output is correct
15 Correct 47 ms 63284 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 63044 KB Output is correct
2 Correct 45 ms 63000 KB Output is correct
3 Correct 45 ms 63024 KB Output is correct
4 Correct 45 ms 62924 KB Output is correct
5 Correct 49 ms 62992 KB Output is correct
6 Correct 45 ms 62920 KB Output is correct
7 Correct 46 ms 63012 KB Output is correct
8 Correct 46 ms 63020 KB Output is correct
9 Correct 46 ms 62956 KB Output is correct
10 Correct 46 ms 63056 KB Output is correct
11 Correct 46 ms 63252 KB Output is correct
12 Correct 46 ms 63052 KB Output is correct
13 Correct 46 ms 63056 KB Output is correct
14 Correct 47 ms 63288 KB Output is correct
15 Correct 46 ms 63316 KB Output is correct
16 Correct 45 ms 63160 KB Output is correct
17 Correct 47 ms 63572 KB Output is correct
18 Correct 46 ms 63272 KB Output is correct
19 Correct 46 ms 63148 KB Output is correct
20 Correct 48 ms 63052 KB Output is correct
21 Correct 46 ms 63076 KB Output is correct
22 Correct 46 ms 63200 KB Output is correct
23 Correct 46 ms 63180 KB Output is correct
24 Correct 46 ms 63404 KB Output is correct
25 Correct 45 ms 63264 KB Output is correct
26 Correct 46 ms 63332 KB Output is correct
27 Correct 52 ms 63308 KB Output is correct
28 Correct 47 ms 63948 KB Output is correct
29 Correct 48 ms 65644 KB Output is correct
30 Correct 50 ms 63748 KB Output is correct
31 Correct 47 ms 64384 KB Output is correct
32 Correct 47 ms 63992 KB Output is correct
33 Correct 53 ms 68236 KB Output is correct
34 Correct 51 ms 67996 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 62948 KB Output is correct
2 Correct 45 ms 63012 KB Output is correct
3 Correct 50 ms 62980 KB Output is correct
4 Correct 45 ms 62976 KB Output is correct
5 Correct 45 ms 62924 KB Output is correct
6 Correct 47 ms 62928 KB Output is correct
7 Correct 45 ms 62924 KB Output is correct
8 Correct 45 ms 62948 KB Output is correct
9 Correct 46 ms 62964 KB Output is correct
10 Correct 46 ms 63056 KB Output is correct
11 Correct 46 ms 63224 KB Output is correct
12 Correct 46 ms 63052 KB Output is correct
13 Correct 46 ms 63036 KB Output is correct
14 Correct 46 ms 63328 KB Output is correct
15 Correct 46 ms 63340 KB Output is correct
16 Correct 46 ms 63100 KB Output is correct
17 Correct 46 ms 63468 KB Output is correct
18 Correct 46 ms 63180 KB Output is correct
19 Correct 46 ms 63180 KB Output is correct
20 Correct 46 ms 63044 KB Output is correct
21 Correct 45 ms 63128 KB Output is correct
22 Correct 46 ms 63224 KB Output is correct
23 Correct 46 ms 63180 KB Output is correct
24 Correct 46 ms 63500 KB Output is correct
25 Correct 48 ms 63292 KB Output is correct
26 Correct 49 ms 63296 KB Output is correct
27 Correct 47 ms 63304 KB Output is correct
28 Correct 46 ms 63952 KB Output is correct
29 Correct 48 ms 65612 KB Output is correct
30 Correct 45 ms 63724 KB Output is correct
31 Correct 46 ms 64380 KB Output is correct
32 Correct 46 ms 63988 KB Output is correct
33 Correct 52 ms 68164 KB Output is correct
34 Correct 50 ms 68056 KB Output is correct
35 Correct 52 ms 66568 KB Output is correct
36 Correct 46 ms 63664 KB Output is correct
37 Correct 54 ms 69100 KB Output is correct
38 Correct 54 ms 68400 KB Output is correct
39 Correct 54 ms 68460 KB Output is correct
40 Correct 53 ms 68360 KB Output is correct
41 Correct 55 ms 68560 KB Output is correct
42 Correct 51 ms 63820 KB Output is correct
43 Correct 49 ms 63572 KB Output is correct
44 Correct 49 ms 63476 KB Output is correct
45 Correct 82 ms 80972 KB Output is correct
46 Correct 69 ms 80096 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 62924 KB Output is correct
2 Correct 45 ms 62988 KB Output is correct
3 Correct 46 ms 62984 KB Output is correct
4 Correct 46 ms 62964 KB Output is correct
5 Correct 46 ms 63020 KB Output is correct
6 Correct 46 ms 62992 KB Output is correct
7 Correct 50 ms 62992 KB Output is correct
8 Correct 46 ms 63032 KB Output is correct
9 Correct 45 ms 63044 KB Output is correct
10 Correct 45 ms 63052 KB Output is correct
11 Correct 45 ms 63208 KB Output is correct
12 Correct 46 ms 62956 KB Output is correct
13 Correct 45 ms 62964 KB Output is correct
14 Correct 46 ms 63308 KB Output is correct
15 Correct 46 ms 63308 KB Output is correct
16 Correct 46 ms 63204 KB Output is correct
17 Correct 45 ms 63596 KB Output is correct
18 Correct 46 ms 63212 KB Output is correct
19 Correct 50 ms 63184 KB Output is correct
20 Correct 51 ms 63076 KB Output is correct
21 Correct 47 ms 63040 KB Output is correct
22 Correct 46 ms 63136 KB Output is correct
23 Correct 46 ms 63256 KB Output is correct
24 Correct 46 ms 63480 KB Output is correct
25 Correct 46 ms 63180 KB Output is correct
26 Correct 46 ms 63288 KB Output is correct
27 Correct 46 ms 63308 KB Output is correct
28 Correct 50 ms 63948 KB Output is correct
29 Correct 52 ms 65740 KB Output is correct
30 Correct 47 ms 63752 KB Output is correct
31 Correct 47 ms 64464 KB Output is correct
32 Correct 46 ms 63956 KB Output is correct
33 Correct 53 ms 68236 KB Output is correct
34 Correct 51 ms 68032 KB Output is correct
35 Correct 53 ms 66536 KB Output is correct
36 Correct 47 ms 63668 KB Output is correct
37 Correct 59 ms 69020 KB Output is correct
38 Correct 55 ms 68436 KB Output is correct
39 Correct 60 ms 68436 KB Output is correct
40 Correct 54 ms 68400 KB Output is correct
41 Correct 64 ms 68448 KB Output is correct
42 Correct 50 ms 63688 KB Output is correct
43 Correct 50 ms 63604 KB Output is correct
44 Correct 49 ms 63392 KB Output is correct
45 Correct 77 ms 80952 KB Output is correct
46 Correct 70 ms 80092 KB Output is correct
47 Correct 71 ms 87840 KB Output is correct
48 Correct 62 ms 70940 KB Output is correct
49 Correct 52 ms 67644 KB Output is correct
50 Correct 51 ms 67856 KB Output is correct
51 Correct 61 ms 73748 KB Output is correct
52 Correct 60 ms 74852 KB Output is correct
53 Correct 56 ms 66344 KB Output is correct
54 Correct 46 ms 64320 KB Output is correct
55 Correct 48 ms 65376 KB Output is correct
56 Correct 51 ms 64696 KB Output is correct
57 Correct 59 ms 80084 KB Output is correct
58 Correct 52 ms 66312 KB Output is correct
59 Correct 53 ms 67532 KB Output is correct
60 Correct 54 ms 68900 KB Output is correct
61 Correct 54 ms 67600 KB Output is correct
62 Correct 71 ms 81192 KB Output is correct
63 Correct 188 ms 134952 KB Output is correct
64 Correct 223 ms 151324 KB Output is correct
65 Correct 331 ms 193816 KB Output is correct
66 Runtime error 204 ms 262144 KB Execution killed with signal 11
67 Halted 0 ms 0 KB -