제출 #1079594

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1079594		allin27x	송신탑 (IOI22_towers)	C++17	14 / 100	716 ms	12104 KiB

towers

#include <bits/stdc++.h>
using namespace std;
#define int long long

const int N = 1e5+4;
vector<int> h;
vector<int> lc,rc,a;
vector<int> ds;
int pr[N];

int sum (int l, int r) {
	if (l > r) return 0;
	if (r==0) return pr[r];
	return pr[r] - pr[l-1];
}

int dfs(int i, int d){
	if (i==-1) return 0;
	if (lc[i]==-1 && rc[i]==-1) return -a[i];
	int lans = dfs(lc[i],d);
	int rans = dfs(rc[i],d);
	if (lans < 0 && a[i] - d >= -lans) lans = 1;
	if (rans < 0 && a[i] - d >= -rans) rans = 1;
	if (!lans) return rans; if (!rans) return lans;
	ds.push_back(a[i] + min(lans, rans));

	if (lans < 0 && rans < 0) return max(lans,rans);
	if (lans < 0) return rans;
	if (rans < 0) return lans;
	return lans + rans;
}

signed helper(signed l, signed r, int d){
	int sz = r-l+1;
	a.assign(sz,0); for (int i=l; i<=r; i++) a[i-l] = h[i];

	a.push_back(3e9);
	stack<int> st; st.push(sz);
	lc.assign(sz+1,-1); rc.assign(sz+1,-1);

	for (int i=0; i<sz; i++){
		int last = -1;
		while (a[i] > a[st.top()]) {
			last=st.top();
			st.pop();
		}
		lc[i] = last;
		rc[st.top()]=i;
		st.push(i);
	}
	return dfs(sz,d);
}


void init(signed N, std::vector<signed> H){
	h.resize(N); for (int i = 0; i < N; i++) h[i] = H[i];
	helper(0, N-1, (int)1e18);
	sort(ds.begin(), ds.end());
	pr[0] = (lc[0]==-1 && rc[0]==-1);
	for (int i=1; i<N; i++) pr[i] = pr[i-1] + (lc[i]==-1 && rc[i]==-1);

}

signed max_towers(signed l, signed r, signed d) {
	if (r-l <= 1) return 1;
	int s = sum(l+1,r-1);
	s += h[l] < h[l+1]; s += h[r] < h[r-1];
	return s;
}

컴파일 시 표준 에러 (stderr) 메시지

towers.cpp: In function 'long long int dfs(long long int, long long int)':
towers.cpp:24:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   24 |  if (!lans) return rans; if (!rans) return lans;
      |  ^~
towers.cpp:24:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   24 |  if (!lans) return rans; if (!rans) return lans;
      |                          ^~

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