oj.uz

Submission #826788

# Submission time Handle Problem Language Result Execution time Memory
826788 2023-08-16T03:38:44 Z cig32 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 303 ms 262144 KB 
#include "bits/stdc++.h"
using namespace std;
#define double long double
const int MAXN = 14000000;
const int MAXN2 = 8000000;
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 = 80;// 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:96:7: warning: 'en' may be used uninitialized in this function [-Wmaybe-uninitialized]
   96 |       if(f==en)break;
      |       ^~
skyscraper.cpp:90:8: warning: 'st' may be used uninitialized in this function [-Wmaybe-uninitialized]
   90 |   dq[0]=st;
      |   ~~~~~^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 48920 KB Output is correct
2 Correct 35 ms 48936 KB Output is correct
3 Correct 35 ms 48900 KB Output is correct
4 Correct 35 ms 48864 KB Output is correct
5 Correct 39 ms 48924 KB Output is correct
6 Correct 35 ms 48936 KB Output is correct
7 Correct 35 ms 48852 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 48908 KB Output is correct
2 Correct 35 ms 48876 KB Output is correct
3 Correct 35 ms 48860 KB Output is correct
4 Correct 36 ms 48840 KB Output is correct
5 Correct 35 ms 48948 KB Output is correct
6 Correct 36 ms 48896 KB Output is correct
7 Correct 36 ms 48856 KB Output is correct
8 Correct 35 ms 48844 KB Output is correct
9 Correct 35 ms 48892 KB Output is correct
10 Correct 35 ms 48964 KB Output is correct
11 Correct 35 ms 49164 KB Output is correct
12 Correct 35 ms 48880 KB Output is correct
13 Correct 35 ms 48864 KB Output is correct
14 Correct 36 ms 49268 KB Output is correct
15 Correct 36 ms 49168 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 48912 KB Output is correct
2 Correct 36 ms 48924 KB Output is correct
3 Correct 35 ms 48868 KB Output is correct
4 Correct 35 ms 48868 KB Output is correct
5 Correct 37 ms 48932 KB Output is correct
6 Correct 39 ms 48880 KB Output is correct
7 Correct 36 ms 48844 KB Output is correct
8 Correct 35 ms 49084 KB Output is correct
9 Correct 37 ms 48980 KB Output is correct
10 Correct 35 ms 48908 KB Output is correct
11 Correct 36 ms 49104 KB Output is correct
12 Correct 36 ms 48976 KB Output is correct
13 Correct 35 ms 48880 KB Output is correct
14 Correct 36 ms 49164 KB Output is correct
15 Correct 35 ms 49180 KB Output is correct
16 Correct 36 ms 49016 KB Output is correct
17 Correct 36 ms 49588 KB Output is correct
18 Correct 36 ms 49140 KB Output is correct
19 Correct 36 ms 49072 KB Output is correct
20 Correct 36 ms 48980 KB Output is correct
21 Correct 35 ms 48980 KB Output is correct
22 Correct 36 ms 49108 KB Output is correct
23 Correct 35 ms 49124 KB Output is correct
24 Correct 35 ms 49424 KB Output is correct
25 Correct 36 ms 49144 KB Output is correct
26 Correct 36 ms 49268 KB Output is correct
27 Correct 37 ms 49140 KB Output is correct
28 Correct 36 ms 49796 KB Output is correct
29 Correct 38 ms 51528 KB Output is correct
30 Correct 38 ms 49716 KB Output is correct
31 Correct 36 ms 50388 KB Output is correct
32 Correct 36 ms 49976 KB Output is correct
33 Correct 42 ms 54128 KB Output is correct
34 Correct 41 ms 53920 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 48864 KB Output is correct
2 Correct 35 ms 48932 KB Output is correct
3 Correct 35 ms 48972 KB Output is correct
4 Correct 35 ms 48824 KB Output is correct
5 Correct 35 ms 48844 KB Output is correct
6 Correct 35 ms 48848 KB Output is correct
7 Correct 35 ms 48860 KB Output is correct
8 Correct 35 ms 48832 KB Output is correct
9 Correct 35 ms 48876 KB Output is correct
10 Correct 35 ms 49004 KB Output is correct
11 Correct 36 ms 49108 KB Output is correct
12 Correct 36 ms 48976 KB Output is correct
13 Correct 36 ms 48928 KB Output is correct
14 Correct 39 ms 49240 KB Output is correct
15 Correct 36 ms 49224 KB Output is correct
16 Correct 35 ms 49016 KB Output is correct
17 Correct 37 ms 49372 KB Output is correct
18 Correct 36 ms 49120 KB Output is correct
19 Correct 39 ms 49052 KB Output is correct
20 Correct 35 ms 49092 KB Output is correct
21 Correct 36 ms 48940 KB Output is correct
22 Correct 38 ms 49164 KB Output is correct
23 Correct 37 ms 49196 KB Output is correct
24 Correct 36 ms 49404 KB Output is correct
25 Correct 35 ms 49116 KB Output is correct
26 Correct 35 ms 49228 KB Output is correct
27 Correct 36 ms 49184 KB Output is correct
28 Correct 37 ms 49832 KB Output is correct
29 Correct 38 ms 51524 KB Output is correct
30 Correct 36 ms 49704 KB Output is correct
31 Correct 37 ms 50388 KB Output is correct
32 Correct 36 ms 50004 KB Output is correct
33 Correct 41 ms 54184 KB Output is correct
34 Correct 41 ms 53936 KB Output is correct
35 Correct 42 ms 52372 KB Output is correct
36 Correct 37 ms 49468 KB Output is correct
37 Correct 49 ms 54760 KB Output is correct
38 Correct 44 ms 54168 KB Output is correct
39 Correct 43 ms 54260 KB Output is correct
40 Correct 44 ms 54164 KB Output is correct
41 Correct 44 ms 54272 KB Output is correct
42 Correct 38 ms 49596 KB Output is correct
43 Correct 38 ms 49492 KB Output is correct
44 Correct 40 ms 49356 KB Output is correct
45 Correct 74 ms 65856 KB Output is correct
46 Correct 58 ms 64972 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 48832 KB Output is correct
2 Correct 34 ms 48896 KB Output is correct
3 Correct 35 ms 48932 KB Output is correct
4 Correct 36 ms 48960 KB Output is correct
5 Correct 35 ms 48896 KB Output is correct
6 Correct 38 ms 48884 KB Output is correct
7 Correct 36 ms 48828 KB Output is correct
8 Correct 37 ms 48948 KB Output is correct
9 Correct 36 ms 48840 KB Output is correct
10 Correct 36 ms 48912 KB Output is correct
11 Correct 36 ms 49068 KB Output is correct
12 Correct 36 ms 48984 KB Output is correct
13 Correct 37 ms 48944 KB Output is correct
14 Correct 39 ms 49252 KB Output is correct
15 Correct 36 ms 49240 KB Output is correct
16 Correct 41 ms 49048 KB Output is correct
17 Correct 51 ms 49428 KB Output is correct
18 Correct 36 ms 49136 KB Output is correct
19 Correct 36 ms 49096 KB Output is correct
20 Correct 37 ms 49012 KB Output is correct
21 Correct 36 ms 48932 KB Output is correct
22 Correct 37 ms 49128 KB Output is correct
23 Correct 37 ms 49204 KB Output is correct
24 Correct 40 ms 49388 KB Output is correct
25 Correct 36 ms 49100 KB Output is correct
26 Correct 41 ms 49232 KB Output is correct
27 Correct 37 ms 49188 KB Output is correct
28 Correct 40 ms 49740 KB Output is correct
29 Correct 38 ms 51492 KB Output is correct
30 Correct 37 ms 49684 KB Output is correct
31 Correct 37 ms 50408 KB Output is correct
32 Correct 38 ms 49976 KB Output is correct
33 Correct 46 ms 54092 KB Output is correct
34 Correct 41 ms 53956 KB Output is correct
35 Correct 42 ms 52328 KB Output is correct
36 Correct 37 ms 49464 KB Output is correct
37 Correct 45 ms 54736 KB Output is correct
38 Correct 45 ms 54232 KB Output is correct
39 Correct 44 ms 54264 KB Output is correct
40 Correct 44 ms 54224 KB Output is correct
41 Correct 45 ms 54212 KB Output is correct
42 Correct 42 ms 49536 KB Output is correct
43 Correct 40 ms 49476 KB Output is correct
44 Correct 40 ms 49332 KB Output is correct
45 Correct 65 ms 65828 KB Output is correct
46 Correct 60 ms 64972 KB Output is correct
47 Correct 60 ms 73188 KB Output is correct
48 Correct 46 ms 56788 KB Output is correct
49 Correct 42 ms 53472 KB Output is correct
50 Correct 42 ms 53664 KB Output is correct
51 Correct 51 ms 59460 KB Output is correct
52 Correct 58 ms 60608 KB Output is correct
53 Correct 45 ms 52176 KB Output is correct
54 Correct 37 ms 50260 KB Output is correct
55 Correct 38 ms 51312 KB Output is correct
56 Correct 43 ms 50644 KB Output is correct
57 Correct 51 ms 65972 KB Output is correct
58 Correct 42 ms 52228 KB Output is correct
59 Correct 43 ms 53328 KB Output is correct
60 Correct 47 ms 54840 KB Output is correct
61 Correct 50 ms 53500 KB Output is correct
62 Correct 61 ms 66840 KB Output is correct
63 Correct 179 ms 120912 KB Output is correct
64 Correct 210 ms 137240 KB Output is correct
65 Correct 303 ms 175864 KB Output is correct
66 Runtime error 196 ms 262144 KB Execution killed with signal 11
67 Halted 0 ms 0 KB -