oj.uz

답안 #626519

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
626519 2022-08-11T13:56:07 Z haojiandan 송신탑 (IOI22_towers) C++17
0 / 100
 763 ms 44184 KB 
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=(1e5)+10;
const int maxm=maxn*40;
const int INF=2e9;
int n,h[maxn],tot,st[maxn];
int mx[maxn*4],ls[maxm],rs[maxm],tr[maxm];
void build(int l,int r,int root) {
	if (l==r) { mx[root]=h[l]; return; }
	int mid=(l+r)>>1;
	build(l,mid,root<<1),build(mid+1,r,root<<1|1);
	mx[root]=max(mx[root<<1],mx[root<<1|1]);
}
int querymx(int L,int R,int l,int r,int root) {
	if (L>R) return -INF;
	if (L<=l&&r<=R) return mx[root];
	int mid=(l+r)>>1,res=0;
	if (L<=mid) res=querymx(L,R,l,mid,root<<1);
	if (mid<R) res=max(res,querymx(L,R,mid+1,r,root<<1|1));
	return res;
}
int L[maxn],R[maxn],rt[maxn];
namespace Seg {
	int mxR[maxn*4],mxL[maxn*4];
	void build(int l,int r,int root) {
		if (l==r) { mxR[root]=R[l],mxL[root]=L[l]; return; }
		int mid=(l+r)>>1;
		build(l,mid,root<<1),build(mid+1,r,root<<1|1);
		mxR[root]=max(mxR[root<<1],mxR[root<<1|1]);
		mxL[root]=max(mxL[root<<1],mxL[root<<1|1]);
	}
	int query1(int L,int R,int l,int r,int root,int delta) {
		if (mxR[root]<delta) return n+1;
		if (L<=l&&r<=R) {
			if (l==r) return l;
			int mid=(l+r)>>1;
			if (mxR[root<<1]>=delta) return query1(L,R,l,mid,root<<1,delta);
			return query1(L,R,mid+1,r,root<<1|1,delta);
		}
		int mid=(l+r)>>1,res=n+1;
		if (L<=mid) { res=query1(L,R,l,mid,root<<1,delta); if (res<=n) return res; }
		if (mid<R) res=query1(L,R,mid+1,r,root<<1|1,delta); return res;
	}
	int query2(int L,int R,int l,int r,int root,int delta) {
		if (mxL[root]<delta) return 0;
		if (L<=l&&r<=R) {
			if (l==r) return l;
			int mid=(l+r)>>1;
			if (mxL[root<<1|1]>=delta) return query2(L,R,mid+1,r,root<<1|1,delta);
			return query2(L,R,l,mid,root<<1,delta);
		}
		int mid=(l+r)>>1,res=0;
		if (mid<R) { res=query2(L,R,mid+1,r,root<<1|1,delta); if (res) return res; }
		if (L<=mid) res=query2(L,R,l,mid,root<<1,delta); return res;
	}
};
void add(int x,int l,int r,int &root) {
	tot++; ls[tot]=ls[root],rs[tot]=rs[root],tr[tot]=tr[root]+1; root=tot;
	if (l==r) return;
	int mid=((ll)l+r)>>1;
	if (x<=mid) add(x,l,mid,ls[root]); else add(x,mid+1,r,rs[root]);
}
int query(int L,int R,int l,int r,int x,int y) {
	if (L<=l&&r<=R) return tr[y]-tr[x];
	int res=0,mid=((ll)l+r)>>1;
	if (L<=mid) res+=query(L,R,l,mid,ls[x],ls[y]);
	if (mid<R) res+=query(L,R,mid+1,r,rs[x],rs[y]);
	return res;
}
void init(int _n, vector<int> H) {
	n=_n;
	for (int i=1;i<=n;i++) h[i]=H[i-1];
	build(1,n,1);
	for (int i=1;i<=n;i++) {
		while (tot&&h[st[tot]]>h[i]) tot--;
		if (!tot) L[i]=INF; else {
			L[i]=querymx(st[tot]+1,i-1,1,n,1);
			if (L[i]>=0) L[i]-=h[i];
		}
		st[++tot]=i;
	}
	tot=0;
	for (int i=n;i>=1;i--) {
		while (tot&&h[st[tot]]>h[i]) tot--;
		if (!tot) R[i]=INF; else {
			R[i]=querymx(i+1,st[tot]-1,1,n,1);
			if (R[i]>=0) R[i]-=h[i];
		}
		st[++tot]=i;
	}
	Seg::build(1,n,1);
	for (int i=1;i<=n;i++) rt[i]=rt[i-1],add(min(L[i],R[i]),-INF,INF,rt[i]);
}
int max_towers(int l, int r, int D) {
	l++,r++;
	l=Seg::query1(l,n,1,n,1,D);
	r=Seg::query2(1,r,1,n,1,D);
	if (l>r) return 1;
	return 2+(l+1<=r-1?query(D,INF,-INF,INF,rt[l],rt[r-1]):0);
}

