oj.uz

답안 #501392

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
501392 2022-01-03T04:12:15 Z tmn2005 K개의 묶음 (IZhO14_blocks) C++17
100 / 100
 143 ms 81516 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

#define ar array
#define fr first
#define sc second

#define vec vector
#define ret return

#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front

#define int long long

#define pii pair<int,int>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N=1e6+12,INF=1e9,mod = 1e9+7;
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n,m,k,x,y,l,r,o,ans,res,ok,mx,mn = INF;
int a[N],dp[105][N],b,c;

main(){
	NeedForSpeed
    cin>>n>>k;
    for(int i=1; i<=n; i++)cin>>a[i];
    
    for(int i=1; i<=n; i++){
    	dp[1][i] = max(dp[1][i-1], a[i]);
	}
    for(int i=2; i<=k; i++){
    	stack<pii>q;
    	for(int j=i; j<=n; j++){
    		int tmp = dp[i-1][j-1];
    		
    		while(!q.empty() && q.top().fr < a[j]){
    			tmp = min(tmp, q.top().sc);
    			q.pop();
			}
			if(q.empty() || q.top().fr + q.top().sc > tmp + a[j]){
				q.push(mk(a[j], tmp));
			}
			dp[i][j] = q.top().fr + q.top().sc;
		}
	}
	cout<<dp[k][n];



	return 0;
}

Compilation message

blocks.cpp:34:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   34 | main(){
      | ^~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 0 ms 324 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 324 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 316 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 448 KB Output is correct
18 Correct 0 ms 316 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 460 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 0 ms 324 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 324 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 316 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 448 KB Output is correct
36 Correct 0 ms 316 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 0 ms 460 KB Output is correct
39 Correct 1 ms 716 KB Output is correct
40 Correct 0 ms 324 KB Output is correct
41 Correct 0 ms 296 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 0 ms 320 KB Output is correct
44 Correct 0 ms 332 KB Output is correct
45 Correct 0 ms 332 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 0 ms 332 KB Output is correct
48 Correct 0 ms 316 KB Output is correct
49 Correct 0 ms 352 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 0 ms 460 KB Output is correct
52 Correct 1 ms 460 KB Output is correct
53 Correct 1 ms 1100 KB Output is correct
54 Correct 1 ms 1100 KB Output is correct
55 Correct 1 ms 716 KB Output is correct
56 Correct 1 ms 1100 KB Output is correct
57 Correct 1 ms 1100 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 0 ms 324 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 324 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 316 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 448 KB Output is correct
36 Correct 0 ms 316 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 0 ms 460 KB Output is correct
39 Correct 1 ms 716 KB Output is correct
40 Correct 0 ms 324 KB Output is correct
41 Correct 0 ms 296 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 0 ms 320 KB Output is correct
44 Correct 0 ms 332 KB Output is correct
45 Correct 0 ms 332 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 0 ms 332 KB Output is correct
48 Correct 0 ms 316 KB Output is correct
49 Correct 0 ms 352 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 0 ms 460 KB Output is correct
52 Correct 1 ms 460 KB Output is correct
53 Correct 1 ms 1100 KB Output is correct
54 Correct 1 ms 1100 KB Output is correct
55 Correct 1 ms 716 KB Output is correct
56 Correct 1 ms 1100 KB Output is correct
57 Correct 1 ms 1100 KB Output is correct
58 Correct 4 ms 2636 KB Output is correct
59 Correct 5 ms 1252 KB Output is correct
60 Correct 6 ms 3416 KB Output is correct
61 Correct 31 ms 27988 KB Output is correct
62 Correct 89 ms 80748 KB Output is correct
63 Correct 13 ms 4160 KB Output is correct
64 Correct 48 ms 37344 KB Output is correct
65 Correct 1 ms 460 KB Output is correct
66 Correct 1 ms 716 KB Output is correct
67 Correct 1 ms 708 KB Output is correct
68 Correct 1 ms 716 KB Output is correct
69 Correct 1 ms 332 KB Output is correct
70 Correct 1 ms 460 KB Output is correct
71 Correct 11 ms 9048 KB Output is correct
72 Correct 1 ms 536 KB Output is correct
73 Correct 4 ms 2616 KB Output is correct
74 Correct 4 ms 1228 KB Output is correct
75 Correct 6 ms 3404 KB Output is correct
76 Correct 34 ms 27896 KB Output is correct
77 Correct 112 ms 80764 KB Output is correct
78 Correct 11 ms 4108 KB Output is correct
79 Correct 48 ms 37316 KB Output is correct
80 Correct 9 ms 2500 KB Output is correct
81 Correct 16 ms 9624 KB Output is correct
82 Correct 99 ms 80740 KB Output is correct
83 Correct 1 ms 332 KB Output is correct
84 Correct 1 ms 460 KB Output is correct
85 Correct 13 ms 9132 KB Output is correct
86 Correct 1 ms 716 KB Output is correct
87 Correct 4 ms 2636 KB Output is correct
88 Correct 4 ms 1304 KB Output is correct
89 Correct 8 ms 3708 KB Output is correct
90 Correct 50 ms 28288 KB Output is correct
91 Correct 143 ms 81516 KB Output is correct
92 Correct 12 ms 4568 KB Output is correct
93 Correct 70 ms 38040 KB Output is correct
94 Correct 2 ms 544 KB Output is correct
95 Correct 9 ms 9028 KB Output is correct
96 Correct 1 ms 452 KB Output is correct
97 Correct 1 ms 324 KB Output is correct
98 Correct 0 ms 332 KB Output is correct
99 Correct 0 ms 332 KB Output is correct