oj.uz

Submission #790826

# Submission time Handle Problem Language Result Execution time Memory
790826 2023-07-23T08:40:04 Z penguinman Radio Towers (IOI22_towers) C++17
23 / 100
 4000 ms 2688 KB 
#include "towers.h"

#include <bits/stdc++.h>

using std::vector;
using std::string;
using std::cin;
using std::cout;
using ll = int;
using vi = vector<ll>;
using vii = vector<vi>;
using pii = std::pair<ll,ll>;
#define ln "\n"
#define rep(i,j,k) for(ll i=ll(j); i<ll(k); i++)
#define REP(i,j,k) for(ll i=ll(j); i<=ll(k); i++)
#define per(i,j,k) for(ll i=ll(j); i>=ll(k); i--)
#define all(a) a.begin(), a.end()
#define mp std::make_pair
#define pb emplace_back
constexpr ll inf = (1<<30)+(1<<29)+(1<<28);

ll N;
vi H;
ll D;
vi right, left;
constexpr ll di = 20;
ll sz;
vii pr, mr, pl, ml;
vii sum;

void init(int n, std::vector<int> h) {
  N = n;
  H.resize(N);
  right.resize(N);
  left.resize(N);
  rep(i,0,N) H[i] = h[i];
  D = -1;
}

int max_towers(int L, int R, int d) {
  if(D == -1){
    D = d;
    {
      sz = N/di+10;
      /*
      sum.resize(sz, vi(sz));
      pr.resize(N+2);
      mr.resize(N+2);
      pl.resize(N+2);
      ml.resize(N+2);*/
      std::deque<ll> ima, vma, imi, vmi;
      ima.pb(-3);
      vma.pb(-inf);
      imi.pb(-2);
      vmi.pb(inf);
      rep(i,0,N){
        ll large = lower_bound(all(vmi), H[i]+D)-vmi.begin();
        large = imi[large];
        ll small = lower_bound(all(vma),H[i])-vma.begin()-1;
        small = ima[small];
        if(small >= large) left[i] = small+1;
        else left[i] = -1;
        while(true){
          if(vma[vma.size()-1] > H[i]) vma.pop_back(), ima.pop_back();
          else break;
        }
        vma.pb(H[i]);
        ima.pb(i);
        while(true){
          if(vmi[0] < H[i]) vmi.pop_front(), imi.pop_front();
          else break;
        }
        vmi.emplace_front(H[i]);
        imi.emplace_front(i);
      }
    }
    {
      std::deque<ll> ima, vma, imi, vmi;
      ima.pb(N+3);
      vma.pb(-inf);
      imi.pb(N+2);
      vmi.pb(inf);
      per(i,N-1,0){
        ll large = lower_bound(all(vmi), H[i]+D)-vmi.begin();
        large = imi[large];
        ll small = lower_bound(all(vma),H[i])-vma.begin()-1;
        small = ima[small];
        if(small <= large) right[i] = small-1;
        else right[i] = N;
        while(true){
          if(vma[vma.size()-1] > H[i]) vma.pop_back(), ima.pop_back();
          else break;
        }
        vma.pb(H[i]);
        ima.pb(i);
        while(true){
          if(vmi[0] < H[i]) vmi.pop_front(), imi.pop_front();
          else break;
        }
        vmi.emplace_front(H[i]);
        imi.emplace_front(i);
      }
    }
    /*
    rep(i,0,N){
      left[i]++;
      right[i]++;
      ll ld = (left[i]+di-1)/di;
      ll rd = right[i]/di;
      sum[ld][rd]++;
      ll id = i/di;
      sum[ld][id]--;
      id = (i+di-1)/di;
      sum[id][rd]--;
      pr[right[i]].pb(left[i]);
      pl[left[i]].pb(right[i]);
      ml[i+1].pb(right[i]);
      ml[left[i]].pb(i+1);
      mr[i+1].pb(left[i]);
      mr[right[i]].pb(i+1);
    }
    REP(l,1,sz){
      rep(i,0,sz){
        ll j = i+l;
        if(j >= sz) break;
        sum[i][j] = sum[i+1][j]+sum[i][j-1]-sum[i+1][j-1];
      }
    }*/
  }
  ll ans = 0;
  ll ld = (L+di-1)/di;
  ll rd = R/di;
  //ans = psum[ld][rd]-msum[ld][rd];
  ans = 0;
  rep(i,0,N){
    if(left[i] <= L && R <= right[i]) ans++;
  }
  rep(i,0,L){
    if(R <= right[i]) ans--;
  }
  rep(i,R+1,N){
    if(left[i] <= L) ans--;
  }
  return ans;
}

