Submission #1071738

#	Time	Username	Problem	Language	Result	Execution time	Memory
1071738		beaconmc	송신탑 (IOI22_towers)	C++17	4 / 100	681 ms	1596 KiB

towers

#include "towers.h"

 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)

int maxi = 0;
vector<int> towers;
int maxpos = -1;

void init(int N, std::vector<int> H) {
    towers = H;
    FOR(i,0,N){
        maxi = max(maxi, H[i]);
    }
    FOR(i,0,N){
        if (H[i] == maxi) maxpos = i;
    }

}

int max_towers(int L, int R, int D) {
    if (L==R) return 1;

    if (maxi - towers[L] >= D && maxi - towers[R] >= D && L<=maxpos && R >= maxpos){
        return 2;
    }else{
        return 1;
    }
}

• Subtask 1: 4 / 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