oj.uz

Submission #952931

# Submission time Handle Problem Language Result Execution time Memory
952931 2024-03-25T05:22:30 Z lunchbox The short shank; Redemption (BOI21_prison) C++17
80 / 100
 2000 ms 70984 KB 
/*
*       ___
*   _ /    _\_
*  / |    |___|
*  | |       |
*  \_|   __  |
*     \_/  \_/
*   uwu amogus
*/
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x7FFFFFFF
#define llinf 0x7FFFFFFFFFFFFFFF
#define ff first
#define ss second
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define ROF(i, a, b) for(int i = a - 1; i >= b; i--)
//#define assert void
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
//#define int ll
struct dsu {
	dsu(int n) {
		p.resize(n, -1);
		pp.resize(n); for (int i = 0; i < n; i++) pp[i] = i;
		r.resize(n, 0);
	}
	inline int par(int x) {
		return pp[_par(x)];
	}
	inline int _par(int x) {
		return p[x] == -1 ? x : p[x] = _par(p[x]);
	}
	inline void merge(int a, int b) {
		a = _par(a); b = _par(b);
		if (a == b)return;
		if (r[a] < r[b]) {
			swap(a, b);
			swap(pp[a], pp[b]);
		}
		if (r[a] == r[b]) r[a]++;
		p[b] = a;
	}
	vector<int> p, r, pp;
};

namespace fastio {
static constexpr int SZ = 1 << 17;
char ibuf[SZ], obuf[SZ];
int pil = 0, pir = 0, por = 0;

struct Pre {
  char num[40000];
  constexpr Pre() : num() {
    for (int i = 0; i < 10000; i++) {
      int n = i;
      for (int j = 3; j >= 0; j--) {
        num[i * 4 + j] = n % 10 + '0';
        n /= 10;
      }
    }
  }
} constexpr pre;

inline void load() {
  memcpy(ibuf, ibuf + pil, pir - pil);
  pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);
  pil = 0;
}
inline void flush() {
  fwrite(obuf, 1, por, stdout);
  por = 0;
}

inline void rd(char& c) { c = ibuf[pil++]; }
template <typename T>
inline void rd(T& x) {
  if (pil + 32 > pir) load();
  char c;
  do
    c = ibuf[pil++];
  while (c < '-');
  bool minus = 0;
  if (c == '-') {
    minus = 1;
    c = ibuf[pil++];
  }
  x = 0;
  while (c >= '0') {
    x = x * 10 + (c & 15);
    c = ibuf[pil++];
  }
  if (minus) x = -x;
}
inline void rd() {}
template <typename Head, typename... Tail>
inline void rd(Head& head, Tail&... tail) {
  rd(head);
  rd(tail...);
}

inline void wt(char c) { obuf[por++] = c; }
template <typename T>
inline void wt(T x) {
  if (por > SZ - 32) flush();
  if (!x) {
    obuf[por++] = '0';
    return;
  }
  if (x < 0) {
    obuf[por++] = '-';
    x = -x;
  }
  int i = 12;
  char buf[16];
  while (x >= 10000) {
    memcpy(buf + i, pre.num + (x % 10000) * 4, 4);
    x /= 10000;
    i -= 4;
  }
  if (x < 100) {
    if (x < 10) {
      wt(char('0' + char(x)));
    } else {
      uint32_t q = (uint32_t(x) * 205) >> 11;
      uint32_t r = uint32_t(x) - q * 10;
      obuf[por + 0] = '0' + q;
      obuf[por + 1] = '0' + r;
      por += 2;
    }
  } else {
    if (x < 1000) {
      memcpy(obuf + por, pre.num + (x << 2) + 1, 3);
      por += 3;
    } else {
      memcpy(obuf + por, pre.num + (x << 2), 4);
      por += 4;
    }
  }
  memcpy(obuf + por, buf + i + 4, 12 - i);
  por += 12 - i;
}

inline void wt() {}
template <typename Head, typename... Tail>
inline void wt(Head head, Tail... tail) {
  wt(head);
  wt(tail...);
}
template <typename T>
inline void wtn(T x) {
  wt(x, '\n');
}

struct Dummy {
  Dummy() { atexit(flush); }
} dummy;

}  // namespace fastio
using fastio::rd;
using fastio::wt;
using fastio::wtn;
 
