oj.uz

답안 #533945

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
533945 2022-03-07T17:31:27 Z amunduzbaev Peru (RMI20_peru) C++17
49 / 100
 156 ms 26976 KB 
#include "bits/stdc++.h"
using namespace std;
#include "peru.h"
#ifndef EVAL
#include "grader.cpp"
#endif

#define ar array
const int N = 4e5 + 5;
const int mod = 1e9 + 7;
const int P = 23;
long long dp[N];

int solve(int n, int k, int* a){
	deque<int> ss;
	multiset<long long> mm;
	int res = 0;
	for(int i=0;i<n;i++){
		while(!ss.empty() && ss.front() <= i - k){
			int j = ss.front(); ss.pop_front();
			if(!ss.empty()) mm.erase(mm.find(dp[j] + a[ss.front()]));
		}
		while(!ss.empty() && a[ss.back()] <= a[i]){
			int j = ss.back(); ss.pop_back();
			if(!ss.empty()){
				mm.erase(mm.find(dp[ss.back()] + a[j]));
			}
		}
		
		dp[i] = 1e18;
		if(!ss.empty()) mm.insert(dp[ss.back()] + a[i]);
		ss.push_back(i);
		
		//~ for(auto x : mm) cout<<x<<" ";
		//~ cout<<": ";
		
		if(!mm.empty()) dp[i] = *mm.begin();
		//~ cout<<dp[i]<<" ";
		dp[i] = min(dp[i], (i < k ? 0 : dp[i-k]) + a[ss.front()]);
		res = (res * 1ll * P + dp[i]) % mod;
		//~ cout<<dp[i]<<"\n";
	} 
	
	//~ cout<<"\n";
	return res;
}

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 70 ms 5048 KB Output is correct
16 Correct 56 ms 5108 KB Output is correct
17 Correct 59 ms 5048 KB Output is correct
18 Correct 38 ms 5048 KB Output is correct
19 Correct 41 ms 5084 KB Output is correct
20 Correct 45 ms 5064 KB Output is correct
21 Correct 62 ms 5128 KB Output is correct
22 Correct 59 ms 5128 KB Output is correct
23 Correct 62 ms 5108 KB Output is correct
24 Correct 64 ms 5044 KB Output is correct
25 Correct 60 ms 5132 KB Output is correct
26 Correct 61 ms 5064 KB Output is correct
27 Correct 73 ms 5120 KB Output is correct
28 Correct 78 ms 5196 KB Output is correct
29 Correct 76 ms 5380 KB Output is correct
30 Correct 59 ms 5160 KB Output is correct
31 Correct 64 ms 5100 KB Output is correct
32 Correct 60 ms 5180 KB Output is correct
33 Correct 57 ms 5060 KB Output is correct

Subtask #3
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 5048 KB Output is correct
2 Correct 56 ms 5108 KB Output is correct
3 Correct 59 ms 5048 KB Output is correct
4 Correct 38 ms 5048 KB Output is correct
5 Correct 41 ms 5084 KB Output is correct
6 Correct 45 ms 5064 KB Output is correct
7 Correct 62 ms 5128 KB Output is correct
8 Correct 59 ms 5128 KB Output is correct
9 Correct 62 ms 5108 KB Output is correct
10 Correct 64 ms 5044 KB Output is correct
11 Correct 60 ms 5132 KB Output is correct
12 Correct 61 ms 5064 KB Output is correct
13 Correct 73 ms 5120 KB Output is correct
14 Correct 78 ms 5196 KB Output is correct
15 Correct 76 ms 5380 KB Output is correct
16 Correct 59 ms 5160 KB Output is correct
17 Correct 64 ms 5100 KB Output is correct
18 Correct 60 ms 5180 KB Output is correct
19 Correct 57 ms 5060 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Runtime error 156 ms 26976 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -