oj.uz

Submission #826790

# Submission time Handle Problem Language Result Execution time Memory
826790 2023-08-16T03:41:10 Z cig32 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 296 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;
unordered_map<int,pair<int, int>> cmds;
int adj[MAXN];
int id;
int ps[MAXN2];
short cur[MAXN2];
int dq[MAXN];
unordered_map<int,int> dist;
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);
}
// 勿忘初衷

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 62896 KB Output is correct
2 Correct 45 ms 62900 KB Output is correct
3 Correct 45 ms 62900 KB Output is correct
4 Correct 45 ms 63008 KB Output is correct
5 Correct 48 ms 63204 KB Output is correct
6 Correct 46 ms 62968 KB Output is correct
7 Correct 46 ms 62992 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 62900 KB Output is correct
2 Correct 45 ms 63000 KB Output is correct
3 Correct 45 ms 62960 KB Output is correct
4 Correct 45 ms 62924 KB Output is correct
5 Correct 45 ms 63024 KB Output is correct
6 Correct 45 ms 62968 KB Output is correct
7 Correct 46 ms 63048 KB Output is correct
8 Correct 45 ms 62936 KB Output is correct
9 Correct 46 ms 63040 KB Output is correct
10 Correct 46 ms 63212 KB Output is correct
11 Correct 46 ms 63788 KB Output is correct
12 Correct 44 ms 63136 KB Output is correct
13 Correct 45 ms 63052 KB Output is correct
14 Correct 48 ms 64044 KB Output is correct
15 Correct 48 ms 64144 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 62944 KB Output is correct
2 Correct 45 ms 63040 KB Output is correct
3 Correct 50 ms 62960 KB Output is correct
4 Correct 46 ms 62948 KB Output is correct
5 Correct 50 ms 62924 KB Output is correct
6 Correct 45 ms 62924 KB Output is correct
7 Correct 47 ms 62996 KB Output is correct
8 Correct 45 ms 62924 KB Output is correct
9 Correct 46 ms 63004 KB Output is correct
10 Correct 46 ms 63196 KB Output is correct
11 Correct 47 ms 63744 KB Output is correct
12 Correct 46 ms 63116 KB Output is correct
13 Correct 47 ms 63020 KB Output is correct
14 Correct 48 ms 64144 KB Output is correct
15 Correct 48 ms 64124 KB Output is correct
16 Correct 47 ms 63564 KB Output is correct
17 Correct 50 ms 65256 KB Output is correct
18 Correct 48 ms 64060 KB Output is correct
19 Correct 46 ms 63924 KB Output is correct
20 Correct 48 ms 63560 KB Output is correct
21 Correct 46 ms 63436 KB Output is correct
22 Correct 47 ms 63976 KB Output is correct
23 Correct 48 ms 64048 KB Output is correct
24 Correct 50 ms 65012 KB Output is correct
25 Correct 48 ms 64160 KB Output is correct
26 Correct 47 ms 64808 KB Output is correct
27 Correct 51 ms 64220 KB Output is correct
28 Correct 53 ms 66992 KB Output is correct
29 Correct 66 ms 75124 KB Output is correct
30 Correct 51 ms 66264 KB Output is correct
31 Correct 59 ms 69376 KB Output is correct
32 Correct 53 ms 67420 KB Output is correct
33 Correct 89 ms 86860 KB Output is correct
34 Correct 86 ms 86628 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 62996 KB Output is correct
2 Correct 46 ms 62964 KB Output is correct
3 Correct 46 ms 62896 KB Output is correct
4 Correct 46 ms 63020 KB Output is correct
5 Correct 46 ms 62912 KB Output is correct
6 Correct 46 ms 62984 KB Output is correct
7 Correct 45 ms 63012 KB Output is correct
8 Correct 45 ms 62996 KB Output is correct
9 Correct 46 ms 63056 KB Output is correct
10 Correct 46 ms 63280 KB Output is correct
11 Correct 48 ms 63740 KB Output is correct
12 Correct 47 ms 63180 KB Output is correct
13 Correct 47 ms 63052 KB Output is correct
14 Correct 47 ms 64112 KB Output is correct
15 Correct 48 ms 64044 KB Output is correct
16 Correct 46 ms 63544 KB Output is correct
17 Correct 50 ms 65384 KB Output is correct
18 Correct 47 ms 64076 KB Output is correct
19 Correct 48 ms 63876 KB Output is correct
20 Correct 47 ms 63460 KB Output is correct
21 Correct 47 ms 63472 KB Output is correct
22 Correct 47 ms 64008 KB Output is correct
23 Correct 52 ms 64120 KB Output is correct
24 Correct 48 ms 65032 KB Output is correct
25 Correct 47 ms 64212 KB Output is correct
26 Correct 47 ms 64840 KB Output is correct
27 Correct 47 ms 64272 KB Output is correct
28 Correct 57 ms 67036 KB Output is correct
29 Correct 65 ms 75012 KB Output is correct
30 Correct 51 ms 66264 KB Output is correct
31 Correct 57 ms 69456 KB Output is correct
32 Correct 59 ms 67376 KB Output is correct
33 Correct 89 ms 86832 KB Output is correct
34 Correct 85 ms 86664 KB Output is correct
35 Correct 81 ms 79344 KB Output is correct
36 Correct 52 ms 66044 KB Output is correct
37 Correct 96 ms 93412 KB Output is correct
38 Correct 92 ms 88988 KB Output is correct
39 Correct 90 ms 88988 KB Output is correct
40 Correct 91 ms 88936 KB Output is correct
41 Correct 97 ms 88924 KB Output is correct
42 Correct 53 ms 66164 KB Output is correct
43 Correct 53 ms 65696 KB Output is correct
44 Correct 52 ms 64740 KB Output is correct
45 Correct 222 ms 136044 KB Output is correct
46 Correct 200 ms 135400 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 62960 KB Output is correct
2 Correct 46 ms 62980 KB Output is correct
3 Correct 45 ms 62936 KB Output is correct
4 Correct 46 ms 62900 KB Output is correct
5 Correct 46 ms 62956 KB Output is correct
6 Correct 46 ms 62920 KB Output is correct
7 Correct 45 ms 62924 KB Output is correct
8 Correct 45 ms 63044 KB Output is correct
9 Correct 46 ms 63012 KB Output is correct
10 Correct 51 ms 63212 KB Output is correct
11 Correct 47 ms 63820 KB Output is correct
12 Correct 46 ms 63080 KB Output is correct
13 Correct 46 ms 63076 KB Output is correct
14 Correct 48 ms 64036 KB Output is correct
15 Correct 47 ms 64120 KB Output is correct
16 Correct 46 ms 63588 KB Output is correct
17 Correct 51 ms 65448 KB Output is correct
18 Correct 47 ms 64100 KB Output is correct
19 Correct 46 ms 63820 KB Output is correct
20 Correct 46 ms 63444 KB Output is correct
21 Correct 47 ms 63360 KB Output is correct
22 Correct 47 ms 64040 KB Output is correct
23 Correct 47 ms 64048 KB Output is correct
24 Correct 50 ms 65108 KB Output is correct
25 Correct 48 ms 64204 KB Output is correct
26 Correct 50 ms 64796 KB Output is correct
27 Correct 47 ms 64204 KB Output is correct
28 Correct 53 ms 67036 KB Output is correct
29 Correct 66 ms 75100 KB Output is correct
30 Correct 51 ms 66352 KB Output is correct
31 Correct 56 ms 69348 KB Output is correct
32 Correct 53 ms 67352 KB Output is correct
33 Correct 88 ms 86860 KB Output is correct
34 Correct 90 ms 86620 KB Output is correct
35 Correct 85 ms 79348 KB Output is correct
36 Correct 51 ms 65996 KB Output is correct
37 Correct 96 ms 93292 KB Output is correct
38 Correct 94 ms 89004 KB Output is correct
39 Correct 96 ms 89068 KB Output is correct
40 Correct 90 ms 88884 KB Output is correct
41 Correct 95 ms 88988 KB Output is correct
42 Correct 53 ms 66080 KB Output is correct
43 Correct 54 ms 65744 KB Output is correct
44 Correct 52 ms 64816 KB Output is correct
45 Correct 245 ms 136120 KB Output is correct
46 Correct 199 ms 135296 KB Output is correct
47 Correct 239 ms 188920 KB Output is correct
48 Correct 108 ms 99824 KB Output is correct
49 Correct 84 ms 83956 KB Output is correct
50 Correct 82 ms 84724 KB Output is correct
51 Correct 137 ms 115300 KB Output is correct
52 Correct 168 ms 123824 KB Output is correct
53 Correct 74 ms 79092 KB Output is correct
54 Correct 57 ms 70136 KB Output is correct
55 Correct 64 ms 73532 KB Output is correct
56 Correct 64 ms 71292 KB Output is correct
57 Correct 162 ms 140180 KB Output is correct
58 Correct 73 ms 78836 KB Output is correct
59 Correct 84 ms 82552 KB Output is correct
60 Correct 95 ms 93276 KB Output is correct
61 Correct 81 ms 83148 KB Output is correct
62 Correct 187 ms 140616 KB Output is correct
63 Runtime error 296 ms 262144 KB Execution killed with signal 9
64 Halted 0 ms 0 KB -