oj.uz

Submission #826793

# Submission time Handle Problem Language Result Execution time Memory
826793 2023-08-16T03:48:38 Z cig32 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 310 ms 262144 KB 
#include "bits/stdc++.h"
using namespace std;
#define double long double
const int MAXN = 13750000;//14000000;
const int MAXN2 = 7341226;//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 = 73;//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 32 ms 45004 KB Output is correct
2 Correct 32 ms 45060 KB Output is correct
3 Correct 32 ms 45072 KB Output is correct
4 Correct 33 ms 44980 KB Output is correct
5 Correct 32 ms 44988 KB Output is correct
6 Correct 32 ms 44976 KB Output is correct
7 Correct 34 ms 45092 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 45060 KB Output is correct
2 Correct 32 ms 45036 KB Output is correct
3 Correct 32 ms 45024 KB Output is correct
4 Correct 33 ms 44984 KB Output is correct
5 Correct 34 ms 45076 KB Output is correct
6 Correct 34 ms 45024 KB Output is correct
7 Correct 33 ms 45012 KB Output is correct
8 Correct 33 ms 45012 KB Output is correct
9 Correct 33 ms 45004 KB Output is correct
10 Correct 32 ms 45144 KB Output is correct
11 Correct 32 ms 45244 KB Output is correct
12 Correct 33 ms 45008 KB Output is correct
13 Correct 32 ms 45020 KB Output is correct
14 Correct 33 ms 45388 KB Output is correct
15 Correct 33 ms 45396 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 45048 KB Output is correct
2 Correct 32 ms 45048 KB Output is correct
3 Correct 34 ms 45040 KB Output is correct
4 Correct 33 ms 45100 KB Output is correct
5 Correct 33 ms 44980 KB Output is correct
6 Correct 33 ms 45028 KB Output is correct
7 Correct 33 ms 44996 KB Output is correct
8 Correct 33 ms 45016 KB Output is correct
9 Correct 34 ms 44972 KB Output is correct
10 Correct 33 ms 45128 KB Output is correct
11 Correct 34 ms 45200 KB Output is correct
12 Correct 33 ms 45052 KB Output is correct
13 Correct 34 ms 45056 KB Output is correct
14 Correct 33 ms 45420 KB Output is correct
15 Correct 33 ms 45396 KB Output is correct
16 Correct 33 ms 45152 KB Output is correct
17 Correct 34 ms 45524 KB Output is correct
18 Correct 33 ms 45324 KB Output is correct
19 Correct 33 ms 45252 KB Output is correct
20 Correct 33 ms 45168 KB Output is correct
21 Correct 34 ms 45072 KB Output is correct
22 Correct 33 ms 45260 KB Output is correct
23 Correct 34 ms 45256 KB Output is correct
24 Correct 34 ms 45552 KB Output is correct
25 Correct 34 ms 45268 KB Output is correct
26 Correct 34 ms 45336 KB Output is correct
27 Correct 33 ms 45372 KB Output is correct
28 Correct 35 ms 45920 KB Output is correct
29 Correct 37 ms 47708 KB Output is correct
30 Correct 34 ms 45736 KB Output is correct
31 Correct 35 ms 46520 KB Output is correct
32 Correct 34 ms 46020 KB Output is correct
33 Correct 40 ms 50252 KB Output is correct
34 Correct 40 ms 50080 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 45084 KB Output is correct
2 Correct 33 ms 45004 KB Output is correct
3 Correct 32 ms 45004 KB Output is correct
4 Correct 33 ms 45012 KB Output is correct
5 Correct 33 ms 45080 KB Output is correct
6 Correct 33 ms 45088 KB Output is correct
7 Correct 32 ms 44960 KB Output is correct
8 Correct 32 ms 45012 KB Output is correct
9 Correct 35 ms 45108 KB Output is correct
10 Correct 35 ms 45056 KB Output is correct
11 Correct 33 ms 45268 KB Output is correct
12 Correct 34 ms 45096 KB Output is correct
13 Correct 33 ms 45012 KB Output is correct
14 Correct 33 ms 45316 KB Output is correct
15 Correct 33 ms 45412 KB Output is correct
16 Correct 33 ms 45168 KB Output is correct
17 Correct 34 ms 45516 KB Output is correct
18 Correct 33 ms 45272 KB Output is correct
19 Correct 33 ms 45164 KB Output is correct
20 Correct 34 ms 45180 KB Output is correct
21 Correct 33 ms 45140 KB Output is correct
22 Correct 33 ms 45216 KB Output is correct
23 Correct 33 ms 45272 KB Output is correct
24 Correct 33 ms 45528 KB Output is correct
25 Correct 34 ms 45228 KB Output is correct
26 Correct 33 ms 45336 KB Output is correct
27 Correct 33 ms 45356 KB Output is correct
28 Correct 34 ms 45860 KB Output is correct
29 Correct 36 ms 47652 KB Output is correct
30 Correct 34 ms 45772 KB Output is correct
31 Correct 35 ms 46552 KB Output is correct
32 Correct 34 ms 46020 KB Output is correct
33 Correct 39 ms 50308 KB Output is correct
34 Correct 38 ms 50068 KB Output is correct
35 Correct 40 ms 48480 KB Output is correct
36 Correct 35 ms 45672 KB Output is correct
37 Correct 40 ms 50888 KB Output is correct
38 Correct 42 ms 50316 KB Output is correct
39 Correct 42 ms 50336 KB Output is correct
40 Correct 41 ms 50376 KB Output is correct
41 Correct 43 ms 50412 KB Output is correct
42 Correct 37 ms 45764 KB Output is correct
43 Correct 37 ms 45708 KB Output is correct
44 Correct 36 ms 45516 KB Output is correct
45 Correct 60 ms 61780 KB Output is correct
46 Correct 55 ms 60924 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 45040 KB Output is correct
2 Correct 33 ms 44992 KB Output is correct
3 Correct 33 ms 45004 KB Output is correct
4 Correct 36 ms 45260 KB Output is correct
5 Correct 33 ms 45072 KB Output is correct
6 Correct 33 ms 45068 KB Output is correct
7 Correct 33 ms 44964 KB Output is correct
8 Correct 34 ms 45012 KB Output is correct
9 Correct 33 ms 45016 KB Output is correct
10 Correct 33 ms 45128 KB Output is correct
11 Correct 34 ms 45236 KB Output is correct
12 Correct 33 ms 45060 KB Output is correct
13 Correct 33 ms 45012 KB Output is correct
14 Correct 33 ms 45316 KB Output is correct
15 Correct 34 ms 45404 KB Output is correct
16 Correct 33 ms 45232 KB Output is correct
17 Correct 33 ms 45524 KB Output is correct
18 Correct 33 ms 45300 KB Output is correct
19 Correct 33 ms 45176 KB Output is correct
20 Correct 33 ms 45120 KB Output is correct
21 Correct 34 ms 45092 KB Output is correct
22 Correct 36 ms 45212 KB Output is correct
23 Correct 34 ms 45308 KB Output is correct
24 Correct 33 ms 45516 KB Output is correct
25 Correct 34 ms 45320 KB Output is correct
26 Correct 34 ms 45396 KB Output is correct
27 Correct 33 ms 45356 KB Output is correct
28 Correct 34 ms 45892 KB Output is correct
29 Correct 36 ms 47696 KB Output is correct
30 Correct 33 ms 45732 KB Output is correct
31 Correct 34 ms 46500 KB Output is correct
32 Correct 35 ms 46120 KB Output is correct
33 Correct 40 ms 50336 KB Output is correct
34 Correct 38 ms 50112 KB Output is correct
35 Correct 39 ms 48464 KB Output is correct
36 Correct 33 ms 45588 KB Output is correct
37 Correct 41 ms 50844 KB Output is correct
38 Correct 44 ms 50408 KB Output is correct
39 Correct 41 ms 50268 KB Output is correct
40 Correct 41 ms 50340 KB Output is correct
41 Correct 42 ms 50336 KB Output is correct
42 Correct 37 ms 45684 KB Output is correct
43 Correct 36 ms 45676 KB Output is correct
44 Correct 36 ms 45488 KB Output is correct
45 Correct 61 ms 61792 KB Output is correct
46 Correct 55 ms 60896 KB Output is correct
47 Correct 61 ms 69280 KB Output is correct
48 Correct 44 ms 52876 KB Output is correct
49 Correct 40 ms 49484 KB Output is correct
50 Correct 39 ms 49740 KB Output is correct
51 Correct 49 ms 55624 KB Output is correct
52 Correct 50 ms 56648 KB Output is correct
53 Correct 40 ms 48276 KB Output is correct
54 Correct 34 ms 46416 KB Output is correct
55 Correct 35 ms 47472 KB Output is correct
56 Correct 37 ms 46804 KB Output is correct
57 Correct 46 ms 62156 KB Output is correct
58 Correct 40 ms 48548 KB Output is correct
59 Correct 40 ms 49512 KB Output is correct
60 Correct 42 ms 50996 KB Output is correct
61 Correct 40 ms 49640 KB Output is correct
62 Correct 56 ms 62920 KB Output is correct
63 Correct 175 ms 117000 KB Output is correct
64 Correct 226 ms 133416 KB Output is correct
65 Correct 310 ms 171980 KB Output is correct
66 Runtime error 197 ms 262144 KB Execution killed with signal 11
67 Halted 0 ms 0 KB -