2 files changed, 142 insertions, 0 deletions
diff --git a/20.5/feb/plat/minimizing.cpp b/20.5/feb/plat/minimizing.cpp
new file mode 100644
index 0000000..9d5bf95
--- /dev/null
+++ b/20.5/feb/plat/minimizing.cpp
@@ -0,0 +1,78 @@
+#include <bits/stdc++.h>
+#define f first
+#define s second
+using namespace std;
+using ll = long long;
+using ii = pair<int, int>;
+constexpr int MX = 1e5+5;
+
+int ans, D[2*MX];
+vector<int> G[MX], H[2*MX];
+
+int main() {
+	if (fopen("in", "r")) freopen("in", "r", stdin), freopen("out", "w", stdout);
+	cin.tie(0)->sync_with_stdio(0);
+
+	int T; cin >> T;
+	while (T--) {
+		int N, M; cin >> N >> M;
+		for (int u = 1; u <= N; ++u) G[u].clear();
+		for (int u = 1; u <= 2*N; ++u) H[u].clear();
+		for (int i = 0; i < M; ++i) {
+			int x, y; cin >> x >> y;
+			G[x].push_back(y), G[y].push_back(x);
+			H[x].push_back(y+N), H[y+N].push_back(x);
+			H[y].push_back(x+N), H[x+N].push_back(y);
+		}
+		
+		for (int u = 1; u <= 2*N; ++u) D[u] = 1e9;
+		queue<int> q;
+		D[1] = 0, q.push(1);
+		while (q.size()) {
+			int u = q.front(); q.pop();
+			for (int v : H[u]) if (D[v] == 1e9)
+				D[v] = D[u]+1, q.push(v);
+		}
+
+		if (*max_element(D+1, D+2*N+1) == 1e9) {
+			cout << N-1 << '\n';
+			continue;
+		}
+
+		/*vector<ii> C;
+		C.emplace_back(0, 0);
+		for (int u = 1; u <= N; ++u) {
+			C.emplace_back(D[u], D[u+N]);
+		}*/
+
+		ans = 0;
+		map<ii, int> f;
+		map<ii, vector<int>> b;
+		for (int u = 1; u <= N; ++u) {
+			ii p(min(D[u], D[u+N]), max(D[u], D[u+N]));
+			++f[p], b[p].push_back(u);
+		}
+		map<ii, int> ea;
+		for (auto [p, c] : f) {
+			int pr = ea[ii(p.f-1, p.s+1)];
+			if (p.f+1 == p.s) {
+				if (p.f == 0) ans += (c+1)/2;
+				else if (f[ii(p.f-1, p.s-1)]) ans += max((c-pr)+(pr+1)/2, (c+1)/2);
+				else {
+					if (pr < c) ans += c-pr;
+					ans += (c+1)/2;
+				}
+			}
+			else {
+				ans += c;
+				if (p.f == 0) ea[p] = c;
+				else if (f[ii(p.f-1, p.s-1)]) ea[p] += min(c, pr);
+				else {
+					if (pr < c) ans += c-pr;
+					ea[p] = c;
+				}
+			}
+		}
+		cout << ans << '\n';
+	}
+}
diff --git a/20.5/feb/plat/notime.cpp b/20.5/feb/plat/notime.cpp
new file mode 100644
index 0000000..48794bf
--- /dev/null
+++ b/20.5/feb/plat/notime.cpp
@@ -0,0 +1,64 @@
+#include <bits/stdc++.h>
+#define f first
+#define s second
+using namespace std;
+using ll = long long;
+using ii = pair<int, int>;
+constexpr int MX = 2e5+5, B = 300;
+
+int C[MX], L[MX], R[MX], ST[20][MX], ans[MX];
+pair<ii, int> P[MX];
+
+inline int query(int i, int j) {
+	if (i > j) return MX;
+	int k = 31-__builtin_clz(j-i+1);
+	return min(ST[k][i], ST[k][j-(1<<k)+1]);
+}
+
+int main() {
+	if (fopen("in", "r")) freopen("in", "r", stdin), freopen("out", "w", stdout);
+	cin.tie(0)->sync_with_stdio(0);
+	
+	int N, Q; cin >> N >> Q;
+	for (int i = 0; i < N; ++i) cin >> C[i];
+	for (int i = 0; i < Q; ++i) {
+		cin >> P[i].f.f >> P[i].f.s;
+		--P[i].f.f, --P[i].f.s, P[i].s = i;
+	}
+
+	vector<int> tmp(N+1, -1);
+	for (int i = 0; i < N; ++i) L[i] = tmp[C[i]], tmp[C[i]] = i;
+	fill(begin(tmp), end(tmp), -1);
+	for (int i = N-1; i >= 0; --i) R[i] = tmp[C[i]], tmp[C[i]] = i;
+	
+	memset(ST, '?', sizeof ST);
+	for (int i = 0; i < N; ++i) ST[0][i] = C[i];
+	for (int i = 0; i < 18; ++i)
+		for (int j = 0; j+(1<<(i+1)) < N; ++j) ST[i+1][j] = min(ST[i][j], ST[i][j+(1<<i)]);
+
+	sort(P, P+Q, [](auto a, auto b) {
+		return a.f.f/B == b.f.f/B ? ((a.f.f/B)%2 ? a.f.s > b.f.s : a.f.s < b.f.s) : a.f.f/B < b.f.f/B;
+	});
+	
+	int l = 0, r = -1, cur = 0;
+	for (int i = 0; i < Q; ++i) {
+		while (l > P[i].f.f) {
+			--l;
+			if (R[l] == -1 || R[l] > r || query(l+1, R[l]-1) < C[l]) ++cur;
+		}
+		while (r < P[i].f.s) {
+			++r;
+			if (L[r] == -1 || L[r] < l || query(L[r]+1, r-1) < C[r]) ++cur;
+		}
+		while (l < P[i].f.f) {
+			if (R[l] == -1 || R[l] > r || query(l+1, R[l]-1) < C[l]) --cur;
+			++l;
+		}
+		while (r > P[i].f.s) {
+			if (L[r] == -1 || L[r] < l || query(L[r]+1, r-1) < C[r]) --cur;
+			--r;
+		}
+		ans[P[i].s] = cur;
+	}
+	for (int i = 0; i < Q; ++i) cout << ans[i] << '\n';
+}