Compilation message

towers.cpp: In function 'int max_towers(int, int, int)':
towers.cpp:131:6: warning: unused variable 'ld' [-Wunused-variable]
  131 |   ll ld = (L+di-1)/di;
      |      ^~
towers.cpp:132:6: warning: unused variable 'rd' [-Wunused-variable]
  132 |   ll rd = R/di;
      |      ^~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 3893 ms 1580 KB 31st lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 ms 208 KB Output is correct
30 Correct 1 ms 280 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 ms 208 KB Output is correct
30 Correct 1 ms 280 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 14 ms 1488 KB Output is correct
37 Correct 22 ms 2208 KB Output is correct
38 Correct 22 ms 2232 KB Output is correct
39 Correct 27 ms 2212 KB Output is correct
40 Correct 22 ms 2208 KB Output is correct
41 Correct 21 ms 2256 KB Output is correct
42 Correct 26 ms 2212 KB Output is correct
43 Correct 28 ms 2600 KB Output is correct
44 Correct 28 ms 2576 KB Output is correct
45 Correct 27 ms 2376 KB Output is correct
46 Correct 33 ms 2324 KB Output is correct
47 Correct 27 ms 2204 KB Output is correct
48 Correct 26 ms 2228 KB Output is correct
49 Correct 21 ms 2256 KB Output is correct
50 Correct 26 ms 2688 KB Output is correct
51 Correct 25 ms 2560 KB Output is correct
52 Correct 20 ms 2224 KB Output is correct
53 Correct 19 ms 2204 KB Output is correct
54 Correct 19 ms 2256 KB Output is correct
55 Correct 32 ms 2580 KB Output is correct
56 Correct 31 ms 2496 KB Output is correct
57 Correct 21 ms 2092 KB Output is correct
58 Correct 22 ms 2256 KB Output is correct
59 Correct 21 ms 2256 KB Output is correct
60 Correct 20 ms 2256 KB Output is correct
61 Correct 20 ms 2216 KB Output is correct
62 Correct 21 ms 2256 KB Output is correct
63 Correct 22 ms 2256 KB Output is correct
64 Correct 36 ms 2672 KB Output is correct
65 Correct 28 ms 2564 KB Output is correct
66 Correct 26 ms 2352 KB Output is correct
67 Correct 28 ms 2600 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4014 ms 2128 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 3161 ms 748 KB 2nd lines differ - on the 1st token, expected: '7063', found: '7197'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 ms 208 KB Output is correct
30 Correct 1 ms 280 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 14 ms 1488 KB Output is correct
37 Correct 22 ms 2208 KB Output is correct
38 Correct 22 ms 2232 KB Output is correct
39 Correct 27 ms 2212 KB Output is correct
40 Correct 22 ms 2208 KB Output is correct
41 Correct 21 ms 2256 KB Output is correct
42 Correct 26 ms 2212 KB Output is correct
43 Correct 28 ms 2600 KB Output is correct
44 Correct 28 ms 2576 KB Output is correct
45 Correct 27 ms 2376 KB Output is correct
46 Correct 33 ms 2324 KB Output is correct
47 Correct 27 ms 2204 KB Output is correct
48 Correct 26 ms 2228 KB Output is correct
49 Correct 21 ms 2256 KB Output is correct
50 Correct 26 ms 2688 KB Output is correct
51 Correct 25 ms 2560 KB Output is correct
52 Correct 20 ms 2224 KB Output is correct
53 Correct 19 ms 2204 KB Output is correct
54 Correct 19 ms 2256 KB Output is correct
55 Correct 32 ms 2580 KB Output is correct
56 Correct 31 ms 2496 KB Output is correct
57 Correct 21 ms 2092 KB Output is correct
58 Correct 22 ms 2256 KB Output is correct
59 Correct 21 ms 2256 KB Output is correct
60 Correct 20 ms 2256 KB Output is correct
61 Correct 20 ms 2216 KB Output is correct
62 Correct 21 ms 2256 KB Output is correct
63 Correct 22 ms 2256 KB Output is correct
64 Correct 36 ms 2672 KB Output is correct
65 Correct 28 ms 2564 KB Output is correct
66 Correct 26 ms 2352 KB Output is correct
67 Correct 28 ms 2600 KB Output is correct
68 Execution timed out 4014 ms 2128 KB Time limit exceeded
69 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 3893 ms 1580 KB 31st lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -