oj.uz

Submission #790890

# Submission time Handle Problem Language Result Execution time Memory
790890 2023-07-23T09:16:37 Z penguinman Radio Towers (IOI22_towers) C++17
23 / 100
 1102 ms 67864 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 = 30;
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+100;
      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,1){
      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,pr.size()){
        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]), rd*di);
    ans -= ml[i].end()-lower_bound(all(ml[i]), rd*di);
  }
  rep(i,R,rd*di){
    if(i >= int(pr.size())) continue;
    ans += upper_bound(all(pr[i]), L)-pr[i].begin();
    ans -= upper_bound(all(mr[i]), L)-mr[i].begin();
  }
  return ans;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 369 ms 30040 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 1 ms 336 KB Output is correct
2 Correct 2 ms 720 KB Output is correct
3 Correct 1 ms 720 KB Output is correct
4 Correct 2 ms 868 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 2 ms 720 KB Output is correct
10 Correct 1 ms 848 KB Output is correct
11 Correct 2 ms 720 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 848 KB Output is correct
14 Correct 1 ms 720 KB Output is correct
15 Correct 2 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 2 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 1 ms 720 KB Output is correct
24 Correct 1 ms 720 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 2 ms 796 KB Output is correct
27 Correct 3 ms 720 KB Output is correct
28 Correct 2 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 2 ms 808 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 848 KB Output is correct
35 Correct 1 ms 720 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 ms 720 KB Output is correct
3 Correct 1 ms 720 KB Output is correct
4 Correct 2 ms 868 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 2 ms 720 KB Output is correct
10 Correct 1 ms 848 KB Output is correct
11 Correct 2 ms 720 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 848 KB Output is correct
14 Correct 1 ms 720 KB Output is correct
15 Correct 2 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 2 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 1 ms 720 KB Output is correct
24 Correct 1 ms 720 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 2 ms 796 KB Output is correct
27 Correct 3 ms 720 KB Output is correct
28 Correct 2 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 2 ms 808 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 848 KB Output is correct
35 Correct 1 ms 720 KB Output is correct
36 Correct 78 ms 34272 KB Output is correct
37 Correct 145 ms 67180 KB Output is correct
38 Correct 152 ms 67732 KB Output is correct
39 Correct 158 ms 67108 KB Output is correct
40 Correct 142 ms 67612 KB Output is correct
41 Correct 147 ms 67516 KB Output is correct
42 Correct 153 ms 67756 KB Output is correct
43 Correct 163 ms 67712 KB Output is correct
44 Correct 147 ms 67608 KB Output is correct
45 Correct 156 ms 67700 KB Output is correct
46 Correct 149 ms 67712 KB Output is correct
47 Correct 152 ms 67704 KB Output is correct
48 Correct 152 ms 67760 KB Output is correct
49 Correct 154 ms 67768 KB Output is correct
50 Correct 152 ms 67648 KB Output is correct
51 Correct 154 ms 67580 KB Output is correct
52 Correct 167 ms 67764 KB Output is correct
53 Correct 162 ms 67864 KB Output is correct
54 Correct 148 ms 67756 KB Output is correct
55 Correct 153 ms 67680 KB Output is correct
56 Correct 154 ms 67604 KB Output is correct
57 Correct 163 ms 63692 KB Output is correct
58 Correct 150 ms 67356 KB Output is correct
59 Correct 149 ms 67520 KB Output is correct
60 Correct 142 ms 67768 KB Output is correct
61 Correct 149 ms 67620 KB Output is correct
62 Correct 149 ms 67476 KB Output is correct
63 Correct 152 ms 67624 KB Output is correct
64 Correct 157 ms 67760 KB Output is correct
65 Correct 154 ms 67700 KB Output is correct
66 Correct 150 ms 67716 KB Output is correct
67 Correct 158 ms 67684 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 700 ms 67076 KB Output is correct
2 Correct 905 ms 67740 KB Output is correct
3 Correct 897 ms 67728 KB Output is correct
4 Correct 873 ms 67704 KB Output is correct
5 Correct 1034 ms 67760 KB Output is correct
6 Correct 1014 ms 67768 KB Output is correct
7 Correct 1041 ms 67852 KB Output is correct
8 Correct 1102 ms 67688 KB Output is correct
9 Correct 865 ms 67672 KB Output is correct
10 Correct 896 ms 67688 KB Output is correct
11 Incorrect 883 ms 67696 KB 4417th lines differ - on the 1st token, expected: '1', found: '0'
12 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 265 ms 8532 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 1 ms 336 KB Output is correct
2 Correct 2 ms 720 KB Output is correct
3 Correct 1 ms 720 KB Output is correct
4 Correct 2 ms 868 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 2 ms 720 KB Output is correct
10 Correct 1 ms 848 KB Output is correct
11 Correct 2 ms 720 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 848 KB Output is correct
14 Correct 1 ms 720 KB Output is correct
15 Correct 2 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 2 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 1 ms 720 KB Output is correct
24 Correct 1 ms 720 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 2 ms 796 KB Output is correct
27 Correct 3 ms 720 KB Output is correct
28 Correct 2 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 2 ms 808 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 848 KB Output is correct
35 Correct 1 ms 720 KB Output is correct
36 Correct 78 ms 34272 KB Output is correct
37 Correct 145 ms 67180 KB Output is correct
38 Correct 152 ms 67732 KB Output is correct
39 Correct 158 ms 67108 KB Output is correct
40 Correct 142 ms 67612 KB Output is correct
41 Correct 147 ms 67516 KB Output is correct
42 Correct 153 ms 67756 KB Output is correct
43 Correct 163 ms 67712 KB Output is correct
44 Correct 147 ms 67608 KB Output is correct
45 Correct 156 ms 67700 KB Output is correct
46 Correct 149 ms 67712 KB Output is correct
47 Correct 152 ms 67704 KB Output is correct
48 Correct 152 ms 67760 KB Output is correct
49 Correct 154 ms 67768 KB Output is correct
50 Correct 152 ms 67648 KB Output is correct
51 Correct 154 ms 67580 KB Output is correct
52 Correct 167 ms 67764 KB Output is correct
53 Correct 162 ms 67864 KB Output is correct
54 Correct 148 ms 67756 KB Output is correct
55 Correct 153 ms 67680 KB Output is correct
56 Correct 154 ms 67604 KB Output is correct
57 Correct 163 ms 63692 KB Output is correct
58 Correct 150 ms 67356 KB Output is correct
59 Correct 149 ms 67520 KB Output is correct
60 Correct 142 ms 67768 KB Output is correct
61 Correct 149 ms 67620 KB Output is correct
62 Correct 149 ms 67476 KB Output is correct
63 Correct 152 ms 67624 KB Output is correct
64 Correct 157 ms 67760 KB Output is correct
65 Correct 154 ms 67700 KB Output is correct
66 Correct 150 ms 67716 KB Output is correct
67 Correct 158 ms 67684 KB Output is correct
68 Correct 700 ms 67076 KB Output is correct
69 Correct 905 ms 67740 KB Output is correct
70 Correct 897 ms 67728 KB Output is correct
71 Correct 873 ms 67704 KB Output is correct
72 Correct 1034 ms 67760 KB Output is correct
73 Correct 1014 ms 67768 KB Output is correct
74 Correct 1041 ms 67852 KB Output is correct
75 Correct 1102 ms 67688 KB Output is correct
76 Correct 865 ms 67672 KB Output is correct
77 Correct 896 ms 67688 KB Output is correct
78 Incorrect 883 ms 67696 KB 4417th lines differ - on the 1st token, expected: '1', found: '0'
79 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

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