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 ... | #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;
... | 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++) ... | #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 (in... | 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 =... | #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 =... | 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(... | #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(... | 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);
cons... | /* 特徴 */
/* 教訓 */
#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);
cons... | 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... | #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... | 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;
... | #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 (in... | 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]... | #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]... | 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::syn... | #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::syn... | 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) { ... | #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) { ... | 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);
... | #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.... | 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... | #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... | 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 G... | /*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 G... | 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>
#inc... | // #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>
#inc... | 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[M... | #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[M... | 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] = (((... | #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] = (((... | 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 a... | #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];
d... | 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);... | #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);... | 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_s... | #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_s... | 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 __pri... | #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 __pri... | 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 s... |
/*
@・ω・@ <だれだろうね
*/
/*****/
#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 s... | 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 <ran... | #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 <ran... | 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, ... | #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, ... | 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() {
... | #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() {
... | 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... | #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++)
... | 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 ... | #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 (... | 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;
... | #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;
... | 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];
... | #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... | 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);
... | // 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);
... | 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,... | #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... | 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 n... |
#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 n... | 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 ... | #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 ... | 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... | #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... | 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 (i... | #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;
fo... | 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... | #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... | 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;... | #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;... | 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++) {
... | #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 ... | 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;
... | #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;
... | 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 ... | #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 (in... | 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... | #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... | 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 in... | #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 in... | 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... | #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 - ... | 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;... | #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;... | 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... | #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... | 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)) /... | #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)) /... | 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(... | #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(... | 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 ... | #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 ... | 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;
... | #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;
... | 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 > ma... | #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];
... | 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... | #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 ... | 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... | #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... | 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 = ... | #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++) {
an... | 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 &... | #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 &... | 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++) {
... | #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++) {
... | 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++)
... | #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++)
... | 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;
... | #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 += a... | 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];
}... | #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; ... | 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;
i... | // 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;
i... | 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) /... | #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++) {... | 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 <c... | #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 <c... | 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;... | // 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;... | 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); ... | #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); ... | 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 a... | //
// 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 a... | 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... | #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 su... | 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;
... | #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) ... | 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++)... | #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+... | 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... | #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 = to... | 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... | #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... | 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[... | // 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[... | 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
s... | #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
s... | 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)... | #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)... | 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] =... | #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]... | 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>
#incl... | #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>
#incl... | 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 + ... | #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 -... | 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) fo... | #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) fo... | 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 += (... | #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 += (... | 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 (in... | #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 (i... | 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... | #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... | 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 = ... | #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 = ... | 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)... | #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)... | 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] =... | #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]... | 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... | #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]; }
... | 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 ... | #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... | 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 ... | #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 ... | 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)... | #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)... | 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 ... |
#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 ... | 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++) {
doub... | #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++... | 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... | #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 ... | 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 =... | # 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... | 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()
prin... | 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(a... | 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(m... | 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_... | 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 = ... | 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 = ... | 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.