signed main() {
//   ios_base::sync_with_stdio(false); cin.tie(NULL);
	int N, D, T; rd(N,D,T);
	vector<int> t(N); for (auto& x : t) rd(x);
	int l = 0, r = 2e6, m = 0;
	int ans = 0;
	while (l < r) {//aliens HAHAHAhaha ha ha :sob:
		m = (l + r) / 2;
		vector<pair<int,int>> st; st.reserve(N);
		struct node {
			int p = -1;//prev
			int n = -1;//next
			int lz = 0;
			int v = 0;
			int c = 0; // count owo!!!
			node() {};
			node(int v, int c) : v(v), c(c) {};
		};
		vector<node> st2; st2.reserve(N);
		dsu pls(N);
		int start = 0; 
		int amt = 0;//amount added
		function<void(int)> kill = [&](int i) {
			int n = st2[i].n;
			//assert(n != -1); 
			if (n == -1) return;
			if ((st2[i].v + (int)st2[i].lz > st2[n].v)) {
				int p = st2[i].p;
				st2[n].p = p;
				if (p != -1) {
					st2[p].lz += st2[i].lz;
					st2[p].n = n;
					pls.merge(p, i); //merge i to p
					kill(p);
				}
				else {
					// DEAD
					amt -= st2[i].lz; //recycle owo
					start = n;
				}
			}
		};
		for (int i = 0; i < N; i++) {
			//create and then upd
			if (st2.size()) {
				st2.push_back(node(st2[start].v + (int)amt + m, st2[start].c+1));
				st2[i - 1].n = i; st2[i].p = i - 1;
				kill(i - 1);
			}
			else {
				st2.push_back(node());
			}
 
			int o = i;
			if (t[i] <= T) {
				while (st.size() && st.back().ff >= t[i] - i) {
					st.pop_back();
				}
				st.push_back({ t[i] - i, i});
			}
			else {
				while (st.size() && st.back().ff > T - i) st.pop_back();
				if (st.size()) {
					o = st.back().ss;
				}
				else o = -1;
			}
			//cout << o << ",";
			if(o >= start){
				int t = pls.par(o);
				st2[t].lz++; amt++;
				kill(t);
			}
			//cout << amt << ",";
		}
		//cout << endl;
		int c = st2[start].c;
		//cout << c << endl;
		if (c <= D) {
			r = m;
			ans = round((int)st2[start].v + (int)amt - (int)D * m);
		}
		else {
			//cout << "fuck" << endl;
			l = m + 1;
		}
	}
	cout << ans << endl;
	// n log n inverse ackermann n please pass i swear to god
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 508 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 699 ms 18176 KB Output is correct
3 Correct 709 ms 18152 KB Output is correct
4 Correct 712 ms 21832 KB Output is correct
5 Correct 666 ms 18140 KB Output is correct
6 Correct 498 ms 20556 KB Output is correct
7 Correct 510 ms 33252 KB Output is correct
8 Correct 514 ms 18560 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 508 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 2 ms 508 KB Output is correct
23 Correct 5 ms 604 KB Output is correct
24 Correct 5 ms 632 KB Output is correct
25 Correct 5 ms 604 KB Output is correct
26 Correct 6 ms 608 KB Output is correct
27 Correct 5 ms 632 KB Output is correct
28 Correct 5 ms 620 KB Output is correct
29 Correct 6 ms 624 KB Output is correct
30 Correct 5 ms 608 KB Output is correct
31 Correct 4 ms 612 KB Output is correct
32 Correct 4 ms 624 KB Output is correct
33 Correct 3 ms 608 KB Output is correct
34 Correct 7 ms 608 KB Output is correct
35 Correct 5 ms 608 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 113 ms 3208 KB Output is correct
3 Correct 110 ms 3216 KB Output is correct
4 Correct 74 ms 3320 KB Output is correct
5 Correct 70 ms 4052 KB Output is correct
6 Correct 64 ms 3772 KB Output is correct
7 Correct 84 ms 3756 KB Output is correct
8 Correct 79 ms 4020 KB Output is correct
9 Correct 68 ms 5260 KB Output is correct
10 Correct 52 ms 3276 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 508 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 2 ms 508 KB Output is correct
23 Correct 5 ms 604 KB Output is correct
24 Correct 5 ms 632 KB Output is correct
25 Correct 5 ms 604 KB Output is correct
26 Correct 6 ms 608 KB Output is correct
27 Correct 5 ms 632 KB Output is correct
28 Correct 5 ms 620 KB Output is correct
29 Correct 6 ms 624 KB Output is correct
30 Correct 5 ms 608 KB Output is correct
31 Correct 4 ms 612 KB Output is correct
32 Correct 4 ms 624 KB Output is correct
33 Correct 3 ms 608 KB Output is correct
34 Correct 7 ms 608 KB Output is correct
35 Correct 5 ms 608 KB Output is correct
36 Correct 1 ms 352 KB Output is correct
37 Correct 113 ms 3208 KB Output is correct
38 Correct 110 ms 3216 KB Output is correct
39 Correct 74 ms 3320 KB Output is correct
40 Correct 70 ms 4052 KB Output is correct
41 Correct 64 ms 3772 KB Output is correct
42 Correct 84 ms 3756 KB Output is correct
43 Correct 79 ms 4020 KB Output is correct
44 Correct 68 ms 5260 KB Output is correct
45 Correct 52 ms 3276 KB Output is correct
46 Correct 1 ms 500 KB Output is correct
47 Correct 1 ms 352 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 352 KB Output is correct
50 Correct 1 ms 352 KB Output is correct
51 Correct 1 ms 352 KB Output is correct
52 Correct 1 ms 356 KB Output is correct
53 Correct 1 ms 464 KB Output is correct
54 Correct 1 ms 608 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 344 KB Output is correct
57 Correct 6 ms 604 KB Output is correct
58 Correct 5 ms 612 KB Output is correct
59 Correct 5 ms 604 KB Output is correct
60 Correct 5 ms 632 KB Output is correct
61 Correct 6 ms 612 KB Output is correct
62 Correct 6 ms 612 KB Output is correct
63 Correct 6 ms 616 KB Output is correct
64 Correct 4 ms 616 KB Output is correct
65 Correct 4 ms 616 KB Output is correct
66 Correct 4 ms 616 KB Output is correct
67 Correct 4 ms 616 KB Output is correct
68 Correct 5 ms 616 KB Output is correct
69 Correct 5 ms 628 KB Output is correct
70 Correct 1 ms 360 KB Output is correct
71 Correct 107 ms 3268 KB Output is correct
72 Correct 118 ms 3260 KB Output is correct
73 Correct 91 ms 3304 KB Output is correct
74 Correct 74 ms 3920 KB Output is correct
75 Correct 61 ms 3764 KB Output is correct
76 Correct 84 ms 3756 KB Output is correct
77 Correct 82 ms 4040 KB Output is correct
78 Correct 68 ms 5332 KB Output is correct
79 Correct 52 ms 3324 KB Output is correct
80 Correct 118 ms 3220 KB Output is correct
81 Correct 100 ms 3232 KB Output is correct
82 Correct 104 ms 3248 KB Output is correct
83 Correct 110 ms 3640 KB Output is correct
84 Correct 98 ms 3220 KB Output is correct
85 Correct 57 ms 3536 KB Output is correct
86 Correct 87 ms 3524 KB Output is correct
87 Correct 69 ms 3320 KB Output is correct
88 Correct 66 ms 5076 KB Output is correct
89 Correct 73 ms 5172 KB Output is correct
90 Correct 61 ms 4688 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 508 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 699 ms 18176 KB Output is correct
14 Correct 709 ms 18152 KB Output is correct
15 Correct 712 ms 21832 KB Output is correct
16 Correct 666 ms 18140 KB Output is correct
17 Correct 498 ms 20556 KB Output is correct
18 Correct 510 ms 33252 KB Output is correct
19 Correct 514 ms 18560 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 2 ms 508 KB Output is correct
31 Correct 5 ms 604 KB Output is correct
32 Correct 5 ms 632 KB Output is correct
33 Correct 5 ms 604 KB Output is correct
34 Correct 6 ms 608 KB Output is correct
35 Correct 5 ms 632 KB Output is correct
36 Correct 5 ms 620 KB Output is correct
37 Correct 6 ms 624 KB Output is correct
38 Correct 5 ms 608 KB Output is correct
39 Correct 4 ms 612 KB Output is correct
40 Correct 4 ms 624 KB Output is correct
41 Correct 3 ms 608 KB Output is correct
42 Correct 7 ms 608 KB Output is correct
43 Correct 5 ms 608 KB Output is correct
44 Correct 1 ms 352 KB Output is correct
45 Correct 113 ms 3208 KB Output is correct
46 Correct 110 ms 3216 KB Output is correct
47 Correct 74 ms 3320 KB Output is correct
48 Correct 70 ms 4052 KB Output is correct
49 Correct 64 ms 3772 KB Output is correct
50 Correct 84 ms 3756 KB Output is correct
51 Correct 79 ms 4020 KB Output is correct
52 Correct 68 ms 5260 KB Output is correct
53 Correct 52 ms 3276 KB Output is correct
54 Correct 1 ms 500 KB Output is correct
55 Correct 1 ms 352 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 352 KB Output is correct
58 Correct 1 ms 352 KB Output is correct
59 Correct 1 ms 352 KB Output is correct
60 Correct 1 ms 356 KB Output is correct
61 Correct 1 ms 464 KB Output is correct
62 Correct 1 ms 608 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 6 ms 604 KB Output is correct
66 Correct 5 ms 612 KB Output is correct
67 Correct 5 ms 604 KB Output is correct
68 Correct 5 ms 632 KB Output is correct
69 Correct 6 ms 612 KB Output is correct
70 Correct 6 ms 612 KB Output is correct
71 Correct 6 ms 616 KB Output is correct
72 Correct 4 ms 616 KB Output is correct
73 Correct 4 ms 616 KB Output is correct
74 Correct 4 ms 616 KB Output is correct
75 Correct 4 ms 616 KB Output is correct
76 Correct 5 ms 616 KB Output is correct
77 Correct 5 ms 628 KB Output is correct
78 Correct 1 ms 360 KB Output is correct
79 Correct 107 ms 3268 KB Output is correct
80 Correct 118 ms 3260 KB Output is correct
81 Correct 91 ms 3304 KB Output is correct
82 Correct 74 ms 3920 KB Output is correct
83 Correct 61 ms 3764 KB Output is correct
84 Correct 84 ms 3756 KB Output is correct
85 Correct 82 ms 4040 KB Output is correct
86 Correct 68 ms 5332 KB Output is correct
87 Correct 52 ms 3324 KB Output is correct
88 Correct 118 ms 3220 KB Output is correct
89 Correct 100 ms 3232 KB Output is correct
90 Correct 104 ms 3248 KB Output is correct
91 Correct 110 ms 3640 KB Output is correct
92 Correct 98 ms 3220 KB Output is correct
93 Correct 57 ms 3536 KB Output is correct
94 Correct 87 ms 3524 KB Output is correct
95 Correct 69 ms 3320 KB Output is correct
96 Correct 66 ms 5076 KB Output is correct
97 Correct 73 ms 5172 KB Output is correct
98 Correct 61 ms 4688 KB Output is correct
99 Correct 1 ms 348 KB Output is correct
100 Correct 1 ms 348 KB Output is correct
101 Correct 2 ms 348 KB Output is correct
102 Correct 1 ms 348 KB Output is correct
103 Correct 2 ms 348 KB Output is correct
104 Correct 2 ms 348 KB Output is correct
105 Correct 1 ms 348 KB Output is correct
106 Correct 1 ms 348 KB Output is correct
107 Correct 1 ms 348 KB Output is correct
108 Correct 1 ms 348 KB Output is correct
109 Correct 1 ms 348 KB Output is correct
110 Correct 0 ms 348 KB Output is correct
111 Correct 696 ms 18204 KB Output is correct
112 Correct 768 ms 18172 KB Output is correct
113 Correct 698 ms 19820 KB Output is correct
114 Correct 661 ms 18192 KB Output is correct
115 Correct 526 ms 20660 KB Output is correct
116 Correct 497 ms 31340 KB Output is correct
117 Correct 563 ms 20316 KB Output is correct
118 Correct 5 ms 584 KB Output is correct
119 Correct 6 ms 632 KB Output is correct
120 Correct 5 ms 604 KB Output is correct
121 Correct 8 ms 644 KB Output is correct
122 Correct 6 ms 608 KB Output is correct
123 Correct 7 ms 612 KB Output is correct
124 Correct 5 ms 628 KB Output is correct
125 Correct 5 ms 604 KB Output is correct
126 Correct 4 ms 604 KB Output is correct
127 Correct 3 ms 604 KB Output is correct
128 Correct 3 ms 604 KB Output is correct
129 Correct 5 ms 608 KB Output is correct
130 Correct 5 ms 604 KB Output is correct
131 Correct 1 ms 344 KB Output is correct
132 Correct 107 ms 3256 KB Output is correct
133 Correct 119 ms 3232 KB Output is correct
134 Correct 75 ms 3296 KB Output is correct
135 Correct 57 ms 3940 KB Output is correct
136 Correct 56 ms 3832 KB Output is correct
137 Correct 80 ms 3740 KB Output is correct
138 Correct 99 ms 4052 KB Output is correct
139 Correct 96 ms 5264 KB Output is correct
140 Correct 59 ms 3276 KB Output is correct
141 Correct 108 ms 3244 KB Output is correct
142 Correct 104 ms 3208 KB Output is correct
143 Correct 106 ms 3252 KB Output is correct
144 Correct 100 ms 3752 KB Output is correct
145 Correct 106 ms 3264 KB Output is correct
146 Correct 61 ms 3560 KB Output is correct
147 Correct 94 ms 3460 KB Output is correct
148 Correct 72 ms 3368 KB Output is correct
149 Correct 69 ms 5060 KB Output is correct
150 Correct 76 ms 5468 KB Output is correct
151 Correct 61 ms 4804 KB Output is correct
152 Execution timed out 2080 ms 70984 KB Time limit exceeded
153 Halted 0 ms 0 KB -