oj.uz

Submission #41298

# Submission time Handle Problem Language Result Execution time Memory
41298 2018-02-15T17:45:59 Z IvanC K blocks (IZhO14_blocks) C++14
53 / 100
 1000 ms 13096 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef pair<int,int> ii;
typedef tuple<int,int,int> trinca;
const int INF = 1e9;
const int MAXN = 1e5  + 10;
int vetor[MAXN],dp[MAXN],esq[MAXN],dir[MAXN],N,K,seg2[4*MAXN];
ii seg[4*MAXN];
void build(int pos,int left,int right){
	//printf("Build1 %d %d %d\n",pos,left,right);
	if(left == right){
		seg[pos] = ii(dp[left],left);
		return;
	}
	int mid = (left+right)/2;
	build(2*pos,left,mid);
	build(2*pos+1,mid+1,right);
	seg[pos] = max(seg[2*pos],seg[2*pos+1]);
}
ii query(int pos,int left,int right,int i,int j){
	//printf("Query1 %d %d %d %d\n",pos,left,right,i,j);
	if(left >= i && right <= j) return seg[pos];
	int mid = (left+right)/2;
	if(j <= mid) return query(2*pos,left,mid,i,j);
	else if(i >= mid + 1) return query(2*pos+1,mid+1,right,i,j);
	return max(query(2*pos,left,mid,i,j),query(2*pos+1,mid+1,right,i,j));
}
void intervals(int ini,int fim){
	//printf("Intervals %d %d\n",ini,fim);
	if(ini > fim) return;
	int maioral = query(1,1,N,ini,fim).second;
	esq[maioral] = ini;
	dir[maioral] = fim;
	intervals(ini,maioral-1);
	intervals(maioral+1,fim);
}
void build2(int pos,int left,int right){
	//printf("Build2 %d %d %d\n",pos,left,right);
	if(left == right){
		seg2[pos] = dp[left];
		return;
	}
	int mid = (left+right)/2;
	build2(2*pos,left,mid);
	build2(2*pos+1,mid+1,right);
	seg2[pos] = min(seg2[2*pos],seg2[2*pos+1]);
}
int query2(int pos,int left,int right,int i,int j){
	//printf("Query2 %d %d %d %d\n",pos,left,right,i,j);
	if(left >= i && right <= j) return seg2[pos];
	int mid = (left+right)/2;
	if(j <= mid) return query2(2*pos,left,mid,i,j);
	else if(i >= mid + 1) return query2(2*pos+1,mid+1,right,i,j);
	return min(query2(2*pos,left,mid,i,j),query2(2*pos+1,mid+1,right,i,j));
}
void solve(int k){
	for(int i = 0;i<k-1;i++) dp[i] = INF;
	vector<trinca> sweep;
	priority_queue<ii, vector<ii> , greater<ii> > valores;
	build2(1,1,N);
	for(int i = 1;i<=N;i++){
		int lo = max(esq[i] - 1,1);
		int hi = i - 1;
		if(lo > hi || max(lo,hi) <= 0) continue;
		int novo = query2(1,1,N,lo,hi) + vetor[i];
		sweep.push_back(make_tuple(i,dir[i],novo));
	}
	//printf("Ok1\n");
	int ptr = 0;
	for(int i = k;i<=N;i++){
		//printf("Sweep\n");
		while(ptr < sweep.size() && get<0>(sweep[ptr]) <= i){
			//printf("While\n");
			ii val = ii(get<2>(sweep[ptr]), get<1>(sweep[ptr]) );
			valores.push(val);
			ptr++;
		}
		while(!valores.empty() && valores.top().second < i){
			valores.pop();
		}
		if(valores.empty()){
			dp[i] = INF;
		}
		else{
			dp[i] = (valores.top().first);
		}
	}
	//printf("Ok2\n");
	sweep.clear();
	while(!valores.empty()) valores.pop();
}
int main(){
	scanf("%d %d",&N,&K);
	for(int i = 1;i<=N;i++){
		scanf("%d",&vetor[i]);
		dp[i] = vetor[i];
	}
	build(1,1,N);
	intervals(1,N);
	for(int i = 1;i<=N;i++) dp[i] = query(1,1,N,1,i).first;
	for(int k = 2;k<=K;k++) solve(k);
	printf("%d\n",dp[N]);
	return 0;
}

Compilation message

blocks.cpp: In function 'void solve(int)':
blocks.cpp:75:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(ptr < sweep.size() && get<0>(sweep[ptr]) <= i){
             ^
blocks.cpp: In function 'int main()':
blocks.cpp:96:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&N,&K);
                      ^
blocks.cpp:98:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&vetor[i]);
                        ^

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
3 Correct 2 ms 424 KB Output is correct
4 Correct 2 ms 544 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 1 ms 568 KB Output is correct
7 Correct 1 ms 584 KB Output is correct
8 Correct 2 ms 584 KB Output is correct
9 Correct 2 ms 584 KB Output is correct
10 Correct 1 ms 584 KB Output is correct
11 Correct 2 ms 584 KB Output is correct
12 Correct 2 ms 584 KB Output is correct
13 Correct 2 ms 584 KB Output is correct
14 Correct 2 ms 696 KB Output is correct
15 Correct 1 ms 696 KB Output is correct
16 Correct 2 ms 696 KB Output is correct
17 Correct 2 ms 696 KB Output is correct
18 Correct 2 ms 696 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 696 KB Output is correct
2 Correct 2 ms 696 KB Output is correct
3 Correct 2 ms 696 KB Output is correct
4 Correct 2 ms 696 KB Output is correct
5 Correct 2 ms 696 KB Output is correct
6 Correct 2 ms 696 KB Output is correct
7 Correct 1 ms 696 KB Output is correct
8 Correct 1 ms 696 KB Output is correct
9 Correct 2 ms 696 KB Output is correct
10 Correct 2 ms 696 KB Output is correct
11 Correct 2 ms 696 KB Output is correct
12 Correct 2 ms 696 KB Output is correct
13 Correct 2 ms 696 KB Output is correct
14 Correct 2 ms 696 KB Output is correct
15 Correct 2 ms 696 KB Output is correct
16 Correct 2 ms 696 KB Output is correct
17 Correct 2 ms 696 KB Output is correct
18 Correct 2 ms 696 KB Output is correct
19 Correct 2 ms 696 KB Output is correct
20 Correct 2 ms 696 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 696 KB Output is correct
2 Correct 2 ms 696 KB Output is correct
3 Correct 2 ms 696 KB Output is correct
4 Correct 1 ms 696 KB Output is correct
5 Correct 2 ms 696 KB Output is correct
6 Correct 1 ms 696 KB Output is correct
7 Correct 2 ms 696 KB Output is correct
8 Correct 2 ms 696 KB Output is correct
9 Correct 2 ms 696 KB Output is correct
10 Correct 1 ms 696 KB Output is correct
11 Correct 2 ms 696 KB Output is correct
12 Correct 1 ms 696 KB Output is correct
13 Correct 2 ms 696 KB Output is correct
14 Correct 2 ms 696 KB Output is correct
15 Correct 3 ms 696 KB Output is correct
16 Correct 3 ms 696 KB Output is correct
17 Correct 2 ms 696 KB Output is correct
18 Correct 3 ms 696 KB Output is correct
19 Correct 3 ms 696 KB Output is correct

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 1988 KB Output is correct
2 Correct 25 ms 4452 KB Output is correct
3 Correct 100 ms 6300 KB Output is correct
4 Correct 944 ms 6644 KB Output is correct
5 Execution timed out 1065 ms 13096 KB Time limit exceeded
6 Halted 0 ms 0 KB -