oj.uz

답안 #826635

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
826635 2023-08-15T18:39:56 Z cig32 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 277 ms 194020 KB 
#include "bits/stdc++.h"
using namespace std;
#define double long double
const int MAXN = 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[MAXN];
int cur[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 = 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<MAXN; i++) ps[i]+=ps[i-1];
  for(int i=0; i<MAXN; 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:105:17: warning: 'en' may be used uninitialized in this function [-Wmaybe-uninitialized]
  105 |   cout<<(dist[en]==1e9?-1:dist[en])<<"\n";
      |          ~~~~~~~^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 81680 KB Output is correct
2 Correct 57 ms 81676 KB Output is correct
3 Correct 58 ms 81612 KB Output is correct
4 Correct 57 ms 81636 KB Output is correct
5 Correct 60 ms 81724 KB Output is correct
6 Correct 58 ms 81672 KB Output is correct
7 Correct 57 ms 81608 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 81676 KB Output is correct
2 Correct 60 ms 81604 KB Output is correct
3 Correct 62 ms 81608 KB Output is correct
4 Correct 57 ms 81704 KB Output is correct
5 Correct 56 ms 81612 KB Output is correct
6 Correct 57 ms 81624 KB Output is correct
7 Correct 56 ms 81608 KB Output is correct
8 Correct 57 ms 81724 KB Output is correct
9 Correct 58 ms 81608 KB Output is correct
10 Correct 56 ms 81672 KB Output is correct
11 Correct 57 ms 81852 KB Output is correct
12 Correct 59 ms 81844 KB Output is correct
13 Correct 57 ms 81712 KB Output is correct
14 Correct 57 ms 81884 KB Output is correct
15 Correct 58 ms 81932 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 81624 KB Output is correct
2 Correct 57 ms 81620 KB Output is correct
3 Correct 57 ms 81708 KB Output is correct
4 Correct 58 ms 81612 KB Output is correct
5 Correct 57 ms 81704 KB Output is correct
6 Correct 57 ms 81608 KB Output is correct
7 Correct 58 ms 81612 KB Output is correct
8 Correct 63 ms 81760 KB Output is correct
9 Correct 57 ms 81612 KB Output is correct
10 Correct 61 ms 81732 KB Output is correct
11 Correct 58 ms 81856 KB Output is correct
12 Correct 58 ms 81636 KB Output is correct
13 Correct 61 ms 81748 KB Output is correct
14 Correct 57 ms 81880 KB Output is correct
15 Correct 60 ms 81892 KB Output is correct
16 Correct 57 ms 81752 KB Output is correct
17 Correct 58 ms 82300 KB Output is correct
18 Correct 58 ms 81924 KB Output is correct
19 Correct 58 ms 81852 KB Output is correct
20 Correct 57 ms 81808 KB Output is correct
21 Correct 56 ms 81768 KB Output is correct
22 Correct 59 ms 82028 KB Output is correct
23 Correct 56 ms 81920 KB Output is correct
24 Correct 60 ms 82216 KB Output is correct
25 Correct 57 ms 81916 KB Output is correct
26 Correct 57 ms 82044 KB Output is correct
27 Correct 57 ms 81996 KB Output is correct
28 Correct 58 ms 82512 KB Output is correct
29 Correct 61 ms 84216 KB Output is correct
30 Correct 58 ms 82392 KB Output is correct
31 Correct 59 ms 83052 KB Output is correct
32 Correct 58 ms 82672 KB Output is correct
33 Correct 62 ms 86448 KB Output is correct
34 Correct 63 ms 86456 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 81648 KB Output is correct
2 Correct 57 ms 81612 KB Output is correct
3 Correct 57 ms 81632 KB Output is correct
4 Correct 58 ms 81676 KB Output is correct
5 Correct 62 ms 81616 KB Output is correct
6 Correct 56 ms 81636 KB Output is correct
7 Correct 57 ms 81672 KB Output is correct
8 Correct 59 ms 81808 KB Output is correct
9 Correct 57 ms 81660 KB Output is correct
10 Correct 57 ms 81712 KB Output is correct
11 Correct 57 ms 81880 KB Output is correct
12 Correct 58 ms 81700 KB Output is correct
13 Correct 58 ms 81716 KB Output is correct
14 Correct 58 ms 81868 KB Output is correct
15 Correct 62 ms 81876 KB Output is correct
16 Correct 56 ms 81868 KB Output is correct
17 Correct 57 ms 82288 KB Output is correct
18 Correct 58 ms 81996 KB Output is correct
19 Correct 56 ms 81920 KB Output is correct
20 Correct 57 ms 81824 KB Output is correct
21 Correct 57 ms 81716 KB Output is correct
22 Correct 60 ms 81836 KB Output is correct
23 Correct 58 ms 81864 KB Output is correct
24 Correct 58 ms 82132 KB Output is correct
25 Correct 58 ms 81996 KB Output is correct
26 Correct 57 ms 82060 KB Output is correct
27 Correct 57 ms 81996 KB Output is correct
28 Correct 59 ms 82588 KB Output is correct
29 Correct 62 ms 84180 KB Output is correct
30 Correct 62 ms 82424 KB Output is correct
31 Correct 58 ms 83040 KB Output is correct
32 Correct 58 ms 82616 KB Output is correct
33 Correct 66 ms 86472 KB Output is correct
34 Correct 64 ms 86536 KB Output is correct
35 Correct 66 ms 85688 KB Output is correct
36 Correct 62 ms 82344 KB Output is correct
37 Correct 70 ms 88760 KB Output is correct
38 Correct 69 ms 88148 KB Output is correct
39 Correct 71 ms 88128 KB Output is correct
40 Correct 71 ms 88032 KB Output is correct
41 Correct 70 ms 88140 KB Output is correct
42 Correct 62 ms 82388 KB Output is correct
43 Correct 61 ms 82288 KB Output is correct
44 Correct 61 ms 82160 KB Output is correct
45 Correct 89 ms 100804 KB Output is correct
46 Correct 91 ms 100772 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 81620 KB Output is correct
2 Correct 59 ms 81676 KB Output is correct
3 Correct 58 ms 81608 KB Output is correct
4 Correct 57 ms 81724 KB Output is correct
5 Correct 58 ms 81660 KB Output is correct
6 Correct 57 ms 81680 KB Output is correct
7 Correct 57 ms 81724 KB Output is correct
8 Correct 56 ms 81604 KB Output is correct
9 Correct 57 ms 81636 KB Output is correct
10 Correct 57 ms 81776 KB Output is correct
11 Correct 56 ms 81808 KB Output is correct
12 Correct 57 ms 81724 KB Output is correct
13 Correct 57 ms 81664 KB Output is correct
14 Correct 57 ms 81860 KB Output is correct
15 Correct 57 ms 81864 KB Output is correct
16 Correct 57 ms 81868 KB Output is correct
17 Correct 58 ms 82272 KB Output is correct
18 Correct 57 ms 81996 KB Output is correct
19 Correct 57 ms 81876 KB Output is correct
20 Correct 61 ms 81740 KB Output is correct
21 Correct 60 ms 81900 KB Output is correct
22 Correct 65 ms 81864 KB Output is correct
23 Correct 58 ms 81964 KB Output is correct
24 Correct 57 ms 82192 KB Output is correct
25 Correct 60 ms 81960 KB Output is correct
26 Correct 57 ms 82084 KB Output is correct
27 Correct 58 ms 81972 KB Output is correct
28 Correct 59 ms 82576 KB Output is correct
29 Correct 60 ms 84172 KB Output is correct
30 Correct 58 ms 82312 KB Output is correct
31 Correct 59 ms 83008 KB Output is correct
32 Correct 60 ms 82624 KB Output is correct
33 Correct 63 ms 86444 KB Output is correct
34 Correct 69 ms 86536 KB Output is correct
35 Correct 64 ms 85716 KB Output is correct
36 Correct 58 ms 82404 KB Output is correct
37 Correct 68 ms 88796 KB Output is correct
38 Correct 69 ms 88016 KB Output is correct
39 Correct 68 ms 88064 KB Output is correct
40 Correct 77 ms 88104 KB Output is correct
41 Correct 76 ms 88088 KB Output is correct
42 Correct 60 ms 82384 KB Output is correct
43 Correct 60 ms 82320 KB Output is correct
44 Correct 60 ms 82100 KB Output is correct
45 Correct 97 ms 100812 KB Output is correct
46 Correct 104 ms 100724 KB Output is correct
47 Correct 128 ms 111440 KB Output is correct
48 Correct 66 ms 91048 KB Output is correct
49 Correct 63 ms 87480 KB Output is correct
50 Correct 63 ms 87588 KB Output is correct
51 Correct 82 ms 94492 KB Output is correct
52 Correct 79 ms 95428 KB Output is correct
53 Correct 64 ms 85212 KB Output is correct
54 Correct 65 ms 83148 KB Output is correct
55 Correct 60 ms 84172 KB Output is correct
56 Correct 61 ms 83528 KB Output is correct
57 Correct 88 ms 99360 KB Output is correct
58 Correct 63 ms 84996 KB Output is correct
59 Correct 65 ms 86180 KB Output is correct
60 Correct 76 ms 87760 KB Output is correct
61 Correct 65 ms 86580 KB Output is correct
62 Correct 82 ms 101328 KB Output is correct
63 Correct 225 ms 173148 KB Output is correct
64 Correct 277 ms 194020 KB Output is correct
65 Runtime error 142 ms 193272 KB Execution killed with signal 11
66 Halted 0 ms 0 KB -