oj.uz

Submission #790859

# Submission time Handle Problem Language Result Execution time Memory
790859 2023-07-23T09:03:02 Z penguinman Radio Towers (IOI22_towers) C++17
37 / 100
 1255 ms 120032 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+2+di-1)/di;
      sum[id][rd]--;
      pr[right[i]].pb(left[i]);
      pl[left[i]].pb(right[i]);
      ml[i+2].pb(right[i]);
      ml[left[i]].pb(i);
      mr[i].pb(left[i]);
      mr[right[i]].pb(i+2);
    }
    per(l,sz,0){
      rep(i,0,sz){
        ll j = i+l;
        if(j >= sz) break;
        if(i) sum[i][j] += sum[i-1][j];
        if(j+1 < sz) sum[i][j] += sum[i][j+1];
        if(i && j+1<sz) sum[i][j] -= sum[i-1][j+1];
      }
    }
    rep(i,0,N+2){
        sort(all(pr[i]));
        sort(all(pl[i]));
        sort(all(mr[i]));
        sort(all(ml[i]));
    }
  }
  ll ans = 0;
  L++, R++;
  ll ld = L/di;
  ll rd = (R+di-1)/di;
  ans = sum[ld][rd];
  REP(i, ld*di+1, L){
    ans += pl[i].end()-lower_bound(all(pl[i]), R);
    ans -= ml[i].end()-lower_bound(all(ml[i]), R);
  }
  rep(i,R,rd*di){
    if(i >= int(pr.size())) continue;
    ans += upper_bound(all(pr[i]), ld*di)-pr[i].begin();
    ans -= upper_bound(all(mr[i]), ld*di)-mr[i].begin();
  }
  return ans;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 466 ms 47964 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 336 KB Output is correct