Compilation message

towers.cpp: In function 'int Seg::query1(int, int, int, int, int, int)':
towers.cpp:44:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   44 |   if (mid<R) res=query1(L,R,mid+1,r,root<<1|1,delta); return res;
      |   ^~
towers.cpp:44:55: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   44 |   if (mid<R) res=query1(L,R,mid+1,r,root<<1|1,delta); return res;
      |                                                       ^~~~~~
towers.cpp: In function 'int Seg::query2(int, int, int, int, int, int)':
towers.cpp:56:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   56 |   if (L<=mid) res=query2(L,R,l,mid,root<<1,delta); return res;
      |   ^~
towers.cpp:56:52: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   56 |   if (L<=mid) res=query2(L,R,l,mid,root<<1,delta); return res;
      |                                                    ^~~~~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 451 ms 26540 KB 31989th lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 2 ms 1232 KB Output is correct
3 Correct 2 ms 1232 KB Output is correct
4 Correct 2 ms 1232 KB Output is correct
5 Correct 1 ms 1232 KB Output is correct
6 Correct 2 ms 1232 KB Output is correct
7 Correct 1 ms 1232 KB Output is correct
8 Correct 1 ms 1232 KB Output is correct
9 Correct 1 ms 1232 KB Output is correct
10 Correct 1 ms 1232 KB Output is correct
11 Correct 1 ms 1232 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 1232 KB Output is correct
14 Correct 1 ms 1232 KB Output is correct
15 Correct 2 ms 1232 KB Output is correct
16 Correct 2 ms 1152 KB Output is correct
17 Correct 2 ms 1232 KB Output is correct
18 Correct 1 ms 1232 KB Output is correct
19 Correct 1 ms 1232 KB Output is correct
20 Correct 2 ms 1232 KB Output is correct
21 Correct 2 ms 1232 KB Output is correct
22 Correct 2 ms 1232 KB Output is correct
23 Incorrect 1 ms 1232 KB 1st lines differ - on the 1st token, expected: '1', found: '2'
24 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 2 ms 1232 KB Output is correct
3 Correct 2 ms 1232 KB Output is correct
4 Correct 2 ms 1232 KB Output is correct
5 Correct 1 ms 1232 KB Output is correct
6 Correct 2 ms 1232 KB Output is correct
7 Correct 1 ms 1232 KB Output is correct
8 Correct 1 ms 1232 KB Output is correct
9 Correct 1 ms 1232 KB Output is correct
10 Correct 1 ms 1232 KB Output is correct
11 Correct 1 ms 1232 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 1232 KB Output is correct
14 Correct 1 ms 1232 KB Output is correct
15 Correct 2 ms 1232 KB Output is correct
16 Correct 2 ms 1152 KB Output is correct
17 Correct 2 ms 1232 KB Output is correct
18 Correct 1 ms 1232 KB Output is correct
19 Correct 1 ms 1232 KB Output is correct
20 Correct 2 ms 1232 KB Output is correct
21 Correct 2 ms 1232 KB Output is correct
22 Correct 2 ms 1232 KB Output is correct
23 Incorrect 1 ms 1232 KB 1st lines differ - on the 1st token, expected: '1', found: '2'
24 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 763 ms 44184 KB 45626th lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 294 ms 10832 KB 2257th lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 2 ms 1232 KB Output is correct
3 Correct 2 ms 1232 KB Output is correct
4 Correct 2 ms 1232 KB Output is correct
5 Correct 1 ms 1232 KB Output is correct
6 Correct 2 ms 1232 KB Output is correct
7 Correct 1 ms 1232 KB Output is correct
8 Correct 1 ms 1232 KB Output is correct
9 Correct 1 ms 1232 KB Output is correct
10 Correct 1 ms 1232 KB Output is correct
11 Correct 1 ms 1232 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 1232 KB Output is correct
14 Correct 1 ms 1232 KB Output is correct
15 Correct 2 ms 1232 KB Output is correct
16 Correct 2 ms 1152 KB Output is correct
17 Correct 2 ms 1232 KB Output is correct
18 Correct 1 ms 1232 KB Output is correct
19 Correct 1 ms 1232 KB Output is correct
20 Correct 2 ms 1232 KB Output is correct
21 Correct 2 ms 1232 KB Output is correct
22 Correct 2 ms 1232 KB Output is correct
23 Incorrect 1 ms 1232 KB 1st lines differ - on the 1st token, expected: '1', found: '2'
24 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 451 ms 26540 KB 31989th lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -