oj.uz

답안 #430363

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
430363 2021-06-16T13:09:43 Z patrikpavic2 The short shank; Redemption (BOI21_prison) C++17
70 / 100
 1929 ms 12732 KB 
#include <cstdio>
#include <cstring>
#include <stack>
#include <vector>
 
#define X first
#define Y second
#define PB push_back
 
using namespace std;
 
const int N = 1e5 + 500;
const int OFF = (1 << 17);
 
typedef long long ll;
typedef pair < int, int > pii;
 
ll LO, HI = (ll)1e9, COST;
 
inline ll get_cost(pii &tmp){
	return 100000LL * tmp.X + COST * tmp.Y;
}
 
inline pii bolji(pii A, pii B){
	if(get_cost(A) < get_cost(B))
		return A;
	return B;
}
 
pii T[2 * OFF];
int prop[2 * OFF];
int n, d, tme[N], L;
vector < int > q[N];
 
void refresh(int x){
	if(!prop[x]) return;
	T[x].X += prop[x];
	if(x < OFF){
		prop[2 * x] += prop[x];
		prop[2 * x + 1] += prop[x];
	}
	prop[x] = 0;
}
 
void update(int i, int a, int b, int lo, int hi){
	refresh(i);
	if(lo <= a && b <= hi) {
		prop[i]++; refresh(i);
		return;
	}
	if(a > hi || b < lo) { return; }
	update(2 * i, a, (a + b) / 2, lo, hi);
	update(2 * i + 1, (a + b) / 2 + 1, b, lo, hi);
	T[i] = bolji(T[2 * i], T[2 * i + 1]);
}
 
void postavi(int i, int a, int b, int gdje, pii kog){
	refresh(i); refresh(i ^ 1);
	if(a == b){
		T[i] = kog; return;
	}
	if(gdje <= (a + b) / 2)
		postavi(2 * i, a, (a + b) / 2, gdje, kog);
	else
		postavi(2 * i + 1, (a + b) / 2 + 1, b, gdje, kog);
	T[i] = bolji(T[2 * i], T[2 * i + 1]);
}
 
pii dp[N];
 
pii probaj(){
	for(int i = 0;i < 2 * OFF;i++) T[i] = {N, N}, prop[i] = 0;
	postavi(1, 0, OFF - 1, 0, {0, 0});
	for(int i = 1;i <= n;i++){
		for(int j : q[i]){
			//printf("%d %d += 1\n", 0, j - 1);
			update(1, 0, OFF - 1, 0, j - 1);
		}
		dp[i] = T[1]; dp[i].Y++; postavi(1, 0, OFF - 1, i, dp[i]);
	//	printf("dp[ %d ] = %d %d\n", i, dp[i].X, dp[i].Y);
	}
	return T[1];
}
 
int main(){
	scanf("%d%d%d", &n, &d, &L);
	stack < int > Q;
	for(int i = 1;i <= n;i++){
		scanf("%d", tme + i);
		Q.push(i);
		while(!Q.empty() && tme[Q.top()] + i - Q.top() > L)
			Q.pop();
		if(!Q.empty()){
		//	printf("%d %d\n", Q.top(), i);
			q[i].PB(Q.top());
		}
	}
	for(int i = 0;i < 32;i++){
		COST = (LO + HI) / 2;
		int odg = probaj().Y;
		if(odg == d) break;
	//	printf("LO = %lld HI = %lld\n", LO, HI);
		if(odg < d)
			HI = COST;
		else
			LO = COST;
	}
	//printf("COST = %lld\n", COST);
	pii fin = probaj();
	//printf("%d %d\n", fin.X, fin.Y);
	printf("%lld\n", (get_cost(fin) - COST * d) / 100000LL);
	return 0;
}

Compilation message

prison.cpp: In function 'int main()':
prison.cpp:86:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |  scanf("%d%d%d", &n, &d, &L);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
prison.cpp:89:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |   scanf("%d", tme + i);
      |   ~~~~~^~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 5708 KB Output is correct
2 Correct 24 ms 5708 KB Output is correct
3 Correct 23 ms 5724 KB Output is correct
4 Correct 34 ms 5708 KB Output is correct
5 Correct 37 ms 5708 KB Output is correct
6 Correct 16 ms 5744 KB Output is correct
7 Correct 12 ms 5732 KB Output is correct
8 Correct 30 ms 5720 KB Output is correct
9 Correct 30 ms 5692 KB Output is correct
10 Correct 27 ms 5708 KB Output is correct
11 Correct 23 ms 5708 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 5708 KB Output is correct
2 Runtime error 35 ms 12732 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 5708 KB Output is correct
2 Correct 24 ms 5708 KB Output is correct
3 Correct 23 ms 5724 KB Output is correct
4 Correct 34 ms 5708 KB Output is correct
5 Correct 37 ms 5708 KB Output is correct
6 Correct 16 ms 5744 KB Output is correct
7 Correct 12 ms 5732 KB Output is correct
8 Correct 30 ms 5720 KB Output is correct
9 Correct 30 ms 5692 KB Output is correct
10 Correct 27 ms 5708 KB Output is correct
11 Correct 23 ms 5708 KB Output is correct
12 Correct 15 ms 5728 KB Output is correct
13 Correct 28 ms 5744 KB Output is correct
14 Correct 22 ms 5748 KB Output is correct
15 Correct 33 ms 5708 KB Output is correct
16 Correct 36 ms 5724 KB Output is correct
17 Correct 15 ms 5708 KB Output is correct
18 Correct 15 ms 5708 KB Output is correct
19 Correct 23 ms 5752 KB Output is correct
20 Correct 28 ms 5708 KB Output is correct
21 Correct 23 ms 5724 KB Output is correct
22 Correct 23 ms 5740 KB Output is correct
23 Correct 132 ms 5884 KB Output is correct
24 Correct 127 ms 5884 KB Output is correct
25 Correct 100 ms 5884 KB Output is correct
26 Correct 119 ms 5836 KB Output is correct
27 Correct 108 ms 5880 KB Output is correct
28 Correct 128 ms 5896 KB Output is correct
29 Correct 106 ms 5884 KB Output is correct
30 Correct 91 ms 5836 KB Output is correct
31 Correct 88 ms 5856 KB Output is correct
32 Correct 108 ms 5864 KB Output is correct
33 Correct 112 ms 5860 KB Output is correct
34 Correct 61 ms 5872 KB Output is correct
35 Correct 112 ms 5884 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 5708 KB Output is correct
2 Correct 1815 ms 9048 KB Output is correct
3 Correct 1736 ms 9080 KB Output is correct
4 Correct 1565 ms 9192 KB Output is correct
5 Correct 1783 ms 9680 KB Output is correct
6 Correct 1861 ms 9676 KB Output is correct
7 Correct 1495 ms 8440 KB Output is correct
8 Correct 1291 ms 8348 KB Output is correct
9 Correct 1616 ms 9444 KB Output is correct
10 Correct 1617 ms 9208 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 5708 KB Output is correct
2 Correct 24 ms 5708 KB Output is correct
3 Correct 23 ms 5724 KB Output is correct
4 Correct 34 ms 5708 KB Output is correct
5 Correct 37 ms 5708 KB Output is correct
6 Correct 16 ms 5744 KB Output is correct
7 Correct 12 ms 5732 KB Output is correct
8 Correct 30 ms 5720 KB Output is correct
9 Correct 30 ms 5692 KB Output is correct
10 Correct 27 ms 5708 KB Output is correct
11 Correct 23 ms 5708 KB Output is correct
12 Correct 15 ms 5728 KB Output is correct
13 Correct 28 ms 5744 KB Output is correct
14 Correct 22 ms 5748 KB Output is correct
15 Correct 33 ms 5708 KB Output is correct
16 Correct 36 ms 5724 KB Output is correct
17 Correct 15 ms 5708 KB Output is correct
18 Correct 15 ms 5708 KB Output is correct
19 Correct 23 ms 5752 KB Output is correct
20 Correct 28 ms 5708 KB Output is correct
21 Correct 23 ms 5724 KB Output is correct
22 Correct 23 ms 5740 KB Output is correct
23 Correct 132 ms 5884 KB Output is correct
24 Correct 127 ms 5884 KB Output is correct
25 Correct 100 ms 5884 KB Output is correct
26 Correct 119 ms 5836 KB Output is correct
27 Correct 108 ms 5880 KB Output is correct
28 Correct 128 ms 5896 KB Output is correct
29 Correct 106 ms 5884 KB Output is correct
30 Correct 91 ms 5836 KB Output is correct
31 Correct 88 ms 5856 KB Output is correct
32 Correct 108 ms 5864 KB Output is correct
33 Correct 112 ms 5860 KB Output is correct
34 Correct 61 ms 5872 KB Output is correct
35 Correct 112 ms 5884 KB Output is correct
36 Correct 17 ms 5708 KB Output is correct
37 Correct 1815 ms 9048 KB Output is correct
38 Correct 1736 ms 9080 KB Output is correct
39 Correct 1565 ms 9192 KB Output is correct
40 Correct 1783 ms 9680 KB Output is correct
41 Correct 1861 ms 9676 KB Output is correct
42 Correct 1495 ms 8440 KB Output is correct
43 Correct 1291 ms 8348 KB Output is correct
44 Correct 1616 ms 9444 KB Output is correct
45 Correct 1617 ms 9208 KB Output is correct
46 Correct 15 ms 5708 KB Output is correct
47 Correct 24 ms 5736 KB Output is correct
48 Correct 22 ms 5736 KB Output is correct
49 Correct 32 ms 5752 KB Output is correct
50 Correct 27 ms 5708 KB Output is correct
51 Correct 12 ms 5708 KB Output is correct
52 Correct 11 ms 5708 KB Output is correct
53 Correct 25 ms 5720 KB Output is correct
54 Correct 27 ms 5708 KB Output is correct
55 Correct 23 ms 5708 KB Output is correct
56 Correct 30 ms 5740 KB Output is correct
57 Correct 99 ms 5928 KB Output is correct
58 Correct 133 ms 5920 KB Output is correct
59 Correct 108 ms 5924 KB Output is correct
60 Correct 104 ms 5924 KB Output is correct
61 Correct 102 ms 5924 KB Output is correct
62 Correct 125 ms 5836 KB Output is correct
63 Correct 101 ms 5920 KB Output is correct
64 Correct 114 ms 5860 KB Output is correct
65 Correct 92 ms 5868 KB Output is correct
66 Correct 108 ms 5880 KB Output is correct
67 Correct 95 ms 5880 KB Output is correct
68 Correct 52 ms 5872 KB Output is correct
69 Correct 105 ms 5900 KB Output is correct
70 Correct 14 ms 5728 KB Output is correct
71 Correct 1771 ms 9776 KB Output is correct
72 Correct 1767 ms 9820 KB Output is correct
73 Correct 1755 ms 9200 KB Output is correct
74 Correct 1787 ms 9668 KB Output is correct
75 Correct 1649 ms 9676 KB Output is correct
76 Correct 1291 ms 8444 KB Output is correct
77 Correct 1253 ms 8356 KB Output is correct
78 Correct 1385 ms 9508 KB Output is correct
79 Correct 1756 ms 9208 KB Output is correct
80 Correct 1622 ms 9820 KB Output is correct
81 Correct 1644 ms 9772 KB Output is correct
82 Correct 1580 ms 9820 KB Output is correct
83 Correct 1699 ms 9364 KB Output is correct
84 Correct 1809 ms 9016 KB Output is correct
85 Correct 1929 ms 9672 KB Output is correct
86 Correct 1541 ms 8996 KB Output is correct
87 Correct 1434 ms 8480 KB Output is correct
88 Correct 1660 ms 9048 KB Output is correct
89 Correct 1684 ms 9448 KB Output is correct
90 Correct 1655 ms 9540 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 5708 KB Output is correct
2 Correct 24 ms 5708 KB Output is correct
3 Correct 23 ms 5724 KB Output is correct
4 Correct 34 ms 5708 KB Output is correct
5 Correct 37 ms 5708 KB Output is correct
6 Correct 16 ms 5744 KB Output is correct
7 Correct 12 ms 5732 KB Output is correct
8 Correct 30 ms 5720 KB Output is correct
9 Correct 30 ms 5692 KB Output is correct
10 Correct 27 ms 5708 KB Output is correct
11 Correct 23 ms 5708 KB Output is correct
12 Correct 14 ms 5708 KB Output is correct
13 Runtime error 35 ms 12732 KB Execution killed with signal 6
14 Halted 0 ms 0 KB -