oj.uz

답안 #286349

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
286349 2020-08-30T10:16:22 Z TadijaSebez 별자리 3 (JOI20_constellation3) C++11
35 / 100
 1500 ms 161784 KB 
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define ll long long
#define pb push_back
const int N=200050;
const int L=20;
int a[N],rmq[N][L],lgs[N],n;
int Get(int l,int r){
	int k=lgs[r-l+1];
	return max(rmq[l][k],rmq[r-(1<<k)+1][k]);
}
pii GetRng(int x,int y){
	int top=x,bot=1,mid,L=0,R=n+1;
	while(top>=bot){
		mid=top+bot>>1;
		if(Get(mid,x)>=y)L=mid,bot=mid+1;
		else top=mid-1;
	}
	top=n,bot=x;
	while(top>=bot){
		mid=top+bot>>1;
		if(Get(x,mid)>=y)R=mid,top=mid-1;
		else bot=mid+1;
	}
	return {L,R};
}
int x[N],y[N],c[N];
map<pii,vector<int>> stars;
vector<int> idx[N];
unordered_map<ll,ll> was;
ll DP(int l,int r){
	if(r-l<2)return 0;
	if(was.count((ll)l*N+r))return was[(ll)l*N+r];
	int m=Get(l+1,r-1);
	int fir=upper_bound(idx[m].begin(),idx[m].end(),l)-idx[m].begin();
	//int las=lower_bound(idx[m].begin(),idx[m].end(),r)-idx[m].begin();
	ll ans=DP(l,idx[m][fir])+DP(idx[m][fir],r);
	for(int i:stars[{l,r}]){
		ans=max(ans,DP(l,x[i])+c[i]+DP(x[i],r));
	}
	return was[(ll)l*N+r]=ans;

	/*vector<ll> dp;
	int L=l;
	for(int i=fir;i<las;i++){
		dp.pb(DP(L,idx[m][i]));
		L=idx[m][i];
	}
	dp.pb(DP(L,r));
	ll sum=0;
	for(ll d:dp)sum+=d;
	vector<int> pts=stars[{l,r}];
	sort(pts.begin(),pts.end(),[&](int i,int j){return x[i]<x[j];});
	ll ans=sum;
	L=l;
	int j=0;
	for(int i=fir,o=0;i<las;i++,o++){
		int mx=0;
		while(j<pts.size()&&x[pts[j]]<idx[m][i])mx=max(mx,c[pts[j]]),j++;
		ans=max(ans,sum-dp[o]+mx);
		while(j<pts.size()&&x[pts[j]]==idx[m][i])ans=max(ans,sum+c[pts[j]]),j++;
		printf("%i - ",idx[m][i]);
	}
	printf("|");
	int mx=0;
	while(j<pts.size())mx=max(mx,c[pts[j]]),j++;
	ans=max(ans,sum-dp.back()+mx);
	printf("%i %i %lld\n",l,r,ans);
	return ans;*/
}
int main(){
	scanf("%i",&n);
	for(int i=1;i<=n;i++)scanf("%i",&a[i]),rmq[i][0]=a[i],idx[a[i]].pb(i);
	a[0]=a[n+1]=n;
	for(int j=1;j<L;j++){
		for(int i=1;i<=n-(1<<j)+1;i++){
			rmq[i][j]=max(rmq[i][j-1],rmq[i+(1<<j-1)][j-1]);
		}
	}
	for(int i=2;i<=n;i++)lgs[i]=lgs[i>>1]+1;
	ll sum=0;
	int m;
	scanf("%i",&m);
	for(int i=1;i<=m;i++){
		scanf("%i %i %i",&x[i],&y[i],&c[i]);
		stars[GetRng(x[i],y[i])].pb(i);
		sum+=c[i];
	}
	printf("%lld\n",sum-DP(0,n+1));
	return 0;
}

Compilation message

constellation3.cpp: In function 'std::pair<int, int> GetRng(int, int)':
constellation3.cpp:16:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   16 |   mid=top+bot>>1;
      |       ~~~^~~~
constellation3.cpp:22:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   22 |   mid=top+bot>>1;
      |       ~~~^~~~
constellation3.cpp: In function 'int main()':
constellation3.cpp:78:41: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   78 |    rmq[i][j]=max(rmq[i][j-1],rmq[i+(1<<j-1)][j-1]);
      |                                        ~^~
constellation3.cpp:73:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   73 |  scanf("%i",&n);
      |  ~~~~~^~~~~~~~~
constellation3.cpp:74:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   74 |  for(int i=1;i<=n;i++)scanf("%i",&a[i]),rmq[i][0]=a[i],idx[a[i]].pb(i);
      |                       ~~~~~^~~~~~~~~~~~
constellation3.cpp:84:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   84 |  scanf("%i",&m);
      |  ~~~~~^~~~~~~~~
