oj.uz

Submission #826645

# Submission time Handle Problem Language Result Execution time Memory
826645 2023-08-15T18:53:36 Z cig32 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 445 ms 260136 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];
int cur[MAXN2];
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;
  int bruh[s+1][s];
  for(int i=1; i<=s; i++) {
    for(int j=0; j<i; j++) {
      bruh[i][j] = -1;
    }
  }
  for(int i=0; i<m; i++) {
    int b, p;
    cin >> b >> p;
    if(i == 0) st = b;
    if(i == 1) en = b;
    if(p <= s && bruh[p][b%p] == -1) {
      bruh[p][b%p] = nxt;
      construct(b, p);
    }
    else if(p > s) {
      construct(b, p);
    }
    else {
      add_command(b, (bruh[p][b%p] + b/p) * 2);
      //adj[b].push_back((bruh[p][b%p] + b/p) * 2 + 0);
    }
  }
  for(int i=1; i<MAXN2; i++) ps[i]+=ps[i-1];
  for(int i=0; i<MAXN2; i++) cur[i]=ps[i]-1;
  for(int i=0; i<id; i++) {
    int u = cmds[i].first, v = cmds[i].second;
    adj[cur[u]] = v;
    cur[u]--;
  }
  int k = nxt;
  int dist[k];
  bool vis[k];
  for(int i=0; i<k; i++) dist[i] = 1e9, vis[i] = 0;
  dist[st] = 0;
  deque<int> dq;
  dq.push_back(st);
  while(dq.size()) {
    int f = dq.front();
    dq.pop_front();
    if(!vis[f]) {
      vis[f] = 1;
      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) dq.push_front(x / 2);
          else dq.push_back(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:106:17: warning: 'en' may be used uninitialized in this function [-Wmaybe-uninitialized]
  106 |   cout<<(dist[en]==1e9?-1:dist[en])<<"\n";
      |          ~~~~~~~^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 81684 KB Output is correct
2 Correct 65 ms 81636 KB Output is correct
3 Correct 74 ms 81644 KB Output is correct
4 Correct 68 ms 81632 KB Output is correct
5 Correct 60 ms 81688 KB Output is correct
6 Correct 61 ms 81604 KB Output is correct
7 Correct 63 ms 81720 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 81788 KB Output is correct
2 Correct 66 ms 81652 KB Output is correct
3 Correct 61 ms 81632 KB Output is correct
4 Correct 59 ms 81728 KB Output is correct
5 Correct 67 ms 81652 KB Output is correct
6 Correct 65 ms 81676 KB Output is correct
7 Correct 59 ms 81604 KB Output is correct
8 Correct 60 ms 81720 KB Output is correct
9 Correct 62 ms 81700 KB Output is correct
10 Correct 68 ms 81764 KB Output is correct
11 Correct 62 ms 81876 KB Output is correct
12 Correct 62 ms 81756 KB Output is correct
13 Correct 60 ms 81744 KB Output is correct
14 Correct 59 ms 81844 KB Output is correct
15 Correct 61 ms 81840 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 81672 KB Output is correct
2 Correct 73 ms 81640 KB Output is correct
3 Correct 61 ms 81672 KB Output is correct
4 Correct 73 ms 81668 KB Output is correct
5 Correct 61 ms 81692 KB Output is correct
6 Correct 61 ms 81652 KB Output is correct
7 Correct 62 ms 81612 KB Output is correct
8 Correct 62 ms 81680 KB Output is correct
9 Correct 63 ms 81664 KB Output is correct
10 Correct 64 ms 81860 KB Output is correct
11 Correct 63 ms 81852 KB Output is correct
12 Correct 62 ms 81704 KB Output is correct
13 Correct 61 ms 81764 KB Output is correct
14 Correct 64 ms 81848 KB Output is correct
15 Correct 63 ms 81948 KB Output is correct
16 Correct 62 ms 81836 KB Output is correct
17 Correct 62 ms 82216 KB Output is correct
18 Correct 66 ms 81960 KB Output is correct
19 Correct 72 ms 81860 KB Output is correct
20 Correct 61 ms 81844 KB Output is correct
21 Correct 62 ms 81820 KB Output is correct
22 Correct 70 ms 81920 KB Output is correct
23 Correct 68 ms 82080 KB Output is correct
24 Correct 62 ms 82248 KB Output is correct
25 Correct 63 ms 81960 KB Output is correct
26 Correct 62 ms 82124 KB Output is correct
27 Correct 62 ms 82008 KB Output is correct
28 Correct 63 ms 82612 KB Output is correct
29 Correct 67 ms 84096 KB Output is correct
30 Correct 63 ms 82380 KB Output is correct
31 Correct 68 ms 83012 KB Output is correct
32 Correct 63 ms 82604 KB Output is correct
33 Correct 68 ms 86432 KB Output is correct
34 Correct 67 ms 86432 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 81612 KB Output is correct
2 Correct 63 ms 81636 KB Output is correct
3 Correct 61 ms 81712 KB Output is correct
4 Correct 61 ms 81628 KB Output is correct
5 Correct 61 ms 81652 KB Output is correct
6 Correct 62 ms 81720 KB Output is correct
7 Correct 61 ms 81684 KB Output is correct
8 Correct 66 ms 81696 KB Output is correct
9 Correct 62 ms 81728 KB Output is correct
10 Correct 65 ms 81788 KB Output is correct
11 Correct 61 ms 81852 KB Output is correct
12 Correct 62 ms 81668 KB Output is correct
13 Correct 62 ms 81740 KB Output is correct
14 Correct 64 ms 81848 KB Output is correct
15 Correct 65 ms 81860 KB Output is correct
16 Correct 61 ms 81808 KB Output is correct
17 Correct 63 ms 82248 KB Output is correct
18 Correct 62 ms 81996 KB Output is correct
19 Correct 63 ms 81828 KB Output is correct
20 Correct 62 ms 81824 KB Output is correct
21 Correct 63 ms 81728 KB Output is correct
22 Correct 63 ms 81908 KB Output is correct
23 Correct 64 ms 81996 KB Output is correct
24 Correct 62 ms 82248 KB Output is correct
25 Correct 62 ms 81984 KB Output is correct
26 Correct 63 ms 82132 KB Output is correct
27 Correct 63 ms 82028 KB Output is correct
28 Correct 63 ms 82624 KB Output is correct
29 Correct 65 ms 84116 KB Output is correct
30 Correct 63 ms 82316 KB Output is correct
31 Correct 64 ms 82992 KB Output is correct
32 Correct 63 ms 82636 KB Output is correct
33 Correct 68 ms 86476 KB Output is correct
34 Correct 67 ms 86548 KB Output is correct
35 Correct 70 ms 85896 KB Output is correct
36 Correct 63 ms 82440 KB Output is correct
37 Correct 75 ms 89036 KB Output is correct
38 Correct 82 ms 88348 KB Output is correct
39 Correct 81 ms 88396 KB Output is correct
40 Correct 76 ms 88372 KB Output is correct
41 Correct 80 ms 88448 KB Output is correct
42 Correct 66 ms 82664 KB Output is correct
43 Correct 64 ms 82508 KB Output is correct
44 Correct 64 ms 82344 KB Output is correct
45 Correct 95 ms 100976 KB Output is correct
46 Correct 94 ms 100912 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 81672 KB Output is correct
2 Correct 63 ms 81672 KB Output is correct
3 Correct 69 ms 81696 KB Output is correct
4 Correct 66 ms 81656 KB Output is correct
5 Correct 64 ms 81612 KB Output is correct
6 Correct 72 ms 81672 KB Output is correct
7 Correct 67 ms 81664 KB Output is correct
8 Correct 61 ms 81636 KB Output is correct
9 Correct 61 ms 81616 KB Output is correct
10 Correct 81 ms 81708 KB Output is correct
11 Correct 62 ms 81824 KB Output is correct
12 Correct 60 ms 81684 KB Output is correct
13 Correct 66 ms 81652 KB Output is correct
14 Correct 62 ms 81904 KB Output is correct
15 Correct 62 ms 81868 KB Output is correct
16 Correct 61 ms 81764 KB Output is correct
17 Correct 63 ms 82280 KB Output is correct
18 Correct 61 ms 81996 KB Output is correct
19 Correct 61 ms 81840 KB Output is correct
20 Correct 64 ms 81740 KB Output is correct
21 Correct 62 ms 81740 KB Output is correct
22 Correct 65 ms 81920 KB Output is correct
23 Correct 68 ms 81976 KB Output is correct
24 Correct 66 ms 82172 KB Output is correct
25 Correct 62 ms 82020 KB Output is correct
26 Correct 64 ms 82084 KB Output is correct
27 Correct 67 ms 81984 KB Output is correct
28 Correct 62 ms 82568 KB Output is correct
29 Correct 86 ms 84092 KB Output is correct
30 Correct 61 ms 82356 KB Output is correct
31 Correct 63 ms 83028 KB Output is correct
32 Correct 62 ms 82672 KB Output is correct
33 Correct 68 ms 86460 KB Output is correct
34 Correct 67 ms 86440 KB Output is correct
35 Correct 69 ms 85836 KB Output is correct
36 Correct 75 ms 82348 KB Output is correct
37 Correct 74 ms 89036 KB Output is correct
38 Correct 75 ms 88408 KB Output is correct
39 Correct 74 ms 88328 KB Output is correct
40 Correct 73 ms 88396 KB Output is correct
41 Correct 73 ms 88396 KB Output is correct
42 Correct 64 ms 82620 KB Output is correct
43 Correct 64 ms 82520 KB Output is correct
44 Correct 67 ms 82376 KB Output is correct
45 Correct 94 ms 100944 KB Output is correct
46 Correct 99 ms 100976 KB Output is correct
47 Correct 114 ms 111644 KB Output is correct
48 Correct 76 ms 91212 KB Output is correct
49 Correct 71 ms 87680 KB Output is correct
50 Correct 67 ms 87736 KB Output is correct
51 Correct 84 ms 94632 KB Output is correct
52 Correct 91 ms 95772 KB Output is correct
53 Correct 72 ms 85580 KB Output is correct
54 Correct 68 ms 83104 KB Output is correct
55 Correct 63 ms 84180 KB Output is correct
56 Correct 67 ms 83776 KB Output is correct
57 Correct 88 ms 99376 KB Output is correct
58 Correct 66 ms 85028 KB Output is correct
59 Correct 71 ms 86344 KB Output is correct
60 Correct 69 ms 87960 KB Output is correct
61 Correct 71 ms 86856 KB Output is correct
62 Correct 90 ms 101584 KB Output is correct
63 Correct 258 ms 173384 KB Output is correct
64 Correct 361 ms 194164 KB Output is correct
65 Correct 445 ms 243700 KB Output is correct
66 Runtime error 193 ms 260136 KB Execution killed with signal 11
67 Halted 0 ms 0 KB -