제출 #1073473

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1073473		fv3	Radio Towers (IOI22_towers)	C++17	0 / 100	4086 ms	2956 KiB

towers

#include "towers.h"
#include <bits/stdc++.h>

using namespace std;
const int INF = 1 << 30;

int N;
vector<int> H;

void init(int N_, vector<int> H_)
{
  N = N_;
  H = H_;
}

int max_towers(int L, int R, int D) 
{
  // You should always lease the smallest tower
  // No two adjacent towers can be leased

  int res = 0;
  vector<int> leased(N);
  vector<int> neighbour(N);
  while (true)
  {
    int mn = INF;
    int mn_index = -1;

    for (int i = L; i <= R; i++)
    {
      if (!leased[i] && !neighbour[i] && H[i] < mn)
      {
        mn = H[i];
        mn_index = i;
      }
    }
    if (mn == INF) break;

    int mx = mn;
    for (int i = mn_index + 1; i <= R; i++)
    {
      if (leased[i])
      {
        if (mx - mn < D) 
          return res;
      }
      else
      {
        mx = max(mx, H[i]);
      }
    }

    mx = mn;
    for (int i = mn_index - 1; i >= L; i--)
    {
      if (leased[i])
      {
        if (mx - mn < D) 
          return res;
      }
      else
      {
        mx = max(mx, H[i]);
      }
    }

    res++;
    leased[mn_index] = 1;
    if (mn_index > L) neighbour[mn_index-1] = 1;
    if (mn_index < R) neighbour[mn_index+1] = 1;
  }

  return res;
}

• 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