problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02780 | C++ | Time Limit Exceeded | #include <cstdio>
#include <string.h>
#include <vector>
int main() {
int K, N;
scanf("%d %d", &N, &K);
std::vector<double> data(N);
for (int i = 0; i < N; ++i) {
int d;
scanf("%d", &d);
data[i] = d;
// 期待値 = ((d + 1) / 2);
data[i] = (data[i] + 1.0) / 2.0;
}
double max = 0.0f;
for (int i = 0; i < (N - K + 1); ++i) {
double sum = 0.0;
for (int j = 0; j < K; ++j) {
sum += data[j + i];
}
if (max < sum) {
max = sum;
}
}
printf("%f\n", (float)max);
}
| #include <cstdio>
#include <string.h>
#include <vector>
int main() {
int K, N;
scanf("%d %d", &N, &K);
std::vector<double> data(N);
for (int i = 0; i < N; ++i) {
int d;
scanf("%d", &d);
data[i] = d;
// 期待値 = ((d + 1) / 2);
data[i] = (data[i] + 1.0) / 2.0;
}
double current = 0.0;
int i = 0;
// K まで進む
for (; i < K; ++i) {
current += data[i];
}
double max = current;
// 最初を減らして、最後を追加し、比較する
for (; i < N; ++i) {
current -= data[i - K];
current += data[i];
if (max < current) {
max = current;
}
}
printf("%f\n", (float)max);
}
| replace | 19 | 27 | 19 | 34 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
int N;
int K;
double sum = 0;
double peropero = 0;
scanf("%d %d", &N, &K);
int a[N];
for (int i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < N - K + 1; i++) {
sum = 0;
for (int j = 0; j < K; j++) {
sum = sum + a[i + j];
}
if (sum > peropero) {
peropero = sum;
}
}
peropero = peropero / 2 + 0.5 * K;
printf("%lf", peropero);
} | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
int N;
int K;
double sum = 0;
double peropero = 0;
scanf("%d %d", &N, &K);
int a[N];
for (int i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < K; i++) {
sum = sum + a[i];
}
peropero = sum;
for (int i = 0; i < N - K; i++) {
sum = sum - a[i] + a[i + K];
if (sum > peropero) {
peropero = sum;
}
}
peropero = peropero / 2 + 0.5 * K;
printf("%lf", peropero);
}
| replace | 15 | 20 | 15 | 21 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <cassert>
#include <cstdio>
#include <set>
#include <vector>
#include <algorithm>
#include <climits>
#include <deque>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#include <utility>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const int INF = 1e9;
const long long LINF = 1e18;
double expectedValue(int n) { return (1 + n) / 2.0; }
int main() {
int N, K;
cin >> N >> K;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
double ans = 0.0;
for (int i = 0; i < N - K + 1; i++) {
double sum = 0.0;
for (int j = 0; j < K; j++) {
sum += expectedValue(p[j + i]);
}
ans = max(ans, sum);
}
// cout << ans << endl;
printf("%.12f\n", ans);
return 0;
}
| #include <cassert>
#include <cstdio>
#include <set>
#include <vector>
#include <algorithm>
#include <climits>
#include <deque>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#include <utility>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const int INF = 1e9;
const long long LINF = 1e18;
double expectedValue(int n) { return (1 + n) / 2.0; }
int main() {
int N, K;
cin >> N >> K;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
double sum = 0.0;
for (int i = 0; i < K; i++) {
sum += expectedValue(p[i]);
}
double ans = sum;
for (int i = 1; i < N - K + 1; i++) {
sum -= expectedValue(p[i - 1]);
sum += expectedValue(p[i + K - 1]);
ans = max(ans, sum);
}
// cout << ans << endl;
printf("%.12f\n", ans);
return 0;
}
| replace | 45 | 51 | 45 | 53 | TLE | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1000000007;
int p[300000];
double sum[300000];
int main() {
int n, K;
cin >> n >> K;
rep(i, n) {
scanf("%d", &p[i]);
sum[i] = (1 + p[i]) * p[i] / 2 / (double)p[i];
if (i)
sum[i] += sum[i - 1];
}
double Max = 0;
rep(i, n) {
if (i == K - 1)
Max = max(Max, sum[i]);
else
Max = max(Max, sum[i] - sum[i - K]);
}
printf("%.12lf\n", Max);
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1000000007;
int p[300000];
double sum[300000];
int main() {
int n, K;
cin >> n >> K;
rep(i, n) {
scanf("%d", &p[i]);
sum[i] = (1 + p[i]) * p[i] / 2 / (double)p[i];
if (i)
sum[i] += sum[i - 1];
}
double Max = 0;
rep(i, n) {
if (i == K - 1)
Max = max(Max, sum[i]);
else if (i >= K)
Max = max(Max, sum[i] - sum[i - K]);
}
printf("%.12lf\n", Max);
} | replace | 26 | 27 | 26 | 27 | 0 | |
p02780 | C++ | Time Limit Exceeded | /* 特徴 */
/* 教訓 */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF = 1e9 + 7;
const ll LINF = 9223372036854775807;
const ll MOD = 1e9 + 7;
const ld PI = acos(-1);
const ld EPS = 1e-9; // 微調整用（EPSより小さいと0と判定など）
// MODINT
// 変数名.nでint型の数値を受け取る
struct mint {
int n;
mint(int n_ = 0) : n(n_) {}
};
mint operator+(mint a, mint b) {
a.n += b.n;
if (a.n >= MOD)
a.n -= MOD;
return a;
}
mint operator-(mint a, mint b) {
a.n -= b.n;
if (a.n < 0)
a.n += MOD;
return a;
}
mint operator*(mint a, mint b) { return (long long)a.n * b.n % MOD; }
mint &operator+=(mint &a, mint b) { return a = a + b; }
mint &operator-=(mint &a, mint b) { return a = a - b; }
mint &operator*=(mint &a, mint b) { return a = a * b; }
int ii() {
int x;
scanf("%d", &x);
return x;
}
long long il() {
long long x;
scanf("%lld", &x);
return x;
}
string is() {
string x;
cin >> x;
return x;
}
char ic() {
char x;
cin >> x;
return x;
}
void oi(int x) { printf("%d ", x); }
void ol(long long x) { printf("%lld ", x); }
void od_nosp(double x) { printf("%.15f", x); } // 古い問題用
void od(double x) { printf("%.15f ", x); }
// long doubleで受け取り、fをLfなどに変えて出力すると、変な数値が出る
// それをなんとかするには独自の出力を作らなければならなそう
void os(const string &s) { printf("%s ", s.c_str()); }
void oc(const char &c) { printf("%c ", c); }
// GCC9.2.1に変わって動かなくなったので一旦消した そのうち原因を調べる
// auto op = [&](auto p) -> void{ cout << p; };
// auto ov = [&](auto vec) -> void{ cout << vec; };
#define o_map(v) \
{ \
cerr << #v << endl; \
for (const auto &xxx : v) { \
cout << xxx.first << " " << xxx.second << "\n"; \
} \
} // 動作未確認
void br() { putchar('\n'); }
#define gcd __gcd // llは受け取ってくれない
int lcm(int a, int b) { return a / gcd(a, b) * b; }
#define ALL(a) a.begin(), a.end() // sort(ALL(vec));
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define MP(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define PB push_back
#define SZ(x) ((int)(x).size) // size()がunsignedなのでエラー避けに
// 4近傍（上下左右） rep(i, 2) にすると右・下だけに進む
vector<int> dx_4 = {1, 0, -1, 0};
vector<int> dy_4 = {0, 1, 0, -1};
// coutによるpairの出力（空白区切り）
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << " " << p.second << ")";
}
// 空白区切りだけ --> return s << "(" << p.first << " " << p.second << ")";
// 見やすくしたいとき --> return s << "(" << p.first << " " << p.second << ")";
// coutによるvectorの出力（空白区切り）
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << " "; //"\t"に変えるとTabで見やすく区切る
}
return s;
}
// coutによる多次元vectorの出力（空白区切り）
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
// 最大値、最小値を更新する。aよりbのが大きい（小さい）か等しければaを更新してtrueを返す。そうでなければ何もせずfalseを返す
// chmax(nowmax,x);
template <typename T> bool chmax(T &a, T b) { return (a = max(a, b)) == b; }
template <typename T> bool chmin(T &a, T b) { return (a = min(a, b)) == b; }
// -------- template end - //
// - library ------------- //
// --------- library end - //
// - main() -------------- //
int main() {
ll n, k;
cin >> n >> k;
vector<ll> ps;
rep(i, n) { ps.push_back(il()); }
ld ans = 0;
ld sum = 0;
REP(i, 0, n - 1 - (k - 1) + 1) {
sum = 0;
rep(j, k) { sum += (ld)(1 + ps[i + j]) / 2; }
chmax(ans, sum);
}
od(ans);
// ---------- main() end - //
} | /* 特徴 */
/* 教訓 */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF = 1e9 + 7;
const ll LINF = 9223372036854775807;
const ll MOD = 1e9 + 7;
const ld PI = acos(-1);
const ld EPS = 1e-9; // 微調整用（EPSより小さいと0と判定など）
// MODINT
// 変数名.nでint型の数値を受け取る
struct mint {
int n;
mint(int n_ = 0) : n(n_) {}
};
mint operator+(mint a, mint b) {
a.n += b.n;
if (a.n >= MOD)
a.n -= MOD;
return a;
}
mint operator-(mint a, mint b) {
a.n -= b.n;
if (a.n < 0)
a.n += MOD;
return a;
}
mint operator*(mint a, mint b) { return (long long)a.n * b.n % MOD; }
mint &operator+=(mint &a, mint b) { return a = a + b; }
mint &operator-=(mint &a, mint b) { return a = a - b; }
mint &operator*=(mint &a, mint b) { return a = a * b; }
int ii() {
int x;
scanf("%d", &x);
return x;
}
long long il() {
long long x;
scanf("%lld", &x);
return x;
}
string is() {
string x;
cin >> x;
return x;
}
char ic() {
char x;
cin >> x;
return x;
}
void oi(int x) { printf("%d ", x); }
void ol(long long x) { printf("%lld ", x); }
void od_nosp(double x) { printf("%.15f", x); } // 古い問題用
void od(double x) { printf("%.15f ", x); }
// long doubleで受け取り、fをLfなどに変えて出力すると、変な数値が出る
// それをなんとかするには独自の出力を作らなければならなそう
void os(const string &s) { printf("%s ", s.c_str()); }
void oc(const char &c) { printf("%c ", c); }
// GCC9.2.1に変わって動かなくなったので一旦消した そのうち原因を調べる
// auto op = [&](auto p) -> void{ cout << p; };
// auto ov = [&](auto vec) -> void{ cout << vec; };
#define o_map(v) \
{ \
cerr << #v << endl; \
for (const auto &xxx : v) { \
cout << xxx.first << " " << xxx.second << "\n"; \
} \
} // 動作未確認
void br() { putchar('\n'); }
#define gcd __gcd // llは受け取ってくれない
int lcm(int a, int b) { return a / gcd(a, b) * b; }
#define ALL(a) a.begin(), a.end() // sort(ALL(vec));
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define MP(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define PB push_back
#define SZ(x) ((int)(x).size) // size()がunsignedなのでエラー避けに
// 4近傍（上下左右） rep(i, 2) にすると右・下だけに進む
vector<int> dx_4 = {1, 0, -1, 0};
vector<int> dy_4 = {0, 1, 0, -1};
// coutによるpairの出力（空白区切り）
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << " " << p.second << ")";
}
// 空白区切りだけ --> return s << "(" << p.first << " " << p.second << ")";
// 見やすくしたいとき --> return s << "(" << p.first << " " << p.second << ")";
// coutによるvectorの出力（空白区切り）
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << " "; //"\t"に変えるとTabで見やすく区切る
}
return s;
}
// coutによる多次元vectorの出力（空白区切り）
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
// 最大値、最小値を更新する。aよりbのが大きい（小さい）か等しければaを更新してtrueを返す。そうでなければ何もせずfalseを返す
// chmax(nowmax,x);
template <typename T> bool chmax(T &a, T b) { return (a = max(a, b)) == b; }
template <typename T> bool chmin(T &a, T b) { return (a = min(a, b)) == b; }
// -------- template end - //
// - library ------------- //
// --------- library end - //
// - main() -------------- //
int main() {
ll n, k;
cin >> n >> k;
vector<ll> ps;
rep(i, n) { ps.push_back(il()); }
ld ans = 0;
ld sum = 0;
// 1つ目（これは確実にある）
rep(j, k) { sum += (ld)(1 + ps[j]) / 2; }
chmax(ans, sum);
// 2つ目以降（無い場合もある）
REP(i, 0, n - 1 - (k - 1)) {
sum -= (ld)(1 + ps[i]) / 2;
sum += (ld)(1 + ps[i + k]) / 2;
chmax(ans, sum);
}
od(ans);
// ---------- main() end - //
} | replace | 148 | 151 | 148 | 156 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define ii pair<ll, ll>
#define vi vector<ll>
#define vii vector<ii>
#define vs vector<string>
#define si set<ll>
#define endl "\n"
#define pb push_back
#define x first
#define y second
// g++ -std=c++11 -Wall -Wextra -pedantic-errors main.cpp -o main
const int ms = 1e3 + 5, base = 31, mod = 1e9 + 7;
using namespace std;
double P[ms];
void sieve() {
double sum = 0;
for (int i = 1; i < ms; i++) {
sum += i;
P[i] = sum / i;
}
}
int main() {
ios::sync_with_stdio(false), cin.tie(0);
sieve();
int n, k;
cin >> n >> k;
vi arr;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
arr.pb(a);
}
double ans = 0;
for (int i = 0; i < n - k + 1; i++) {
double temp = 0;
for (int j = 0; j < k; j++) {
// cout << arr[i+j] << " \n"[j==k-1];
temp += P[arr[i + j]];
}
ans = max(ans, temp);
}
cout << setprecision(10) << fixed << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ii pair<ll, ll>
#define vi vector<ll>
#define vii vector<ii>
#define vs vector<string>
#define si set<ll>
#define endl "\n"
#define pb push_back
#define x first
#define y second
// g++ -std=c++11 -Wall -Wextra -pedantic-errors main.cpp -o main
const int ms = 1e3 + 5, base = 31, mod = 1e9 + 7;
using namespace std;
double P[ms];
void sieve() {
double sum = 0;
for (int i = 1; i < ms; i++) {
sum += i;
P[i] = sum / i;
}
}
int main() {
ios::sync_with_stdio(false), cin.tie(0);
sieve();
int n, k;
cin >> n >> k;
vi arr;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
arr.pb(a);
}
double ans = 0;
double temp = 0;
for (int j = 0; j < k; j++) {
temp += P[arr[j]];
}
ans = temp;
for (int i = k; i < n; i++) {
temp -= P[arr[i - k]];
temp += P[arr[i]];
ans = max(ans, temp);
}
cout << setprecision(10) << fixed << ans << endl;
return 0;
} | replace | 42 | 48 | 42 | 51 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, cc, n) for (int i = cc; i <= n; ++i)
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<double> V(N);
rep(i, 0, N - 1) {
int p;
cin >> p;
V[i] = (p + 1) / 2.0;
}
double ans = 0;
for (int i = 0; i + K <= N; i++) {
double sum = 0;
for (int j = i; j < i + K; j++) {
sum += V[j];
}
ans = max(ans, sum);
}
printf("%.10f\n", ans);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, cc, n) for (int i = cc; i <= n; ++i)
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<double> V(N);
rep(i, 0, N - 1) {
int p;
cin >> p;
V[i] = (p + 1) / 2.0;
}
double sum = 0;
rep(i, 0, K - 1) sum += V[i];
double ans = sum;
for (int i = 1; i + K <= N; i++) {
sum -= V[i - 1];
sum += V[i + K - 1];
ans = max(ans, sum);
}
printf("%.10f\n", ans);
return 0;
}
| replace | 14 | 20 | 14 | 20 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// 型に気を付けよう
#define s(all) s.begin(), s.end()
#define rep(i, n) for (long long i = 0; i < n; i++)
#define ll long long
int main() {
double ans = 0;
double x = -1;
double sum = 0;
ll n = 0;
double k = 0;
cin >> n >> k;
vector<int> p(n);
rep(i, n) cin >> p[i];
for (int j = 0; j < (n - k + 1); j++) {
sum = 0;
for (int l = 0; l < k; l++) {
sum += p[j + l];
}
cerr << "sum at " << j + 1 << ":" << sum << endl;
x = max(x, sum);
}
ans = (x / 2) + (k / 2);
cout << fixed << setprecision(15) << ans;
} | #include <bits/stdc++.h>
using namespace std;
// 型に気を付けよう
#define s(all) s.begin(), s.end()
#define rep(i, n) for (long long i = 0; i < n; i++)
#define ll long long
int main() {
double ans = 0;
double x = -1;
double sum = 0;
ll n = 0;
double k = 0;
cin >> n >> k;
vector<int> p(n);
rep(i, n) cin >> p[i];
rep(l, k) sum += p[l];
cerr << "sum at " << 1 << ":" << sum << endl;
x = sum;
for (int j = 0; j < (n - k); j++) {
sum -= p[j];
sum += p[j + k];
cerr << "sum at " << j + 2 << ":" << sum << endl;
x = max(x, sum);
}
ans = (x / 2) + (k / 2);
cout << fixed << setprecision(15) << ans;
} | replace | 16 | 22 | 16 | 23 | TLE | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ << ": " << #x << " = " << (x) << '\n')
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int maxn = 110000;
int main() {
// 检查有没有特判0,有没有越界限.
ios::sync_with_stdio(false);
cin.tie(0);
cout << setiosflags(ios::fixed) << setprecision(12);
int n, k;
vector<double> p(n + 1);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
double x;
cin >> x;
double cur = (x + 1) * x * 1.0 / (2 * x);
// DBG(cur);
p[i] = cur;
}
double ans = 0;
for (int i = 1; i <= n; i++) {
p[i] += p[i - 1];
// DBG(p[i]);
}
p[0] = 0;
for (int i = k; i <= n; i++) {
ans = max(ans, p[i] - p[i - k]);
// DBG(ans);
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ << ": " << #x << " = " << (x) << '\n')
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int maxn = 110000;
int main() {
// 检查有没有特判0,有没有越界限.
ios::sync_with_stdio(false);
cin.tie(0);
cout << setiosflags(ios::fixed) << setprecision(12);
int n, k;
vector<double> p(n + 1);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
double x;
cin >> x;
double cur = (x + 1) * x * 1.0 / (2 * x);
// DBG(cur);
p[i] = cur;
}
double ans = 0;
for (int i = 2; i <= n; i++) {
p[i] += p[i - 1];
// DBG(p[i]);
}
p[0] = 0;
for (int i = k; i <= n; i++) {
ans = max(ans, p[i] - p[i - k]);
// DBG(ans);
}
cout << ans << "\n";
return 0;
} | replace | 24 | 25 | 24 | 25 | 0 | |
p02780 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
#define endl "\n"
using namespace std;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b)
// { a = b; return 1; } return 0; }
template <class T> inline bool chmin(T a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
typedef long long int ll;
#define INF 2000000000
int main() {
int n, k;
cin >> n >> k;
int tindex, num;
double tmax, tmp;
double d;
vector<double> p(n);
vector<double> a(n + 1, 0);
for (int i = 0; i < n; i++) {
cin >> p[i];
p[i] = (p[i] + 1) / 2;
a[i + 1] = a[i] + p[i];
}
tmp = 0;
for (int i = 0; i < k; i++) {
// if(a[i+k]-a[i] > tmp){
tmp = std::max(a[i + k] - a[i], tmp);
// tmax = tmp;
//}
// if(tmax > tmp) d = accumulate(a.begin()+i,a.begin()+i+k,0);
}
cout << setprecision(10) << tmp << endl;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
#define endl "\n"
using namespace std;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b)
// { a = b; return 1; } return 0; }
template <class T> inline bool chmin(T a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
typedef long long int ll;
#define INF 2000000000
int main() {
int n, k;
cin >> n >> k;
int tindex, num;
double tmax, tmp;
double d;
vector<double> p(n);
vector<double> a(n + 1, 0);
for (int i = 0; i < n; i++) {
cin >> p[i];
p[i] = (p[i] + 1) / 2;
a[i + 1] = a[i] + p[i];
}
tmp = 0;
for (int i = 0; i < a.size() - k; i++) {
// if(a[i+k]-a[i] > tmp){
tmp = std::max(a[i + k] - a[i], tmp);
// tmax = tmp;
//}
// if(tmax > tmp) d = accumulate(a.begin()+i,a.begin()+i+k,0);
}
cout << setprecision(10) << tmp << endl;
}
| replace | 47 | 48 | 47 | 48 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<double> vec(n);
for (auto &e : vec) {
cin >> e;
}
vector<int> dp(n);
int sum = -1;
int index = 0;
for (int i = 0; i <= n - k; i++) {
for (int j = i; j < i + k; j++) {
dp.at(i) += vec.at(j);
}
if (sum < dp.at(i)) {
sum = dp.at(i);
index = i;
}
}
double exp = 0;
for (int i = index; i < index + k; i++) {
exp += (vec.at(i) + 1) / 2;
}
cout << fixed << setprecision(10);
cout << exp << endl;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<double> vec(n);
for (auto &e : vec) {
cin >> e;
}
vector<int> dp(n);
int sum = -1;
int index = 0;
for (int i = 0; i < k; i++) {
dp.at(0) += vec.at(i);
}
for (int i = 1; i <= n - k; i++) {
dp.at(i) = dp.at(i - 1) + vec.at(i + (k - 1)) - vec.at(i - 1);
if (sum < dp.at(i)) {
sum = dp.at(i);
index = i;
}
}
double exp = 0;
for (int i = index; i < index + k; i++) {
exp += (vec.at(i) + 1) / 2;
}
cout << fixed << setprecision(10);
cout << exp << endl;
} | replace | 15 | 19 | 15 | 22 | TLE | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
double func(int x) {
double ret = 0;
for (int i = 1; i <= x; i++) {
ret += i;
}
return ret / x;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n);
vector<double> s(n + 1, 0);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i <= n; i++) {
s[i + 1] = s[i] + func(p[i]);
}
double ans = 0;
int right = 0;
for (int left = 0; left < n; left++) {
while (right < n && (right + 1 - left <= k)) {
++right;
}
ans = max(ans, s[right] - s[left]);
}
cout << fixed << setprecision(10) << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
double func(int x) {
double ret = 0;
for (int i = 1; i <= x; i++) {
ret += i;
}
return ret / x;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n);
vector<double> s(n + 1, 0);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
s[i + 1] = s[i] + func(p[i]);
}
double ans = 0;
int right = 0;
for (int left = 0; left < n; left++) {
while (right < n && (right + 1 - left <= k)) {
++right;
}
ans = max(ans, s[right] - s[left]);
}
cout << fixed << setprecision(10) << ans << endl;
return 0;
} | replace | 21 | 22 | 21 | 22 | 0 | |
p02780 | C++ | Runtime Error | /*input
4 1
6 6 6 6
*/
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
// order_of_key #of elements less than x
// find_by_order kth element
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define f first
#define s second
#define pb push_back
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define FILL(n, x) memset(n, x, sizeof(n))
#define ALL(_a) _a.begin(), _a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
const ll INF64 = 4e18;
const int INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const ld PI = acos(-1);
const ld eps = 1e-9;
#define lowb(x) x & (-x)
#define MNTO(x, y) x = min(x, (__typeof__(x))y)
#define MXTO(x, y) x = max(x, (__typeof__(x))y)
ll sub(ll a, ll b) {
ll x = a - b;
while (x < 0)
x += MOD;
while (x > MOD)
x -= MOD;
return x;
}
ll mult(ll a, ll b) { return a * b % MOD; }
ll mypow(ll a, ll b) {
if (b <= 0)
return 1;
ll res = 1LL;
while (b) {
if (b & 1)
res = (res * a) % MOD;
a = (a * a) % MOD;
b >>= 1;
}
return res;
}
const int maxn = 1e5 + 5;
double arr[maxn];
int main() {
int n, k;
cin >> n >> k;
REP(i, n) {
double p;
cin >> p;
arr[i] = ((p * (p + 1)) / 2) / p;
}
double ans = 0, cur = 0;
REP(i, k) cur += arr[i];
MXTO(ans, cur);
REP(i, n - k) {
cur -= arr[i];
cur += arr[i + k];
MXTO(ans, cur);
}
cout << fixed << setprecision(6) << ans;
} | /*input
4 1
6 6 6 6
*/
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
// order_of_key #of elements less than x
// find_by_order kth element
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define f first
#define s second
#define pb push_back
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define FILL(n, x) memset(n, x, sizeof(n))
#define ALL(_a) _a.begin(), _a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
const ll INF64 = 4e18;
const int INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const ld PI = acos(-1);
const ld eps = 1e-9;
#define lowb(x) x & (-x)
#define MNTO(x, y) x = min(x, (__typeof__(x))y)
#define MXTO(x, y) x = max(x, (__typeof__(x))y)
ll sub(ll a, ll b) {
ll x = a - b;
while (x < 0)
x += MOD;
while (x > MOD)
x -= MOD;
return x;
}
ll mult(ll a, ll b) { return a * b % MOD; }
ll mypow(ll a, ll b) {
if (b <= 0)
return 1;
ll res = 1LL;
while (b) {
if (b & 1)
res = (res * a) % MOD;
a = (a * a) % MOD;
b >>= 1;
}
return res;
}
const int maxn = 2e5 + 5;
double arr[maxn];
int main() {
int n, k;
cin >> n >> k;
REP(i, n) {
double p;
cin >> p;
arr[i] = ((p * (p + 1)) / 2) / p;
}
double ans = 0, cur = 0;
REP(i, k) cur += arr[i];
MXTO(ans, cur);
REP(i, n - k) {
cur -= arr[i];
cur += arr[i + k];
MXTO(ans, cur);
}
cout << fixed << setprecision(6) << ans;
}
| replace | 58 | 59 | 58 | 59 | 0 | |
p02780 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
using int64 = long long int;
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chadd(T &a, T b) { a = a + b; }
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;
int main() {
int N, K;
cin >> N >> K;
vector<double> P(N);
for (int i = 0; i < N; i++) {
int v;
cin >> v;
P[i + 1] = v * (v + 1) / 2.0 / v;
P[i + 1] += P[i];
}
double ans = 0;
for (int i = 0; i + K <= N; i++) {
double S = P[i + K] - P[i];
chmax(ans, S);
}
printf("%.12f\n", ans);
return 0;
}
| // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
using int64 = long long int;
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chadd(T &a, T b) { a = a + b; }
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;
int main() {
int N, K;
cin >> N >> K;
vector<double> P(N + 1);
for (int i = 0; i < N; i++) {
int v;
cin >> v;
P[i + 1] = v * (v + 1) / 2.0 / v;
P[i + 1] += P[i];
}
double ans = 0;
for (int i = 0; i + K <= N; i++) {
double S = P[i + K] - P[i];
chmax(ans, S);
}
printf("%.12f\n", ans);
return 0;
}
| replace | 43 | 44 | 43 | 44 | -6 | malloc(): corrupted top size
|
p02780 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> tup;
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
COMinit();
ll N, K;
cin >> N >> K;
vector<ll> p(N);
vector<double> d(N, 0);
for (int i = 0; i < N; i++) {
cin >> p[i];
if (i != 0)
d[i] = d[i - 1] + (1.0 + p[i]) / 2;
else
d[i] = (1.0 + p[i]) / 2;
}
double maxv = 0;
for (int i = 0; i < N; i++) {
if (i != 0)
maxv = max(maxv, d[i + K - 1] - d[i - 1]);
else
maxv = max(maxv, d[i + K - 1]);
}
cout << fixed << setprecision(10) << maxv << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> tup;
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
COMinit();
ll N, K;
cin >> N >> K;
vector<ll> p(N);
vector<double> d(N, 0);
for (int i = 0; i < N; i++) {
cin >> p[i];
if (i != 0)
d[i] = d[i - 1] + (1.0 + p[i]) / 2;
else
d[i] = (1.0 + p[i]) / 2;
}
double maxv = 0;
for (int i = 0; i + K - 1 < N; i++) {
if (i != 0)
maxv = max(maxv, d[i + K - 1] - d[i - 1]);
else
maxv = max(maxv, d[i + K - 1]);
}
cout << fixed << setprecision(10) << maxv << endl;
return 0;
}
| replace | 58 | 59 | 58 | 59 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
vector<double> P(N);
vector<double> PD(N);
rep(i, 0, N) {
cin >> P[i];
PD[i] = (((1 + P[i]) * P[i]) / 2) / P[i];
}
double ans = 0;
rep(i, 0, N - K + 1) {
double tmp = 0;
ll n = i + K;
rep(j, i, n) { tmp += PD[j]; }
if (tmp > ans) {
ans = tmp;
}
}
printf("%.12f", ans);
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
vector<double> P(N);
vector<double> PD(N);
rep(i, 0, N) {
cin >> P[i];
PD[i] = (((1 + P[i]) * P[i]) / 2) / P[i];
}
double ans = 0;
ll index = 0;
double tmp = 0;
rep(i, 0, N) {
if (i >= K) {
tmp -= PD[index];
index++;
}
tmp += PD[i];
if (tmp > ans) {
ans = tmp;
}
}
printf("%.12f", ans);
return 0;
}
| replace | 18 | 22 | 18 | 26 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 200000;
int n, k;
double p[MAX_N];
double e[MAX_N];
void solve() {
for (int i = 0; i < n; i++) {
e[i] = (p[i] + 1) / 2;
}
double s[n];
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
s[i] += e[j];
}
}
double ans[n - k + 1];
double max = ans[0] = s[k - 1];
for (int i = 1; i < n - k + 1; i++) {
ans[i] = s[i + k - 1] - s[i - 1];
if (ans[i] > max) {
max = ans[i];
}
}
printf("%.10f\n", max);
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
solve();
} | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 200000;
int n, k;
double p[MAX_N];
double e[MAX_N];
void solve() {
for (int i = 0; i < n; i++) {
e[i] = (p[i] + 1) / 2;
}
double s[n];
s[0] = e[0];
for (int i = 1; i < n; i++) {
s[i] = s[i - 1] + e[i];
}
double ans[n - k + 1];
double max = ans[0] = s[k - 1];
for (int i = 1; i < n - k + 1; i++) {
ans[i] = s[i + k - 1] - s[i - 1];
if (ans[i] > max) {
max = ans[i];
}
}
printf("%.10f\n", max);
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
solve();
} | replace | 14 | 18 | 14 | 17 | TLE | |
p02780 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define USE_LLONG_AS_INT
#ifdef USE_LLONG_AS_INT
#define int long long
#define inf (1ll << 60)
#else
#define inf (1 << 30)
#endif
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Rep(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, a, b) for (int i = (a); i <= (b); i++)
#define rev(i, n) for (int i = (n)-1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define eb emplace_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define MEMSET(a) memset(a, 0, sizeof(a))
#define Yes(f) cout << (f ? "Yes" : "No") << endl
#define yes(f) cout << (f ? "yes" : "no") << endl
#define YES(f) cout << (f ? "YES" : "NO") << endl
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
using namespace std;
const int mod = 1e9 + 7;
const string sp = " ";
void run();
void init() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(12);
}
signed main() {
init();
run();
return 0;
}
double f(double n) { return n * (n + 1) / 2 / n; }
void run() {
int n, k;
cin >> n >> k;
vector<double> p(n + 1);
REP(i, 1, n) {
cin >> p[i];
p[i] = f(p[i]);
}
rep(i, n) p[i + 1] += p[i];
double ans = 0;
rep(i, n) { ans = max(ans, p[i + k] - p[i]); }
cout << ans << endl;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define USE_LLONG_AS_INT
#ifdef USE_LLONG_AS_INT
#define int long long
#define inf (1ll << 60)
#else
#define inf (1 << 30)
#endif
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Rep(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, a, b) for (int i = (a); i <= (b); i++)
#define rev(i, n) for (int i = (n)-1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define eb emplace_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define MEMSET(a) memset(a, 0, sizeof(a))
#define Yes(f) cout << (f ? "Yes" : "No") << endl
#define yes(f) cout << (f ? "yes" : "no") << endl
#define YES(f) cout << (f ? "YES" : "NO") << endl
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
using namespace std;
const int mod = 1e9 + 7;
const string sp = " ";
void run();
void init() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(12);
}
signed main() {
init();
run();
return 0;
}
double f(double n) { return n * (n + 1) / 2 / n; }
void run() {
int n, k;
cin >> n >> k;
vector<double> p(n + 1);
REP(i, 1, n) {
cin >> p[i];
p[i] = f(p[i]);
}
rep(i, n) p[i + 1] += p[i];
double ans = 0;
rep(i, n - k + 1) { ans = max(ans, p[i + k] - p[i]); }
cout << ans << endl;
} | replace | 61 | 62 | 61 | 62 | 0 | |
p02780 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i < (ll)b; ++i)
#define digit(a) to_string(a).size()
#define INF 10e12
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
const long long MOD = 1e9 + 7;
int main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vector<int> p(n);
rep(i, 0, n) cin >> p[i];
vector<double> cusum(n + 1, 0);
rep(i, 0, n + 1) cusum[i + 1] = cusum[i] + (p[i] + 1) / (double)2;
double ans = 0;
rep(i, 0, n - k + 1) ans = max(ans, cusum[i + k] - cusum[i]);
cout << fixed << setprecision(15);
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i < (ll)b; ++i)
#define digit(a) to_string(a).size()
#define INF 10e12
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
const long long MOD = 1e9 + 7;
int main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vector<int> p(n);
rep(i, 0, n) cin >> p[i];
vector<double> cusum(n + 1, 0);
rep(i, 0, n) cusum[i + 1] = cusum[i] + (p[i] + 1) / (double)2;
double ans = 0;
rep(i, 0, n - k + 1) ans = max(ans, cusum[i + k] - cusum[i]);
cout << fixed << setprecision(15);
cout << ans << endl;
} | replace | 43 | 44 | 43 | 44 | 0 | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ll long long
#define ull unsigned long long
#define F first
#define S second
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
int p[200010];
int main(void) {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
int n, k;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &p[i + 1]);
p[i + 1] += p[i];
}
int ans = 0;
for (int i = k; i <= n; i++)
ans = max(ans, p[i] - p[i - k]);
cout << fixed << setprecision(9) << (double)(ans + k) * 0.5 << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ll long long
#define ull unsigned long long
#define F first
#define S second
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
int p[200010];
int main(void) {
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
int n, k;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &p[i + 1]);
p[i + 1] += p[i];
}
int ans = 0;
for (int i = k; i <= n; i++)
ans = max(ans, p[i] - p[i - k]);
cout << fixed << setprecision(9) << (double)(ans + k) * 0.5 << '\n';
return 0;
}
| replace | 57 | 58 | 57 | 58 | -11 | |
p02780 | C++ | Time Limit Exceeded |
/*
@・ω・@ <だれだろうね
*/
/*****/
#include <algorithm>
#include <array>
#include <cmath>
#include <iomanip> //cout << fixed << setprecision(桁数);
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdexcept>
#include <string>
#include <vector>
// #define int long long
using namespace std;
using ll = long long;
using ld = long double;
using vecll = vector<long long>;
using pll = pair<long long, long long>;
template <class T> using pr = pair<T, T>;
template <class T> using vec = vector<T>;
template <class T> using grid = vector<vector<T>>;
#define debug(x) (std::cerr << (x) << "\n")
#define debug_tab(n, x) (std::cerr << strMulti("\t", n) << (x) << "\n")
#define debug_cout(x) (std::cerr << #x << " : " << (x) << "\n")
#define debug_tabcout(n, x) \
(std::cerr << strMulti("\t", n) << #x << " : " << (x) << "\n")
#define debug_headcout(h, x) (std::cerr << h << " : " << (x) << "\n")
#define debug_tabheadcout(n, h, x) \
(std::cerr << strMulti("\t", n) << h << " : " << (x) << "\n")
#define str(n) (n.toString())
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define rrep1(i, n) for (ll i = (n); i > 0; --i)
#define all(x) (x).begin(), (x).end()
#define pair(a, b) make_pair(a, b)
constexpr int INF = 2000000100;
constexpr ll MOD = 1000000007; // 10e9+7
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> T divup(T a, T b) {
if (a % b == 0) {
return a / b;
}
return a / b + 1;
}
std::string strMulti(std::string t, int n) {
std::string out = "";
for (int i = 0; i < n; i++) {
out += t;
}
return out;
}
template <class T> T math_P(T m, T n) {
T ret = 1;
for (T i = m; i > m - n; i--) {
ret *= i;
}
return ret;
}
template <class T> T math_C(T m, T n) {
T ret = math_P(m, n);
for (T i = 2; i <= n; i++) {
ret /= i;
}
return ret;
}
template <class T> bool compare_by_b(pair<T, T> a, pair<T, T> b) {
if (a.second != b.second) {
return a.second < b.second;
}
return a.first < b.first;
}
template <class T> T mod_pow(T x, T n, const T &p) {
T ret = 1;
while (n > 0) {
if (n & 1) {
(ret *= x) %= p;
}
(x *= x) %= p;
n >>= 1;
}
return ret;
}
template <class T> void Grid(grid<T> &G, size_t w, size_t h) {
G.reserve(w);
for (size_t i = 0; i < w; ++i) {
G.emplace_back(vector<ll>(h));
}
}
/*****/
ll N, K;
vector<ll> P;
void Main() {
cin >> N >> K;
P.resize(N);
rep(i, N) cin >> P[i];
vector<ld> csum(N + 1);
rep(i, N) { csum[i + 1] = csum[i] + (P[i] + 1.0) / 2; }
rep(i, N + 1) {
debug_cout(i);
debug_tabcout(1, csum[i]);
}
ld max = 0;
rep1(i, N - K + 1) {
ld m1 = 0;
rep(j, K) { m1 += csum[i + j] - csum[i + j - 1]; }
chmax(max, m1);
}
cout << max;
}
/*****/
int main() {
// std::ios::sync_with_stdio(false);
// std::cin.tie(0);
std::cout << std::fixed << std::setprecision(10);
/*
while (true)
{
Main();
cout << endl;
}
//*/
Main();
cout << endl;
return 0;
}
|
/*
@・ω・@ <だれだろうね
*/
/*****/
#include <algorithm>
#include <array>
#include <cmath>
#include <iomanip> //cout << fixed << setprecision(桁数);
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdexcept>
#include <string>
#include <vector>
// #define int long long
using namespace std;
using ll = long long;
using ld = long double;
using vecll = vector<long long>;
using pll = pair<long long, long long>;
template <class T> using pr = pair<T, T>;
template <class T> using vec = vector<T>;
template <class T> using grid = vector<vector<T>>;
#define debug(x) (std::cerr << (x) << "\n")
#define debug_tab(n, x) (std::cerr << strMulti("\t", n) << (x) << "\n")
#define debug_cout(x) (std::cerr << #x << " : " << (x) << "\n")
#define debug_tabcout(n, x) \
(std::cerr << strMulti("\t", n) << #x << " : " << (x) << "\n")
#define debug_headcout(h, x) (std::cerr << h << " : " << (x) << "\n")
#define debug_tabheadcout(n, h, x) \
(std::cerr << strMulti("\t", n) << h << " : " << (x) << "\n")
#define str(n) (n.toString())
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define rrep1(i, n) for (ll i = (n); i > 0; --i)
#define all(x) (x).begin(), (x).end()
#define pair(a, b) make_pair(a, b)
constexpr int INF = 2000000100;
constexpr ll MOD = 1000000007; // 10e9+7
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> T divup(T a, T b) {
if (a % b == 0) {
return a / b;
}
return a / b + 1;
}
std::string strMulti(std::string t, int n) {
std::string out = "";
for (int i = 0; i < n; i++) {
out += t;
}
return out;
}
template <class T> T math_P(T m, T n) {
T ret = 1;
for (T i = m; i > m - n; i--) {
ret *= i;
}
return ret;
}
template <class T> T math_C(T m, T n) {
T ret = math_P(m, n);
for (T i = 2; i <= n; i++) {
ret /= i;
}
return ret;
}
template <class T> bool compare_by_b(pair<T, T> a, pair<T, T> b) {
if (a.second != b.second) {
return a.second < b.second;
}
return a.first < b.first;
}
template <class T> T mod_pow(T x, T n, const T &p) {
T ret = 1;
while (n > 0) {
if (n & 1) {
(ret *= x) %= p;
}
(x *= x) %= p;
n >>= 1;
}
return ret;
}
template <class T> void Grid(grid<T> &G, size_t w, size_t h) {
G.reserve(w);
for (size_t i = 0; i < w; ++i) {
G.emplace_back(vector<ll>(h));
}
}
/*****/
ll N, K;
vector<ll> P;
void Main() {
cin >> N >> K;
P.resize(N);
rep(i, N) cin >> P[i];
vector<ld> csum(N + 1);
rep(i, N) { csum[i + 1] = csum[i] + (P[i] + 1.0) / 2; }
rep(i, N + 1) {
debug_cout(i);
debug_tabcout(1, csum[i]);
}
ld max = 0;
rep1(i, N - K + 1) { chmax(max, csum[i + K - 1] - csum[i - 1]); }
cout << max;
}
/*****/
int main() {
// std::ios::sync_with_stdio(false);
// std::cin.tie(0);
std::cout << std::fixed << std::setprecision(10);
/*
while (true)
{
Main();
cout << endl;
}
//*/
Main();
cout << endl;
return 0;
}
| replace | 133 | 139 | 133 | 134 | TLE | |
p02780 | C++ | Time Limit Exceeded | #define LOCAL
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define ALL(x) ((x).begin(), (x).end())
#define SIZE(x) ((int)(x).size())
#define BITS(x) (1LL << (x))
constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001LL;
constexpr int MOD = 1000000007;
constexpr double EPS = 1e-10;
constexpr double PI = 3.141592653589793;
constexpr int dx4[4] = {1, 0, -1, 0};
constexpr int dy4[4] = {0, 1, 0, -1};
constexpr int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
constexpr int dy8[8] = {1, 0, -1, 1, -1, 1, 0, -1};
random_device seed_gen;
mt19937 mrand(seed_gen());
mt19937_64 mrand64(seed_gen());
int rand32(int x) { return mrand() % x; }
ll rand64(long x) { return mrand64() % x; }
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ",");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T> ostream &operator<<(ostream &out, const vector<T> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ",");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T, class Cmp>
ostream &operator<<(ostream &out, const set<T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ",");
out << v;
first = 0;
}
out << "}";
return out;
}
template <typename U, typename T, class Cmp>
ostream &operator<<(ostream &out, const map<U, T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &p : a) {
out << (first ? "" : ",");
out << p.first << ": " << p.second;
first = 0;
}
out << "}";
return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
struct fast_ios {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
fast_ios() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} fast_ios_;
int p[220000];
double e[1100];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < 1100; i++) {
e[i] = (i + 1) / 2.0;
}
double ans = 0;
for (int i = 0; i + k - 1 < n; i++) {
double sum = 0;
for (int j = i; j < i + k; j++) {
sum += e[p[j]];
}
ans = max(ans, sum);
}
cout << ans << endl;
return 0;
} | #define LOCAL
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define ALL(x) ((x).begin(), (x).end())
#define SIZE(x) ((int)(x).size())
#define BITS(x) (1LL << (x))
constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001LL;
constexpr int MOD = 1000000007;
constexpr double EPS = 1e-10;
constexpr double PI = 3.141592653589793;
constexpr int dx4[4] = {1, 0, -1, 0};
constexpr int dy4[4] = {0, 1, 0, -1};
constexpr int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
constexpr int dy8[8] = {1, 0, -1, 1, -1, 1, 0, -1};
random_device seed_gen;
mt19937 mrand(seed_gen());
mt19937_64 mrand64(seed_gen());
int rand32(int x) { return mrand() % x; }
ll rand64(long x) { return mrand64() % x; }
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ",");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T> ostream &operator<<(ostream &out, const vector<T> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ",");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T, class Cmp>
ostream &operator<<(ostream &out, const set<T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ",");
out << v;
first = 0;
}
out << "}";
return out;
}
template <typename U, typename T, class Cmp>
ostream &operator<<(ostream &out, const map<U, T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &p : a) {
out << (first ? "" : ",");
out << p.first << ": " << p.second;
first = 0;
}
out << "}";
return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
struct fast_ios {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
fast_ios() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} fast_ios_;
int p[220000];
double e[1100];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < 1100; i++) {
e[i] = (i + 1) / 2.0;
}
double ans = 0, sum = 0;
for (int i = 0; i < k; i++) {
sum += e[p[i]];
}
ans = sum;
for (int i = 1; i + k - 1 < n; i++) {
sum += e[p[i + k - 1]] - e[p[i - 1]];
ans = max(ans, sum);
}
cout << ans << endl;
return 0;
} | replace | 146 | 152 | 146 | 153 | TLE | |
p02780 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
// typedef pair<ll, P> T;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define revrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define f first
#define s second
#define pb push_back
ll mod = 1000000007;
const ll INF = 100000000000010000;
// const ull B = 998244353;
// ll bit[200010];
// ll kai[3010];
// ll Cnt[10010];
// void pres(double A, ll x = 20) { printf("%.20f\n", x); }
/*ll sum(ll i)
{
i += 1;
ll t = 0;
while (i > 0)
{
t += bit[i];
i -= i & -i;
}
return t;
}
void add(ll i, ll x)
{
i += 1;
while (i <= 200005)
{
bit[i] += x;
i += i & -i;
}
}*/
/*`ll SAIKI(ll S) {
for (ll T = S; ; T = (T - 1) & S) {
}
}*/
void test() { cout << "888888888888888888888888" << endl; }
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
ll pow_mod(ll x, ll k) {
x %= mod;
ll res = 1;
while (k > 0) {
if (k % 2) {
res *= x;
res %= mod;
}
x *= x;
x %= mod;
k /= 2;
}
return res;
}
ll div_mod(ll x) { return pow_mod(x, mod - 2); }
// コンビネーション
const int MAXcomb = 200010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
// facはn!,finvは1/n!
// invは逆元
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAXcomb; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll comb(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * finv[k] % mod * finv[n - k] % mod;
}
/*map<ll, ll> pres;
ll ct;
void makePrimeList(ll x) {
ll X = x;
for (ll j = 2; j * j <= x; j++) {
ll cnt = 0;
while (X % j == 0) {
cnt++;
X /= j;
}
if (cnt) {
if (pres[j] == 0) {
ct++;
pres[j] = ct;
}
Cnt[pres[j]] += cnt;
}
}
if (X != 1) {
if (pres[X] == 0) {
ct++;
pres[X] = ct;
}
Cnt[pres[X]] += 1;
}
}*/
ll N, K;
double p[1010], sum[1010], ans;
void solve() {
cin >> N >> K;
rep(i, N) {
cin >> p[i];
sum[i + 1] = sum[i] + (p[i] + 1) / 2;
}
rep(i, N) {
if (i + K > N)
break;
ans = max(ans, sum[i + K] - sum[i]);
}
printf("%.10lf\n", ans);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
ll N;
cin >> N;
} | #include <algorithm>
#include <bitset>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
// typedef pair<ll, P> T;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define revrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define f first
#define s second
#define pb push_back
ll mod = 1000000007;
const ll INF = 100000000000010000;
// const ull B = 998244353;
// ll bit[200010];
// ll kai[3010];
// ll Cnt[10010];
// void pres(double A, ll x = 20) { printf("%.20f\n", x); }
/*ll sum(ll i)
{
i += 1;
ll t = 0;
while (i > 0)
{
t += bit[i];
i -= i & -i;
}
return t;
}
void add(ll i, ll x)
{
i += 1;
while (i <= 200005)
{
bit[i] += x;
i += i & -i;
}
}*/
/*`ll SAIKI(ll S) {
for (ll T = S; ; T = (T - 1) & S) {
}
}*/
void test() { cout << "888888888888888888888888" << endl; }
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
ll pow_mod(ll x, ll k) {
x %= mod;
ll res = 1;
while (k > 0) {
if (k % 2) {
res *= x;
res %= mod;
}
x *= x;
x %= mod;
k /= 2;
}
return res;
}
ll div_mod(ll x) { return pow_mod(x, mod - 2); }
// コンビネーション
const int MAXcomb = 200010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
// facはn!,finvは1/n!
// invは逆元
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAXcomb; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll comb(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * finv[k] % mod * finv[n - k] % mod;
}
/*map<ll, ll> pres;
ll ct;
void makePrimeList(ll x) {
ll X = x;
for (ll j = 2; j * j <= x; j++) {
ll cnt = 0;
while (X % j == 0) {
cnt++;
X /= j;
}
if (cnt) {
if (pres[j] == 0) {
ct++;
pres[j] = ct;
}
Cnt[pres[j]] += cnt;
}
}
if (X != 1) {
if (pres[X] == 0) {
ct++;
pres[X] = ct;
}
Cnt[pres[X]] += 1;
}
}*/
ll N, K;
double p[200010], sum[200010], ans;
void solve() {
cin >> N >> K;
rep(i, N) {
cin >> p[i];
sum[i + 1] = sum[i] + (p[i] + 1) / 2;
}
rep(i, N) {
if (i + K > N)
break;
ans = max(ans, sum[i + K] - sum[i]);
}
printf("%.10lf\n", ans);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
ll N;
cin >> N;
} | replace | 137 | 138 | 137 | 138 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int p[200010];
double P[200010];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> p[i];
for (int j = 1; j <= p[i]; j++) {
P[i] += (double)j / p[i];
}
}
double ans = 0;
for (int i = 0; i <= N - K; i++) {
double sum = 0;
for (int j = i; j < i + K; j++) {
sum += P[j];
}
// cout << sum << endl;
ans = max(ans, sum);
}
printf("%.6f", ans);
}
| #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int p[200010];
double P[200010];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> p[i];
for (int j = 1; j <= p[i]; j++) {
P[i] += (double)j / p[i];
}
}
double ans = 0.0, sum = 0;
for (int i = 0; i < K; i++) {
sum += P[i];
}
ans = sum;
for (int i = K; i < N; i++) {
sum -= P[i - K];
sum += P[i];
ans = max(sum, ans);
}
printf("%.6f", ans);
}
| replace | 25 | 33 | 25 | 34 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n, k;
cin >> n >> k;
vector<ll> p(n);
for (ll i = 0; i < n; i++)
cin >> p[i];
vector<double> exp(n);
for (ll i = 0; i < n; i++) {
exp[i] = (p[i] + 1) / 2.0;
}
double ans = 0;
for (ll i = 0; i + k - 1 < n; i++) {
double temp = 0;
for (ll j = 0; j < k; j++) {
temp += exp[i + j];
}
ans = max(ans, temp);
}
printf("%.10f\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n, k;
cin >> n >> k;
vector<ll> p(n);
for (ll i = 0; i < n; i++)
cin >> p[i];
vector<double> exp(n);
for (ll i = 0; i < n; i++) {
exp[i] = (p[i] + 1) / 2.0;
}
double ans = 0;
for (ll i = 0; i < k; i++)
ans += exp[i];
double temp = ans;
for (ll i = 1; i + k - 1 < n; i++) {
temp -= exp[i - 1];
temp += exp[i + k - 1];
ans = max(ans, temp);
}
printf("%.10f\n", ans);
} | replace | 15 | 20 | 15 | 21 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
using namespace std;
const int N = 200005;
int n, k;
double p[N], sum = 0, res = 0;
double dp[N];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%lf", &p[i]);
}
for (int i = 1; i <= n - k + 1; i++) {
res = 0;
for (int j = i; j < i + k; j++) {
res += p[j];
}
sum = max(sum, res);
}
printf("%.12lf", (sum + k) / 2.0);
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
using namespace std;
const int N = 200005;
int n, k;
double p[N], sum = 0, res = 0;
double dp[N];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%lf", &p[i]);
}
for (int i = 1; i <= n - k + 1; i++) {
if (i == 1) {
for (int j = i; j < i + k; j++) {
res += p[j];
}
} else {
res -= p[i - 1];
res += p[i + k - 1];
}
sum = max(sum, res);
}
printf("%.12lf", (sum + k) / 2.0);
} | replace | 15 | 18 | 15 | 22 | TLE | |
p02780 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long double ll;
int Array(int x[], int n) {
for (int i = 0; i < n; i++) {
cin >> x[i];
}
return *x;
}
int main() {
int n, k;
cin >> n >> k;
int p[n];
vector<ll> ktit(n);
vector<ll> riskw(n + 1);
Array(p, n);
ll sum = 0;
ll ans = 0;
for (int i = 0; i < n; i++) {
ll s = (p[i] + 1);
s /= 2;
ktit.push_back(s);
riskw[i + 1] = s;
}
for (int i = 1; i <= n; i++) {
riskw[i] += riskw[i - 1];
}
for (int i = 0; i <= n; i++) {
ll x = riskw[i + k] - riskw[i];
if (x > ans) {
ans = x;
}
}
cout << setprecision(8) << ans << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long double ll;
int Array(int x[], int n) {
for (int i = 0; i < n; i++) {
cin >> x[i];
}
return *x;
}
int main() {
int n, k;
cin >> n >> k;
int p[n];
vector<ll> ktit(n);
vector<ll> riskw(n + 1);
Array(p, n);
ll sum = 0;
ll ans = 0;
for (int i = 0; i < n; i++) {
ll s = (p[i] + 1);
s /= 2;
ktit.push_back(s);
riskw[i + 1] = s;
}
for (int i = 1; i <= n; i++) {
riskw[i] += riskw[i - 1];
}
for (int i = k; i <= n; i++) {
ll x = riskw[i] - riskw[i - k];
if (x > ans) {
ans = x;
}
}
cout << setprecision(8) << ans << endl;
} | replace | 38 | 40 | 38 | 40 | 0 | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
freopen("10.txt", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> p(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
int sum = 0;
for (int i = 0; i < k; ++i) {
sum += p[i];
}
int ans = sum;
for (int i = k; i < n; ++i) {
sum += p[i];
sum -= p[i - k];
ans = max(ans, sum);
}
cout << setprecision(30) << (double)(ans + k) / 2.0 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> p(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
int sum = 0;
for (int i = 0; i < k; ++i) {
sum += p[i];
}
int ans = sum;
for (int i = k; i < n; ++i) {
sum += p[i];
sum -= p[i - k];
ans = max(ans, sum);
}
cout << setprecision(30) << (double)(ans + k) / 2.0 << endl;
return 0;
}
| delete | 5 | 6 | 5 | 5 | -11 | |
p02780 | C++ | Runtime Error | // ABC_154_D
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forn(i, n) for (int i = 0; i < (int)n; ++i)
int sum(int n) {
int sum = n * (n + 1) / 2;
return sum;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
forn(i, n) cin >> v[i];
vector<double> expv(n, 0);
forn(i, n) {
double tmp = 0;
tmp = (double)sum(v[i]) / (double)v[i];
expv[i] = tmp;
}
// sum
vector<double> sum(n + 1, 0);
forn(i, n + 1) sum[i + 1] = sum[i] + expv[i];
double max = 0;
for (int j = 0; j <= n - k; ++j) {
double tmp = sum[j + k] - sum[j];
// cout << tmp << "\n";
if (max < tmp)
max = tmp;
}
cout << fixed << setprecision(15);
cout << max << "\n";
} | // ABC_154_D
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forn(i, n) for (int i = 0; i < (int)n; ++i)
int sum(int n) {
int sum = n * (n + 1) / 2;
return sum;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
forn(i, n) cin >> v[i];
vector<double> expv(n, 0);
forn(i, n) {
double tmp = 0;
tmp = (double)sum(v[i]) / (double)v[i];
expv[i] = tmp;
}
// sum
vector<double> sum(n + 1, 0);
forn(i, n) sum[i + 1] = sum[i] + expv[i];
double max = 0;
for (int j = 0; j <= n - k; ++j) {
double tmp = sum[j + k] - sum[j];
// cout << tmp << "\n";
if (max < tmp)
max = tmp;
}
cout << fixed << setprecision(15);
cout << max << "\n";
} | replace | 30 | 31 | 30 | 31 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int K, N;
cin >> N >> K;
double p[N];
rep(i, N) cin >> p[i];
rep(i, N) p[i] = (p[i] + 1) / 2.0;
double ans = 0.0;
double sum = 0.0;
rep(i, N - K + 1) {
sum = 0.0;
rep(j, K) { sum += p[i + j]; }
ans = max(ans, sum);
}
cout << fixed << setprecision(14);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int K, N;
cin >> N >> K;
double p[N];
rep(i, N) cin >> p[i];
rep(i, N) p[i] = (p[i] + 1) / 2.0;
double ans = 0.0;
double sum = 0;
rep(i, K) ans += p[i];
sum = ans;
for (int i = K; i < N; i++) {
sum += p[i];
sum -= p[i - K];
ans = max(ans, sum);
}
cout << fixed << setprecision(14);
cout << ans << endl;
} | replace | 15 | 19 | 15 | 21 | TLE | |
p02780 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <cctype>
#include <cstdlib>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int I;
int keta(int a) {
int count = 0;
while (a != 0) {
a /= 10;
count++;
}
return count;
}
int main() {
int n, k;
double ans = 0, m = 0;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n - k + 1; i++) {
m = k;
for (int j = i; j < i + k; j++) {
m += a[j];
}
ans = max(m, ans);
}
ans = double(ans);
cout << fixed;
cout << setprecision(8) << ans / 2.0 << endl;
return 0;
} // カモンAC |
#include <algorithm>
#include <cctype>
#include <cstdlib>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int I;
int keta(int a) {
int count = 0;
while (a != 0) {
a /= 10;
count++;
}
return count;
}
int main() {
int n, k;
double ans = 0, m = 0;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
m = k;
for (int i = 0; i < k; i++) {
m += a[i];
}
ans = m;
for (int i = k; i < n; i++) {
m += a[i] - a[i - k];
ans = max(ans, m);
}
ans = double(ans);
cout << fixed;
cout << setprecision(8) << ans / 2.0 << endl;
return 0;
} // カモンAC | replace | 40 | 46 | 40 | 48 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define pi 3.14159265358979323846
#define VI vector<int>
#define VLL vector<long long>
#define MAX max_element
#define MIN min_element
#define all(v) v.begin(), v.end()
const ll MOD = 1e9 + 7;
using namespace std;
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T lcm(T a, T b) { return a * b / gcd(a, b); }
template <typename T> T finder(vector<T> vec, T number) {
auto itr = find(vec.begin(), vec.end(), number);
size_t index = distance(vec.begin(), itr);
if (index != vec.size()) { // 発見できたとき
return 1;
} else { // 発見できなかったとき
return 0;
}
}
ll frac(ll n) {
if (n == 0) {
return 1;
}
return (n * frac(n - 1)) % MOD;
}
/*char r[4];
int yaju[4];
char op[3];
int sum = 0;
scanf("%s", r);
for (int i = 0;i < 4;i++) {
yaju[i] = r[i] - '0';
}
*/
int main() {
ll N, K;
cin >> N >> K;
vector<double> B(N);
double ans = 0;
double max = 0;
double x;
for (int i = 0; i < N; i++) {
cin >> x;
for (int j = 1; j <= x; j++) {
B[i] += j * (1 / x);
}
}
for (int i = 0; i < N - K + 1; i++) {
max = 0;
for (int k = i; k < i + K; k++) {
max += B[k];
}
if (max > ans)
ans = max;
}
cout << fixed << setprecision(13) << ans << endl;
} | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define pi 3.14159265358979323846
#define VI vector<int>
#define VLL vector<long long>
#define MAX max_element
#define MIN min_element
#define all(v) v.begin(), v.end()
const ll MOD = 1e9 + 7;
using namespace std;
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T lcm(T a, T b) { return a * b / gcd(a, b); }
template <typename T> T finder(vector<T> vec, T number) {
auto itr = find(vec.begin(), vec.end(), number);
size_t index = distance(vec.begin(), itr);
if (index != vec.size()) { // 発見できたとき
return 1;
} else { // 発見できなかったとき
return 0;
}
}
ll frac(ll n) {
if (n == 0) {
return 1;
}
return (n * frac(n - 1)) % MOD;
}
/*char r[4];
int yaju[4];
char op[3];
int sum = 0;
scanf("%s", r);
for (int i = 0;i < 4;i++) {
yaju[i] = r[i] - '0';
}
*/
int main() {
ll N, K;
cin >> N >> K;
vector<double> B(N);
double ans = 0;
double max = 0;
double x;
for (int i = 0; i < N; i++) {
cin >> x;
for (int j = 1; j <= x; j++) {
B[i] += j * (1 / x);
}
}
double l = 0;
for (int i = 0; i < K; i++)
l += B[i];
ans = l;
for (int i = 0; i < N - K; i++) {
l -= B[i];
l += B[i + K];
if (l > ans)
ans = l;
}
cout << fixed << setprecision(13) << ans << endl;
}
| replace | 64 | 71 | 64 | 73 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
vector<double> v(n);
cout << fixed << setprecision(6);
rep(i, n) {
cin >> v.at(i);
v.at(i) = (v.at(i) + 1) / 2;
// cout<<v.at(i)<<" ";
}
double ans, ansm = 0;
rep(i, n - k + 1) {
ans = 0;
for (int j = i; j < i + k; j++) {
ans += v.at(j);
}
ansm = max(ans, ansm);
}
cout << ansm;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
vector<double> v(n);
cout << fixed << setprecision(6);
rep(i, n) {
cin >> v.at(i);
v.at(i) = (v.at(i) + 1) / 2;
// cout<<v.at(i)<<" ";
}
double ans = 0;
rep(i, k) { ans += v.at(i); }
double ansm = ans;
rep(i, n - k) {
ans = ans - v.at(i) + v.at(i + k);
ansm = max(ans, ansm);
}
cout << ansm;
}
| replace | 17 | 23 | 17 | 22 | TLE | |
p02780 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
double avg(int n) { return (n + 1) / 2.0; }
int main() {
int n, k, p[200];
std::cin >> n >> k;
for (int i = 0; i < n; ++i)
std::cin >> p[i];
double sum = 0;
for (int i = 0; i < k; ++i) {
sum += avg(p[i]);
}
double ans = sum;
for (int i = k; i < n; ++i) {
sum -= avg(p[i - k]);
sum += avg(p[i]);
ans = std::max(ans, sum);
}
std::cout << std::setprecision(10) << std::fixed << ans;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
double avg(int n) { return (n + 1) / 2.0; }
int main() {
int n, k, p[2000010];
std::cin >> n >> k;
for (int i = 0; i < n; ++i)
std::cin >> p[i];
double sum = 0;
for (int i = 0; i < k; ++i) {
sum += avg(p[i]);
}
double ans = sum;
for (int i = k; i < n; ++i) {
sum -= avg(p[i - k]);
sum += avg(p[i]);
ans = std::max(ans, sum);
}
std::cout << std::setprecision(10) << std::fixed << ans;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, k;
double ex[200000], pre[200001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
for (int i = 0; i < n; i++) {
double val;
cin >> val;
ex[i] = (val * (val + 1)) / (2 * val);
}
double mx = 0;
for (int i = 1; i <= n; i++) {
pre[i] = pre[i - 1] + ex[i - 1];
mx = max(mx, pre[i] - pre[i - k]);
}
cout << fixed << setprecision(6) << mx << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, k;
double ex[200000], pre[200001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
for (int i = 0; i < n; i++) {
double val;
cin >> val;
ex[i] = (val * (val + 1)) / (2 * val);
}
double mx = 0;
for (int i = 1; i <= n; i++) {
pre[i] = pre[i - 1] + ex[i - 1];
mx = max(mx, pre[i] - pre[max(0, i - k)]);
}
cout << fixed << setprecision(6) << mx << "\n";
return 0;
} | replace | 18 | 19 | 18 | 19 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using ll = long long;
#define rep(inc, bgn, end) for (int inc = bgn; inc < end; ++inc)
#define repe(inc, bgn, end) for (int inc = bgn; inc <= end; ++inc)
using namespace std;
// 154-c
int main() {
int n, k;
cin >> n >> k;
int p;
vector<double> v;
rep(i, 0, n) {
cin >> p;
double sum = p * (p + 1);
double div = 2 * p;
v.push_back(sum / div);
}
double mx = 0, sum = 0;
for (int i = 0; i + k - 1 < n; i++) {
sum = 0;
rep(_k, 0, k) { sum += v[i + _k]; }
mx = max(mx, sum);
}
printf("%lf\n", mx);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using ll = long long;
#define rep(inc, bgn, end) for (int inc = bgn; inc < end; ++inc)
#define repe(inc, bgn, end) for (int inc = bgn; inc <= end; ++inc)
using namespace std;
// 154-c
int main() {
int n, k;
cin >> n >> k;
int p;
vector<double> v;
rep(i, 0, n) {
cin >> p;
double sum = p * (p + 1);
double div = 2 * p;
v.push_back(sum / div);
}
double sum = 0;
rep(i, 0, k) { sum += v[i]; }
double mx = sum;
for (int i = 1; i + k - 1 < n; i++) {
sum += v[i + k - 1];
sum -= v[i - 1];
mx = max(mx, sum);
}
printf("%lf\n", mx);
return 0;
}
| replace | 27 | 31 | 27 | 34 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
vector<long double> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
long double maxans = 0;
for (int j = 0; j < n - k + 1; j++) {
long double ans = 0;
for (int i = j; i < k + j; i++) {
ans += (p[i] + 1) / 2;
}
maxans = max(maxans, ans);
}
cout << fixed << setprecision(10) << maxans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
vector<long double> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
long double maxans = 0;
for (int i = 0; i < k; i++) {
maxans += (p[i] + 1) / 2;
}
long double ans = maxans;
for (int i = 0; i < n - k + 1; i++) {
ans += (p[i + k] - p[i]) / 2;
maxans = max(maxans, ans);
}
cout << fixed << setprecision(10) << maxans << endl;
}
| replace | 14 | 19 | 14 | 21 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const ll INFL = 1e17;
const int MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n);
rep(i, n) cin >> p[i];
int ans = 0;
rep(i, n - k + 1) {
int now = 0;
rep(j, k) { now += p[i + j]; }
ans = max(now, ans);
}
double output = ans;
output = output / 2.0 + 1.0 / 2.0 * k;
printf("%.12lf\n", output);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const ll INFL = 1e17;
const int MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n);
rep(i, n) cin >> p[i];
int now = 0;
for (int i = 0; i < k; i++)
now += p[i];
int ans = now;
for (int i = k; i < n; i++) {
now = now - p[i - k] + p[i];
ans = max(ans, now);
}
double output = ans;
output = output / 2.0 + 1.0 / 2.0 * k;
printf("%.12lf\n", output);
return 0;
} | replace | 14 | 19 | 14 | 21 | TLE | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<double> pref(n + 1), E(n);
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
E[i] = (1.0 + x) / 2.0;
}
for (int i = 1; i <= n; ++i) {
pref[i] = pref[i - 1] + E[i];
}
double ans = 0.0;
for (int i = 0; i <= n - k; ++i) {
ans = max(ans, pref[i + k] - pref[i]);
}
printf("%.10f\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<double> pref(n + 1), E(n + 1);
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
E[i] = (1.0 + x) / 2.0;
}
for (int i = 1; i <= n; ++i) {
pref[i] = pref[i - 1] + E[i];
}
double ans = 0.0;
for (int i = 0; i <= n - k; ++i) {
ans = max(ans, pref[i + k] - pref[i]);
}
printf("%.10f\n", ans);
} | replace | 7 | 8 | 7 | 8 | -6 | malloc(): corrupted top size
|
p02780 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;
using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
if (a.first == b.first)
return a.second < b.second;
return a.first < b.first;
}
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec) \
std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec) \
std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d) \
vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d) \
vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec) \
do { \
sort(ALL((vec))); \
(vec).erase(std::unique(ALL((vec))), (vec).end()); \
} while (0)
ll POW(ll n, ll m) {
if (m == 0) {
return 1;
} else if (m % 2 == 0) {
ll tmp = POW(n, m / 2);
return (tmp * tmp);
} else {
return (n * POW(n, m - 1));
}
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N, K;
cin >> N >> K;
vl p(N);
REP(i, N) cin >> p[i];
long double ans = 0;
REP(i, N - K + 1) {
long double score = 0;
REP(j, K) { score += (long double)(1 + p[i + j]) / 2; }
ans = max(ans, score);
}
cout << SP(20) << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;
using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
if (a.first == b.first)
return a.second < b.second;
return a.first < b.first;
}
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec) \
std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec) \
std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d) \
vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d) \
vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec) \
do { \
sort(ALL((vec))); \
(vec).erase(std::unique(ALL((vec))), (vec).end()); \
} while (0)
ll POW(ll n, ll m) {
if (m == 0) {
return 1;
} else if (m % 2 == 0) {
ll tmp = POW(n, m / 2);
return (tmp * tmp);
} else {
return (n * POW(n, m - 1));
}
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N, K;
cin >> N >> K;
vl p(N);
REP(i, N) cin >> p[i];
long double ans = 0;
long double score = 0;
REP(j, K) { score += (long double)(1 + p[j]) / 2; }
ans = max(ans, score);
FOR(i, K, N) {
// cout << K << endl;
score -= (long double)(1 + p[i - K]) / 2;
score += (long double)(1 + p[i]) / 2;
ans = max(ans, score);
}
cout << SP(20) << ans << endl;
return 0;
}
| replace | 84 | 87 | 84 | 91 | TLE | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define trace(x) cerr << x << END;
#define loop(i, a, b) for (int i = (a); i < (b); i++)
#define loopb(i, b, a) for (int i = (b); i > (a); --i)
const int mod = 1e9 + 7;
const int mod1 = 998244353;
const int inf = 1e18;
const int nax = 100005;
int a[nax], n, k;
void solve() {
cin >> n >> k;
loop(i, 0, n) cin >> a[i];
int lo = 0, hi = 0;
double sum = 0, ans = 0;
loop(i, 0, k) sum += 1.0 * (a[i] + 1) / 2;
ans = sum;
hi = k - 1;
loop(i, k, n) {
sum -= 1.0 * (a[lo] + 1) / 2;
lo++;
sum += 1.0 * (a[i] + 1) / 2;
hi++;
if (hi - lo + 1 == k)
ans = max(ans, sum);
}
cout << fixed << setprecision(10);
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
/*int t;
cin>>t;
loop(i,1,t+1)*/
solve();
// cerr<<END<<1.0*clock();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define trace(x) cerr << x << END;
#define loop(i, a, b) for (int i = (a); i < (b); i++)
#define loopb(i, b, a) for (int i = (b); i > (a); --i)
const int mod = 1e9 + 7;
const int mod1 = 998244353;
const int inf = 1e18;
const int nax = 200005;
int a[nax], n, k;
void solve() {
cin >> n >> k;
loop(i, 0, n) cin >> a[i];
int lo = 0, hi = 0;
double sum = 0, ans = 0;
loop(i, 0, k) sum += 1.0 * (a[i] + 1) / 2;
ans = sum;
hi = k - 1;
loop(i, k, n) {
sum -= 1.0 * (a[lo] + 1) / 2;
lo++;
sum += 1.0 * (a[i] + 1) / 2;
hi++;
if (hi - lo + 1 == k)
ans = max(ans, sum);
}
cout << fixed << setprecision(10);
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
/*int t;
cin>>t;
loop(i,1,t+1)*/
solve();
// cerr<<END<<1.0*clock();
return 0;
}
| replace | 14 | 15 | 14 | 15 | 0 | |
p02780 | C++ | Runtime Error | #include <cstdio>
#include <vector>
int main() {
int n, k;
scanf("%d%d", &n, &k);
std::vector<double> sum = {0};
double ret = 0;
for (int i = 1; i <= n; ++i) {
int p;
scanf("%d", &p);
sum[i] = (p + 1) * 0.5 + sum[i - 1];
if (i >= k && sum[i] - sum[i - k] >= ret)
ret = sum[i] - sum[i - k];
}
printf("%.10f\n", ret);
return 0;
}
| #include <cstdio>
#include <vector>
int main() {
int n, k;
scanf("%d%d", &n, &k);
std::vector<double> sum(n + 1);
double ret = 0;
for (int i = 1; i <= n; ++i) {
int p;
scanf("%d", &p);
sum[i] = (p + 1) * 0.5 + sum[i - 1];
if (i >= k && sum[i] - sum[i - k] >= ret)
ret = sum[i] - sum[i - k];
}
printf("%.10f\n", ret);
return 0;
}
| replace | 6 | 7 | 6 | 7 | -6 | malloc(): corrupted top size
|
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, k;
double ans = -1.0;
int p[200000];
double z[200000];
cin >> n >> k;
rep(i, n) {
int q;
double r;
cin >> q;
p[i] = q;
ll t = ((1 + p[i]) * p[i]) / 2;
z[i] = (double)t / p[i];
if (i < k - 1)
continue;
double h = 0;
rep(j, k) { h += z[i - j]; }
ans = max(ans, h);
}
cout << fixed;
cout << setprecision(12) << ans;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, k;
double ans = -1.0;
int p[200000];
double z[200000];
cin >> n >> k;
rep(i, n) {
int q;
double r;
cin >> q;
p[i] = q;
ll t = ((1 + p[i]) * p[i]) / 2;
z[i] = (double)t / p[i];
if (i < k - 1)
continue;
double h;
if (i == k - 1) {
h = 0;
rep(j, k) { h += z[i - j]; }
} else if (i > k - 1) {
h -= z[i - k];
h += z[i];
}
ans = max(ans, h);
}
cout << fixed;
cout << setprecision(12) << ans;
return 0;
} | replace | 22 | 24 | 22 | 31 | TLE | |
p02780 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
ll inf = 100000000;
ll v[205];
ll x[20000005];
ll a[10000005];
ll b[10000005];
ll dp[10005][10005];
ll ex = 1000000007;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
typedef pair<ll, ll> P;
double q[200005];
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
int n, k;
cin >> n >> k;
int p[1005];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
double ans = 0;
for (int i = 0; i < n; i++) {
ans = (double)(((1 + p[i]) * p[i]) / 2) / p[i];
q[i] = ans;
}
double sum = 0;
for (int i = 0; i < k; i++) {
sum += q[i];
}
double max = sum;
double kai = 0;
for (int i = k; i < n; i++) {
kai = (sum - q[i - k]) + q[i];
if (max < kai) {
max = kai;
}
sum = kai;
}
printf("%.12f", max);
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
ll inf = 100000000;
ll v[205];
ll x[20000005];
ll a[10000005];
ll b[10000005];
ll dp[10005][10005];
ll ex = 1000000007;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
typedef pair<ll, ll> P;
double q[200005];
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
int n, k;
cin >> n >> k;
int p[200005];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
double ans = 0;
for (int i = 0; i < n; i++) {
ans = (double)(((1 + p[i]) * p[i]) / 2) / p[i];
q[i] = ans;
}
double sum = 0;
for (int i = 0; i < k; i++) {
sum += q[i];
}
double max = sum;
double kai = 0;
for (int i = k; i < n; i++) {
kai = (sum - q[i - k]) + q[i];
if (max < kai) {
max = kai;
}
sum = kai;
}
printf("%.12f", max);
return 0;
} | replace | 25 | 26 | 25 | 26 | -11 | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll a, b, c, d = 0, e = 1, i, j, k, l;
cin >> a >> d;
vector<double> v, vv;
double x, y, z;
for (i = 1; i <= a; i++) {
cin >> x;
v.push_back(x);
}
for (i = 0; i < a; i++) {
x = v[i];
y = ((x / 2.0) * (x + 1)) / x;
vv.push_back(y);
}
x = 0.0;
z = 0.0;
for (i = 0; i + d <= a; i++) {
for (j = i; j < i + d; j++) {
x += vv[j];
}
z = max(z, x);
x = 0;
}
printf("%0.12f\n", z);
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll a, b, c, d = 0, e = 1, i, j, k, l;
cin >> a >> d;
vector<double> v, vv;
double x, y, z;
for (i = 1; i <= a; i++) {
cin >> x;
v.push_back(x);
}
for (i = 0; i < a; i++) {
x = v[i];
y = ((x / 2.0) * (x + 1)) / x;
vv.push_back(y);
}
x = 0.0;
z = 0.0;
for (i = 0; i < d; i++) {
x += vv[i];
}
z = max(z, x); // cout<<z<<endl;
for (i = d, j = 0; i < a; i++, j++) {
x = x + vv[i] - vv[j];
// cout<<x<<" "<<v[j]<<endl;
z = max(x, z);
}
printf("%0.12f\n", z);
} | replace | 20 | 26 | 20 | 29 | TLE | |
p02780 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P>> G;
void g_dir(G &graph, ll a, ll b, ll w = 1) { graph[a].push_back(P(b, w)); }
void g_undir(G &graph, ll a, ll b, ll w = 1) {
g_dir(graph, a, b, w);
g_dir(graph, b, a, w);
}
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for (ll(i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for (ll(i) = (n)-1; (i) >= 0; (i)--)
#define rrep1(i, n) for (ll(i) = (n); (i) >= 1; (i)--)
template <class T> void chmax(T &a, const T &b) {
if (a < b) {
a = b;
}
}
template <class T> void chmin(T &a, const T &b) {
if (a > b) {
a = b;
}
}
const ll INF = 1145141919;
const ll MOD = 1000000007;
const ll NUM = 101010;
ll p[1010];
double v[1010];
int main() {
ll N, K;
cin >> N >> K;
rep1(i, N) {
cin >> p[i];
v[i] = p[i] * (p[i] + 1) / 2.0 / p[i];
v[i] += v[i - 1];
}
double ans = 0;
rep1(i, N) {
ll j = i - K;
if (j < 0)
continue;
chmax(ans, v[i] - v[j]);
}
printf("%.10f\n", ans);
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P>> G;
void g_dir(G &graph, ll a, ll b, ll w = 1) { graph[a].push_back(P(b, w)); }
void g_undir(G &graph, ll a, ll b, ll w = 1) {
g_dir(graph, a, b, w);
g_dir(graph, b, a, w);
}
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for (ll(i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for (ll(i) = (n)-1; (i) >= 0; (i)--)
#define rrep1(i, n) for (ll(i) = (n); (i) >= 1; (i)--)
template <class T> void chmax(T &a, const T &b) {
if (a < b) {
a = b;
}
}
template <class T> void chmin(T &a, const T &b) {
if (a > b) {
a = b;
}
}
const ll INF = 1145141919;
const ll MOD = 1000000007;
const ll NUM = 101010;
ll p[202020];
double v[202020];
int main() {
ll N, K;
cin >> N >> K;
rep1(i, N) {
cin >> p[i];
v[i] = p[i] * (p[i] + 1) / 2.0 / p[i];
v[i] += v[i - 1];
}
double ans = 0;
rep1(i, N) {
ll j = i - K;
if (j < 0)
continue;
chmax(ans, v[i] - v[j]);
}
printf("%.10f\n", ans);
return 0;
} | replace | 31 | 33 | 31 | 33 | 0 | |
p02780 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define range(i, l, r) for (int i = l; i < (int)(r); ++i)
#define rrange(i, l, r) for (int i = r - 1; i >= (int)(l); --i)
#define unless(a) if (!(a))
#define all(a) begin(a), end(a)
#define fst first
#define scd second
#define PB emplace_back
#define PPB pop_back
using vi = vector<int>;
using pii = pair<int, int>;
using ll = long long;
template <typename T> bool chmin(T &a, T b) {
return a > b ? (a = b, true) : false;
}
template <typename T> bool chmax(T &a, T b) {
return a < b ? (a = b, true) : false;
}
// int read(){int a;scanf("%lld",&a);return a;}
constexpr int TEN(int n) { return n == 0 ? 1 : 10 * TEN(n - 1); }
const int inf = TEN(18) * 3 + 10;
const int mod = TEN(9) + 7;
int N, K;
signed main() {
cin >> N >> K;
vector<double> a(N + 1), rui(N + 1);
rep(i, N) {
int p;
cin >> p;
a[i + 1] = (p + 1) / 2.0;
}
rep(i, N) { rui[i + 1] += rui[i] + a[i + 1]; }
double ans = 0;
rep1(i, N) { chmax(ans, rui[i + K - 1] - rui[i - 1]); }
printf("%.10f\n", ans);
}
| #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define range(i, l, r) for (int i = l; i < (int)(r); ++i)
#define rrange(i, l, r) for (int i = r - 1; i >= (int)(l); --i)
#define unless(a) if (!(a))
#define all(a) begin(a), end(a)
#define fst first
#define scd second
#define PB emplace_back
#define PPB pop_back
using vi = vector<int>;
using pii = pair<int, int>;
using ll = long long;
template <typename T> bool chmin(T &a, T b) {
return a > b ? (a = b, true) : false;
}
template <typename T> bool chmax(T &a, T b) {
return a < b ? (a = b, true) : false;
}
// int read(){int a;scanf("%lld",&a);return a;}
constexpr int TEN(int n) { return n == 0 ? 1 : 10 * TEN(n - 1); }
const int inf = TEN(18) * 3 + 10;
const int mod = TEN(9) + 7;
int N, K;
signed main() {
cin >> N >> K;
vector<double> a(N + 1), rui(N + 1);
rep(i, N) {
int p;
cin >> p;
a[i + 1] = (p + 1) / 2.0;
}
rep(i, N) { rui[i + 1] += rui[i] + a[i + 1]; }
double ans = 0;
rep1(i, N) {
if (i + K - 1 <= N)
chmax(ans, rui[i + K - 1] - rui[i - 1]);
}
printf("%.10f\n", ans);
}
| replace | 60 | 61 | 60 | 64 | 0 | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
double p;
cin >> n >> k;
vector<double> v(n + 1, 0);
double sofar = 0;
for (int i = 1; i <= n; i++) {
cin >> p;
sofar += (p + 1) / 2;
v[i] = sofar;
}
// for(auto x: v) cout << x << " ";
cout << endl;
double maxi = 0;
for (int i = 0; i < n - 2; i++) {
maxi = max(maxi, v[i + k] - v[i]);
}
cout << setprecision(10) << maxi;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
double p;
cin >> n >> k;
vector<double> v(n + 1, 0);
double sofar = 0;
for (int i = 1; i <= n; i++) {
cin >> p;
sofar += (p + 1) / 2;
v[i] = sofar;
}
// for(auto x: v) cout << x << " ";
cout << endl;
double maxi = 0;
for (int i = 0; i < n - k + 1; i++) {
// cout << i - (n-1) << endl;
maxi = max(maxi, v[i + k] - v[i]);
}
cout << setprecision(10) << maxi;
}
| replace | 17 | 18 | 17 | 19 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
int maxsum = 0;
for (int i = 0; i < N - K + 1; i++) {
int partsum = 0;
for (int j = 0; j < K; j++) {
partsum += p[i + j];
}
if (partsum > maxsum)
maxsum = partsum;
}
cout << setprecision(10) << (maxsum + K) / 2.0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
int maxsum = 0;
for (int j = 0; j < K; j++) {
maxsum += p[j];
}
int partsum = maxsum;
for (int i = 0; i < N - K; i++) {
partsum += p[i + K] - p[i];
if (partsum > maxsum)
maxsum = partsum;
}
cout << setprecision(10) << (maxsum + K) / 2.0 << endl;
} | replace | 11 | 16 | 11 | 17 | TLE | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long int n, k;
double ans = 0;
cin >> n >> k;
vector<double> a(n), b(n), c(n - k + 1, 0.0); /*期待値の配列b*/
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = (a[i] + 1) / 2;
}
for (int i = 0; i < k; i++) {
c[0] += b[i];
}
for (int i = 1; i < n - k + 1; ++i) {
c[i] = c[i - 1] - b[i - 1] + b[i + k - 1];
}
for (int i = 0; i < n; i++) {
ans = max(ans, c[i]);
}
cout << fixed << setprecision(12) << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long int n, k;
double ans = 0;
cin >> n >> k;
vector<double> a(n), b(n), c(n, 0.0); /*期待値の配列b*/
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = (a[i] + 1) / 2;
}
for (int i = 0; i < k; i++) {
c[0] += b[i];
}
for (int i = 1; i < n - k + 1; ++i) {
c[i] = c[i - 1] - b[i - 1] + b[i + k - 1];
}
for (int i = 0; i < n; i++) {
ans = max(ans, c[i]);
}
cout << fixed << setprecision(12) << ans << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int n, k;
cin >> n >> k;
vector<int> p;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
p.push_back(tmp);
}
map<int, double> m;
for (int i = 1; i <= 1000; i++)
m[i] = (i + 1) / 2.0;
double mx = 0;
for (int i = 0; i + k - 1 < n; i++) {
double tmp = 0;
for (int j = i; j <= i + k - 1; j++) {
tmp += m[p[j]];
}
mx = max(tmp, mx);
}
printf("%.10f\n", mx);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int n, k;
cin >> n >> k;
vector<int> p;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
p.push_back(tmp);
}
map<int, double> m;
for (int i = 1; i <= 1000; i++)
m[i] = (i + 1) / 2.0;
double mx = 0;
for (int j = 0; j < k; j++) {
mx += m[p[j]];
}
double prev = mx;
for (int j = 1; j + k - 1 < n; j++) {
double now = prev - m[p[j - 1]] + m[p[j + k - 1]];
mx = max(now, mx);
prev = now;
}
printf("%.10f\n", mx);
} | replace | 26 | 32 | 26 | 34 | TLE | |
p02780 | C++ | Runtime Error | #include <iomanip>
#include <iostream>
using namespace std;
const int LEN = 2e5 + 10;
int p[LEN];
double sum[LEN];
int main() {
int N, K;
double ans = 0.0;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> p[i];
sum[i] = sum[i - 1] + (1.0 + p[i]) / 2;
}
for (int i = 1; i <= N; i++) {
ans = max(ans, sum[K + i - 1] - sum[i - 1]);
}
cout << fixed << setprecision(12) << ans << endl;
return 0;
} | #include <iomanip>
#include <iostream>
using namespace std;
const int LEN = 2e5 + 10;
int p[LEN];
double sum[LEN];
int main() {
int N, K;
double ans = 0.0;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> p[i];
sum[i] = sum[i - 1] + (1.0 + p[i]) / 2;
}
for (int i = 0; i <= N - K; i++) {
ans = max(ans, sum[K + i] - sum[i]);
}
cout << fixed << setprecision(12) << ans << endl;
return 0;
} | replace | 16 | 18 | 16 | 18 | 0 | |
p02780 | C++ | Runtime Error | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
// a>b -> a==b;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// a<b -> a==b;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(void) {
long long N, K, i, p[200001], sum = 0, sum_max = 0, maxi = 0;
double a, ans = 0;
cin >> N >> K;
for (i = 1; i <= N; i++) {
cin >> p[i];
}
// sumの初期化
for (i = 1; i <= K; i++) {
sum += p[i];
if (sum > sum_max) {
sum_max = sum;
maxi = i;
}
}
if (K < N) {
for (i = K + 1; i <= N; i++) {
sum -= p[i - K];
sum += p[i];
if (sum > sum_max) {
sum_max = sum;
maxi = i - K + 1;
}
}
}
for (i = maxi; i <= maxi + K - 1; i++) {
a = (double)(1 + p[i]) / 2;
ans += a;
}
cout << setprecision(20) << ans << endl;
return 0;
} | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
// a>b -> a==b;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// a<b -> a==b;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(void) {
long long N, K, i, p[200001], sum = 0, sum_max = 0, maxi = 0;
double a, ans = 0;
cin >> N >> K;
for (i = 1; i <= N; i++) {
cin >> p[i];
}
// sumの初期化
for (i = 1; i <= K; i++) {
sum += p[i];
if (sum > sum_max) {
sum_max = sum;
maxi = i;
}
}
if (K < N) {
for (i = K + 1; i <= N; i++) {
sum -= p[i - K];
sum += p[i];
if (sum > sum_max) {
sum_max = sum;
maxi = i - K + 1;
}
}
} else {
maxi = 1;
}
for (i = maxi; i <= maxi + K - 1; i++) {
a = (double)(1 + p[i]) / 2;
ans += a;
}
cout << setprecision(20) << ans << endl;
return 0;
} | insert | 58 | 58 | 58 | 60 | 0 | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
#define S second
#define int long long
using namespace std;
int x[1000000];
signed main() {
int a, b, ans = 0;
cin >> a >> b;
f(i, a) {
cin >> x[i + 1];
x[i + 1] += x[i];
}
for (int i = b; i <= a; i++) {
ans = max(x[i] - x[i - b], ans);
}
printf("%.100LF\n", (ans + b) / 2.0);
}
| #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
#define S second
#define int long long
using namespace std;
int x[1000000];
signed main() {
int a, b, ans = 0;
cin >> a >> b;
f(i, a) {
cin >> x[i + 1];
x[i + 1] += x[i];
}
for (int i = b; i <= a; i++) {
ans = max(x[i] - x[i - b], ans);
}
printf("%.100lf\n", (ans + b) / 2.0);
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
double p[N];
double expect[N];
for (int i = 0; i < N; i++)
cin >> p[i];
for (int i = 0; i < N; i++) {
double tmp = 0.0;
for (int j = 0; j < p[i]; j++) {
tmp += (j + 1) / p[i];
}
expect[i] = tmp;
}
double ans = 0;
for (int i = 0; i <= N - K; i++) {
double tmp2 = 0.0;
for (int j = 0; j < K; j++) {
tmp2 += expect[i + j];
}
ans = max(ans, tmp2);
}
printf("%.10f", ans);
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
double p[N];
double expect[N];
for (int i = 0; i < N; i++)
cin >> p[i];
for (int i = 0; i < N; i++) {
double tmp = 0.0;
for (int j = 0; j < p[i]; j++) {
tmp += (j + 1) / p[i];
}
expect[i] = tmp;
}
double ans = 0;
double comsum[N + 1];
comsum[0] = 0.0;
for (int i = 0; i < N; i++) {
comsum[i + 1] = comsum[i] + expect[i];
}
for (int i = K; i <= N; i++) {
double tmp2 = comsum[i] - comsum[i - K];
ans = max(ans, tmp2);
}
printf("%.10f", ans);
}
| replace | 28 | 33 | 28 | 36 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int N, K;
double arr[200000];
double ans = 0;
scanf("%d %d", &N, &K);
for (int i = 0; i < N; i++) {
double num;
scanf("%lf", &num);
arr[i] = (1.0 + num) / 2;
}
for (int i = 0; i < N - K + 1; i++) {
double ret = 0;
for (int j = i; j < i + K; j++) {
ret += arr[j];
}
ans = max(ans, ret);
}
printf("%lf\n", ans);
} | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int N, K;
double arr[200000];
double ans = 0;
scanf("%d %d", &N, &K);
for (int i = 0; i < N; i++) {
double num;
scanf("%lf", &num);
arr[i] = (1.0 + num) / 2;
}
double ret = 0;
for (int i = 0; i < K; i++) {
ret += arr[i];
}
ans = max(ans, ret);
for (int i = K; i < N; i++) {
ret += (arr[i] - arr[i - K]);
ans = max(ans, ret);
}
printf("%lf\n", ans);
} | replace | 14 | 20 | 14 | 21 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double p[n], ans = 0;
for (int i = 0; i < n; i++) {
double a;
cin >> a;
p[i] = (a + 1) / 2;
}
for (int i = 0; i <= n - k; i++) {
double cnt = 0;
for (int j = i; j < i + k; j++) {
cnt += p[j];
}
ans = max(ans, cnt);
}
cout << fixed << setprecision(10) << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double p[n], ans = 0;
for (int i = 0; i < n; i++) {
double a;
cin >> a;
p[i] = (a + 1) / 2;
}
double q[n + 1];
q[0] = 0;
for (int i = 0; i < n; i++)
q[i + 1] = q[i] + p[i];
for (int i = 0; i + k <= n; i++) {
ans = max(q[i + k] - q[i], ans);
}
cout << fixed << setprecision(10) << ans << endl;
} | replace | 12 | 18 | 12 | 18 | TLE | |
p02780 | C++ | Time Limit Exceeded | // g++ -std=c++14 test.cpp -o test.out
#include <algorithm>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
int N, K;
int p[200000];
double ans = 0;
double dice_expected[200000];
void solve() {
// 各サイコロについて期待値を求める
for (int i = 0; i < N; i++) {
dice_expected[i] = (p[i] + 1) * p[i] / 2;
dice_expected[i] = (dice_expected[i] / (double)p[i]);
}
// それからどの隣接するK個のサイコロがいいかを調べる
for (int i = 0; i <= N - K; i++) {
double expected_sum = 0;
for (int k = i; k < i + K; k++) {
double expected = 0;
expected_sum += dice_expected[k];
}
if (ans < expected_sum)
ans = expected_sum;
}
}
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> p[i];
solve();
cout << fixed << setprecision(10) << ans << endl;
return 0;
}
| // g++ -std=c++14 test.cpp -o test.out
#include <algorithm>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
int N, K;
int p[200000];
double ans = 0;
double dice_expected[200000];
void solve() {
// 各サイコロについて期待値を求める
for (int i = 0; i < N; i++) {
dice_expected[i] = (p[i] + 1) * p[i] / 2;
dice_expected[i] = (dice_expected[i] / (double)p[i]);
}
// それからどの隣接するK個のサイコロがいいかを調べる
double expected_sum = 0;
for (int i = 0; i < K; i++) {
expected_sum += dice_expected[i];
}
ans = expected_sum;
for (int i = K; i < N; i++) {
expected_sum -= dice_expected[i - K];
expected_sum += dice_expected[i];
if (expected_sum > ans)
ans = expected_sum;
}
}
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> p[i];
solve();
cout << fixed << setprecision(10) << ans << endl;
return 0;
}
| replace | 30 | 37 | 30 | 39 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<double> p(N);
for (int i = 0; i < N; i++)
cin >> p.at(i);
vector<double> kitai(N - K + 1, 0.0);
for (int i = 0; i < kitai.size(); i++) {
for (int j = 0; j < K; j++) {
kitai.at(i) += (p.at(i + j) + 1) / 2;
}
}
double ans = 0.0;
for (auto i : kitai) {
if (i > ans)
ans = i;
}
cout << fixed << setprecision(10);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<double> p(N);
for (int i = 0; i < N; i++)
cin >> p.at(i);
vector<double> kitai(N - K + 1, 0.0);
for (int i = 0; i < K; i++) {
kitai.at(0) += (p.at(i) + 1) / 2;
}
for (int i = 1; i < kitai.size(); i++) {
kitai.at(i) =
kitai.at(i - 1) + (p.at(i + K - 1) + 1) / 2 - (p.at(i - 1) + 1) / 2;
}
double ans = 0.0;
for (auto i : kitai) {
if (i > ans)
ans = i;
}
cout << fixed << setprecision(10);
cout << ans << endl;
return 0;
} | replace | 11 | 15 | 11 | 18 | TLE | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
template <class T, class C> void chmax(T &a, C b) { a > b ?: a = b; }
template <class T, class C> void chmin(T &a, C b) { a < b ?: a = b; }
int main(int argc, char *argv[]) {
int n, k;
cin >> n >> k;
vector<double> p(n);
rep(i, n) cin >> p[i];
vector<double> r(n + 1);
r[0] = 0;
double ans = 0;
for (int i = 1; i < n + 1; i++) {
r[i] = 1 / 2.0 * (p[i - 1] + 1);
}
for (int i = 1; i < n + 1; i++) {
r[i] += r[i - 1];
}
for (int i = 1; i < n + 1; i++) {
double e;
e = r[i + k - 1] - r[i - 1];
if (ans < e)
ans = e;
}
cout << setprecision(10) << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
template <class T, class C> void chmax(T &a, C b) { a > b ?: a = b; }
template <class T, class C> void chmin(T &a, C b) { a < b ?: a = b; }
int main(int argc, char *argv[]) {
int n, k;
cin >> n >> k;
vector<double> p(n);
rep(i, n) cin >> p[i];
vector<double> r(n + 1);
r[0] = 0;
double ans = 0;
for (int i = 1; i < n + 1; i++) {
r[i] = 1 / 2.0 * (p[i - 1] + 1);
}
for (int i = 1; i < n + 1; i++) {
r[i] += r[i - 1];
}
for (int i = 1; i < n - k + 2; i++) {
double e;
e = r[i + k - 1] - r[i - 1];
if (ans < e)
ans = e;
}
cout << setprecision(10) << ans << endl;
return 0;
}
| replace | 26 | 27 | 26 | 27 | 0 | |
p02780 | C++ | Time Limit Exceeded | // p面体サイコロの期待値
// (p+1)/2 // 7なら4 // 6なら3.5
// 期待値の配列を用意
// vector<int> exp(n);
// 連続するK個の合計期待値は、
// exp(0)+exp(1)+...+exp(K-1)
// から始まって、K-1=Nとなるまで、異なる選び方ができる
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
int num = 0;
cin >> N >> K;
vector<double> vec(N);
for (int i = 0; i < N; i++) {
cin >> num;
vec.at(i) = ((double)num + 1) / 2;
}
double sum = 0.0;
double maxExp = 0.0;
for (int i = 0; i + K <= N; i++) {
sum = 0.0;
for (int j = i; j < i + K; j++) {
sum += vec.at(j);
}
if (sum > maxExp) {
maxExp = sum;
}
}
cout << fixed << setprecision(12) << maxExp << endl;
return 0;
} | // p面体サイコロの期待値
// (p+1)/2 // 7なら4 // 6なら3.5
// 期待値の配列を用意
// vector<int> exp(n);
// 連続するK個の合計期待値は、
// exp(0)+exp(1)+...+exp(K-1)
// から始まって、K-1=Nとなるまで、異なる選び方ができる
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
int num = 0;
cin >> N >> K;
vector<double> vec(N);
for (int i = 0; i < N; i++) {
cin >> num;
vec.at(i) = ((double)num + 1) / 2;
}
double sum = 0.0;
double maxExp = 0.0;
for (int i = 0; i < K; i++) {
sum += vec.at(i);
}
maxExp = sum;
if (N > 1) {
for (int i = 0; i < N - K; i++) {
sum = sum - vec.at(i) + vec.at(i + K);
if (sum > maxExp) {
maxExp = sum;
}
}
}
cout << fixed << setprecision(12) << maxExp << endl;
return 0;
} | replace | 27 | 34 | 27 | 38 | TLE | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i <= n; i++)
#define repk(i, m, n) for (ll i = m; i < n; i++)
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define F first
#define S second
typedef long long ll;
typedef long double ld;
using namespace std;
const int MOD = 1e9 + 7;
ll sum[200005] = {0};
int main() {
ll n, k, temp, maxx = 0;
cin >> n >> k;
rep1(i, n) {
cin >> temp;
sum[i] = sum[i - 1] + temp;
}
rep(i, k + 1) { maxx = max(maxx, sum[i + k] - sum[i]); }
maxx += k;
cout << maxx / 2;
if (maxx % 2 == 1)
cout << ".5";
}
| #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i <= n; i++)
#define repk(i, m, n) for (ll i = m; i < n; i++)
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define F first
#define S second
typedef long long ll;
typedef long double ld;
using namespace std;
const int MOD = 1e9 + 7;
ll sum[200005] = {0};
int main() {
ll n, k, temp, maxx = 0;
cin >> n >> k;
rep1(i, n) {
cin >> temp;
sum[i] = sum[i - 1] + temp;
}
rep(i, n - k + 1) { maxx = max(maxx, sum[i + k] - sum[i]); }
maxx += k;
cout << maxx / 2;
if (maxx % 2 == 1)
cout << ".5";
}
| replace | 21 | 22 | 21 | 22 | 0 | |
p02780 | C++ | Runtime Error | //
// main.cpp
// atcoder
//
// Created by Hisaki Kobayashi on 2020/04/14.
// Copyright © 2020 Hisaki Kobayashi. All rights reserved.
//
#include <bits/stdc++.h>
#include <bitset>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
typedef long long ll;
using namespace std;
int main(int argc, const char *argv[]) {
// input from txt （提出時にこの箇所は削除すること）
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
ll N, K;
cin >> N >> K;
vector<double> s(N + 1);
s[0] = 0;
vector<double> p(N + 1);
p[0] = 0;
for (ll i = 0; i < N; i++) {
cin >> p[i + 1];
s[i + 1] = s[i] + p[i + 1];
}
ll max_expect = 0;
ll i_save = 0;
;
for (ll i = 1; i <= N - K + 1; i++) {
if (max_expect < s[i + K - 1] - s[i - 1]) {
max_expect = s[i + K - 1] - s[i - 1];
i_save = i;
}
}
double sum = 0.0;
for (ll i = 0; i < K; i++) {
// cout << "p[i_save] : " << p[i_save+i] << endl;
// sum += (p[i_save+i] + 1.0) / 2.0;
sum += p[i_save + i] + 1.0;
}
sum /= 2.0;
cout << setprecision(10) << sum << endl;
// cout << "save_i : " << i_save << endl;
return 0;
}
| //
// main.cpp
// atcoder
//
// Created by Hisaki Kobayashi on 2020/04/14.
// Copyright © 2020 Hisaki Kobayashi. All rights reserved.
//
#include <bits/stdc++.h>
#include <bitset>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
typedef long long ll;
using namespace std;
int main(int argc, const char *argv[]) {
// // input from txt （提出時にこの箇所は削除すること）
// std::ifstream in("input.txt");
// std::cin.rdbuf(in.rdbuf());
//
ll N, K;
cin >> N >> K;
vector<double> s(N + 1);
s[0] = 0;
vector<double> p(N + 1);
p[0] = 0;
for (ll i = 0; i < N; i++) {
cin >> p[i + 1];
s[i + 1] = s[i] + p[i + 1];
}
ll max_expect = 0;
ll i_save = 0;
;
for (ll i = 1; i <= N - K + 1; i++) {
if (max_expect < s[i + K - 1] - s[i - 1]) {
max_expect = s[i + K - 1] - s[i - 1];
i_save = i;
}
}
double sum = 0.0;
for (ll i = 0; i < K; i++) {
// cout << "p[i_save] : " << p[i_save+i] << endl;
// sum += (p[i_save+i] + 1.0) / 2.0;
sum += p[i_save + i] + 1.0;
}
sum /= 2.0;
cout << setprecision(10) << sum << endl;
// cout << "save_i : " << i_save << endl;
return 0;
}
| replace | 19 | 23 | 19 | 23 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int N, K;
cin >> N >> K;
vector<int> P(N);
rep(i, N) cin >> P[i];
long double res = 0;
rep(i, N - K + 1) {
long double sum = 0;
for (int j = i; j < i + K; j++) {
long long d = P[j] * (P[j] + 1) / 2;
sum += d / (long double)P[j];
}
res = max(res, sum);
}
cout << setprecision(12) << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int N, K;
cin >> N >> K;
vector<int> P(N);
rep(i, N) cin >> P[i];
vector<long double> D(N);
rep(i, N) {
long long d = P[i] * (P[i] + 1) / 2;
D[i] = d / (long double)P[i];
}
long double sum = 0;
rep(i, K) sum += D[i];
long double res = sum;
rep(i, N - K) {
sum += D[i + K];
sum -= D[i];
res = max(res, sum);
}
cout << setprecision(12) << res << endl;
return 0;
} | replace | 10 | 17 | 10 | 21 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k;
cin >> n >> k;
long double a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
long double ans = 0, temp = 0;
for (int j = 0; j < n - k + 1; j++) {
temp = 0;
for (int i = 0; i < k; i++) {
temp += (a[i + j] / 2) + 0.5;
}
ans = max(temp, ans);
}
cout << fixed << setprecision(12);
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k;
cin >> n >> k;
long double a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
long double ans = 0, temp = 0;
for (int i = 0; i < k; i++) {
ans += (a[i] / 2) + 0.5;
}
temp = ans;
for (int i = k; i < n; i++) {
temp -= (a[i - k] / 2) + 0.5;
temp += (a[i] / 2) + 0.5;
ans = max(temp, ans);
}
cout << fixed << setprecision(12);
cout << ans;
return 0;
}
| replace | 13 | 18 | 13 | 20 | TLE | |
p02780 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, k;
double expect[1005];
cin >> n >> k;
for (int i = 0; i < n; i++) {
int data;
cin >> data;
expect[i] = (data + 1) / 2.0;
}
// 左からk個のサイコロの期待値を計算する
double sum = 0;
for (int i = 0; i < k; i++) {
sum += expect[i];
}
// 左のサイコロを引き、右のサイコロを足しながらiを進める
double maxim = sum;
for (int i = 0; i < n - k; i++) {
sum = sum - expect[i] + expect[i + k];
maxim = max(maxim, sum);
}
printf("%lf\n", maxim);
return (0);
} | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, k;
double expect[200005];
cin >> n >> k;
for (int i = 0; i < n; i++) {
int data;
cin >> data;
expect[i] = (data + 1) / 2.0;
}
// 左からk個のサイコロの期待値を計算する
double sum = 0;
for (int i = 0; i < k; i++) {
sum += expect[i];
}
// 左のサイコロを引き、右のサイコロを足しながらiを進める
double maxim = sum;
for (int i = 0; i < n - k; i++) {
sum = sum - expect[i] + expect[i + k];
maxim = max(maxim, sum);
}
printf("%lf\n", maxim);
return (0);
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02780 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, K;
double p[1000];
cin >> N >> K;
double total = 0;
for (int i = 0; i < N; ++i) {
int tmp;
cin >> tmp;
p[i] = (double)(1 + tmp) / 2;
if (i < K)
total += p[i];
}
double maxTotal = total;
for (int i = K; i < N; ++i) {
total = total - p[i - K] + p[i];
if (maxTotal < total)
maxTotal = total;
}
printf("%10.10lf", maxTotal);
return 0;
}
| #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, K;
double *p;
p = new double[200000];
cin >> N >> K;
double total = 0;
for (int i = 0; i < N; ++i) {
int tmp;
cin >> tmp;
p[i] = (double)(1 + tmp) / 2;
if (i < K)
total += p[i];
}
double maxTotal = total;
for (int i = K; i < N; ++i) {
total = total - p[i - K] + p[i];
if (maxTotal < total)
maxTotal = total;
}
printf("%10.10lf", maxTotal);
return 0;
}
| replace | 6 | 7 | 6 | 8 | 0 | |
p02780 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 1; i <= n; ++i)
#define all(x) begin(x), end(x)
typedef long long ll;
typedef pair<int, int> ip;
typedef pair<ll, ll> lp;
const int inf = 1001001000;
const ll INF = 1LL << 60;
const int MOD = (int)1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
vector<double> exp(N);
rep(i, N) {
double t;
cin >> t;
exp[i] = t * (t + 1) / 2 / t;
}
double ans = 0;
rep(i, N) exp[i + 1] += exp[i];
ans = exp[K - 1];
for (int i = K; i < N; ++i) {
ans = max(ans, exp[i] - exp[i - K]);
}
cout << fixed << setprecision(10) << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 1; i <= n; ++i)
#define all(x) begin(x), end(x)
typedef long long ll;
typedef pair<int, int> ip;
typedef pair<ll, ll> lp;
const int inf = 1001001000;
const ll INF = 1LL << 60;
const int MOD = (int)1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
vector<double> exp(N);
rep(i, N) {
double t;
cin >> t;
exp[i] = t * (t + 1) / 2 / t;
}
double ans = 0;
rep(i, N - 1) exp[i + 1] += exp[i];
ans = exp[K - 1];
for (int i = K; i < N; ++i) {
ans = max(ans, exp[i] - exp[i - K]);
}
cout << fixed << setprecision(10) << ans << endl;
return 0;
} | replace | 35 | 36 | 35 | 36 | 0 | |
p02780 | C++ | Time Limit Exceeded | // g++ -std=gnu++1y -O2 xxx.cpp
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int K, N;
cin >> K >> N;
vector<int> pi(K);
vector<double> e(K);
vector<double> sum(K);
for (int i = 0; i < K; i++) {
cin >> pi[i];
}
// 期待値計算
for (int i = 0; i < K; i++) {
e[i] = (1.0 / pi[i]) * (1.0 / 2.0) * (pi[i] + 1) * (pi[i] + 1 - 1);
// cout << e[i] << " ";
}
for (int i = 0; i <= K - N; i++) {
for (int j = 0; j < N; j++) {
sum[i] += e[i + j];
}
}
sort(sum.begin(), sum.end(), greater<int>());
cout << setprecision(16) << sum[0] << endl;
return 0;
} | // g++ -std=gnu++1y -O2 xxx.cpp
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int K, N;
cin >> K >> N;
vector<int> pi(K);
vector<double> e(K);
vector<double> sum(K);
for (int i = 0; i < K; i++) {
cin >> pi[i];
}
// 期待値計算
for (int i = 0; i < K; i++) {
e[i] = (1.0 / pi[i]) * (1.0 / 2.0) * (pi[i] + 1) * (pi[i] + 1 - 1);
// cout << e[i] << " ";
}
for (int j = 0; j < N; j++) {
sum[0] += e[0 + j];
}
for (int i = 1; i <= K - N; i++) {
sum[i] = sum[i - 1] - e[i - 1] + e[i + N - 1];
}
sort(sum.begin(), sum.end(), greater<int>());
cout << setprecision(16) << sum[0] << endl;
return 0;
} | replace | 25 | 29 | 25 | 31 | TLE | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2e2 + 10;
typedef long long ll;
int a[N];
ll sum[N];
int cmp(int a, int b) { return a > b; }
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (i != 0)
sum[i] = sum[i - 1] + a[i];
else
sum[i] = a[i];
}
double d = 0;
for (int i = k; i <= n; i++) {
double t = sum[i] - sum[i - k];
d = max((t + k) / 2, d);
}
printf("%.9lf", d);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
typedef long long ll;
int a[N];
ll sum[N];
int cmp(int a, int b) { return a > b; }
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (i != 0)
sum[i] = sum[i - 1] + a[i];
else
sum[i] = a[i];
}
double d = 0;
for (int i = k; i <= n; i++) {
double t = sum[i] - sum[i - k];
d = max((t + k) / 2, d);
}
printf("%.9lf", d);
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
int n, k;
cin >> n >> k;
vector<double> ev(n);
rep(i, n) {
cin >> ev[i];
ev[i] = (1 + ev[i]) / (double)2;
}
int l;
double ans = 0.0, tmp = 0.0;
rep(i, n) {
if (i - l < k) {
tmp += ev[i];
} else {
tmp -= ev[l];
tmp += ev[i];
l++;
}
ans = max(ans, tmp);
}
printf("%.12f\n", ans);
}
| #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
int n, k;
cin >> n >> k;
vector<double> ev(n);
rep(i, n) {
cin >> ev[i];
ev[i] = (1 + ev[i]) / (double)2;
}
int l = 0;
double ans = 0.0, tmp = 0.0;
rep(i, n) {
if (i - l < k) {
tmp += ev[i];
} else {
tmp -= ev[l];
tmp += ev[i];
l++;
}
ans = max(ans, tmp);
}
printf("%.12f\n", ans);
}
| replace | 16 | 17 | 16 | 17 | -11 | |
p02780 | C++ | Runtime Error | #include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double *p = new double[n];
double *E = new double[n];
double sum = 0;
double maxsum = 0;
for (int i = 0; i < n; i++) {
scanf("%d", p[i]);
}
for (int i = 0; i < n; i++) {
E[i] = (1 + p[i]) / 2;
}
for (int i = 0; i < k; i++) {
sum += E[i];
}
maxsum = sum;
for (int i = 0; i < n - k; i++) {
sum = sum - E[i] + E[i + k];
maxsum = max(maxsum, sum);
}
cout << setprecision(10) << maxsum << endl;
delete[] p, E;
return 0;
} | #include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double *p = new double[n];
double *E = new double[n];
double sum = 0;
double maxsum = 0;
for (int i = 0; i < n; i++) {
scanf("%lf", &p[i]);
}
for (int i = 0; i < n; i++) {
E[i] = (1 + p[i]) / 2;
}
for (int i = 0; i < k; i++) {
sum += E[i];
}
maxsum = sum;
for (int i = 0; i < n - k; i++) {
sum = sum - E[i] + E[i + k];
maxsum = max(maxsum, sum);
}
cout << setprecision(10) << maxsum << endl;
delete[] p, E;
return 0;
} | replace | 13 | 14 | 13 | 14 | -11 | |
p02780 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <deque>
#include <float.h>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define LL long long
#define pii pair<int, int>
#define pLL pair<LL, LL>
#define mp make_pair
#define mt make_tuple
#define pq priority_queue<LL>
#define pqg priority_queue<LL, vector<LL>, greater<LL>>
#define pb push_back
#define vecLL vector<LL>
#define vecpii vector<pii>
#define vecpLL vector<pLL>
#define vecbL vector<bool>
#define endl "\n"
#define REP(e, v) for (auto e : v)
#define rep(i, a, n) for (LL i = a; i < n; i++)
#define INF LLONG_MAX / 2
#define DINF DBL_MAX / 2
using namespace std;
/*↓マイライブラリ↓*/
// clock_t start = clock();
//
// clock_t end = clock();
//
// const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC *
// 1000.0; printf("time %lf[ms]\n", time);
LL linp() {
LL x;
scanf("%lld", &x);
return x;
}
LL mod(LL i) {
LL mi = i % 1000000007;
if (mi < 0)
mi += 1000000007;
return mi;
}
LL gcd(LL i, LL j) {
if (j != 0)
return gcd(j, i % j);
else
return i;
}
pLL extgcd(LL a, LL b) { // ax+by = 1の解
pLL ans;
if (b != 0) {
pLL next = extgcd(b, a % b);
ans.first = next.second;
ans.second = next.first - (a / b) * next.second;
} else {
ans = pLL(1, 0);
}
return ans;
}
LL division(LL a, LL b, LL m) { return mod(mod(a) * mod(extgcd(b, m).first)); }
LL numperm_mod(LL x, LL y) {
LL res = 1;
for (LL i = x; i >= y; i--) {
res = mod(res * mod(i));
}
return mod(res);
}
LL numperm(LL x, LL y) {
LL res = 1;
for (LL i = x; i >= y; i--) {
res *= i;
}
return res;
}
LL pow_mod(LL x, LL y) {
x = mod(x);
if (y == 1) {
return mod(x);
}
LL res = mod(pow_mod(mod(x * x), y / 2));
if (y % 2 == 0) {
return res;
} else {
return mod(x * res);
}
}
LL pow(LL x, LL y) {
if (y == 1) {
return x;
}
if (y % 2 == 0) {
return pow(x * x, y / 2);
} else {
return x * pow(x * x, y / 2);
}
}
vecLL Eratosthenes(LL n) { // 素数のベクトルを返す
bool isPrime[n];
fill(isPrime, isPrime + n, true);
isPrime[0] = isPrime[1] = false;
rep(i, 2, sqrt(n) + 1) {
if (isPrime[i]) {
for (LL j = 2 * i; j <= n; j += i) {
isPrime[j] = false;
}
}
}
vecLL P;
rep(i, 2, n + 1) {
if (isPrime[i]) {
P.push_back(i);
}
}
return P;
}
struct edge { // 枝
LL to, cost;
double dcost; // コストが整数でない場合に使う
};
struct vertex { // 頂点(枝付き)
LL key;
double dkey; // キーが整数でない場合に使う
vector<edge> edges; // 頂点から伸びる枝
};
class Graph {
public:
LL V; // 頂点数
vertex *vertices; // グラフ
Graph(LL v) { // 頂点数を指定してグラフの初期化
V = v; // 頂点数
vertices = new vertex[V]; // 頂点集合
rep(i, 0, V) {
vertices[i].key = -1; // キー初期値は-1
vertices[i].dkey = -1; // キー初期値は-1
}
}
void setDE(LL i, LL j, LL cos) { // i→jにコストcosの有向枝を加える
edge e;
e.to = j;
e.cost = cos;
vertices[i].edges.push_back(e);
return;
}
void setDE(LL i, LL j, double dcos) { // i→jにコストcosの有向枝を加える
edge e;
e.to = j;
e.dcost = dcos;
vertices[i].edges.push_back(e);
return;
}
void setUDE(LL i, LL j, LL cos) { //(i,j)にコストcosの無向枝を加える
edge ei, ej;
ei.to = j;
ej.to = i;
ei.cost = ej.cost = cos;
vertices[i].edges.push_back(ei);
vertices[j].edges.push_back(ej);
return;
}
void setUDE(LL i, LL j, double dcos) { //(i,j)にコストcosの無向枝を加える
edge ei, ej;
ei.to = j;
ej.to = i;
ei.dcost = ej.dcost = dcos;
vertices[i].edges.push_back(ei);
vertices[j].edges.push_back(ej);
return;
}
void setKey(LL i, LL newKey) { // キー変更
vertices[i].key = newKey;
}
void setKey(LL i, double newKey) { // キー変更
vertices[i].key = newKey;
}
edge getEdge(LL i, LL j) {
rep(a, 0, vertices[i].edges.size()) {
if (vertices[i].edges[a].to == j) {
return vertices[i].edges[a];
}
}
return (edge){j, INF, DINF}; // なければ,コストINFの枝を返す
}
void bellman_ford(LL s, LL b[]) {
fill(b, b + V, INF);
b[s] = 0;
while (true) {
bool update = false;
rep(i, 0, V) {
rep(j, 0, vertices[i].edges.size()) {
edge e = vertices[i].edges[j];
if (b[e.to] > b[i] + e.cost) {
b[e.to] = b[i] + e.cost;
update = true;
}
}
}
if (!update)
break;
}
return;
}
void
dijkstra(LL s,
LL d[]) { // ダイクストラ(始点を入力とし、各点への最小距離を返す)
priority_queue<pLL, vector<pLL>, greater<pLL>> que;
fill(d, d + V, INF);
d[s] = 0;
que.push(pLL(0, s));
while (!que.empty()) {
pLL p = que.top();
que.pop();
LL v = p.second;
if (d[v] < p.first)
continue;
rep(i, 0, vertices[v].edges.size()) {
edge e = vertices[v].edges[i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(pLL(d[e.to], e.to));
}
}
}
return;
}
void warshall_floyd(LL **w) {
rep(i, 0, V) {
rep(j, 0, V) { w[i][j] = INF; }
}
rep(i, 0, V) {
rep(j, 0, vertices[i].edges.size()) {
w[i][vertices[i].edges[j].to] = vertices[i].edges[j].cost;
}
}
rep(i, 0, V) { w[i][i] = 0; }
rep(i, 0, V) {
rep(j, 0, V) {
rep(k, 0, V) { w[i][j] = min(w[i][j], w[i][k] + w[k][j]); }
}
}
}
};
class UF {
public:
LL N;
LL *par;
LL *rank;
UF(LL n) {
N = n;
par = new LL[N];
rank = new LL[N];
rep(i, 0, N) {
par[i] = i;
rank[i] = i;
}
return;
}
LL root(LL x) {
if (x == par[x])
return x;
else
return par[x] = root(par[x]);
}
bool same(LL x, LL y) { return (root(x) == root(y)); }
void Union(LL x, LL y) {
LL rtx = root(x);
LL rty = root(y);
if (rank[rtx] < rank[rty]) {
par[rtx] = rty;
} else {
par[rty] = rtx;
if (rank[rtx] == rank[rty]) {
rank[rtx]++;
}
}
}
};
class ST {};
/*↑マイライブラリ↑*/
LL solveA() {
string S, T;
LL A, B;
string U;
cin >> S >> T;
cin >> A >> B;
cin >> U;
if (S == U) {
cout << A - 1 << " " << B << endl;
} else {
cout << A << " " << B - 1 << endl;
}
return 0;
}
LL solveB() {
string S;
cin >> S;
rep(i, 0, S.length()) { cout << "x"; }
return 0;
}
LL solveC() {
LL N;
cin >> N;
set<LL> A;
rep(i, 0, N) {
LL x = linp();
if (A.find(x) != A.end()) {
cout << "NO" << endl;
return 0;
} else {
A.insert(x);
}
}
cout << "YES" << endl;
return 0;
}
LL solveD() {
LL N, K;
cin >> N >> K;
double ans = 0;
LL sum[N + 1];
sum[0] = 0;
LL p[N + 1];
rep(i, 1, N + 1) {
cin >> p[i];
sum[i] += p[i] + sum[i - 1];
}
LL ma;
LL low, up;
ma = 0;
for (LL i = 0; i + K < N + 1; i++) {
if (ma < sum[i + K] - sum[i]) {
ma = sum[i + K] - sum[i];
up = i + K + 1;
low = i + 1;
}
}
rep(i, low, up) { ans += (double)((p[i] * (p[i] + 1)) / 2) / p[i]; }
printf("%.8f", ans);
return 0;
}
LL solveE() { return 0; }
signed main() {
// solveA();
// solveB();
// solveC();
solveD();
// solveE();
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <cmath>
#include <deque>
#include <float.h>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define LL long long
#define pii pair<int, int>
#define pLL pair<LL, LL>
#define mp make_pair
#define mt make_tuple
#define pq priority_queue<LL>
#define pqg priority_queue<LL, vector<LL>, greater<LL>>
#define pb push_back
#define vecLL vector<LL>
#define vecpii vector<pii>
#define vecpLL vector<pLL>
#define vecbL vector<bool>
#define endl "\n"
#define REP(e, v) for (auto e : v)
#define rep(i, a, n) for (LL i = a; i < n; i++)
#define INF LLONG_MAX / 2
#define DINF DBL_MAX / 2
using namespace std;
/*↓マイライブラリ↓*/
// clock_t start = clock();
//
// clock_t end = clock();
//
// const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC *
// 1000.0; printf("time %lf[ms]\n", time);
LL linp() {
LL x;
scanf("%lld", &x);
return x;
}
LL mod(LL i) {
LL mi = i % 1000000007;
if (mi < 0)
mi += 1000000007;
return mi;
}
LL gcd(LL i, LL j) {
if (j != 0)
return gcd(j, i % j);
else
return i;
}
pLL extgcd(LL a, LL b) { // ax+by = 1の解
pLL ans;
if (b != 0) {
pLL next = extgcd(b, a % b);
ans.first = next.second;
ans.second = next.first - (a / b) * next.second;
} else {
ans = pLL(1, 0);
}
return ans;
}
LL division(LL a, LL b, LL m) { return mod(mod(a) * mod(extgcd(b, m).first)); }
LL numperm_mod(LL x, LL y) {
LL res = 1;
for (LL i = x; i >= y; i--) {
res = mod(res * mod(i));
}
return mod(res);
}
LL numperm(LL x, LL y) {
LL res = 1;
for (LL i = x; i >= y; i--) {
res *= i;
}
return res;
}
LL pow_mod(LL x, LL y) {
x = mod(x);
if (y == 1) {
return mod(x);
}
LL res = mod(pow_mod(mod(x * x), y / 2));
if (y % 2 == 0) {
return res;
} else {
return mod(x * res);
}
}
LL pow(LL x, LL y) {
if (y == 1) {
return x;
}
if (y % 2 == 0) {
return pow(x * x, y / 2);
} else {
return x * pow(x * x, y / 2);
}
}
vecLL Eratosthenes(LL n) { // 素数のベクトルを返す
bool isPrime[n];
fill(isPrime, isPrime + n, true);
isPrime[0] = isPrime[1] = false;
rep(i, 2, sqrt(n) + 1) {
if (isPrime[i]) {
for (LL j = 2 * i; j <= n; j += i) {
isPrime[j] = false;
}
}
}
vecLL P;
rep(i, 2, n + 1) {
if (isPrime[i]) {
P.push_back(i);
}
}
return P;
}
struct edge { // 枝
LL to, cost;
double dcost; // コストが整数でない場合に使う
};
struct vertex { // 頂点(枝付き)
LL key;
double dkey; // キーが整数でない場合に使う
vector<edge> edges; // 頂点から伸びる枝
};
class Graph {
public:
LL V; // 頂点数
vertex *vertices; // グラフ
Graph(LL v) { // 頂点数を指定してグラフの初期化
V = v; // 頂点数
vertices = new vertex[V]; // 頂点集合
rep(i, 0, V) {
vertices[i].key = -1; // キー初期値は-1
vertices[i].dkey = -1; // キー初期値は-1
}
}
void setDE(LL i, LL j, LL cos) { // i→jにコストcosの有向枝を加える
edge e;
e.to = j;
e.cost = cos;
vertices[i].edges.push_back(e);
return;
}
void setDE(LL i, LL j, double dcos) { // i→jにコストcosの有向枝を加える
edge e;
e.to = j;
e.dcost = dcos;
vertices[i].edges.push_back(e);
return;
}
void setUDE(LL i, LL j, LL cos) { //(i,j)にコストcosの無向枝を加える
edge ei, ej;
ei.to = j;
ej.to = i;
ei.cost = ej.cost = cos;
vertices[i].edges.push_back(ei);
vertices[j].edges.push_back(ej);
return;
}
void setUDE(LL i, LL j, double dcos) { //(i,j)にコストcosの無向枝を加える
edge ei, ej;
ei.to = j;
ej.to = i;
ei.dcost = ej.dcost = dcos;
vertices[i].edges.push_back(ei);
vertices[j].edges.push_back(ej);
return;
}
void setKey(LL i, LL newKey) { // キー変更
vertices[i].key = newKey;
}
void setKey(LL i, double newKey) { // キー変更
vertices[i].key = newKey;
}
edge getEdge(LL i, LL j) {
rep(a, 0, vertices[i].edges.size()) {
if (vertices[i].edges[a].to == j) {
return vertices[i].edges[a];
}
}
return (edge){j, INF, DINF}; // なければ,コストINFの枝を返す
}
void bellman_ford(LL s, LL b[]) {
fill(b, b + V, INF);
b[s] = 0;
while (true) {
bool update = false;
rep(i, 0, V) {
rep(j, 0, vertices[i].edges.size()) {
edge e = vertices[i].edges[j];
if (b[e.to] > b[i] + e.cost) {
b[e.to] = b[i] + e.cost;
update = true;
}
}
}
if (!update)
break;
}
return;
}
void
dijkstra(LL s,
LL d[]) { // ダイクストラ(始点を入力とし、各点への最小距離を返す)
priority_queue<pLL, vector<pLL>, greater<pLL>> que;
fill(d, d + V, INF);
d[s] = 0;
que.push(pLL(0, s));
while (!que.empty()) {
pLL p = que.top();
que.pop();
LL v = p.second;
if (d[v] < p.first)
continue;
rep(i, 0, vertices[v].edges.size()) {
edge e = vertices[v].edges[i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(pLL(d[e.to], e.to));
}
}
}
return;
}
void warshall_floyd(LL **w) {
rep(i, 0, V) {
rep(j, 0, V) { w[i][j] = INF; }
}
rep(i, 0, V) {
rep(j, 0, vertices[i].edges.size()) {
w[i][vertices[i].edges[j].to] = vertices[i].edges[j].cost;
}
}
rep(i, 0, V) { w[i][i] = 0; }
rep(i, 0, V) {
rep(j, 0, V) {
rep(k, 0, V) { w[i][j] = min(w[i][j], w[i][k] + w[k][j]); }
}
}
}
};
class UF {
public:
LL N;
LL *par;
LL *rank;
UF(LL n) {
N = n;
par = new LL[N];
rank = new LL[N];
rep(i, 0, N) {
par[i] = i;
rank[i] = i;
}
return;
}
LL root(LL x) {
if (x == par[x])
return x;
else
return par[x] = root(par[x]);
}
bool same(LL x, LL y) { return (root(x) == root(y)); }
void Union(LL x, LL y) {
LL rtx = root(x);
LL rty = root(y);
if (rank[rtx] < rank[rty]) {
par[rtx] = rty;
} else {
par[rty] = rtx;
if (rank[rtx] == rank[rty]) {
rank[rtx]++;
}
}
}
};
class ST {};
/*↑マイライブラリ↑*/
LL solveA() {
string S, T;
LL A, B;
string U;
cin >> S >> T;
cin >> A >> B;
cin >> U;
if (S == U) {
cout << A - 1 << " " << B << endl;
} else {
cout << A << " " << B - 1 << endl;
}
return 0;
}
LL solveB() {
string S;
cin >> S;
rep(i, 0, S.length()) { cout << "x"; }
return 0;
}
LL solveC() {
LL N;
cin >> N;
set<LL> A;
rep(i, 0, N) {
LL x = linp();
if (A.find(x) != A.end()) {
cout << "NO" << endl;
return 0;
} else {
A.insert(x);
}
}
cout << "YES" << endl;
return 0;
}
LL solveD() {
LL N, K;
cin >> N >> K;
double ans = 0;
LL sum[N + 1];
sum[0] = 0;
LL p[N + 1];
rep(i, 1, N + 1) {
cin >> p[i];
sum[i] = p[i] + sum[i - 1];
}
LL ma;
LL low, up;
ma = 0;
for (LL i = 0; i + K < N + 1; i++) {
if (ma < sum[i + K] - sum[i]) {
ma = sum[i + K] - sum[i];
up = i + K + 1;
low = i + 1;
}
}
rep(i, low, up) { ans += (double)((p[i] * (p[i] + 1)) / 2) / p[i]; }
printf("%.8f", ans);
return 0;
}
LL solveE() { return 0; }
signed main() {
// solveA();
// solveB();
// solveC();
solveD();
// solveE();
return 0;
}
| replace | 437 | 438 | 437 | 438 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
int N, K;
cin >> N >> K;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
int maxval = 0;
for (int i = 0; i < N - K + 1; i++) {
int val = 0;
for (int j = i; j < i + K; j++) {
val += 1 + p[j];
}
if (val > maxval)
maxval = val;
}
double E = maxval * 0.5;
cout << std::fixed << std::setprecision(10) << E << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
int N, K;
cin >> N >> K;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
ll maxval = 0;
ll sum = 0;
for (int i = 0; i < K; i++) {
sum += 1 + p[i];
}
maxval = sum;
for (int i = 1; i < N - K + 1; i++) {
sum = sum - p[i - 1] + p[i + K - 1];
if (sum > maxval)
maxval = sum;
}
double E = maxval * 0.5;
cout << std::fixed << std::setprecision(10) << E << endl;
return 0;
}
| replace | 13 | 21 | 13 | 24 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
#define capi(x) \
int x; \
cin >> x
signed main() {
int n, k;
cin >> n >> k;
vector<double> vp;
rep(i, n) {
capi(p);
vp.push_back((p + 1) / 2.0);
}
double ans = 0.0;
for (int i = 0; i + k <= n; ++i) {
double res = 0.0;
rep(j, k) { res += vp[i + j]; }
ans = max(ans, res);
}
printf("%.12lf", ans);
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
#define capi(x) \
int x; \
cin >> x
signed main() {
int n, k;
cin >> n >> k;
vector<double> vp;
rep(i, n) {
capi(p);
vp.push_back((p + 1) / 2.0);
}
double res = 0.0;
rep(j, k) { res += vp[j]; }
double ans = res;
for (int i = 0; i + k < n; ++i) {
res += vp[i + k];
res -= vp[i];
ans = max(ans, res);
}
printf("%.12lf", ans);
return 0;
} | replace | 34 | 38 | 34 | 41 | TLE | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
long double a[200010];
int main() {
ll n, k;
cin >> n >> k;
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
long double ch = 0;
for (ll i = 0; i < k; i++) {
long double sum = 0;
sum += (a[i] + 1) / 2.0;
// cout << sum<<" "<<i<<endl;
ch += sum;
}
long double ans = ch;
// cout << ch<<endl;
for (ll i = 0; i < n; i++) {
ch = ch - (a[i] + 1) / 2.0 + (a[i + k] + 1) / 2.0;
// cout <<now<<" "<<i<<endl;
if (ch > ans) {
ans = ch;
// cout << i<<endl;
// ansi=i+1;
}
}
// cout << ansi<<endl;
printf("%.9Lf", ans);
// your code goes here
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
long double a[200010];
int main() {
ll n, k;
cin >> n >> k;
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
long double ch = 0;
for (ll i = 0; i < k; i++) {
long double sum = 0;
sum += (a[i] + 1) / 2.0;
// cout << sum<<" "<<i<<endl;
ch += sum;
}
long double ans = ch;
// cout << ch<<endl;
for (ll i = 0; i < n - k; i++) {
ch = ch - (a[i] + 1) / 2.0 + (a[i + k] + 1) / 2.0;
// cout <<now<<" "<<i<<endl;
if (ch > ans) {
ans = ch;
// cout << i<<endl;
// ansi=i+1;
}
}
// cout << ansi<<endl;
printf("%.9Lf", ans);
// your code goes here
return 0;
} | replace | 22 | 23 | 22 | 23 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
double t[200005];
int main() {
int n, m;
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%lf", &t[i]);
t[i] = (t[i] + 1) / 2;
}
double max1 = 0;
for (int i = 1; i <= n - m + 1; i++) {
double sum = 0;
for (int j = 0; j < m; j++)
sum += t[i + j];
if (sum > max1)
max1 = sum;
}
printf("%.12lf\n", max1);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
double t[200005];
int main() {
int n, m;
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%lf", &t[i]);
t[i] = (t[i] + 1) / 2;
}
double max1, sum;
for (int i = 0; i < m; i++)
max1 += t[1 + i];
sum = max1;
for (int i = 2; i <= n - m + 1; i++) {
sum = sum - t[i - 1] + t[i + m - 1];
max1 = sum > max1 ? sum : max1;
}
printf("%.12lf\n", max1);
return 0;
}
| replace | 15 | 22 | 15 | 22 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int INF = 0x3f3f3f3f;
int mode = 1e9 + 7;
double e[200020];
int main() {
int n, k;
scanf("%d %d", &n, &k);
double maxn = -1;
int a;
for (int i = 0; i < n; i++) {
scanf("%d", &a);
e[i] = (a * (a + 1) / 2.0) * 1.0 / a;
}
for (int i = 0; i < n - k + 1; i++) {
double sum = 0;
for (int j = i; j < i + k; j++) {
sum += e[j];
}
if (sum > maxn) {
maxn = sum;
}
}
printf("%.12lf\n", maxn);
return 0;
} | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int INF = 0x3f3f3f3f;
int mode = 1e9 + 7;
double e[200020];
int main() {
int n, k;
scanf("%d %d", &n, &k);
double maxn = -1;
int a;
for (int i = 0; i < n; i++) {
scanf("%d", &a);
e[i] = (a * (a + 1) / 2.0) * 1.0 / a;
}
double sum = 0;
for (int i = 0; i < k; i++) {
sum += e[i];
}
// cout<<sum<<endl;
int i = 0, j = k;
while (1) {
maxn = max(sum, maxn);
// cout<<maxn<<" ";
sum = sum + e[j] - e[i];
i++;
j++;
if (j > n) {
break;
}
}
printf("%.12lf\n", maxn);
return 0;
} | replace | 26 | 33 | 26 | 40 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, f, n) for (int i = (f); i < (n); i++)
#define repv(v) for (auto it = (v).begin(); it != (v).end(); it++)
ll const INF = 1LL << 60;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> p(N);
rep(i, N) cin >> p[i];
vector<double> e(N);
rep(i, N) { e[i] = ((double)p[i] * (1 + p[i]) / 2) / p[i]; }
// rep(i, N) cout << e[i] << " ";
// cout << endl;
double ans = 0.0;
rep(i, N - K + 1) {
double sum = 0.0;
rep(j, K) { sum += e[i + j]; }
// cout << sum << endl;
ans = max(ans, sum);
}
cout << fixed << setprecision(12) << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, f, n) for (int i = (f); i < (n); i++)
#define repv(v) for (auto it = (v).begin(); it != (v).end(); it++)
ll const INF = 1LL << 60;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> p(N);
rep(i, N) cin >> p[i];
vector<double> e(N);
rep(i, N) { e[i] = ((double)p[i] * (1 + p[i]) / 2) / p[i]; }
// rep(i, N) cout << e[i] << " ";
// cout << endl;
double current = 0.0;
rep(i, K) { current += e[i]; }
double ans = current;
reps(i, K, N) {
current = current - e[i - K] + e[i];
// cout << current << endl;
ans = max(current, ans);
}
cout << fixed << setprecision(12) << ans << endl;
return 0;
} | replace | 32 | 38 | 32 | 41 | TLE | |
p02780 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define REP3(i, st, en) for (ll(i) = (st); (i) < (en); (i)++)
using P = pair<ll, ll>;
const int MOD = 1e9 + 7;
const ll INF = 1e+14;
const double PI = 3.14159265349;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
vector<double> p(N);
REP(i, N) { cin >> p[i]; }
ll left = 0;
ll sum = 0;
REP(i, K) { sum += p[i]; }
ll maxv = sum;
REP3(i, 1, N - K + 1) {
sum += p[i];
sum -= p[i - K];
if (sum > maxv) {
left = i;
maxv = sum;
}
}
double ans = 0;
REP(i, K) { ans += (p[left + i] + 1.0) / 2; }
cout << fixed << setprecision(10) << ans << "\n";
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define REP3(i, st, en) for (ll(i) = (st); (i) < (en); (i)++)
using P = pair<ll, ll>;
const int MOD = 1e9 + 7;
const ll INF = 1e+14;
const double PI = 3.14159265349;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
vector<double> p(N);
REP(i, N) { cin >> p[i]; }
ll left = 0;
ll sum = 0;
REP(i, K) { sum += p[i]; }
ll maxv = sum;
REP3(i, 1, N - K + 1) {
sum -= p[i - 1];
sum += p[i + K - 1];
if (sum > maxv) {
left = i;
maxv = sum;
}
}
double ans = 0;
REP(i, K) { ans += (p[left + i] + 1.0) / 2; }
cout << fixed << setprecision(10) << ans << "\n";
return 0;
}
| replace | 36 | 38 | 36 | 38 | 0 | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
bool cmp(double a, double b) { return a > b; }
int main() {
int n, k;
double aa[1005];
double bb[20005];
double cc[20005] = {0};
cin >> n >> k;
aa[1] = 1;
for (int i = 2; i <= 1000; i++) {
if (i % 2 == 0)
aa[i] = i / 2 + 0.5;
else
aa[i] = i / 2 + 1;
}
int t;
for (int i = 1; i <= n; i++) {
scanf("%d", &t);
bb[i] = aa[t];
}
for (int i = 1; i <= k; i++) {
cc[1] += bb[i];
}
for (int i = 2; i <= n - k + 1; i++) {
cc[i] = cc[i - 1] - bb[i - 1] + bb[i + k - 1];
}
sort(cc + 1, cc + 1 + n - k + 1, cmp);
printf("%lf", cc[1]);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
bool cmp(double a, double b) { return a > b; }
int main() {
int n, k;
double aa[1005];
double bb[200005];
double cc[200005] = {0};
cin >> n >> k;
aa[1] = 1;
for (int i = 2; i <= 1000; i++) {
if (i % 2 == 0)
aa[i] = i / 2 + 0.5;
else
aa[i] = i / 2 + 1;
}
int t;
for (int i = 1; i <= n; i++) {
scanf("%d", &t);
bb[i] = aa[t];
}
for (int i = 1; i <= k; i++) {
cc[1] += bb[i];
}
for (int i = 2; i <= n - k + 1; i++) {
cc[i] = cc[i - 1] - bb[i - 1] + bb[i + k - 1];
}
sort(cc + 1, cc + 1 + n - k + 1, cmp);
printf("%lf", cc[1]);
return 0;
}
| replace | 8 | 10 | 8 | 10 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i < (n); i++)
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<double> p(n);
rep(i, n) cin >> p[i];
vector<double> q(n - k + 1, 0);
rep(i, n - k + 1) {
rep(j, k) { q[i] += p[i + j]; }
}
double ans = 0;
rep(i, n - k + 1) { ans = max(ans, q[i]); }
cout << fixed << setprecision(8) << (ans + k) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i < (n); i++)
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<double> p(n);
rep(i, n) cin >> p[i];
vector<double> q(n - k + 1, 0);
rep(j, k) { q[0] += p[j]; }
rep2(i, n - k + 1) { q[i] = q[i - 1] - p[i - 1] + p[i + k - 1]; }
double ans = 0;
rep(i, n - k + 1) { ans = max(ans, q[i]); }
cout << fixed << setprecision(8) << (ans + k) / 2 << endl;
} | replace | 12 | 15 | 12 | 14 | TLE | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[20001];
double calc(int x) {
int c = (double)x;
return (c + 1) / 2;
}
int main() {
memset(a, 0, sizeof(a));
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
// sort(a, a+n);
double temp = 0, mx = 0, index = 0;
for (int i = 0; i < n; i++) {
if (index < k) {
temp += a[i];
index++;
} else {
temp -= a[i - k];
temp += a[i];
// index--;
}
if (mx < temp) {
mx = temp;
}
}
// cout << endl;
mx = (mx + k) / 2;
printf("%.12f\n", mx);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a[200001];
int main() {
memset(a, 0, sizeof(a));
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
// sort(a, a+n);
double temp = 0, mx = 0, index = 0;
for (int i = 0; i < n; i++) {
if (index < k) {
temp += a[i];
index++;
} else {
temp -= a[i - k];
temp += a[i];
// index--;
}
if (mx < temp) {
mx = temp;
}
}
// cout << endl;
mx = (mx + k) / 2;
printf("%.12f\n", mx);
return 0;
} | replace | 2 | 7 | 2 | 4 | 0 | |
p02780 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
using namespace std;
const int N = 101101;
int a[N];
int n, k;
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int sum = 0;
for (int i = 1; i <= k; i++)
sum = sum + a[i];
int mx = sum;
for (int i = k + 1; i <= n; i++)
sum = sum + a[i] - a[i - k], mx = max(mx, sum);
printf("%lf\n", 1.0 * (mx + k) / 2);
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
using namespace std;
const int N = 202202;
int a[N];
int n, k;
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int sum = 0;
for (int i = 1; i <= k; i++)
sum = sum + a[i];
int mx = sum;
for (int i = k + 1; i <= n; i++)
sum = sum + a[i] - a[i - k], mx = max(mx, sum);
printf("%lf\n", 1.0 * (mx + k) / 2);
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
double ev(double p) {
double sum = 0;
for (int i = 1; i <= p; i++) {
sum += i / p;
}
return sum;
}
int main() {
int n, k;
cin >> n >> k;
vector<double> e(n);
rep(i, n) {
double temp;
cin >> temp;
e.at(i) = ev(temp);
}
double ev_sum = 0;
rep(i, k) ev_sum += e.at(i);
vector<double> ans(n - k + 1);
ans.at(0) = ev_sum;
for (int i = 0; i < n - k; i++) {
ev_sum += (-e.at(i) + e.at(i + k));
ans.at(i + 1) = ev_sum;
}
sort(ans.begin(), ans.end());
printf("%5.7f\n", ans.at(n - k - 1));
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
double ev(double p) {
double sum = 0;
for (int i = 1; i <= p; i++) {
sum += i / p;
}
return sum;
}
int main() {
int n, k;
cin >> n >> k;
vector<double> e(n);
rep(i, n) {
double temp;
cin >> temp;
e.at(i) = ev(temp);
}
double ev_sum = 0;
rep(i, k) ev_sum += e.at(i);
vector<double> ans(n - k + 1);
ans.at(0) = ev_sum;
for (int i = 0; i < n - k; i++) {
ev_sum += (-e.at(i) + e.at(i + k));
ans.at(i + 1) = ev_sum;
}
sort(ans.begin(), ans.end());
printf("%5.7f\n", ans.at(n - k));
} | replace | 34 | 35 | 34 | 35 | 0 | |
p02780 | C++ | Runtime Error |
#include <bits/stdc++.h>
class kin {
public:
inline void open(FILE *, int);
inline void close(void);
inline void scan(void);
inline kin &operator>(char &);
inline kin &operator>(int &);
inline kin &operator>(long long &);
inline kin &operator>(double &);
inline kin &operator>(long double &);
inline kin &operator>(char *);
template <class T> inline void get(T *, int);
private:
FILE *fp;
char *buf;
int siz;
int idx;
} in;
class kout {
public:
inline void open(FILE *, int);
inline void close(void);
inline void print(void);
inline kout &operator<(char);
inline kout &operator<(int);
inline kout &operator<(long long);
inline kout &operator<(double);
inline kout &operator<(long double);
inline kout &operator<(const char *);
template <class T> inline void put(T *, int, char, char);
private:
FILE *fp;
char *buf;
int siz;
int idx;
} out;
inline void chmax(long long val, long long &var) {
if (val > var)
var = val;
}
int main(int argc, char **argv) {
in.open(stdin, 512);
out.open(stdout, 512);
in.scan();
int n, k;
in > n > k;
long long d[100001];
d[0] = 0LL;
for (int i = 1; i <= n; ++i) {
long long p;
in > p;
d[i] = d[i - 1] + p + 1LL;
}
long long ans = d[k];
for (int i = k + 1; i <= n; ++i)
chmax(d[i] - d[i - k], ans);
out < (long double)ans / 2.0L < '\n';
out.print();
in.close();
out.close();
return 0;
}
inline void kin::open(FILE *fparg, int sizarg) {
fp = fparg;
buf = new char[sizarg];
siz = sizarg;
idx = 0;
return;
}
inline void kin::close(void) {
fp = nullptr;
delete[] buf;
buf = nullptr;
siz = 0;
idx = 0;
return;
}
inline void kin::scan(void) {
int readsiz =
(int)std::fread((void *)buf, (std::size_t)1, (std::size_t)siz, fp);
if (readsiz != siz)
buf[readsiz] = '\x00';
idx = 0;
return;
}
inline kin &kin::operator>(char &var) {
if (!buf[idx]) {
var = '\x00';
return *this;
}
var = buf[idx];
if (++idx == siz)
scan();
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>(int &var) {
if (!buf[idx]) {
var = 0;
return *this;
}
int sign = -1;
if (buf[idx] == '-') {
sign = 1;
if (++idx == siz)
scan();
}
var = 0;
while (buf[idx] >= '0') {
var = var * 10 - (int)(buf[idx] - '0');
if (++idx == siz)
scan();
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>(long long &var) {
if (!buf[idx]) {
var = 0LL;
return *this;
}
long long sign = -1LL;
if (buf[idx] == '-') {
sign = 1LL;
if (++idx == siz)
scan();
};
var = 0LL;
while (buf[idx] >= '0') {
var = var * 10LL - (long long)(buf[idx] - '0');
if (++idx == siz)
scan();
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>(double &var) {
if (!buf[idx]) {
var = 0.0;
return *this;
}
double sign = -1.0;
if (buf[idx] == '-') {
sign = 1.0;
if (++idx == siz)
scan();
}
var = 0.0;
while (buf[idx] >= '0') {
var = var * 10.0 - (double)(buf[idx] - '0');
if (++idx == siz)
scan();
}
if (buf[idx] == '.') {
if (++idx == siz)
scan();
double dig = 1.0;
while (buf[idx] >= '0') {
var -= (double)(buf[idx] - '0') * (dig /= 10.0);
if (++idx == siz)
scan();
}
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>(long double &var) {
if (!buf[idx]) {
var = 0.0L;
return *this;
}
long double sign = -1.0L;
if (buf[idx] == '-') {
sign = 1.0L;
if (++idx == siz)
scan();
}
var = 0.0L;
while (buf[idx] >= '0') {
var = var * 10.0L - (long double)(buf[idx] - '0');
if (++idx == siz)
scan();
}
if (buf[idx] == '.') {
if (++idx == siz)
scan();
long double dig = 1.0L;
while (buf[idx] >= '0') {
var -= (long double)(buf[idx] - '0') * (dig /= 10.0L);
if (++idx == siz)
scan();
}
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>(char *str) {
if (!buf[idx]) {
str[0] = '\x00';
return *this;
}
int ptr = 0;
while (buf[idx] >= '!') {
str[ptr++] = buf[idx];
if (++idx == siz)
scan();
}
str[ptr] = '\x00';
if (++idx == siz)
scan();
return *this;
}
template <class T> inline void kin::get(T *arr, int num) {
for (int i = 0; i < num; ++i)
(*this) > arr[i];
return;
}
inline void kout::open(FILE *fparg, int sizarg) {
fp = fparg;
buf = new char[sizarg];
siz = sizarg;
idx = 0;
return;
}
inline void kout::close(void) {
fp = nullptr;
delete[] buf;
buf = nullptr;
siz = 0;
idx = 0;
return;
}
inline void kout::print(void) {
std::fwrite((void *)buf, (std::size_t)1, (std::size_t)idx, fp);
idx = 0;
return;
}
inline kout &kout::operator<(char val) {
buf[idx] = val;
if (++idx == siz)
print();
return *this;
}
inline kout &kout::operator<(int val) {
if (val < 0) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1;
char dig[10];
int ptr = 0;
do {
int tmp = val / 10;
dig[ptr++] = (char)-(val - tmp * 10) + '0';
val = tmp;
} while (val);
while (ptr--) {
buf[idx] = dig[ptr];
if (++idx == siz)
print();
}
return *this;
}
inline kout &kout::operator<(long long val) {
if (val < 0LL) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1LL;
char dig[19];
int ptr = 0;
do {
long long tmp = val / 10LL;
dig[ptr++] = (char)-(val - tmp * 10LL) + '0';
val = tmp;
} while (val);
while (ptr--) {
buf[idx] = dig[ptr];
if (++idx == siz)
print();
}
return *this;
}
inline kout &kout::operator<(double val) {
if (val < 0.0) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1.0;
double dig = 1.0;
while (val / dig <= -10.0)
dig *= 10.0;
int tmp;
while (dig >= 1.0) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (double)tmp * dig;
dig /= 10.0;
}
buf[idx] = '.';
if (++idx == siz)
print();
for (int i = 0; i < 12; ++i) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (double)tmp * dig;
dig /= 10.0;
}
return *this;
}
inline kout &kout::operator<(long double val) {
if (val < 0.0L) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1.0L;
long double dig = 1.0L;
while (val / dig <= -10.0L)
dig *= 10.0L;
int tmp;
while (dig >= 1.0L) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (long double)tmp * dig;
dig /= 10.0L;
}
buf[idx] = '.';
if (++idx == siz)
print();
for (int i = 0; i < 16; ++i) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (long double)tmp * dig;
dig /= 10.0L;
}
return *this;
}
inline kout &kout::operator<(const char *str) {
for (int i = 0; str[i]; ++i) {
buf[idx] = str[i];
if (++idx == siz)
print();
}
return *this;
}
template <class T> inline void kout::put(T *arr, int num, char dlm, char end) {
--num;
for (int i = 0; i < num; ++i)
(*this) < arr[i] < dlm;
(*this) < arr[num] < end;
return;
}
|
#include <bits/stdc++.h>
class kin {
public:
inline void open(FILE *, int);
inline void close(void);
inline void scan(void);
inline kin &operator>(char &);
inline kin &operator>(int &);
inline kin &operator>(long long &);
inline kin &operator>(double &);
inline kin &operator>(long double &);
inline kin &operator>(char *);
template <class T> inline void get(T *, int);
private:
FILE *fp;
char *buf;
int siz;
int idx;
} in;
class kout {
public:
inline void open(FILE *, int);
inline void close(void);
inline void print(void);
inline kout &operator<(char);
inline kout &operator<(int);
inline kout &operator<(long long);
inline kout &operator<(double);
inline kout &operator<(long double);
inline kout &operator<(const char *);
template <class T> inline void put(T *, int, char, char);
private:
FILE *fp;
char *buf;
int siz;
int idx;
} out;
inline void chmax(long long val, long long &var) {
if (val > var)
var = val;
}
int main(int argc, char **argv) {
in.open(stdin, 512);
out.open(stdout, 512);
in.scan();
int n, k;
in > n > k;
long long d[200001];
d[0] = 0LL;
for (int i = 1; i <= n; ++i) {
long long p;
in > p;
d[i] = d[i - 1] + p + 1LL;
}
long long ans = d[k];
for (int i = k + 1; i <= n; ++i)
chmax(d[i] - d[i - k], ans);
out < (long double)ans / 2.0L < '\n';
out.print();
in.close();
out.close();
return 0;
}
inline void kin::open(FILE *fparg, int sizarg) {
fp = fparg;
buf = new char[sizarg];
siz = sizarg;
idx = 0;
return;
}
inline void kin::close(void) {
fp = nullptr;
delete[] buf;
buf = nullptr;
siz = 0;
idx = 0;
return;
}
inline void kin::scan(void) {
int readsiz =
(int)std::fread((void *)buf, (std::size_t)1, (std::size_t)siz, fp);
if (readsiz != siz)
buf[readsiz] = '\x00';
idx = 0;
return;
}
inline kin &kin::operator>(char &var) {
if (!buf[idx]) {
var = '\x00';
return *this;
}
var = buf[idx];
if (++idx == siz)
scan();
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>(int &var) {
if (!buf[idx]) {
var = 0;
return *this;
}
int sign = -1;
if (buf[idx] == '-') {
sign = 1;
if (++idx == siz)
scan();
}
var = 0;
while (buf[idx] >= '0') {
var = var * 10 - (int)(buf[idx] - '0');
if (++idx == siz)
scan();
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>(long long &var) {
if (!buf[idx]) {
var = 0LL;
return *this;
}
long long sign = -1LL;
if (buf[idx] == '-') {
sign = 1LL;
if (++idx == siz)
scan();
};
var = 0LL;
while (buf[idx] >= '0') {
var = var * 10LL - (long long)(buf[idx] - '0');
if (++idx == siz)
scan();
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>(double &var) {
if (!buf[idx]) {
var = 0.0;
return *this;
}
double sign = -1.0;
if (buf[idx] == '-') {
sign = 1.0;
if (++idx == siz)
scan();
}
var = 0.0;
while (buf[idx] >= '0') {
var = var * 10.0 - (double)(buf[idx] - '0');
if (++idx == siz)
scan();
}
if (buf[idx] == '.') {
if (++idx == siz)
scan();
double dig = 1.0;
while (buf[idx] >= '0') {
var -= (double)(buf[idx] - '0') * (dig /= 10.0);
if (++idx == siz)
scan();
}
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>(long double &var) {
if (!buf[idx]) {
var = 0.0L;
return *this;
}
long double sign = -1.0L;
if (buf[idx] == '-') {
sign = 1.0L;
if (++idx == siz)
scan();
}
var = 0.0L;
while (buf[idx] >= '0') {
var = var * 10.0L - (long double)(buf[idx] - '0');
if (++idx == siz)
scan();
}
if (buf[idx] == '.') {
if (++idx == siz)
scan();
long double dig = 1.0L;
while (buf[idx] >= '0') {
var -= (long double)(buf[idx] - '0') * (dig /= 10.0L);
if (++idx == siz)
scan();
}
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>(char *str) {
if (!buf[idx]) {
str[0] = '\x00';
return *this;
}
int ptr = 0;
while (buf[idx] >= '!') {
str[ptr++] = buf[idx];
if (++idx == siz)
scan();
}
str[ptr] = '\x00';
if (++idx == siz)
scan();
return *this;
}
template <class T> inline void kin::get(T *arr, int num) {
for (int i = 0; i < num; ++i)
(*this) > arr[i];
return;
}
inline void kout::open(FILE *fparg, int sizarg) {
fp = fparg;
buf = new char[sizarg];
siz = sizarg;
idx = 0;
return;
}
inline void kout::close(void) {
fp = nullptr;
delete[] buf;
buf = nullptr;
siz = 0;
idx = 0;
return;
}
inline void kout::print(void) {
std::fwrite((void *)buf, (std::size_t)1, (std::size_t)idx, fp);
idx = 0;
return;
}
inline kout &kout::operator<(char val) {
buf[idx] = val;
if (++idx == siz)
print();
return *this;
}
inline kout &kout::operator<(int val) {
if (val < 0) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1;
char dig[10];
int ptr = 0;
do {
int tmp = val / 10;
dig[ptr++] = (char)-(val - tmp * 10) + '0';
val = tmp;
} while (val);
while (ptr--) {
buf[idx] = dig[ptr];
if (++idx == siz)
print();
}
return *this;
}
inline kout &kout::operator<(long long val) {
if (val < 0LL) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1LL;
char dig[19];
int ptr = 0;
do {
long long tmp = val / 10LL;
dig[ptr++] = (char)-(val - tmp * 10LL) + '0';
val = tmp;
} while (val);
while (ptr--) {
buf[idx] = dig[ptr];
if (++idx == siz)
print();
}
return *this;
}
inline kout &kout::operator<(double val) {
if (val < 0.0) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1.0;
double dig = 1.0;
while (val / dig <= -10.0)
dig *= 10.0;
int tmp;
while (dig >= 1.0) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (double)tmp * dig;
dig /= 10.0;
}
buf[idx] = '.';
if (++idx == siz)
print();
for (int i = 0; i < 12; ++i) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (double)tmp * dig;
dig /= 10.0;
}
return *this;
}
inline kout &kout::operator<(long double val) {
if (val < 0.0L) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1.0L;
long double dig = 1.0L;
while (val / dig <= -10.0L)
dig *= 10.0L;
int tmp;
while (dig >= 1.0L) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (long double)tmp * dig;
dig /= 10.0L;
}
buf[idx] = '.';
if (++idx == siz)
print();
for (int i = 0; i < 16; ++i) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (long double)tmp * dig;
dig /= 10.0L;
}
return *this;
}
inline kout &kout::operator<(const char *str) {
for (int i = 0; str[i]; ++i) {
buf[idx] = str[i];
if (++idx == siz)
print();
}
return *this;
}
template <class T> inline void kout::put(T *arr, int num, char dlm, char end) {
--num;
for (int i = 0; i < num; ++i)
(*this) < arr[i] < dlm;
(*this) < arr[num] < end;
return;
}
| replace | 54 | 55 | 54 | 55 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector<double> p;
for (int i = 0; i < N; i++) {
double x;
cin >> x;
p.push_back((x + 1.) / 2.);
}
double m = 0;
for (int i = 0; i < K; i++) {
m += p[i];
}
for (int i = 1; i <= N - K; i++) {
double m2 = 0;
for (int j = i; j < K + i; j++) {
m2 += p[j];
}
m = max(m, m2);
}
cout << fixed << setprecision(12) << m << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector<double> p;
for (int i = 0; i < N; i++) {
double x;
cin >> x;
p.push_back((x + 1.) / 2.);
}
double m = 0;
for (int i = 0; i < K; i++) {
m += p[i];
}
double m2 = m;
for (int i = K; i < N; i++) {
m2 += p[i];
m2 -= p[i - K];
m = max(m, m2);
}
cout << fixed << setprecision(12) << m << endl;
} | replace | 15 | 20 | 15 | 19 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<double> A(N);
rep(i, N) {
double d;
cin >> d;
d = (d + 1) / 2;
A[i] = d;
}
double ans = 0;
for (int i = 0; i <= N - K; i++) {
double sum = 0;
for (int j = i; j < i + K; j++)
sum += A[j];
ans = max(ans, sum);
}
cout << setprecision(10) << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<double> A(N);
rep(i, N) {
double d;
cin >> d;
d = (d + 1) / 2;
A[i] = d;
}
double sum = 0;
rep(i, K) sum += A[i];
double ans = sum;
for (int i = 1; i <= N - K; i++) {
sum -= A[i - 1];
sum += A[i + K - 1];
ans = max(ans, sum);
}
cout << setprecision(10) << ans << endl;
return 0;
} | replace | 16 | 21 | 16 | 22 | TLE | |
p02780 | Python | Time Limit Exceeded | N, K = map(int, input().split())
lst = [int(x) for x in input().split()]
a = len(lst) - K + 1
n = 0
ret_lst = []
for i in range(a):
m = sum(lst[i : i + K])
if n < m:
n = m
ret_lst = lst[i : i + K]
ll = [x / 2 * (x + 1) / x for x in ret_lst]
print(sum(ll))
| N, K = map(int, input().split())
lst = [int(x) for x in input().split()]
tmp = sum(lst[:K])
ret = tmp
for i in range(N - K):
tmp -= lst[i]
tmp += lst[i + K]
ret = max(ret, tmp)
print((ret + K) / 2)
| replace | 2 | 13 | 2 | 9 | TLE | |
p02780 | Python | Time Limit Exceeded | # https://atcoder.jp/contests/abc154/tasks/abc154_d
import numpy as np
N, K = map(int, input().split())
p = np.array(list(map(int, input().split())))
v = 0
idx = -1
for i in range(N):
tmp = p[i : i + K].sum()
if tmp > v:
v = tmp
idx = i
# print('v idx', v, idx)
subset = p[idx : idx + K]
ans = ((subset + 1) / 2).sum()
print(ans)
| # https://atcoder.jp/contests/abc154/tasks/abc154_d
import numpy as np
N, K = map(int, input().split())
p = np.array(list(map(int, input().split())))
p = (p + 1) / 2
cumsum = np.cumsum(np.array(p))
tmp = np.pad(cumsum[:-K], [K, 0], "constant")
print((cumsum - tmp).max())
| replace | 5 | 18 | 5 | 9 | TLE | |
p02780 | Python | Time Limit Exceeded | def main():
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
expect = [((p + 1) / 2.0) for p in P]
sum_exp = [sum(expect[i : i + K]) for i in range(N - K + 1)]
print(max(sum_exp))
if __name__ == "__main__":
main()
| def main():
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
E = [((p + 1) / 2.0) for p in P]
total = 0
m = 0
for i in range(N):
if i < K:
total += E[i]
else:
total += E[i] - E[i - K]
if total > m:
m = total
print(m)
if __name__ == "__main__":
main()
| replace | 4 | 7 | 4 | 18 | TLE | |
p02780 | Python | Time Limit Exceeded | n, k = map(int, input().split())
p = [int(s) for s in input().split()]
for i in range(n):
p[i] = (1 + p[i]) / 2
ans = 0.0
for i in range(k, n + 1):
ans = max(ans, sum(p[i - k : i]))
print(ans)
| n, k = map(int, input().split())
p = [int(s) for s in input().split()]
for i in range(n):
p[i] = (1 + p[i]) / 2
value = sum(p[0:k])
ans = value
for i in range(k, n):
value = value + p[i] - p[i - k]
ans = max(ans, value)
print(ans)
| replace | 6 | 9 | 6 | 11 | TLE | |
p02780 | Python | Time Limit Exceeded | def main():
n, k = map(int, input().split())
p = list(map(lambda pi: (int(pi) + 1) / 2, input().split()))
ex = 0
for i in range(n - k + 1):
ex = max(ex, sum(p[i : i + k]))
print(ex)
if __name__ == "__main__":
main()
| n, k = map(int, input().split())
p = list(map(lambda pi: (int(pi) + 1) / 2, input().split()))
ex = sum(p[:k])
mx = ex
for i in range(n - k):
ex += p[i + k] - p[i]
if mx < ex:
mx = ex
print(mx)
| replace | 0 | 11 | 0 | 9 | TLE | |
p02780 | Python | Runtime Error | import sys
from itertools import accumulate
def solve():
N, K = map(int, sys.stdin.readline().split())
cusum_p = list(accumulate(map(int, sys.stdin.read().split()), initial=0))
return (max(i - j for i, j in zip(cusum_p[K:], cusum_p[:-K])) + K) / 2
if __name__ == "__main__":
answer = solve()
print(answer)
| import sys
from itertools import accumulate
def solve():
N, K = map(int, sys.stdin.readline().split())
cusum_p = (0,) + tuple(accumulate(map(int, sys.stdin.read().split())))
return (max(i - j for i, j in zip(cusum_p[K:], cusum_p[:-K])) + K) / 2
if __name__ == "__main__":
answer = solve()
print(answer)
| replace | 6 | 7 | 6 | 7 | 0 | |
p02780 | Python | Time Limit Exceeded | n, k = map(int, input().split(" "))
pp = list(map(int, input().split(" ")))
pp_ex = list(map(lambda p: (p + 1) / 2, pp))
max_ex = 0
# for i in range(k):
# max_ex += pp_ex[i]
for i in range(0, n - k + 1):
ex = 0
for j in range(k):
ex += pp_ex[i + j]
if max_ex < ex:
max_ex = ex
print(max_ex)
| n, k = map(int, input().split(" "))
pp = list(map(int, input().split(" ")))
pp_ex = list(map(lambda p: (p + 1) / 2, pp))
max_ex = 0
for i in range(k):
max_ex += pp_ex[i]
bef_ex = max_ex
for i in range(1, n - k + 1):
ex = bef_ex - pp_ex[i - 1] + pp_ex[i + k - 1]
bef_ex = ex
if max_ex < ex:
max_ex = ex
print(max_ex)
| replace | 6 | 13 | 6 | 12 | TLE | |
p02780 | Python | Time Limit Exceeded | def main():
N, K = map(int, input().split())
P = [(v + 1) / 2 for v in map(int, input().split())]
ans = 0
for i in range(N - K + 1):
ans = max(ans, sum(P[i : i + K]))
print(ans)
if __name__ == "__main__":
main()
| def main():
N, K = map(int, input().split())
P = [(v + 1) / 2 for v in map(int, input().split())]
ans = tmp = sum(P[0:K])
for i in range(N - K):
tmp = tmp - P[i] + P[i + K]
ans = max(ans, tmp)
print(ans)
if __name__ == "__main__":
main()
| replace | 4 | 7 | 4 | 8 | TLE | |
p02780 | Python | Runtime Error | import os
import sys
import numpy as np
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10**9)
INF = float("inf")
IINF = 10**18
MOD = 10**9 + 7
# MOD = 998244353
N, K = list(map(int, sys.stdin.buffer.readline().split()))
P = list(map(int, sys.stdin.buffer.readline().split()))
P = np.array(P, dtype=float)
E = (P + 1) / 2
cs = E.cumsum()
ans = (cs[K:] - cs[:-K]).max()
ans = max(ans, cs[K - 1])
print(ans)
| import os
import sys
import numpy as np
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10**9)
INF = float("inf")
IINF = 10**18
MOD = 10**9 + 7
# MOD = 998244353
N, K = list(map(int, sys.stdin.buffer.readline().split()))
P = list(map(int, sys.stdin.buffer.readline().split()))
P = np.array(P, dtype=float)
E = (P + 1) / 2
cs = E.cumsum()
ans = cs[K - 1]
if K < N:
ans = max(ans, (cs[K:] - cs[:-K]).max())
print(ans)
| replace | 21 | 24 | 21 | 24 | TLE | |
p02780 | Python | Time Limit Exceeded | N, K = map(int, input().split())
P = list(map(int, input().split()))
E = []
for p in P:
e = ((p * p + p) / 2) * (1 / p)
E.append(e)
ans = 0
for i in range(0, N - K + 1):
ans = max(ans, sum(E[i : i + K]))
print(ans)
| N, K = map(int, input().split())
P = list(map(int, input().split()))
E = []
for p in P:
e = ((p * p + p) / 2) * (1 / p)
E.append(e)
memo = sum(E[:K])
ans = memo
for i in range(0, N - K):
memo = memo - E[i] + E[i + K]
ans = max(ans, memo)
print(ans)
| replace | 8 | 11 | 8 | 13 | TLE | |
p02780 | Python | Time Limit Exceeded | n, k = map(int, input().split())
E = list(map(lambda x: (x + 1) * 0.5, list(map(int, input().split()))))
ans = sum(E[:k])
for i in range(1, n - k + 1):
ans = max(ans, sum(E[i : i + k]))
print(ans)
| n, k = map(int, input().split())
E = list(map(lambda x: (x + 1) * 0.5, list(map(int, input().split()))))
esum = sum(E[:k])
ans = esum
for i in range(n - k):
esum = esum - E[i] + E[i + k]
ans = max(ans, esum)
print(ans)
| replace | 2 | 5 | 2 | 7 | TLE | |
p02780 | Python | Time Limit Exceeded | n, k = map(int, input().split())
p = [(1 + int(x)) / 2 for x in input().split()]
ans = 0
for i in range(n - k + 1):
ans = max(ans, sum(p[i : i + k]))
print(ans)
| n, k = map(int, input().split())
p = [(1 + int(x)) / 2 for x in input().split()]
a_idx, l, r = 0, 0, 0
for i in range(1, n - k + 1):
l += p[i - 1]
r += p[i + k - 1]
if r > l:
a_idx, l, r = i, 0, 0
print(sum(p[a_idx : a_idx + k]))
| replace | 2 | 6 | 2 | 9 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.