oj.uz

Submission #826658

# Submission time Handle Problem Language Result Execution time Memory
826658 2023-08-15T19:11:37 Z cig32 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 403 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 = 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;
  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:85:7: warning: 'en' may be used uninitialized in this function [-Wmaybe-uninitialized]
   85 |       if(f==en)break;
      |       ^~
skyscraper.cpp:79:8: warning: 'st' may be used uninitialized in this function [-Wmaybe-uninitialized]
   79 |   dq[0]=st;
      |   ~~~~~^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 62924 KB Output is correct
2 Correct 46 ms 63008 KB Output is correct
3 Correct 46 ms 62976 KB Output is correct
4 Correct 46 ms 62976 KB Output is correct
5 Correct 47 ms 63004 KB Output is correct
6 Correct 46 ms 62936 KB Output is correct
7 Correct 46 ms 62924 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 62972 KB Output is correct
2 Correct 45 ms 62916 KB Output is correct
3 Correct 45 ms 63032 KB Output is correct
4 Correct 46 ms 62920 KB Output is correct
5 Correct 47 ms 62924 KB Output is correct
6 Correct 47 ms 62924 KB Output is correct
7 Correct 48 ms 62968 KB Output is correct
8 Correct 46 ms 62940 KB Output is correct
9 Correct 45 ms 63000 KB Output is correct
10 Correct 45 ms 63088 KB Output is correct
11 Correct 46 ms 63188 KB Output is correct
12 Correct 47 ms 63080 KB Output is correct
13 Correct 47 ms 63028 KB Output is correct
14 Correct 47 ms 63276 KB Output is correct
15 Correct 47 ms 63328 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 63020 KB Output is correct
2 Correct 47 ms 62932 KB Output is correct
3 Correct 46 ms 62924 KB Output is correct
4 Correct 47 ms 62924 KB Output is correct
5 Correct 46 ms 62944 KB Output is correct
6 Correct 46 ms 62972 KB Output is correct
7 Correct 47 ms 62924 KB Output is correct
8 Correct 47 ms 63044 KB Output is correct
9 Correct 47 ms 63032 KB Output is correct
10 Correct 46 ms 63004 KB Output is correct
11 Correct 46 ms 63184 KB Output is correct
12 Correct 47 ms 63016 KB Output is correct
13 Correct 46 ms 63032 KB Output is correct
14 Correct 47 ms 63308 KB Output is correct
15 Correct 47 ms 63312 KB Output is correct
16 Correct 47 ms 63220 KB Output is correct
17 Correct 51 ms 63680 KB Output is correct
18 Correct 48 ms 63308 KB Output is correct
19 Correct 47 ms 63216 KB Output is correct
20 Correct 47 ms 63080 KB Output is correct
21 Correct 47 ms 63244 KB Output is correct
22 Correct 45 ms 63308 KB Output is correct
23 Correct 46 ms 63328 KB Output is correct
24 Correct 47 ms 63704 KB Output is correct
25 Correct 46 ms 63456 KB Output is correct
26 Correct 46 ms 63356 KB Output is correct
27 Correct 51 ms 63356 KB Output is correct
28 Correct 49 ms 64080 KB Output is correct
29 Correct 52 ms 65716 KB Output is correct
30 Correct 47 ms 63716 KB Output is correct
31 Correct 48 ms 64440 KB Output is correct
32 Correct 48 ms 64076 KB Output is correct
33 Correct 52 ms 68236 KB Output is correct
34 Correct 51 ms 68024 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 63024 KB Output is correct
2 Correct 50 ms 62952 KB Output is correct
3 Correct 45 ms 63020 KB Output is correct
4 Correct 46 ms 62920 KB Output is correct
5 Correct 45 ms 63008 KB Output is correct
6 Correct 46 ms 62952 KB Output is correct
7 Correct 47 ms 63036 KB Output is correct
8 Correct 45 ms 62988 KB Output is correct
9 Correct 49 ms 62992 KB Output is correct
10 Correct 46 ms 63108 KB Output is correct
11 Correct 48 ms 63168 KB Output is correct
12 Correct 46 ms 63004 KB Output is correct
13 Correct 46 ms 63064 KB Output is correct
14 Correct 52 ms 63352 KB Output is correct
15 Correct 46 ms 63348 KB Output is correct
16 Correct 46 ms 63120 KB Output is correct
17 Correct 46 ms 63644 KB Output is correct
18 Correct 50 ms 63380 KB Output is correct
19 Correct 47 ms 63384 KB Output is correct
20 Correct 46 ms 63056 KB Output is correct
21 Correct 46 ms 63244 KB Output is correct
22 Correct 46 ms 63292 KB Output is correct
23 Correct 47 ms 63400 KB Output is correct
24 Correct 47 ms 63600 KB Output is correct
25 Correct 46 ms 63408 KB Output is correct
26 Correct 45 ms 63396 KB Output is correct
27 Correct 49 ms 63368 KB Output is correct
28 Correct 49 ms 64108 KB Output is correct
29 Correct 49 ms 65628 KB Output is correct
30 Correct 48 ms 63720 KB Output is correct
31 Correct 47 ms 64496 KB Output is correct
32 Correct 47 ms 64092 KB Output is correct
33 Correct 52 ms 68188 KB Output is correct
34 Correct 57 ms 67960 KB Output is correct
35 Correct 61 ms 67960 KB Output is correct
36 Correct 48 ms 63936 KB Output is correct
37 Correct 57 ms 70496 KB Output is correct
38 Correct 59 ms 70348 KB Output is correct
39 Correct 58 ms 70264 KB Output is correct
40 Correct 59 ms 70268 KB Output is correct
41 Correct 60 ms 70376 KB Output is correct
42 Correct 49 ms 63692 KB Output is correct
43 Correct 49 ms 63644 KB Output is correct
44 Correct 50 ms 63448 KB Output is correct
45 Correct 82 ms 84560 KB Output is correct
46 Correct 80 ms 83680 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 63040 KB Output is correct
2 Correct 45 ms 62924 KB Output is correct
3 Correct 45 ms 62924 KB Output is correct
4 Correct 45 ms 62924 KB Output is correct
5 Correct 46 ms 63016 KB Output is correct
6 Correct 45 ms 62920 KB Output is correct
7 Correct 47 ms 62936 KB Output is correct
8 Correct 46 ms 62924 KB Output is correct
9 Correct 49 ms 63008 KB Output is correct
10 Correct 46 ms 63100 KB Output is correct
11 Correct 49 ms 63172 KB Output is correct
12 Correct 49 ms 63024 KB Output is correct
13 Correct 46 ms 62956 KB Output is correct
14 Correct 48 ms 63332 KB Output is correct
15 Correct 47 ms 63260 KB Output is correct
16 Correct 46 ms 63108 KB Output is correct
17 Correct 47 ms 63660 KB Output is correct
18 Correct 46 ms 63312 KB Output is correct
19 Correct 47 ms 63256 KB Output is correct
20 Correct 50 ms 63124 KB Output is correct
21 Correct 47 ms 63188 KB Output is correct
22 Correct 46 ms 63232 KB Output is correct
23 Correct 47 ms 63308 KB Output is correct
24 Correct 47 ms 63728 KB Output is correct
25 Correct 47 ms 63436 KB Output is correct
26 Correct 46 ms 63380 KB Output is correct
27 Correct 47 ms 63316 KB Output is correct
28 Correct 48 ms 64036 KB Output is correct
29 Correct 49 ms 65640 KB Output is correct
30 Correct 48 ms 63728 KB Output is correct
31 Correct 52 ms 64472 KB Output is correct
32 Correct 49 ms 63952 KB Output is correct
33 Correct 54 ms 68272 KB Output is correct
34 Correct 52 ms 68012 KB Output is correct
35 Correct 56 ms 67940 KB Output is correct
36 Correct 50 ms 63944 KB Output is correct
37 Correct 55 ms 70488 KB Output is correct
38 Correct 59 ms 70348 KB Output is correct
39 Correct 59 ms 70348 KB Output is correct
40 Correct 59 ms 70284 KB Output is correct
41 Correct 60 ms 70368 KB Output is correct
42 Correct 49 ms 63692 KB Output is correct
43 Correct 61 ms 63632 KB Output is correct
44 Correct 48 ms 63408 KB Output is correct
45 Correct 88 ms 84676 KB Output is correct
46 Correct 76 ms 83788 KB Output is correct
47 Correct 81 ms 92844 KB Output is correct
48 Correct 63 ms 74368 KB Output is correct
49 Correct 59 ms 70836 KB Output is correct
50 Correct 57 ms 70312 KB Output is correct
51 Correct 71 ms 78384 KB Output is correct
52 Correct 74 ms 79568 KB Output is correct
53 Correct 63 ms 67780 KB Output is correct
54 Correct 49 ms 64320 KB Output is correct
55 Correct 49 ms 65324 KB Output is correct
56 Correct 52 ms 64692 KB Output is correct
57 Correct 61 ms 80116 KB Output is correct
58 Correct 52 ms 66352 KB Output is correct
59 Correct 55 ms 67532 KB Output is correct
60 Correct 55 ms 68620 KB Output is correct
61 Correct 55 ms 68256 KB Output is correct
62 Correct 77 ms 85152 KB Output is correct
63 Correct 235 ms 162384 KB Output is correct
64 Correct 272 ms 184748 KB Output is correct
65 Correct 403 ms 237948 KB Output is correct
66 Runtime error 195 ms 262144 KB Execution killed with signal 11
67 Halted 0 ms 0 KB -