oj.uz

답안 #790870

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
790870 2023-07-23T09:08:26 Z penguinman 송신탑 (IOI22_towers) C++17
37 / 100
 1008 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,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]), 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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 299 ms 30028 KB 31st lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 720 KB Output is correct
3 Correct 1 ms 720 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 1 ms 720 KB Output is correct
6 Correct 1 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 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 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 1 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 848 KB Output is correct
21 Correct 1 ms 720 KB Output is correct
22 Correct 1 ms 848 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 464 KB Output is correct
26 Correct 2 ms 720 KB Output is correct
27 Correct 2 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 812 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 848 KB Output is correct
35 Correct 2 ms 720 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 720 KB Output is correct
3 Correct 1 ms 720 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 1 ms 720 KB Output is correct
6 Correct 1 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 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 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 1 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 848 KB Output is correct
21 Correct 1 ms 720 KB Output is correct
22 Correct 1 ms 848 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 464 KB Output is correct
26 Correct 2 ms 720 KB Output is correct
27 Correct 2 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 812 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 848 KB Output is correct
35 Correct 2 ms 720 KB Output is correct
36 Correct 64 ms 34216 KB Output is correct
37 Correct 153 ms 67208 KB Output is correct
38 Correct 139 ms 67656 KB Output is correct
39 Correct 143 ms 67080 KB Output is correct
40 Correct 144 ms 67708 KB Output is correct
41 Correct 143 ms 67396 KB Output is correct
42 Correct 135 ms 67680 KB Output is correct
43 Correct 141 ms 67692 KB Output is correct
44 Correct 157 ms 67780 KB Output is correct
45 Correct 143 ms 67604 KB Output is correct
46 Correct 144 ms 67716 KB Output is correct
47 Correct 153 ms 67624 KB Output is correct
48 Correct 137 ms 67780 KB Output is correct
49 Correct 141 ms 67768 KB Output is correct
50 Correct 139 ms 67680 KB Output is correct
51 Correct 147 ms 67688 KB Output is correct
52 Correct 151 ms 67756 KB Output is correct
53 Correct 146 ms 67760 KB Output is correct
54 Correct 136 ms 67648 KB Output is correct
55 Correct 148 ms 67800 KB Output is correct
56 Correct 158 ms 67688 KB Output is correct
57 Correct 134 ms 63584 KB Output is correct
58 Correct 153 ms 67380 KB Output is correct
59 Correct 176 ms 67520 KB Output is correct
60 Correct 139 ms 67740 KB Output is correct
61 Correct 164 ms 67624 KB Output is correct
62 Correct 143 ms 67492 KB Output is correct
63 Correct 138 ms 67604 KB Output is correct
64 Correct 151 ms 67640 KB Output is correct
65 Correct 146 ms 67684 KB Output is correct
66 Correct 143 ms 67808 KB Output is correct
67 Correct 147 ms 67648 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 771 ms 66952 KB Output is correct
2 Correct 864 ms 67728 KB Output is correct
3 Correct 920 ms 67768 KB Output is correct
4 Correct 814 ms 67736 KB Output is correct
5 Correct 926 ms 67864 KB Output is correct
6 Correct 1008 ms 67760 KB Output is correct
7 Correct 931 ms 67752 KB Output is correct
8 Correct 772 ms 67604 KB Output is correct
9 Correct 799 ms 67648 KB Output is correct
10 Correct 803 ms 67688 KB Output is correct
11 Correct 1002 ms 67616 KB Output is correct
12 Correct 836 ms 67644 KB Output is correct
13 Correct 919 ms 67680 KB Output is correct
14 Correct 0 ms 336 KB Output is correct
15 Correct 1 ms 720 KB Output is correct
16 Correct 2 ms 720 KB Output is correct
17 Correct 137 ms 67700 KB Output is correct
18 Correct 143 ms 67864 KB Output is correct
19 Correct 136 ms 67660 KB Output is correct
20 Correct 141 ms 67684 KB Output is correct
21 Correct 141 ms 67684 KB Output is correct
22 Correct 150 ms 67780 KB Output is correct
23 Correct 135 ms 67748 KB Output is correct
24 Correct 136 ms 67732 KB Output is correct
25 Correct 138 ms 67688 KB Output is correct
26 Correct 148 ms 67732 KB Output is correct
27 Correct 2 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 2 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 720 KB Output is correct
36 Correct 2 ms 720 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 226 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 720 KB Output is correct
3 Correct 1 ms 720 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 1 ms 720 KB Output is correct
6 Correct 1 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 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 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 1 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 848 KB Output is correct
21 Correct 1 ms 720 KB Output is correct
22 Correct 1 ms 848 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 464 KB Output is correct
26 Correct 2 ms 720 KB Output is correct
27 Correct 2 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 812 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 848 KB Output is correct
35 Correct 2 ms 720 KB Output is correct
36 Correct 64 ms 34216 KB Output is correct
37 Correct 153 ms 67208 KB Output is correct
38 Correct 139 ms 67656 KB Output is correct
39 Correct 143 ms 67080 KB Output is correct
40 Correct 144 ms 67708 KB Output is correct
41 Correct 143 ms 67396 KB Output is correct
42 Correct 135 ms 67680 KB Output is correct
43 Correct 141 ms 67692 KB Output is correct
44 Correct 157 ms 67780 KB Output is correct
45 Correct 143 ms 67604 KB Output is correct
46 Correct 144 ms 67716 KB Output is correct
47 Correct 153 ms 67624 KB Output is correct
48 Correct 137 ms 67780 KB Output is correct
49 Correct 141 ms 67768 KB Output is correct
50 Correct 139 ms 67680 KB Output is correct
51 Correct 147 ms 67688 KB Output is correct
52 Correct 151 ms 67756 KB Output is correct
53 Correct 146 ms 67760 KB Output is correct
54 Correct 136 ms 67648 KB Output is correct
55 Correct 148 ms 67800 KB Output is correct
56 Correct 158 ms 67688 KB Output is correct
57 Correct 134 ms 63584 KB Output is correct
58 Correct 153 ms 67380 KB Output is correct
59 Correct 176 ms 67520 KB Output is correct
60 Correct 139 ms 67740 KB Output is correct
61 Correct 164 ms 67624 KB Output is correct
62 Correct 143 ms 67492 KB Output is correct
63 Correct 138 ms 67604 KB Output is correct
64 Correct 151 ms 67640 KB Output is correct
65 Correct 146 ms 67684 KB Output is correct
66 Correct 143 ms 67808 KB Output is correct
67 Correct 147 ms 67648 KB Output is correct
68 Correct 771 ms 66952 KB Output is correct
69 Correct 864 ms 67728 KB Output is correct
70 Correct 920 ms 67768 KB Output is correct
71 Correct 814 ms 67736 KB Output is correct
72 Correct 926 ms 67864 KB Output is correct
73 Correct 1008 ms 67760 KB Output is correct
74 Correct 931 ms 67752 KB Output is correct
75 Correct 772 ms 67604 KB Output is correct
76 Correct 799 ms 67648 KB Output is correct
77 Correct 803 ms 67688 KB Output is correct
78 Correct 1002 ms 67616 KB Output is correct
79 Correct 836 ms 67644 KB Output is correct
80 Correct 919 ms 67680 KB Output is correct
81 Correct 0 ms 336 KB Output is correct
82 Correct 1 ms 720 KB Output is correct
83 Correct 2 ms 720 KB Output is correct
84 Correct 137 ms 67700 KB Output is correct
85 Correct 143 ms 67864 KB Output is correct
86 Correct 136 ms 67660 KB Output is correct
87 Correct 141 ms 67684 KB Output is correct
88 Correct 141 ms 67684 KB Output is correct
89 Correct 150 ms 67780 KB Output is correct
90 Correct 135 ms 67748 KB Output is correct
91 Correct 136 ms 67732 KB Output is correct
92 Correct 138 ms 67688 KB Output is correct
93 Correct 148 ms 67732 KB Output is correct
94 Correct 2 ms 720 KB Output is correct
95 Correct 1 ms 720 KB Output is correct
96 Correct 1 ms 720 KB Output is correct
97 Correct 1 ms 720 KB Output is correct
98 Correct 1 ms 720 KB Output is correct
99 Correct 2 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 1 ms 720 KB Output is correct
103 Correct 2 ms 720 KB Output is correct
104 Correct 827 ms 55700 KB Output is correct
105 Correct 833 ms 67604 KB Output is correct
106 Correct 863 ms 67364 KB Output is correct
107 Correct 895 ms 67476 KB Output is correct
108 Incorrect 951 ms 67392 KB 207th lines differ - on the 1st token, expected: '641', found: '642'
109 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 299 ms 30028 KB 31st lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -