#208991 (C++14) No.576 E869120 and Rings

• 問題: No.576 E869120 and Rings
• ユーザー: e869120
• 提出日時: 2017-10-11 21:24:37
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 1,351 bytes
• コンパイル時間: 1,161 ms
• コンパイル使用メモリ: 74,064 KB
• 実行使用メモリ: 41,288 KB
• 最終ジャッジ日時: 2024-11-17 09:51:18
• 合計ジャッジ時間: 23,200 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1,089 ms; 40,392 KB
testcase_01	AC	1,149 ms; 40,008 KB
testcase_02	AC	1,131 ms; 40,136 KB
testcase_03	AC	1,102 ms; 40,136 KB
testcase_04	AC	1,092 ms; 40,264 KB
testcase_05	AC	1,113 ms; 40,260 KB
testcase_06	AC	1,091 ms; 40,136 KB
testcase_07	AC	1,108 ms; 40,004 KB
testcase_08	AC	819 ms; 40,132 KB
testcase_09	AC	825 ms; 40,260 KB
testcase_10	AC	837 ms; 40,260 KB
testcase_11	AC	818 ms; 40,260 KB
testcase_12	AC	808 ms; 40,264 KB
testcase_13	AC	859 ms; 41,284 KB
testcase_14	AC	802 ms; 41,288 KB
testcase_15	AC	771 ms; 41,032 KB
testcase_16	AC	811 ms; 41,160 KB
testcase_17	AC	812 ms; 41,160 KB
testcase_18	AC	807 ms; 40,136 KB
testcase_19	AC	841 ms; 40,264 KB
testcase_20	AC	806 ms; 40,128 KB
testcase_21	AC	821 ms; 40,136 KB
testcase_22	AC	3 ms; 7,628 KB
testcase_23	AC	3 ms; 7,880 KB
testcase_24	AC	2 ms; 7,756 KB
testcase_25	AC	3 ms; 7,628 KB
testcase_26	WA	-
testcase_27	AC	2 ms; 7,884 KB
testcase_28	AC	3 ms; 7,756 KB
testcase_29	AC	2 ms; 7,760 KB

ソースコード

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;

#pragma warning(disable: 4996)

/*string ID = "01";

FILE *in = freopen(("./in" + ID + ".txt").c_str(), "r", stdin);
FILE *out = freopen(("./out" + ID + ".txt").c_str(), "w", stdout);*/

int n, m; double c[500009], d[500009], deq[1000009];

vector<double> slide_max(vector<double>&x, int r) {
	vector<double> F; int s = 0, t = 0;
	for (int i = 0; i < x.size(); i++)deq[i] = 0;
	for (int i = 0; i < x.size(); i++) {
		while (s < t && x[deq[t - 1]] <= x[i]) t--;
		deq[t++] = i;
		if (i - r + 1 >= 0) {
			F.emplace_back(x[deq[s]]);
			if (deq[s] == i - r + 1) s++;
		}
	}
	return F;
}

bool solve(double p) {
	for (int i = 0; i < n; i++) d[i] = c[i] - p;
	for (int i = 1; i < n; i++) d[i] += d[i - 1];

	vector<double>V;
	for (int i = 0; i < n * 2; i++) { V.push_back(d[i%n] + d[n - 1] * (i / n)); }
	vector<double>W = slide_max(V, n - m);
	for (int i = 0; i < n; i++) { if (W[i + m] >= d[i])return true; }
	return false;
}

int main() {
	cin >> n >> m;
	string S; cin >> S;
	for (int i = 0; i < n; i++) {
		char e = S[i];
		if (e == '0')c[i] = 0.0;
		if (e == '1')c[i] = 1.0;
	}
	double L = 0, R = 1, M;
	for (int i = 0; i < 30; i++) {
		M = (L + R) / 2.0;
		bool I = solve(M);
		if (I == true)L = M; else R = M;
	}
	printf("%.12lf\n", M);
	return 0;
}