oj.uz

Submission #826652

# Submission time Handle Problem Language Result Execution time Memory
826652 2023-08-15T19:04:12 Z cig32 Jakarta Skyscrapers (APIO15_skyscraper) C++17
10 / 100
 139 ms 171712 KB 
#include "bits/stdc++.h"
using namespace std;
#define double long double
const int MAXN = 15000000;
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];
int dq[MAXN];
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]=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];
  bitset<MAXN2> vis;
  //bool vis[k];
  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++];
    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) {
            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:80:8: warning: 'st' may be used uninitialized in this function [-Wmaybe-uninitialized]
   80 |   dq[0]=st;
      |   ~~~~~^~~
skyscraper.cpp:101:17: warning: 'en' may be used uninitialized in this function [-Wmaybe-uninitialized]
  101 |   cout<<(dist[en]==1e9?-1:dist[en])<<"\n";
      |          ~~~~~~~^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 84556 KB Output is correct
2 Correct 60 ms 84564 KB Output is correct
3 Correct 59 ms 84636 KB Output is correct
4 Correct 60 ms 84608 KB Output is correct
5 Correct 60 ms 84648 KB Output is correct
6 Correct 59 ms 84556 KB Output is correct
7 Correct 63 ms 84576 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 84560 KB Output is correct
2 Correct 59 ms 84524 KB Output is correct
3 Correct 59 ms 84632 KB Output is correct
4 Correct 59 ms 84568 KB Output is correct
5 Correct 59 ms 84556 KB Output is correct
6 Correct 58 ms 84556 KB Output is correct
7 Correct 64 ms 84628 KB Output is correct
8 Correct 59 ms 84560 KB Output is correct
9 Correct 61 ms 84616 KB Output is correct
10 Runtime error 138 ms 171604 KB Execution killed with signal 7
11 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 84536 KB Output is correct
2 Correct 59 ms 84564 KB Output is correct
3 Correct 58 ms 84556 KB Output is correct
4 Correct 60 ms 84604 KB Output is correct
5 Correct 59 ms 84552 KB Output is correct
6 Correct 59 ms 84632 KB Output is correct
7 Correct 58 ms 84580 KB Output is correct
8 Correct 58 ms 84660 KB Output is correct
9 Correct 60 ms 84644 KB Output is correct
10 Runtime error 136 ms 171528 KB Execution killed with signal 7
11 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 84556 KB Output is correct
2 Correct 59 ms 84564 KB Output is correct
3 Correct 60 ms 84624 KB Output is correct
4 Correct 60 ms 84592 KB Output is correct
5 Correct 60 ms 84556 KB Output is correct
6 Correct 60 ms 84540 KB Output is correct
7 Correct 59 ms 84628 KB Output is correct
8 Correct 61 ms 84648 KB Output is correct
9 Correct 60 ms 84556 KB Output is correct
10 Runtime error 136 ms 171568 KB Execution killed with signal 7
11 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 84556 KB Output is correct
2 Correct 64 ms 84600 KB Output is correct
3 Correct 59 ms 84528 KB Output is correct
4 Correct 60 ms 84596 KB Output is correct
5 Correct 62 ms 84524 KB Output is correct
6 Correct 59 ms 84652 KB Output is correct
7 Correct 58 ms 84628 KB Output is correct
8 Correct 60 ms 84572 KB Output is correct
9 Correct 60 ms 84564 KB Output is correct
10 Runtime error 139 ms 171712 KB Execution killed with signal 7
11 Halted 0 ms 0 KB -