제출 #780990

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
780990		Mouad_ouj	송신탑 (IOI22_towers)	C++17	0 / 100	368 ms	1444 KiB

towers

#include "towers.h" //sub1
#include <bits/stdc++.h>
using namespace std;
vector<int> he;
int k=-1,n;
void init (int ne,vector<int> h)
{
  n=ne;
    he.resize(n);
    for(int x=0;x<n;x++)
    {
    he[x]=h[x];
    if(h[x]>h[x+1] && x!=n && k==-1)
    k=x;
    }
    if(h[n-1]>h[n-2])
    k=n-1;
}
int max_towers(int l, int r, int d)
{
    //if(l==r)
    //return 1;
    if(he[n-1]>he[k]-d || he[0]>he[k]-d)
    return 0;
    int ml=k,mr=n-1;
    while(ml!=mr)
    {
        int mid=(ml+mr)/2;
        if(he[mid]>he[k]-d)
        ml=mid+1;
        else
        mr=mid;
    }
    int a1=mr,a2=0;
    ml=0,mr=k;
    while(ml!=mr)
    {
        int mid=(ml+mr)/2;
        if(he[mid]<he[k]-d)
        ml=mid+1;
        else
        mr=mid;
    }
    a2=mr;
    a2=max(a2,l);
    a1=min(a1,r);
    return ((r-a1+1)+(a2-l));
}

• 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