Submission #777670

#	Time	Username	Problem	Language	Result	Execution time	Memory
777670		Ludissey	송신탑 (IOI22_towers)	C++17	0 / 100	4006 ms	1460 KiB

towers

#include "towers.h"
#include <iostream>
#include <string>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <vector>
#include <fstream>
#include <bitset>
#include <tuple>
#include <cmath>
#include <cstdint>
#include <stack>
#include <cassert>
#include <cstdio>
#include <queue>
#include <iterator>
#include <iomanip>
#include <algorithm>
#include <sstream>

using namespace std;
vector<int> towers;


void init(int N, std::vector<int> H) {
	towers.resize(N,-1);
	for (int i = 1; i < N-1; i++)
	{
		int mx = max(H[i - 1], H[i + 1]);
		if (mx <= H[i]) towers[i] = H[i] - mx;
	}
}

int max_towers(int L, int R, int D) {
	int sum=0;
	bool prev = false;
	for (int i = L; i <= R; i++)
	{
		if (towers[i] >= D) {
			sum++ ;
			if (!prev) sum++;
			prev = true;
		}
	}
	if(R-L>=2)return sum;
	return 1;
}

• 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