oj.uz

답안 #597160

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
597160 2022-07-15T16:00:23 Z slime Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 325 ms 262144 KB 
#include "bits/stdc++.h"
using namespace std;
const int MAXN = 4e6 + 10;
const int MOD = 1e9 + 7;
#define ll __int128
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;
}
ll read() { int x; cin >> x; return (ll)x; }
long long bm(long long b, long long p) {
  if(p==0) return 1 % MOD;
  long long r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
long long inv(long long b) { 
  return bm(b, MOD-2);
}
long long f[MAXN];
long long nCr(int n, int r) { 
  long long ans = f[n]; ans *= inv(f[r]); ans %= MOD;
  ans *= inv(f[n-r]); ans %= MOD; return ans;
}
long long fib[MAXN], lucas[MAXN];
void precomp() { 
  for(int i=0; i<MAXN; i++) f[i] = (i == 0 ? 1 % MOD : (f[i-1] * i) % MOD); 
  lucas[0] = 2;
  lucas[1] = 1;
  for(int i=2; i<MAXN; i++) lucas[i] = (lucas[i-2] + lucas[i-1]) % MOD;
  fib[0] = 0;
  fib[1] = 1;
  for(int i=2; i<MAXN; i++) fib[i] = (fib[i-2] + fib[i-1]) % MOD;
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void gay(int i) { cout << "Case #" << i << ": "; }
int csb(int l, int r, int k) { // count number of [l, r] such that i & 2^k > 0
  if(l > r) return 0;
  if(l == 0) {
    int s = r / (1ll << (k+1)); // number of complete cycles
    int t = r % (1ll << (k+1));
    int ans = s * (1ll << k);
    ans += (t >= (1ll << k) ? t - (1ll << k) + 1 : 0);
    return ans;
  }
  else return csb(0, r, k) - csb(0, l - 1, k);
}
int lis(vector<int> a) {
  int n = a.size();
  int bucket[n+1];
  for(int i=1; i<=n; i++) bucket[i] = 1e18;
  int ans = 1;
  for(int x: a) {
    auto it = lower_bound(bucket + 1, bucket +n +1, x);
    int d = distance(bucket, it);
    ans = max(ans, d);
    bucket[d] = min(bucket[d], x);
  }
  return ans;
}
vector<pair<int, short> > adj[MAXN];
void solve(int tc) {
  int n, m;
  cin >> n >> m;
  int nxt = n;
  int sq = ceil(sqrt(n));
  int link[n][sq];
  for(int i=1; i<sq; i++) {
    
    for(int j=0; j<i; j++) {
      for(int k=j; k<n; k+=i) {
        link[k][i] = nxt;
        nxt++;
      }
      for(int k=j; k<n; k+=i) {
        if(k+i < n) {
          adj[link[k][i]].push_back({link[k+i][i], 1});
          adj[link[k+i][i]].push_back({link[k][i], 1});
        }
        adj[link[k][i]].push_back({k, 0});
      }
    }
  }
  int st, en;
  for(int i=0; i<m; i++) {
    //cout << "i = " << i << "\n";
    int b, p;
    cin >> b >> p;
    if(i == 0) st = b;
    else if(i == 1) en = b;
    
    if(p >= sq) {
      for(int j=b%p; j<n; j+=p) {
        link[j][0] = nxt;
        nxt++;
      }
      for(int j=b%p; j<n; j+=p) {
        if(j+p < n) {
          adj[link[j][0]].push_back({link[j+p][0], 1});
          adj[link[j+p][0]].push_back({link[j][0], 1});
        }
        adj[link[j][0]].push_back({j, 0});
      }
      adj[b].push_back({link[b][0], 0});
    }
    else {
      adj[b].push_back({link[b][p], 0});
    }
  }
 
  priority_queue<pair<int, int>,vector<pair<int, int> >,greater<pair<int, int> > > pq;
  
  int dist[nxt];
  
  bool vis[nxt];
  for(int i=0; i<nxt; i++) vis[i] = 0, dist[i] = 1e9;
  dist[st] = 0;
  pq.push({0, st});
  while(pq.size()) {
    pair<int, int> t = pq.top(); pq.pop();
    if(!vis[t.second]) {
      vis[t.second] = 1;
      for(pair<int, int> x: adj[t.second]) {
        if(!vis[x.first] && dist[x.first] > dist[t.second] + x.second) {
          dist[x.first] = dist[t.second] + x.second;
          pq.push({dist[x.first], x.first});
        }
      }
    }
  }
  cout << (dist[en] == 1e9 ? -1 : dist[en]) << "\n";
}
int32_t main() {
  precomp();
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
// I don't know geometry.
// Teaming is unfair.

Compilation message

skyscraper.cpp: In function 'int lis(std::vector<int>)':
skyscraper.cpp:53:39: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   53 |   for(int i=1; i<=n; i++) bucket[i] = 1e18;
      |                                       ^~~~
skyscraper.cpp: In function 'void solve(int)':
skyscraper.cpp:133:19: warning: 'en' may be used uninitialized in this function [-Wmaybe-uninitialized]
  133 |   cout << (dist[en] == 1e9 ? -1 : dist[en]) << "\n";
      |            ~~~~~~~^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 141 ms 188372 KB Output is correct
2 Correct 138 ms 188128 KB Output is correct
3 Correct 142 ms 188164 KB Output is correct
4 Correct 142 ms 188112 KB Output is correct
5 Correct 139 ms 188088 KB Output is correct
6 Correct 141 ms 188108 KB Output is correct
7 Correct 153 ms 188072 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 146 ms 188108 KB Output is correct
2 Correct 149 ms 188096 KB Output is correct
3 Correct 136 ms 188064 KB Output is correct
4 Correct 136 ms 188084 KB Output is correct
5 Correct 149 ms 188272 KB Output is correct
6 Correct 136 ms 188052 KB Output is correct
7 Correct 138 ms 188168 KB Output is correct
8 Correct 145 ms 188080 KB Output is correct
9 Correct 152 ms 188196 KB Output is correct
10 Correct 142 ms 188236 KB Output is correct
11 Correct 143 ms 188436 KB Output is correct
12 Correct 144 ms 188192 KB Output is correct
13 Correct 152 ms 188176 KB Output is correct
14 Correct 145 ms 188492 KB Output is correct
15 Correct 139 ms 188364 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 145 ms 188104 KB Output is correct
2 Correct 138 ms 188156 KB Output is correct
3 Correct 134 ms 188140 KB Output is correct
4 Correct 147 ms 188132 KB Output is correct
5 Correct 141 ms 188108 KB Output is correct
6 Correct 141 ms 188064 KB Output is correct
7 Correct 140 ms 188152 KB Output is correct
8 Correct 143 ms 188120 KB Output is correct
9 Correct 155 ms 188100 KB Output is correct
10 Correct 146 ms 188420 KB Output is correct
11 Correct 143 ms 188500 KB Output is correct
12 Correct 146 ms 188176 KB Output is correct
13 Correct 135 ms 188144 KB Output is correct
14 Correct 142 ms 188448 KB Output is correct
15 Correct 141 ms 188444 KB Output is correct
16 Correct 143 ms 188436 KB Output is correct
17 Correct 141 ms 189708 KB Output is correct
18 Correct 145 ms 192312 KB Output is correct
19 Correct 148 ms 193200 KB Output is correct
20 Correct 147 ms 193024 KB Output is correct
21 Correct 140 ms 188580 KB Output is correct
22 Correct 147 ms 192472 KB Output is correct
23 Correct 147 ms 191772 KB Output is correct
24 Correct 161 ms 193060 KB Output is correct
25 Correct 155 ms 193132 KB Output is correct
26 Correct 150 ms 193288 KB Output is correct
27 Correct 149 ms 193116 KB Output is correct
28 Correct 155 ms 193532 KB Output is correct
29 Correct 151 ms 193008 KB Output is correct
30 Correct 146 ms 193084 KB Output is correct
31 Correct 151 ms 193228 KB Output is correct
32 Correct 163 ms 193612 KB Output is correct
33 Correct 165 ms 195064 KB Output is correct
34 Correct 162 ms 195020 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 138 ms 188108 KB Output is correct
2 Correct 142 ms 188160 KB Output is correct
3 Correct 137 ms 188264 KB Output is correct
4 Correct 135 ms 188164 KB Output is correct
5 Correct 135 ms 188148 KB Output is correct
6 Correct 143 ms 188140 KB Output is correct
7 Correct 135 ms 188112 KB Output is correct
8 Correct 142 ms 188072 KB Output is correct
9 Correct 144 ms 188112 KB Output is correct
10 Correct 138 ms 188200 KB Output is correct
11 Correct 137 ms 188452 KB Output is correct
12 Correct 142 ms 188372 KB Output is correct
13 Correct 153 ms 188248 KB Output is correct
14 Correct 141 ms 188440 KB Output is correct
15 Correct 137 ms 188392 KB Output is correct
16 Correct 139 ms 188496 KB Output is correct
17 Correct 150 ms 189636 KB Output is correct
18 Correct 145 ms 192324 KB Output is correct
19 Correct 146 ms 193120 KB Output is correct
20 Correct 147 ms 193100 KB Output is correct
21 Correct 140 ms 188664 KB Output is correct
22 Correct 148 ms 192436 KB Output is correct
23 Correct 142 ms 191716 KB Output is correct
24 Correct 147 ms 193032 KB Output is correct
25 Correct 155 ms 193240 KB Output is correct
26 Correct 158 ms 193212 KB Output is correct
27 Correct 146 ms 193080 KB Output is correct
28 Correct 146 ms 193532 KB Output is correct
29 Correct 154 ms 192984 KB Output is correct
30 Correct 147 ms 193004 KB Output is correct
31 Correct 147 ms 193116 KB Output is correct
32 Correct 149 ms 193616 KB Output is correct
33 Correct 172 ms 195140 KB Output is correct
34 Correct 159 ms 195020 KB Output is correct
35 Correct 163 ms 195124 KB Output is correct
36 Correct 147 ms 190740 KB Output is correct
37 Correct 200 ms 199416 KB Output is correct
38 Correct 186 ms 198988 KB Output is correct
39 Correct 186 ms 198976 KB Output is correct
40 Correct 204 ms 199040 KB Output is correct
41 Correct 190 ms 199064 KB Output is correct
42 Correct 149 ms 193488 KB Output is correct
43 Correct 153 ms 193456 KB Output is correct
44 Correct 151 ms 193416 KB Output is correct
45 Correct 308 ms 213580 KB Output is correct
46 Correct 307 ms 213580 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 139 ms 188084 KB Output is correct
2 Correct 146 ms 188108 KB Output is correct
3 Correct 144 ms 188164 KB Output is correct
4 Correct 138 ms 188156 KB Output is correct
5 Correct 138 ms 188176 KB Output is correct
6 Correct 147 ms 188120 KB Output is correct
7 Correct 143 ms 188104 KB Output is correct
8 Correct 136 ms 188100 KB Output is correct
9 Correct 142 ms 188120 KB Output is correct
10 Correct 138 ms 188220 KB Output is correct
11 Correct 140 ms 188424 KB Output is correct
12 Correct 140 ms 188364 KB Output is correct
13 Correct 143 ms 188236 KB Output is correct
14 Correct 138 ms 188424 KB Output is correct
15 Correct 136 ms 188476 KB Output is correct
16 Correct 139 ms 188352 KB Output is correct
17 Correct 148 ms 189616 KB Output is correct
18 Correct 164 ms 192244 KB Output is correct
19 Correct 149 ms 193156 KB Output is correct
20 Correct 152 ms 193240 KB Output is correct
21 Correct 209 ms 188628 KB Output is correct
22 Correct 142 ms 192460 KB Output is correct
23 Correct 147 ms 191796 KB Output is correct
24 Correct 154 ms 192976 KB Output is correct
25 Correct 156 ms 193204 KB Output is correct
26 Correct 155 ms 193236 KB Output is correct
27 Correct 150 ms 193052 KB Output is correct
28 Correct 157 ms 193468 KB Output is correct
29 Correct 153 ms 193068 KB Output is correct
30 Correct 147 ms 192952 KB Output is correct
31 Correct 147 ms 193092 KB Output is correct
32 Correct 156 ms 193760 KB Output is correct
33 Correct 166 ms 195056 KB Output is correct
34 Correct 162 ms 195036 KB Output is correct
35 Correct 178 ms 195088 KB Output is correct
36 Correct 157 ms 190676 KB Output is correct
37 Correct 193 ms 199344 KB Output is correct
38 Correct 192 ms 199052 KB Output is correct
39 Correct 203 ms 199056 KB Output is correct
40 Correct 188 ms 199040 KB Output is correct
41 Correct 185 ms 199024 KB Output is correct
42 Correct 153 ms 193560 KB Output is correct
43 Correct 154 ms 193476 KB Output is correct
44 Correct 155 ms 193340 KB Output is correct
45 Correct 299 ms 213540 KB Output is correct
46 Correct 325 ms 213548 KB Output is correct
47 Runtime error 286 ms 262144 KB Execution killed with signal 9
48 Halted 0 ms 0 KB -