제출 #1214760

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1214760		dosts	송신탑 (IOI22_towers)	C++20	0 / 100	4056 ms	2668 KiB

towers

#include "towers.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
//#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;

int sel = 0;
int len;
vi h;
void init(int N, std::vector<int> H) {
  len = N;
  h = H;
  for (int i = 0;i<N;i++) {
    if (H[i] > H[i+1]) {
      sel = i;
      break;
    }
  }
}

int dnq(int L,int R,int D,int ban = inf) {
  int mx = -1,pick = -1;
  for (int i = L;i<=R;i++) {
    if (h[i] > ban) continue;
    if (h[i] > mx) {
      mx = h[i],pick = i;
    }
  }
  if (pick == -1) return 0;
  int sol = dnq(L,pick-1,D,mx-D),sag = dnq(pick+1,R,D,mx-D);
  if (sol && sag) return sol+sag;
  return max(1,max(sol,sag));
} 

int max_towers(int L, int R, int D) {
  return dnq(L,R,D);
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 11
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 17
• Subtask 6: 0 / 19
• Subtask 7: 0 / 23