Submission #997947


Source Code Expand

#include <cstdio>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
#include <set>

using namespace std;

typedef pair<int , int> P2;
typedef pair<pair<int , int> , int> P3;
typedef pair<pair<int , int> , pair<int , int> > P4;
#define Fst first
#define Snd second
#define PB(a) push_back(a)
#define MP(a , b) make_pair((a) , (b))
#define M3P(a , b , c) make_pair(make_pair((a) , (b)) , (c))
#define M4P(a , b , c , d) make_pair(make_pair((a) , (b)) , make_pair((c) , (d)))
#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; ++i)
#define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; --i)
#define repv(t,it,v) for(vector<t>::iterator it = v.begin() ; it != v.end() ; ++it)

typedef long long LL;

const int ST_MAX = (1 << 20);

template <class T> class ST{
	T x[ST_MAX * 2];
	
	T eval(T a , T b){
		return max(a,b);
	}
	
	void ren(int a){
		x[a] = eval(x[2 * a] , x[2 * a + 1]);
		if(a > 0) ren(a / 2);
	}
	
	T read_ST(int a , int b , int e , int s , int f){
		if(e <= s || f <= b) return -1;
		if(s <= b && e <= f) return x[a];
		return eval(read_ST(2 * a , b , (b + e) / 2 , s , f) , read_ST(2 * a + 1 , (b + e) / 2 , e , s , f));
	}
	
public:
	
	ST(){
		fill(x,x+ST_MAX*2,-1);
	}
	
	void put(int a , T b){
		x[a + ST_MAX] = b;
		ren((a + ST_MAX) / 2);
	}
	
	T get(int s , int f){
		return read_ST(1 , 0 , ST_MAX , s , f);
	}
};

ST<LL> st;
int M,N,K;
LL A[100010];
LL dp[100010][301];


int main(){
	scanf("%d%d%d" , &N , &M , &K);
	repp(i,0,N){
		scanf("%lld" , A + i);
		dp[i][0] = A[i];
		st.put(i,A[i]);
	}
	repp(j,1,K){
		repm(i,N-1,-1){
			LL x = st.get(max(0,i-M),i);
			if(x < 0){
				dp[i][j] = -1;
				st.put(i,-1);
			} else {
				dp[i][j] = x + (LL)(j+1) * A[i];
				st.put(i,dp[i][j]);
			}
		}
	}
	printf("%lld\n" , st.get(0,N));
	return 0;
}

Submission Info

Submission Time
Task A - Struck Out
User PIandS
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1897 Byte
Status TLE
Exec Time 2115 ms
Memory 252544 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:69:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d" , &N , &M , &K);
                                ^
./Main.cpp:71:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld" , A + i);
                        ^

Judge Result

Set Name Sample subtask1 subtask2 subtask3 All
Score / Max Score 0 / 0 0 / 100 200 / 200 300 / 300 0 / 100
Status
AC × 3
AC × 8
TLE × 2
AC × 12
AC × 21
AC × 29
TLE × 14
Set Name Test Cases
Sample sample_1.txt, sample_2.txt, sample_3.txt
subtask1 sample_2.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt
subtask2 sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt
subtask3 sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt
All sample_1.txt, sample_2.txt, sample_3.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt, subtask_4_1.txt, subtask_4_10.txt, subtask_4_11.txt, subtask_4_12.txt, subtask_4_13.txt, subtask_4_2.txt, subtask_4_3.txt, subtask_4_4.txt, subtask_4_5.txt, subtask_4_6.txt, subtask_4_7.txt, subtask_4_8.txt, subtask_4_9.txt
Case Name Status Exec Time Memory
sample_1.txt AC 17 ms 16512 KB
sample_2.txt AC 18 ms 16512 KB
sample_3.txt AC 17 ms 16512 KB
subtask_1_1.txt AC 18 ms 16768 KB
subtask_1_2.txt AC 496 ms 40192 KB
subtask_1_3.txt TLE 2115 ms 252416 KB
subtask_1_4.txt AC 54 ms 28288 KB
subtask_1_5.txt AC 319 ms 252544 KB
subtask_1_6.txt AC 24 ms 17024 KB
subtask_1_7.txt AC 1769 ms 252544 KB
subtask_1_8.txt TLE 2115 ms 252416 KB
subtask_1_9.txt AC 42 ms 17664 KB
subtask_2_1.txt AC 20 ms 17280 KB
subtask_2_2.txt AC 18 ms 17280 KB
subtask_2_3.txt AC 19 ms 17280 KB
subtask_2_4.txt AC 19 ms 17024 KB
subtask_2_5.txt AC 18 ms 16640 KB
subtask_2_6.txt AC 18 ms 16640 KB
subtask_2_7.txt AC 20 ms 17280 KB
subtask_2_8.txt AC 20 ms 17280 KB
subtask_2_9.txt AC 19 ms 17280 KB
subtask_3_1.txt AC 813 ms 252544 KB
subtask_3_2.txt AC 914 ms 252544 KB
subtask_3_3.txt AC 899 ms 252544 KB
subtask_3_4.txt AC 749 ms 205312 KB
subtask_3_5.txt AC 52 ms 28416 KB
subtask_3_6.txt AC 549 ms 252544 KB
subtask_3_7.txt AC 731 ms 252544 KB
subtask_3_8.txt AC 102 ms 40192 KB
subtask_3_9.txt AC 853 ms 252544 KB
subtask_4_1.txt TLE 2115 ms 252416 KB
subtask_4_10.txt TLE 2115 ms 252416 KB
subtask_4_11.txt TLE 2115 ms 252416 KB
subtask_4_12.txt TLE 2115 ms 252416 KB
subtask_4_13.txt TLE 2115 ms 252416 KB
subtask_4_2.txt TLE 2115 ms 252416 KB
subtask_4_3.txt TLE 2115 ms 252416 KB
subtask_4_4.txt TLE 2115 ms 252416 KB
subtask_4_5.txt TLE 2115 ms 252416 KB
subtask_4_6.txt AC 601 ms 252416 KB
subtask_4_7.txt TLE 2115 ms 252416 KB
subtask_4_8.txt TLE 2115 ms 249472 KB
subtask_4_9.txt TLE 2115 ms 252416 KB