2 Correct 1 ms 720 KB Output is correct
3 Correct 2 ms 692 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 2 ms 720 KB Output is correct
6 Correct 2 ms 720 KB Output is correct
7 Correct 2 ms 720 KB Output is correct
8 Correct 1 ms 720 KB Output is correct
9 Correct 1 ms 720 KB Output is correct
10 Correct 1 ms 720 KB Output is correct
11 Correct 1 ms 720 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 720 KB Output is correct
14 Correct 1 ms 720 KB Output is correct
15 Correct 1 ms 720 KB Output is correct
16 Correct 1 ms 720 KB Output is correct
17 Correct 2 ms 720 KB Output is correct
18 Correct 1 ms 720 KB Output is correct
19 Correct 1 ms 720 KB Output is correct
20 Correct 1 ms 720 KB Output is correct
21 Correct 1 ms 720 KB Output is correct
22 Correct 1 ms 720 KB Output is correct
23 Correct 2 ms 720 KB Output is correct
24 Correct 1 ms 776 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 720 KB Output is correct
27 Correct 1 ms 720 KB Output is correct
28 Correct 1 ms 720 KB Output is correct
29 Correct 1 ms 720 KB Output is correct
30 Correct 1 ms 720 KB Output is correct
31 Correct 1 ms 720 KB Output is correct
32 Correct 1 ms 720 KB Output is correct
33 Correct 1 ms 720 KB Output is correct
34 Correct 1 ms 720 KB Output is correct
35 Correct 1 ms 688 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 720 KB Output is correct
3 Correct 2 ms 692 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 2 ms 720 KB Output is correct
6 Correct 2 ms 720 KB Output is correct
7 Correct 2 ms 720 KB Output is correct
8 Correct 1 ms 720 KB Output is correct
9 Correct 1 ms 720 KB Output is correct
10 Correct 1 ms 720 KB Output is correct
11 Correct 1 ms 720 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 720 KB Output is correct
14 Correct 1 ms 720 KB Output is correct
15 Correct 1 ms 720 KB Output is correct
16 Correct 1 ms 720 KB Output is correct
17 Correct 2 ms 720 KB Output is correct
18 Correct 1 ms 720 KB Output is correct
19 Correct 1 ms 720 KB Output is correct
20 Correct 1 ms 720 KB Output is correct
21 Correct 1 ms 720 KB Output is correct
22 Correct 1 ms 720 KB Output is correct
23 Correct 2 ms 720 KB Output is correct
24 Correct 1 ms 776 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 720 KB Output is correct
27 Correct 1 ms 720 KB Output is correct
28 Correct 1 ms 720 KB Output is correct
29 Correct 1 ms 720 KB Output is correct
30 Correct 1 ms 720 KB Output is correct
31 Correct 1 ms 720 KB Output is correct
32 Correct 1 ms 720 KB Output is correct
33 Correct 1 ms 720 KB Output is correct
34 Correct 1 ms 720 KB Output is correct
35 Correct 1 ms 688 KB Output is correct
36 Correct 114 ms 55852 KB Output is correct
37 Correct 269 ms 119352 KB Output is correct
38 Correct 258 ms 119872 KB Output is correct
39 Correct 260 ms 119292 KB Output is correct
40 Correct 276 ms 119768 KB Output is correct
41 Correct 252 ms 119548 KB Output is correct
42 Correct 242 ms 119860 KB Output is correct
43 Correct 250 ms 119780 KB Output is correct
44 Correct 267 ms 119836 KB Output is correct
45 Correct 257 ms 119864 KB Output is correct
46 Correct 257 ms 119852 KB Output is correct
47 Correct 251 ms 119780 KB Output is correct
48 Correct 246 ms 119900 KB Output is correct
49 Correct 266 ms 119980 KB Output is correct
50 Correct 252 ms 119716 KB Output is correct
51 Correct 260 ms 119828 KB Output is correct
52 Correct 259 ms 119888 KB Output is correct
53 Correct 263 ms 119920 KB Output is correct
54 Correct 261 ms 119828 KB Output is correct
55 Correct 266 ms 119832 KB Output is correct
56 Correct 255 ms 119836 KB Output is correct
57 Correct 251 ms 112264 KB Output is correct
58 Correct 265 ms 119464 KB Output is correct
59 Correct 258 ms 119656 KB Output is correct
60 Correct 259 ms 119840 KB Output is correct
61 Correct 270 ms 119680 KB Output is correct
62 Correct 257 ms 119740 KB Output is correct
63 Correct 254 ms 119856 KB Output is correct
64 Correct 267 ms 119844 KB Output is correct
65 Correct 277 ms 119836 KB Output is correct
66 Correct 261 ms 119800 KB Output is correct
67 Correct 258 ms 119788 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 845 ms 118496 KB Output is correct
2 Correct 1120 ms 119900 KB Output is correct
3 Correct 1036 ms 120032 KB Output is correct
4 Correct 1040 ms 119904 KB Output is correct
5 Correct 933 ms 119844 KB Output is correct
6 Correct 1040 ms 119828 KB Output is correct
7 Correct 1014 ms 119904 KB Output is correct
8 Correct 1120 ms 119828 KB Output is correct
9 Correct 1012 ms 119804 KB Output is correct
10 Correct 1010 ms 119828 KB Output is correct
11 Correct 1076 ms 119836 KB Output is correct
12 Correct 981 ms 119832 KB Output is correct
13 Correct 998 ms 119832 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 720 KB Output is correct
16 Correct 1 ms 720 KB Output is correct
17 Correct 257 ms 119840 KB Output is correct
18 Correct 261 ms 119904 KB Output is correct
19 Correct 258 ms 119904 KB Output is correct
20 Correct 253 ms 119924 KB Output is correct
21 Correct 261 ms 119836 KB Output is correct
22 Correct 284 ms 119832 KB Output is correct
23 Correct 254 ms 119908 KB Output is correct
24 Correct 245 ms 119828 KB Output is correct
25 Correct 255 ms 119836 KB Output is correct
26 Correct 247 ms 119840 KB Output is correct
27 Correct 2 ms 684 KB Output is correct
28 Correct 1 ms 720 KB Output is correct
29 Correct 2 ms 720 KB Output is correct
30 Correct 2 ms 720 KB Output is correct
31 Correct 1 ms 720 KB Output is correct
32 Correct 1 ms 720 KB Output is correct
33 Correct 1 ms 720 KB Output is correct
34 Correct 1 ms 720 KB Output is correct
35 Correct 2 ms 720 KB Output is correct
36 Correct 1 ms 720 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 228 ms 11092 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 336 KB Output is correct
2 Correct 1 ms 720 KB Output is correct
3 Correct 2 ms 692 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 2 ms 720 KB Output is correct
6 Correct 2 ms 720 KB Output is correct
7 Correct 2 ms 720 KB Output is correct
8 Correct 1 ms 720 KB Output is correct
9 Correct 1 ms 720 KB Output is correct
10 Correct 1 ms 720 KB Output is correct
11 Correct 1 ms 720 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 720 KB Output is correct
14 Correct 1 ms 720 KB Output is correct
15 Correct 1 ms 720 KB Output is correct
16 Correct 1 ms 720 KB Output is correct
17 Correct 2 ms 720 KB Output is correct
18 Correct 1 ms 720 KB Output is correct
19 Correct 1 ms 720 KB Output is correct
20 Correct 1 ms 720 KB Output is correct
21 Correct 1 ms 720 KB Output is correct
22 Correct 1 ms 720 KB Output is correct
23 Correct 2 ms 720 KB Output is correct
24 Correct 1 ms 776 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 720 KB Output is correct
27 Correct 1 ms 720 KB Output is correct
28 Correct 1 ms 720 KB Output is correct
29 Correct 1 ms 720 KB Output is correct
30 Correct 1 ms 720 KB Output is correct
31 Correct 1 ms 720 KB Output is correct
32 Correct 1 ms 720 KB Output is correct
33 Correct 1 ms 720 KB Output is correct
34 Correct 1 ms 720 KB Output is correct
35 Correct 1 ms 688 KB Output is correct
36 Correct 114 ms 55852 KB Output is correct
37 Correct 269 ms 119352 KB Output is correct
38 Correct 258 ms 119872 KB Output is correct
39 Correct 260 ms 119292 KB Output is correct
40 Correct 276 ms 119768 KB Output is correct
41 Correct 252 ms 119548 KB Output is correct
42 Correct 242 ms 119860 KB Output is correct
43 Correct 250 ms 119780 KB Output is correct
44 Correct 267 ms 119836 KB Output is correct
45 Correct 257 ms 119864 KB Output is correct
46 Correct 257 ms 119852 KB Output is correct
47 Correct 251 ms 119780 KB Output is correct
48 Correct 246 ms 119900 KB Output is correct
49 Correct 266 ms 119980 KB Output is correct
50 Correct 252 ms 119716 KB Output is correct
51 Correct 260 ms 119828 KB Output is correct
52 Correct 259 ms 119888 KB Output is correct
53 Correct 263 ms 119920 KB Output is correct
54 Correct 261 ms 119828 KB Output is correct
55 Correct 266 ms 119832 KB Output is correct
56 Correct 255 ms 119836 KB Output is correct
57 Correct 251 ms 112264 KB Output is correct
58 Correct 265 ms 119464 KB Output is correct
59 Correct 258 ms 119656 KB Output is correct
60 Correct 259 ms 119840 KB Output is correct
61 Correct 270 ms 119680 KB Output is correct
62 Correct 257 ms 119740 KB Output is correct
63 Correct 254 ms 119856 KB Output is correct
64 Correct 267 ms 119844 KB Output is correct
65 Correct 277 ms 119836 KB Output is correct
66 Correct 261 ms 119800 KB Output is correct
67 Correct 258 ms 119788 KB Output is correct
68 Correct 845 ms 118496 KB Output is correct
69 Correct 1120 ms 119900 KB Output is correct
70 Correct 1036 ms 120032 KB Output is correct
71 Correct 1040 ms 119904 KB Output is correct
72 Correct 933 ms 119844 KB Output is correct
73 Correct 1040 ms 119828 KB Output is correct
74 Correct 1014 ms 119904 KB Output is correct
75 Correct 1120 ms 119828 KB Output is correct
76 Correct 1012 ms 119804 KB Output is correct
77 Correct 1010 ms 119828 KB Output is correct
78 Correct 1076 ms 119836 KB Output is correct
79 Correct 981 ms 119832 KB Output is correct
80 Correct 998 ms 119832 KB Output is correct
81 Correct 0 ms 208 KB Output is correct
82 Correct 1 ms 720 KB Output is correct
83 Correct 1 ms 720 KB Output is correct
84 Correct 257 ms 119840 KB Output is correct
85 Correct 261 ms 119904 KB Output is correct
86 Correct 258 ms 119904 KB Output is correct
87 Correct 253 ms 119924 KB Output is correct
88 Correct 261 ms 119836 KB Output is correct
89 Correct 284 ms 119832 KB Output is correct
90 Correct 254 ms 119908 KB Output is correct
91 Correct 245 ms 119828 KB Output is correct
92 Correct 255 ms 119836 KB Output is correct
93 Correct 247 ms 119840 KB Output is correct
94 Correct 2 ms 684 KB Output is correct
95 Correct 1 ms 720 KB Output is correct
96 Correct 2 ms 720 KB Output is correct
97 Correct 2 ms 720 KB Output is correct
98 Correct 1 ms 720 KB Output is correct
99 Correct 1 ms 720 KB Output is correct
100 Correct 1 ms 720 KB Output is correct
101 Correct 1 ms 720 KB Output is correct
102 Correct 2 ms 720 KB Output is correct
103 Correct 1 ms 720 KB Output is correct
104 Correct 1060 ms 96612 KB Output is correct
105 Correct 1255 ms 119740 KB Output is correct
106 Correct 989 ms 119496 KB Output is correct
107 Correct 1064 ms 119668 KB Output is correct
108 Incorrect 1024 ms 119448 KB 207th lines differ - on the 1st token, expected: '641', found: '642'
109 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

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