oj.uz

Submission #286353

# Submission time Handle Problem Language Result Execution time Memory
286353 2020-08-30T10:19:00 Z TadijaSebez Constellation 3 (JOI20_constellation3) C++11
35 / 100
 1500 ms 157120 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],lgs[N],n;
pii rmq[N][L];
pii 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).first>=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).first>=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];
	pii 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,m.second)+DP(m.second,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],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:17:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   17 |   mid=top+bot>>1;
      |       ~~~^~~~
constellation3.cpp:23:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   23 |   mid=top+bot>>1;
      |       ~~~^~~~
constellation3.cpp: In function 'int main()':
constellation3.cpp:79:41: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   79 |    rmq[i][j]=max(rmq[i][j-1],rmq[i+(1<<j-1)][j-1]);
      |                                        ~^~
constellation3.cpp:74:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   74 |  scanf("%i",&n);
      |  ~~~~~^~~~~~~~~
constellation3.cpp:75:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   75 |  for(int i=1;i<=n;i++)scanf("%i",&a[i]),rmq[i][0]={a[i],i};//,idx[a[i]].pb(i);
      |                       ~~~~~^~~~~~~~~~~~
constellation3.cpp:85:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   85 |  scanf("%i",&m);
      |  ~~~~~^~~~~~~~~
constellation3.cpp:87:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   87 |   scanf("%i %i %i",&x[i],&y[i],&c[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 7 ms 1792 KB Output is correct
11 Correct 4 ms 1280 KB Output is correct
12 Correct 4 ms 1152 KB Output is correct
13 Correct 3 ms 1024 KB Output is correct
14 Correct 3 ms 1152 KB Output is correct
15 Correct 3 ms 1024 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 2 ms 640 KB Output is correct
18 Correct 6 ms 1664 KB Output is correct
19 Correct 2 ms 616 KB Output is correct
20 Correct 4 ms 640 KB Output is correct
21 Correct 10 ms 1920 KB Output is correct
22 Correct 2 ms 768 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 7 ms 1792 KB Output is correct
11 Correct 4 ms 1280 KB Output is correct
12 Correct 4 ms 1152 KB Output is correct
13 Correct 3 ms 1024 KB Output is correct
14 Correct 3 ms 1152 KB Output is correct
15 Correct 3 ms 1024 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 2 ms 640 KB Output is correct
18 Correct 6 ms 1664 KB Output is correct
19 Correct 2 ms 616 KB Output is correct
20 Correct 4 ms 640 KB Output is correct
21 Correct 10 ms 1920 KB Output is correct
22 Correct 2 ms 768 KB Output is correct
23 Correct 6 ms 1280 KB Output is correct
24 Correct 5 ms 1280 KB Output is correct
25 Correct 5 ms 1280 KB Output is correct
26 Correct 5 ms 1280 KB Output is correct
27 Correct 5 ms 1280 KB Output is correct
28 Correct 5 ms 1280 KB Output is correct
29 Correct 5 ms 1280 KB Output is correct
30 Correct 5 ms 1344 KB Output is correct
31 Correct 5 ms 1280 KB Output is correct
32 Correct 409 ms 56072 KB Output is correct
33 Correct 326 ms 43264 KB Output is correct
34 Correct 276 ms 35392 KB Output is correct
35 Correct 214 ms 29628 KB Output is correct
36 Correct 188 ms 54500 KB Output is correct
37 Correct 192 ms 52880 KB Output is correct
38 Correct 3 ms 1280 KB Output is correct
39 Correct 11 ms 2816 KB Output is correct
40 Correct 432 ms 60068 KB Output is correct
41 Correct 15 ms 3456 KB Output is correct
42 Correct 11 ms 2816 KB Output is correct
43 Correct 510 ms 70244 KB Output is correct
44 Correct 13 ms 3072 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 7 ms 1792 KB Output is correct
11 Correct 4 ms 1280 KB Output is correct
12 Correct 4 ms 1152 KB Output is correct
13 Correct 3 ms 1024 KB Output is correct
14 Correct 3 ms 1152 KB Output is correct
15 Correct 3 ms 1024 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 2 ms 640 KB Output is correct
18 Correct 6 ms 1664 KB Output is correct
19 Correct 2 ms 616 KB Output is correct
20 Correct 4 ms 640 KB Output is correct
21 Correct 10 ms 1920 KB Output is correct
22 Correct 2 ms 768 KB Output is correct
23 Correct 6 ms 1280 KB Output is correct
24 Correct 5 ms 1280 KB Output is correct
25 Correct 5 ms 1280 KB Output is correct
26 Correct 5 ms 1280 KB Output is correct
27 Correct 5 ms 1280 KB Output is correct
28 Correct 5 ms 1280 KB Output is correct
29 Correct 5 ms 1280 KB Output is correct
30 Correct 5 ms 1344 KB Output is correct
31 Correct 5 ms 1280 KB Output is correct
32 Correct 409 ms 56072 KB Output is correct
33 Correct 326 ms 43264 KB Output is correct
34 Correct 276 ms 35392 KB Output is correct
35 Correct 214 ms 29628 KB Output is correct
36 Correct 188 ms 54500 KB Output is correct
37 Correct 192 ms 52880 KB Output is correct
38 Correct 3 ms 1280 KB Output is correct
39 Correct 11 ms 2816 KB Output is correct
40 Correct 432 ms 60068 KB Output is correct
41 Correct 15 ms 3456 KB Output is correct
42 Correct 11 ms 2816 KB Output is correct
43 Correct 510 ms 70244 KB Output is correct
44 Correct 13 ms 3072 KB Output is correct
45 Correct 1196 ms 98404 KB Output is correct
46 Correct 1104 ms 97064 KB Output is correct
47 Correct 1146 ms 97072 KB Output is correct
48 Correct 1092 ms 97776 KB Output is correct
49 Correct 1060 ms 95748 KB Output is correct
50 Correct 1082 ms 95656 KB Output is correct
51 Correct 1070 ms 96300 KB Output is correct
52 Correct 1132 ms 98036 KB Output is correct
53 Correct 1114 ms 97380 KB Output is correct
54 Execution timed out 1599 ms 157120 KB Time limit exceeded
55 Halted 0 ms 0 KB -