constellation3.cpp:86:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   86 |   scanf("%i %i %i",&x[i],&y[i],&c[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 4 ms 5120 KB Output is correct
3 Correct 4 ms 5120 KB Output is correct
4 Correct 4 ms 5120 KB Output is correct
5 Correct 4 ms 5120 KB Output is correct
6 Correct 5 ms 5120 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 4 ms 5120 KB Output is correct
9 Correct 4 ms 5120 KB Output is correct
10 Correct 9 ms 6400 KB Output is correct
11 Correct 7 ms 5888 KB Output is correct
12 Correct 7 ms 5888 KB Output is correct
13 Correct 6 ms 5760 KB Output is correct
14 Correct 6 ms 5760 KB Output is correct
15 Correct 6 ms 5632 KB Output is correct
16 Correct 4 ms 5120 KB Output is correct
17 Correct 5 ms 5248 KB Output is correct
18 Correct 9 ms 6400 KB Output is correct
19 Correct 4 ms 5248 KB Output is correct
20 Correct 5 ms 5248 KB Output is correct
21 Correct 9 ms 6656 KB Output is correct
22 Correct 5 ms 5376 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 4 ms 5120 KB Output is correct
3 Correct 4 ms 5120 KB Output is correct
4 Correct 4 ms 5120 KB Output is correct
5 Correct 4 ms 5120 KB Output is correct
6 Correct 5 ms 5120 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 4 ms 5120 KB Output is correct
9 Correct 4 ms 5120 KB Output is correct
10 Correct 9 ms 6400 KB Output is correct
11 Correct 7 ms 5888 KB Output is correct
12 Correct 7 ms 5888 KB Output is correct
13 Correct 6 ms 5760 KB Output is correct
14 Correct 6 ms 5760 KB Output is correct
15 Correct 6 ms 5632 KB Output is correct
16 Correct 4 ms 5120 KB Output is correct
17 Correct 5 ms 5248 KB Output is correct
18 Correct 9 ms 6400 KB Output is correct
19 Correct 4 ms 5248 KB Output is correct
20 Correct 5 ms 5248 KB Output is correct
21 Correct 9 ms 6656 KB Output is correct
22 Correct 5 ms 5376 KB Output is correct
23 Correct 8 ms 5888 KB Output is correct
24 Correct 8 ms 5888 KB Output is correct
25 Correct 8 ms 5888 KB Output is correct
26 Correct 8 ms 5888 KB Output is correct
27 Correct 10 ms 5888 KB Output is correct
28 Correct 9 ms 5888 KB Output is correct
29 Correct 8 ms 5888 KB Output is correct
30 Correct 8 ms 5888 KB Output is correct
31 Correct 8 ms 5888 KB Output is correct
32 Correct 402 ms 60780 KB Output is correct
33 Correct 317 ms 48068 KB Output is correct
34 Correct 265 ms 39916 KB Output is correct
35 Correct 216 ms 34292 KB Output is correct
36 Correct 255 ms 56164 KB Output is correct
37 Correct 254 ms 57828 KB Output is correct
38 Correct 6 ms 5888 KB Output is correct
39 Correct 14 ms 7296 KB Output is correct
40 Correct 487 ms 74984 KB Output is correct
41 Correct 15 ms 7296 KB Output is correct
42 Correct 14 ms 7296 KB Output is correct
43 Correct 516 ms 75992 KB Output is correct
44 Correct 14 ms 7296 KB Output is correct

Subtask #3
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 4 ms 5120 KB Output is correct
3 Correct 4 ms 5120 KB Output is correct
4 Correct 4 ms 5120 KB Output is correct
5 Correct 4 ms 5120 KB Output is correct
6 Correct 5 ms 5120 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 4 ms 5120 KB Output is correct
9 Correct 4 ms 5120 KB Output is correct
10 Correct 9 ms 6400 KB Output is correct
11 Correct 7 ms 5888 KB Output is correct
12 Correct 7 ms 5888 KB Output is correct
13 Correct 6 ms 5760 KB Output is correct
14 Correct 6 ms 5760 KB Output is correct
15 Correct 6 ms 5632 KB Output is correct
16 Correct 4 ms 5120 KB Output is correct
17 Correct 5 ms 5248 KB Output is correct
18 Correct 9 ms 6400 KB Output is correct
19 Correct 4 ms 5248 KB Output is correct
20 Correct 5 ms 5248 KB Output is correct
21 Correct 9 ms 6656 KB Output is correct
22 Correct 5 ms 5376 KB Output is correct
23 Correct 8 ms 5888 KB Output is correct
24 Correct 8 ms 5888 KB Output is correct
25 Correct 8 ms 5888 KB Output is correct
26 Correct 8 ms 5888 KB Output is correct
27 Correct 10 ms 5888 KB Output is correct
28 Correct 9 ms 5888 KB Output is correct
29 Correct 8 ms 5888 KB Output is correct
30 Correct 8 ms 5888 KB Output is correct
31 Correct 8 ms 5888 KB Output is correct
32 Correct 402 ms 60780 KB Output is correct
33 Correct 317 ms 48068 KB Output is correct
34 Correct 265 ms 39916 KB Output is correct
35 Correct 216 ms 34292 KB Output is correct
36 Correct 255 ms 56164 KB Output is correct
37 Correct 254 ms 57828 KB Output is correct
38 Correct 6 ms 5888 KB Output is correct
39 Correct 14 ms 7296 KB Output is correct
40 Correct 487 ms 74984 KB Output is correct
41 Correct 15 ms 7296 KB Output is correct
42 Correct 14 ms 7296 KB Output is correct
43 Correct 516 ms 75992 KB Output is correct
44 Correct 14 ms 7296 KB Output is correct
45 Correct 1104 ms 91592 KB Output is correct
46 Correct 1081 ms 90472 KB Output is correct
47 Correct 1108 ms 90852 KB Output is correct
48 Correct 1086 ms 90988 KB Output is correct
49 Correct 1081 ms 89444 KB Output is correct
50 Correct 1072 ms 89304 KB Output is correct
51 Correct 1081 ms 89828 KB Output is correct
52 Correct 1103 ms 91364 KB Output is correct
53 Correct 1077 ms 90724 KB Output is correct
54 Execution timed out 1571 ms 161784 KB Time limit exceeded
55 Halted 0 ms 0 KB -