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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03208 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define INF 1e9
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end() // 昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
typedef vector<long long> VL;
typedef vector<int> VI; /... | #include "bits/stdc++.h"
using namespace std;
#define INF 1e9
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end() // 昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
typedef vector<long long> VL;
typedef vector<int> VI; /... | replace | 54 | 55 | 54 | 55 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const long long INFL = 1e18;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i <= b; i++)
#define all(a) begin((a)), end((a))
#define uniq(c) (... | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const long long INFL = 1e18;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i <= b; i++)
#define all(a) begin((a)), end((a))
#define uniq(c) (... | replace | 23 | 24 | 23 | 24 | 0 | |
p03208 | C++ | Runtime Error | // AtCoder Beginner Contest 115 - C.cpp
#include <algorithm>
#include <cstdio>
#include <iostream>
const int maxn = 10020;
using namespace std;
int n, arr[maxn], K;
int main() {
scanf("%d%d", &n, &K);
for (int i = 1; i <= n; i++)
scanf("%d", &arr[i]);
sort(arr + 1, arr + 1 + n);
int min_val = 1e9;
for (in... | // AtCoder Beginner Contest 115 - C.cpp
#include <algorithm>
#include <cstdio>
#include <iostream>
const int maxn = 100200;
using namespace std;
int n, arr[maxn], K;
int main() {
scanf("%d%d", &n, &K);
for (int i = 1; i <= n; i++)
scanf("%d", &arr[i]);
sort(arr + 1, arr + 1 + n);
int min_val = 1e9;
for (i... | replace | 4 | 5 | 4 | 5 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
long long H = 1000000001;
cin >> N >> K;
vector<long long> vec(N);
for (int X = 0; X < N; X++) {
cin >> vec.at(X);
}
sort(vec.begin(), vec.end());
for (int X = 0; X < N; X++) {
if (vec.at(K + X - 1) - vec.at(X) < H) {
H ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
long long H = 1000000001;
cin >> N >> K;
vector<long long> vec(N);
for (int X = 0; X < N; X++) {
cin >> vec.at(X);
}
sort(vec.begin(), vec.end());
for (int X = 0; K + X - 1 < N; X++) {
if (vec.at(K + X - 1) - vec.at(X) < H) {
... | replace | 12 | 13 | 12 | 13 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p03208 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define isNum(a) (a >= '0' && a <= '9')
#define SP putchar(' ')
#define EL putchar('\... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define isNum(a) (a >= '0' && a <= '9')
#define SP putchar(' ')
#define EL putchar('\... | replace | 17 | 18 | 17 | 18 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const ll mod2 = 99... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const ll mod2 = 99... | replace | 18 | 19 | 18 | 19 | 0 | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int tc, k, a[100];
while (cin >> tc >> k) {
for (int i = 0; i < tc; i++) {
cin >> a[i];
}
sort(a, a + tc);
long long ma = 9e18;
for (int i = 0; i <= tc - k; i++) {
// cout<<a[i+k-1]<<' '<<a[i]<<endl... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int tc, k, a[100005];
while (cin >> tc >> k) {
for (int i = 0; i < tc; i++) {
cin >> a[i];
}
sort(a, a + tc);
long long ma = 9e18;
for (int i = 0; i... | replace | 5 | 6 | 5 | 9 | 0 | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <queue>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
uint64_t N, K;
cin >> N >> K;
uint64_t tree[101000];
for (int i = 0; i < N;... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <queue>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
uint64_t N, K;
cin >> N >> K;
uint64_t tree[101000];
for (int i = 0; i < N;... | replace | 23 | 25 | 23 | 25 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 5;
int arr[N], L[N], R[N];
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
i... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 5;
int arr[N], L[N], R[N];
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
i... | replace | 17 | 18 | 17 | 18 | 0 | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
long long a[1000005];
int main() {
long long n, k;
long long i;
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
long long min = 1000;
for (i = 2; i < n; i++) {
if (a[i] - a[i - k + 1] < min)
min = a[i] - a[i -... | #include <algorithm>
#include <iostream>
using namespace std;
long long a[1000005];
int main() {
long long n, k;
long long i;
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
long long min = a[k - 1] - a[0];
for (i = k - 1; i < n; i++) {
if (a[i] - a[i - k + 1] < min)
min... | replace | 12 | 14 | 12 | 14 | 0 | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
int h[10000];
int min = 100000000;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
for (int i = 0; i <= n - k; i++) {
if (h[i + k - 1] - h[i] < min) {
min = h[i + k - 1] - h[... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
int h[100000];
int min = 1000000000;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
for (int i = 0; i <= n - k; i++) {
if (h[i + k - 1] - h[i] < min) {
min = h[i + k - 1] - ... | replace | 6 | 8 | 6 | 8 | 0 | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace ... | replace | 26 | 27 | 26 | 27 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(n) begin(n), end(n)
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
REP(i, n) { cin >> h[i]; }
sort(ALL(h));
int d, d_min;
REP(i, n - 2) {
d = h[i + k - 1] - h[i];
if (i == 0) {
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(n) begin(n), end(n)
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
REP(i, n) { cin >> h[i]; }
sort(ALL(h));
int d, d_min;
REP(i, n - k + 1) {
d = h[i + k - 1] - h[i];
if (i == 0) {... | replace | 14 | 15 | 14 | 15 | 0 | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
long long int n, k = 0;
cin >> n >> k;
vector<unsigned long long> h(n);
for (unsigned long long i = 0; i < n; i++) {
... | #include <algorithm>
#include <array>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
long long int n, k = 0;
cin >> n >> k;
vector<unsigned long long> h(n);
for (unsigned long long i = 0; i < n; i++) {
... | replace | 23 | 24 | 23 | 24 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e9)
#define PI (acos(-1))
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e9)
#define PI (acos(-1))
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << ... | replace | 22 | 23 | 22 | 23 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; ++i)
cin >> h[i];
sort(h.begin(), h.end());
int ans = 1e9;
for (int i = 0; i < N; i += K - 1) {
ans = min(ans, h[i + K - 1] - h[i]);
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; ++i)
cin >> h[i];
sort(h.begin(), h.end());
int ans = 1e9;
for (int i = 0; i < N - K + 1; i++) {
ans = min(ans, h[i + K - 1] - h[i]);
}
cout << ans;
} | replace | 14 | 15 | 14 | 15 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<int> h(100010);
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
sort(h.begin(), h.begin() + N);
int ans = 1e9;
for (int i = 0; i < K; ++i) {
ans = min(ans, h[i + K - 1] - h[i]);
}
cout << ans << endl;... | #include <bits/stdc++.h>
using namespace std;
vector<int> h(100010);
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
sort(h.begin(), h.begin() + N);
int ans = 1e9;
for (int i = 0; i <= N - K; ++i) {
ans = min(ans, h[i + K - 1] - h[i]);
}
cout << ans << ... | replace | 16 | 17 | 16 | 17 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[101];
int main() {
int n, i, k, minn = INT_MAX;
scanf("%d %d", &n, &k);
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + 1 + n);
for (i = 1; i <= n - k + 1; i++)
minn = min(minn, a[i + k - 1] - a[i]);
printf("%d", minn);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a[100001];
int main() {
int n, i, k, minn = INT_MAX;
scanf("%d %d", &n, &k);
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + 1 + n);
for (i = 1; i <= n - k + 1; i++)
minn = min(minn, a[i + k - 1] - a[i]);
printf("%d", minn);
return 0;
... | replace | 2 | 3 | 2 | 3 | 0 | |
p03208 | C++ | Time Limit Exceeded | // template version 1.6
// {{{ define basic macro
using namespace std;
#include <bits/stdc++.h>
#include <iostream>
// varibable settings
#define int long long
#define INF 1000000000000000000LL
// #define INF 2147483647
#define MOD 1000000007LL
// #define MOD 998244353LL
#define infile "../test/sample-1.in"
#define _o... | // template version 1.6
// {{{ define basic macro
using namespace std;
#include <bits/stdc++.h>
#include <iostream>
// varibable settings
#define int long long
#define INF 1000000000000000000LL
// #define INF 2147483647
#define MOD 1000000007LL
// #define MOD 998244353LL
#define infile "../test/sample-1.in"
#define _o... | replace | 90 | 92 | 90 | 92 | TLE | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int INF = 1e9;
const long long LINF = 1e18;
int main() {
int N, K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
int ans = INF;
int now;
for (int i = 0;... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int INF = 1e9;
const long long LINF = 1e18;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
int ans = INF;
int now;
... | insert | 10 | 10 | 10 | 11 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p03208 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#inclu... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#inclu... | replace | 61 | 62 | 61 | 62 | 0 | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#inclu... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#inclu... | replace | 62 | 63 | 62 | 63 | 0 | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
const int M = 1e9;
int n, k, h[M], ans = 1e9;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
for (int i = 0; i ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
const int M = 1e5;
int n, k, h[M], ans = 1e9;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
for (int i = 0; i ... | replace | 10 | 11 | 10 | 11 | -11 | |
p03208 | C++ | Time Limit Exceeded | #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus >= 201703L
#pragma GCC target("avx2")
#else
#pragma GCC target("avx")
#endif
#endif
// 実数の場合
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFIN... | #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus >= 201703L
#pragma GCC target("avx2")
#else
#pragma GCC target("avx")
#endif
#endif
// 実数の場合
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFIN... | replace | 43 | 46 | 43 | 44 | TLE | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
#include <cmath>
#include <cstdio>
#include <deque>
#include <map>
#include <set>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using ll = long long;
using Graph = vector<vector<int>>;
#include <queue>
#include <... | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
#include <cmath>
#include <cstdio>
#include <deque>
#include <map>
#include <set>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using ll = long long;
using Graph = vector<vector<int>>;
#include <queue>
#include <... | replace | 40 | 41 | 40 | 41 | 0 | |
p03208 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
int main() {
int n, k;
cin >> n >> k;
ll h[100000];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
sort(h, h + n);
ll minSumH = 1000000000;
for (int i = 0; i < n - k + 1; ++i) {
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
int main() {
int n, k;
cin >> n >> k;
ll h[100000];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
sort(h, h + n);
ll minSumH = 1000000000;
for (int i = 0; i < n - k + 1; ++i) {
... | replace | 19 | 29 | 19 | 20 | TLE | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int K, N;
cin >> N >> K;
vector<int> heights(N);
for (int i = 0; i < N; ++i) {
cin >> heights[i];
}
sort(heights.begin(), heights.end());
int minDiff = 2000000000;
for (int i = 0; i < K;... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int K, N;
cin >> N >> K;
vector<int> heights(N);
for (int i = 0; i < N; ++i) {
cin >> heights[i];
}
sort(heights.begin(), heights.end());
int minDiff = 2000000000;
for (int i = 0; i <= N... | replace | 16 | 17 | 16 | 17 | 0 | |
p03208 | C++ | Time Limit Exceeded | // median min 25mins
// time
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (ll i = init; i < (n); i++)
#define repd(i, n, init) for (ll i = (n); i >= init; i--)
#define repm(i, m) for (auto ... | // median min 25mins
// time
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (ll i = init; i < (n); i++)
#define repd(i, n, init) for (ll i = (n); i >= init; i--)
#define repm(i, m) for (auto ... | replace | 18 | 30 | 18 | 20 | TLE | |
p03208 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, K;
cin >> N >> K;
// int64_t hmax = 0, hmin = 1e10;
vector<int64_t> H(N), A(K);
rep(i, N) { cin >> H[i]; }
sort(H.begin(), H.end());
int64_t ans = 1e10;
// i... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, K;
cin >> N >> K;
// int64_t hmax = 0, hmin = 1e10;
vector<int64_t> H(N), A(K);
rep(i, N) { cin >> H[i]; }
sort(H.begin(), H.end());
int64_t ans = 1e10;
// i... | replace | 25 | 26 | 25 | 26 | TLE | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
ll intpow(int n, int m) {
if (m == 0)
return 1;
return n * intpow(n, m - 1);
}
ll gcd(ll n, ll m) {
n = ma... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
ll intpow(int n, int m) {
if (m == 0)
return 1;
return n * intpow(n, m - 1);
}
ll gcd(ll n, ll m) {
n = ma... | replace | 29 | 30 | 29 | 30 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector<long long> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
long long ans = 1000000007;
for (int i = N - 1; i >= N - K; i--) {
long long dist;
dist = h[i] - h[i + 1 - ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector<long long> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
long long ans = 1000000007;
for (int i = 0; i <= N - K; i++) {
ans = min(ans, h[i + K - 1] - h[i]);
}
cout ... | replace | 13 | 17 | 13 | 15 | 0 | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, K;
int h[10000];
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
sort(h, h + N);
int max = h[K - 1], min = h[0];
int result = max - min;
for (int i = 1; i <= N - K; i++) {
max = h[i + K - 1];
min = h[i... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, K;
int h[100000];
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
sort(h, h + N);
int max = h[K - 1], min = h[0];
int result = max - min;
for (int i = 1; i <= N - K; i++) {
max = h[i + K - 1];
min = h[... | replace | 5 | 6 | 5 | 6 | 0 | |
p03208 | C++ | Runtime Error | #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() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
ll ans = h.at(n);
rep(i, n - k + 1... | #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() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
ll ans = h.at(n - 1);
rep(i, n - k... | replace | 13 | 14 | 13 | 14 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p03208 | C++ | Runtime Error | // abc115_c.cpp
// Sat Dec 15 19:18:11 2018
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll = long long;
typedef pair<int, int> P;
int main... | // abc115_c.cpp
// Sat Dec 15 19:18:11 2018
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll = long long;
typedef pair<int, int> P;
int main... | replace | 29 | 30 | 29 | 30 | 0 | |
p03208 | Python | Time Limit Exceeded | def main():
N, K = list(map(int, input().split()))
hs = [int(input()) for i in range(N)]
hs.sort()
i = 0
r = 10**9
while True:
if i + K > N:
break
th = hs[i : i + K]
r = min(r, th[-1] - th[0])
i += 1
print(r)
if __name__ == "__main__":
main()... | def main():
N, K = list(map(int, input().split()))
hs = [int(input()) for i in range(N)]
hs.sort()
i = 0
r = 10**9
while True:
if i + K > N:
break
r = min(r, hs[i + K - 1] - hs[i])
i += 1
print(r)
if __name__ == "__main__":
main()
| replace | 9 | 11 | 9 | 10 | TLE | |
p03208 | C++ | Runtime Error | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, beg... | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, beg... | replace | 19 | 20 | 19 | 20 | 0 | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
long long MIN(long long a, long long b) {
if (a < b)
return a;
return b;
}
int main() {
long long n, k;
cin >> n >> k;
long long h[n];
for (int i = 0; i < n; i++)
cin >> h[i... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
long long MIN(long long a, long long b) {
if (a < b)
return a;
return b;
}
int main() {
long long n, k;
cin >> n >> k;
long long h[n];
for (int i = 0; i < n; i++)
cin >> h[i... | replace | 26 | 27 | 26 | 27 | 0 | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <stack>
typedef long long ll;
using namespace std;
ll a[10005];
int main() {
long long m, n;
cin >> m >> n;
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a, a + m);
long long ans = a[m - 1];
for (int i = 0; i + ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <stack>
typedef long long ll;
using namespace std;
ll a[100005];
int main() {
long long m, n;
cin >> m >> n;
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a, a + m);
long long ans = a[m - 1];
for (int i = 0; i +... | replace | 7 | 8 | 7 | 8 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pi acos(-1.0)
#define ms(a, b) memset(a, b, sizeof(a))
using namespace std;
typedef long long ll;
ll h[10005];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%lld", &h[i]);
}
sort(h + 1, h + 1 + n);
ll ans = inf... | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pi acos(-1.0)
#define ms(a, b) memset(a, b, sizeof(a))
using namespace std;
typedef long long ll;
ll h[100005];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%lld", &h[i]);
}
sort(h + 1, h + 1 + n);
ll ans = in... | replace | 6 | 7 | 6 | 7 | 0 | |
p03208 | Python | Runtime Error | import numpy as np
n, k = map(int, input().split())
a = [int(input()) for x in range(n)]
a.sort()
a = np.array(a)
print(np.min(a[k - 1 :] - a[:k]))
| import numpy as np
n, k = map(int, input().split())
a = [int(input()) for x in range(n)]
a.sort()
a = np.array(a)
print(np.min(a[k - 1 :] - a[: n - k + 1]))
| replace | 6 | 7 | 6 | 7 | TLE | |
p03208 | Python | Runtime Error | def main(n: int, k: int, h: list):
h.sort()
print(min([h[i + k - 1] - h[i] for i in range(n - k + 1)]))
if __name__ == "__main__":
n, k = map(int, input().split())
h = [input() for _ in range(n)]
main(n, k, h)
| def main(n: int, k: int, h: list):
h.sort()
print(min([h[i + k - 1] - h[i] for i in range(n - k + 1)]))
if __name__ == "__main__":
n, k = map(int, input().split())
h = [int(input()) for _ in range(n)]
main(n, k, h)
| replace | 8 | 9 | 8 | 9 | TypeError: unsupported operand type(s) for -: 'str' and 'str' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03208/Python/s200032587.py", line 11, in <module>
main(n, k, h)
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03208/Python/s200032587.py", line 4, in main
print(min([h[i + k - 1] - ... |
p03208 | Python | Runtime Error | N, K = list(map(int, input().split()))
h = []
for i in range(N):
h.append(int(input()))
else:
h.sort()
hi = []
i = 0
while i + (K - 1) < N:
hi.append(int(h[i + 2] - h[i]))
i += 1
print(min(hi))
| N, K = list(map(int, input().split()))
h = []
for i in range(N):
h.append(int(input()))
else:
h.sort()
hi = []
i = 0
while i + (K - 1) < N:
hi.append(int(h[i + (K - 1)] - h[i]))
i += 1
print(min(hi))
| replace | 10 | 11 | 10 | 11 | 0 | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int N, K;
cin >> N >> K;
vector<long long> trees(N);
for (int i = 0; i < N; ++i)
cin >> trees[i];
sort(trees.begin(), trees.end());
long long ret = 1000000000;
for (int i = 0; i < N;... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int N, K;
cin >> N >> K;
vector<long long> trees(N);
for (int i = 0; i < N; ++i)
cin >> trees[i];
sort(trees.begin(), trees.end());
long long ret = 1000000000;
for (int i = 0; i <= N... | replace | 17 | 19 | 17 | 19 | 0 | |
p03208 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <iostream>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
sort(h.begin(), h.end());
long ... | #include <algorithm>
#include <climits>
#include <iostream>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
sort(h.begin(), h.end());
long ... | replace | 21 | 29 | 21 | 23 | TLE | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K, dif, min = 2000000000;
cin >> N >> K;
int h[100000];
for (int i = 0; i < N; i++)
cin >> h[i];
// 降順ソート
sort(h, h + N, greater<int>());
// 差
for (int i = 0; i < N; i++) {
dif = h[i] - h[i + K - 1];
if ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K, dif, min = 2000000000;
cin >> N >> K;
int h[100000];
for (int i = 0; i < N; i++)
cin >> h[i];
// 降順ソート
sort(h, h + N, greater<int>());
// 差
for (int i = 0; i + K - 1 < N; i++) {
dif = h[i] - h[i + K - 1];... | replace | 13 | 14 | 13 | 14 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define OnlineJudge1
#define loop(a, n) for (int i = a; i < n; i++)
#define NumofDigits(n) ((int)log10(n) + 1)
#define CountofNumber(array, n, x) \
(upper_bound(array, array + n, x) - lower_bound(array, array + n, x))
#define ... | #include <bits/stdc++.h>
using namespace std;
#define OnlineJudge1
#define loop(a, n) for (int i = a; i < n; i++)
#define NumofDigits(n) ((int)log10(n) + 1)
#define CountofNumber(array, n, x) \
(upper_bound(array, array + n, x) - lower_bound(array, array + n, x))
#define ... | replace | 39 | 40 | 39 | 40 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
// freopen("transmitters.in","r",stdin);
using namespace std;
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
/*long long mn=1e9;
void lucky (long long a, long long c,int b)
{
if(a > 1e11)
return ;
if(a>=b&&c==0)
mn=min(mn,a);
lucky (a*10+... | #include <bits/stdc++.h>
// freopen("transmitters.in","r",stdin);
using namespace std;
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
/*long long mn=1e9;
void lucky (long long a, long long c,int b)
{
if(a > 1e11)
return ;
if(a>=b&&c==0)
mn=min(mn,a);
lucky (a*10+... | replace | 62 | 63 | 62 | 64 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define mp make_pai... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define mp make_pai... | replace | 31 | 32 | 31 | 32 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h.at(i);
sort(h.begin(), h.end());
int ans = 0;
for (int i = 0; i <= N - K; i++) {
int dh = h.at(N - K + i) - h.at(i);
if (i == 0)
ans = dh;
else... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h.at(i);
sort(h.begin(), h.end());
int ans = 0;
for (int i = 0; i <= N - K; i++) {
int dh = h.at(K - 1 + i) - h.at(i);
if (i == 0)
ans = dh;
else... | replace | 13 | 14 | 13 | 14 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define all(a) (a).begin(), (a).end()
int main() {
int n, k;
cin >> n >> k;
vector<LL> h(n);
rep(i, n) cin >> h[i];
sort(all(h));
LL ans = 1010101... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define all(a) (a).begin(), (a).end()
int main() {
int n, k;
cin >> n >> k;
vector<LL> h(n);
rep(i, n) cin >> h[i];
sort(all(h));
LL ans = 1010101... | replace | 14 | 15 | 14 | 15 | 0 | |
p03208 | Python | Time Limit Exceeded | def solve():
n, k = map(int, input().split())
h = sorted(list(int(input()) for _ in range(n)))
min_diff = 10**9
for i in range(n - k + 1):
part = h[i : i + k]
diff = part[-1] - part[0]
if diff < min_diff:
min_diff = diff
return min_diff
if __name__ == "__main__"... | def solve():
n, k = map(int, input().split())
h = sorted(list(int(input()) for _ in range(n)))
return min(h[i + k - 1] - h[i] for i in range(n - k + 1))
if __name__ == "__main__":
print(solve())
| replace | 3 | 10 | 3 | 4 | TLE | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int i, N, K, h[100000], dif;
long long min = 1000000000;
scanf("%d %d", &N, &K);
for (i = 0; i < N; i++) {
scanf("%d", &h[i]);
}
sort(h, h + N);
for (i = 0; i < N; i++) {
dif = h[i + K - 1] - h[i];
... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int i, N, K, h[100000], dif;
long long min = 1000000000;
scanf("%d %d", &N, &K);
for (i = 0; i < N; i++) {
scanf("%d", &h[i]);
}
sort(h, h + N);
for (i = 0; i < N - K + 1; i++) {
dif = h[i + K - 1] - h[... | replace | 17 | 18 | 17 | 18 | 0 | |
p03208 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | replace | 37 | 38 | 37 | 38 | TLE | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define... | replace | 29 | 31 | 29 | 31 | 0 | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int a[10001];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + 1 + n);
int sum = 0, s = 0;
for (int i = 1; i <= k; i++)
sum = a[k] - a[1];
for (int i = 2; i <= n - k... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int a[100001];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + 1 + n);
int sum = 0, s = 0;
for (int i = 1; i <= k; i++)
sum = a[k] - a[1];
for (int i = 2; i <= n - ... | replace | 4 | 5 | 4 | 5 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int minn = a[n - 1] - a[0];
for (int i = 0; i <= n - k; i++) {
int f = i, b = n - k + i;
minn = min(minn, a[b] - a[f]);
}
cout <... | #include <bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int minn = a[n - 1] - a[0];
for (int i = 0; i <= n - k; i++) {
int f = i, b = k + i - 1;
minn = min(minn, a[b] - a[f]);
}
cout <... | replace | 14 | 15 | 14 | 15 | 0 | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
int dx[] = {1, 0, -1, 0}... | #include <algorithm>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
int dx[] = {1, 0, -1, 0}... | replace | 27 | 28 | 27 | 28 | 0 | |
p03208 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<ll> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
ll ans = 1000000000000;
for (int i = 0; i <= N - K; i++) {
for (int j = i; j <= N - K; j++) {
a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<ll> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
ll ans = 1000000000000;
for (int i = 0; i <= N - K; i++) {
ans = min(ans, h[i + K - 1] - h[i]);
}
... | replace | 14 | 17 | 14 | 15 | TLE | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(... | replace | 25 | 43 | 25 | 26 | 0 | |
p03208 | C++ | Time Limit Exceeded | long long A, B, C, D, E, F, I, J, K, M, N, O, Q, R, S, T, U, V, X, Y, Z;
// long long A,B,C,D,E,F, H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z;
double dA, dB, dC, dD, dE, dF, dI, dJ, dK, dM, dN, dO, dP, dQ, dR, dS, dT, dU,
dV, dX, dY, dZ;
#include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ... | long long A, B, C, D, E, F, I, J, K, M, N, O, Q, R, S, T, U, V, X, Y, Z;
// long long A,B,C,D,E,F, H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z;
double dA, dB, dC, dD, dE, dF, dI, dJ, dK, dM, dN, dO, dP, dQ, dR, dS, dT, dU,
dV, dX, dY, dZ;
#include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ... | replace | 274 | 286 | 274 | 278 | TLE | |
p03208 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define EPS (1e-7)
#define INF (1e... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define EPS (1e-7)
#define INF (1e... | replace | 63 | 69 | 63 | 64 | TLE | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
int k;
int min;
cin >> n >> k;
vector<int> tree(n);
for (int i = 0; i < n; i++) {
cin >> tree[i];
}
sort(tree.begin(), tree.end());
min = tree[k - 1] - tree[0];
for (int j = 0; j < n - k; j++) {
if (min > tree[k - 1 - j] -... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
int k;
int min;
cin >> n >> k;
vector<int> tree(n);
for (int i = 0; i < n; i++) {
cin >> tree[i];
}
sort(tree.begin(), tree.end());
min = tree[k - 1] - tree[0];
for (int j = 0; j < n - k + 1; j++) {
if (min > (tree[k - 1 +... | replace | 13 | 16 | 13 | 16 | 0 | |
p03208 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, K;
cin >> N >> K;
vector<long long int> h(N);
for (long long int i = 0; i, N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
long long int min = 1000000000;
for (long long int i = 0; i < N - K + 1; i++) {
if (min > ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, K;
cin >> N >> K;
vector<long long int> h(N);
for (long long int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
long long int min = 1000000000;
for (long long int i = 0; i < N - K + 1; i++) {
if (min >... | replace | 8 | 9 | 8 | 9 | TLE | |
p03208 | C++ | Runtime Error | // Problem C
#include <bits/stdc++.h>
using namespace std;
int n, k, a[12345], s = 1000000000;
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
for (int i = 1; i <= n - k + 1; i++)
s = min(s, a[i + k - 1] - a[i]);
printf("%d", s);
return ... | // Problem C
#include <bits/stdc++.h>
using namespace std;
int n, k, a[123456], s = 1000000000;
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
for (int i = 1; i <= n - k + 1; i++)
s = min(s, a[i + k - 1] - a[i]);
printf("%d", s);
return... | replace | 4 | 5 | 4 | 5 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
sort(h.begin(), h.end());
int max, min;
int ans = h[2] - h[0];
for (int i = 1; i < (N - 3); i++) {
min = h[i];
max = h[i + K - 1];
if (ans > (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
sort(h.begin(), h.end());
int ans = h[K - 1] - h[0];
for (int i = 1; i < (N - (K - 1)); i++) {
if (ans > (h[i + K - 1] - h[i])) {
ans = (h[i + K -... | replace | 12 | 19 | 12 | 16 | 0 | |
p03208 | 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 | |
p03208 | C++ | Runtime Error | // AUTHOR:BlackBox Inc.//
#include <bits/stdc++.h>
#include <tr1/unordered_map>
#include <unordered_map>
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define endl "\n"
#define vpii vector<pair<int, int>>
#define vs vector<s... | // AUTHOR:BlackBox Inc.//
#include <bits/stdc++.h>
#include <tr1/unordered_map>
#include <unordered_map>
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define endl "\n"
#define vpii vector<pair<int, int>>
#define vs vector<s... | replace | 46 | 50 | 46 | 50 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03208 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define LL long long
#define MAXN 110
#define debug(x) cerr << #x << " " << x << endl
using namespace std... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define LL long long
#define MAXN 100010
#define debug(x) cerr << #x << " " << x << endl
using namespace ... | replace | 13 | 14 | 13 | 14 | 0 | |
p03208 | Python | Runtime Error | n, k = map(int, input().split())
h = sorted([int(input()) for _ in range(n)])
ans = 1000000000
for i in range(n - k + 1):
ans = min(ans, h[i + k - 11] - h[i])
print(ans)
| n, k = map(int, input().split())
h = sorted([int(input()) for _ in range(n)])
ans = 1000000000
for i in range(n - k + 1):
ans = min(ans, h[i + k - 1] - h[i])
print(ans)
| replace | 5 | 6 | 5 | 6 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03208/Python/s843004810.py", line 6, in <module>
ans = min(ans, h[i + k - 11] - h[i])
IndexError: list index out of range
|
p03208 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a)... | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a)... | replace | 47 | 57 | 47 | 50 | TLE | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h.begin(), h.end());
int mi = 10000000000;
for (int i = 0; i < n - 2; i++) {
if (h[k + i - 1] - h[i] < mi) {
mi = h[k + i - 1] - h[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h.begin(), h.end());
int mi = 10000000000;
for (int i = 0; i < n + 1 - k; i++) {
if (h[k + i - 1] - h[i] < mi) {
mi = h[k + i - 1] - h[i]... | replace | 16 | 17 | 16 | 17 | 0 | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define fs first
#define sc second
ll si[51];
ll pa[51];
int mai... | #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define fs first
#define sc second
ll si[51];
ll pa[51];
int mai... | replace | 24 | 25 | 24 | 25 | 0 | |
p03209 | C++ | Runtime Error | #include <cstdio>
long long a[51];
long long p[51];
long long f(int n, long long x) {
if (n == 0)
if (x <= 0)
return 0;
else
return 1;
else if (x <= 1 + a[n - 1])
return f(n - 1, x - 1);
else
return p[n - 1] + 1 + f(n - 1, x - 2 - a[n - 1]);
}
int main() {
int n;
long long x;
fre... | #include <cstdio>
long long a[51];
long long p[51];
long long f(int n, long long x) {
if (n == 0)
if (x <= 0)
return 0;
else
return 1;
else if (x <= 1 + a[n - 1])
return f(n - 1, x - 1);
else
return p[n - 1] + 1 + f(n - 1, x - 2 - a[n - 1]);
}
int main() {
int n;
long long x;
// ... | replace | 17 | 19 | 17 | 19 | -11 | |
p03209 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> a(51), p(51);
ll f(ll N, ll X) {
if (X == 1) {
return 0;
} else if (X <= 1 + a[N - 1]) {
return f(N - 1, X - 1);
} else {
return p[N - 1] + 1 + f(N - 1, X - 2 - a[N - 1]);
}
}
int main() {
ll n, x;
cin >> n >> x;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> a(51), p(51);
ll f(ll N, ll X) {
if (N == 0 && X >= 1) {
return 1;
} else if (X <= 0) {
return 0;
} else if (X <= 1 + a[N - 1]) {
return f(N - 1, X - 1);
} else {
return p[N - 1] + 1 + f(N - 1, X - 2 - a[N - 1]);
... | replace | 7 | 8 | 7 | 10 | -11 | |
p03209 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
vector<long long> P(55), ALL(55);
long long calc(long long N, long long X) {
if (X == 0)
return 0;
else if (1 < X && X < ALL.at(N - 1) + 2)
return calc(N - 1, X - 1);
else if (X == ALL.at(N - 1) + 2)
return P.at(N - 1) + 1;
else ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
vector<long long> P(55), ALL(55);
long long calc(long long N, long long X) {
if (N == 0) {
if (X <= 0)
return 0;
else
return 1;
} else if (X == 0)
return 0;
else if (1 < X && X < ALL.at(N - 1) + 2)
return calc(N - 1... | replace | 7 | 8 | 7 | 13 | 0 | |
p03209 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
long long f(int N, long long X) {
vector<long long> sum = {1};
vector<long long> pat = {1};
for (int i = 0; i < N; i++) {
sum.push_back(sum[i] * 2 + 3);
pat.push_back(pat[i] * 2 + 1);
}
if (X == 1) {
return 0;
} else if (X <= 1 + sum[N - 1]) {
r... | #include "bits/stdc++.h"
using namespace std;
long long f(int N, long long X) {
vector<long long> sum = {1};
vector<long long> pat = {1};
for (int i = 0; i < N; i++) {
sum.push_back(sum[i] * 2 + 3);
pat.push_back(pat[i] * 2 + 1);
}
if (N == 0) {
if (X <= 0) {
return 0;
} else {
re... | replace | 10 | 12 | 10 | 16 | -11 | |
p03209 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | replace | 36 | 37 | 36 | 37 | TLE | |
p03209 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
typedef long long li;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define df 0
template <class T> void print(const T &t) { cout << t << "\n"; }
template <class T, class... Ts> void print(const T &t, const Ts &...ts) {
cout << t;
if (sizeof...(ts))
c... | #include <iostream>
#include <vector>
using namespace std;
typedef long long li;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define df 0
template <class T> void print(const T &t) { cout << t << "\n"; }
template <class T, class... Ts> void print(const T &t, const Ts &...ts) {
cout << t;
if (sizeof...(ts))
c... | replace | 17 | 18 | 17 | 20 | 0 | |
p03209 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
long long counter = 0;
void set(long long n, long long x) {
if (n == 0 & x == 1) {
counter += 1;
return;
} else if (x == 1 || x == 0) {
return;
} else if (x >= po... |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
long long counter = 0;
void set(long long n, long long x) {
if (n == 0) {
if (x == 0) {
return;
} else {
counter += 1;
return;
}
} else if (x == 1... | replace | 12 | 15 | 12 | 19 | TLE | |
p03209 | C++ | Runtime Error | #include "bits/stdc++.h"
#define PRECISION(x) cout << fixed << setprecision(x)
#define FAST_IO \
ios::sync_with_stdio(false); \
cin.tie(NULL); ... | #include "bits/stdc++.h"
#define PRECISION(x) cout << fixed << setprecision(x)
#define FAST_IO \
ios::sync_with_stdio(false); \
cin.tie(NULL); ... | replace | 32 | 37 | 32 | 36 | 0 | |
p03209 | C++ | Runtime Error | /*
[abc115] D - Christmas
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long... | /*
[abc115] D - Christmas
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long... | delete | 27 | 28 | 27 | 27 | 0 | |
p03209 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
vector<ll> p = {1}, b = {1};
ll solve(ll n, ll x) {
if (x == 1)
return 0;
else if (x ... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
vector<ll> p = {1}, b = {1};
ll solve(ll n, ll x) {
if (n == 0)
return x <= 0 ? 0 : 1;
... | replace | 17 | 19 | 17 | 19 | -11 | |
p03209 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | replace | 1,009 | 1,011 | 1,009 | 1,013 | TLE | |
p03209 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
#define ll long long
ll all(ll n) {
if (n == 0)
return 1;
else
return all(n - 1) * 2 + 3;
}
ll apy(ll n) {
if (n == 0)
return 1;
return apy(n - 1) * 2 + 1;
}
ll pty(ll n, ll k) {
ll a = all(n - 1);
ll sum = (k > a + 1);
if (k <= 0 || k <= n)
retu... | #include <iostream>
using namespace std;
#define ll long long
ll all(ll n) {
if (n < 0)
return 0;
if (n == 0)
return 1;
else
return all(n - 1) * 2 + 3;
}
ll apy(ll n) {
if (n == 0)
return 1;
return apy(n - 1) * 2 + 1;
}
ll pty(ll n, ll k) {
ll a = all(n - 1);
ll sum = (k > a + 1);
if ... | insert | 5 | 5 | 5 | 7 | TLE | |
p03209 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
map<pair<ll, ll>, ll> mp;
ll f(ll i, ll x) {
if (x-- == 0)
return 0;
if (i-- == 0)
return 1;
ll a = (1LL << i + 2) - 3;
ll res;
if (!x)
res = 0;
else if (x < a + 1)
res = f(i, x);
else
res = f(i, a) + f(i, x - a - 1) +... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
map<pair<ll, ll>, ll> mp;
ll f(ll i, ll x) {
if (mp.count({i, x}))
return mp[{i, x}];
if (x-- == 0)
return 0;
if (i-- == 0)
return 1;
ll a = (1LL << i + 2) - 3;
ll res;
if (!x)
res = 0;
else if (x < a + 1)
res = f(i, x... | insert | 5 | 5 | 5 | 7 | TLE | |
p03209 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
typedef long long ll;
vector<ll> a(51, 0);
ll ttl(ll n) {
if (n == 0)
a.at(n) = 1;
else
a.at(n) = 3 + 2 * ttl(n - 1);
return a.at(n);
}
ll dfs(int n, ll i) {
if (!n)
return 1;
if (i == 1)
return 0... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
typedef long long ll;
vector<ll> a(51, 0);
ll ttl(ll n) {
if (n == 0)
a.at(n) = 1;
else
a.at(n) = 3 + 2 * ttl(n - 1);
return a.at(n);
}
ll dfs(int n, ll i) {
if (!n)
return 1;
if (i == 1)
return 0... | replace | 23 | 24 | 23 | 24 | 0 | |
p03209 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, X;
cin >> N >> X;
if (N == 1) {
if (X < 5)
cout << X - 1 << endl;
else
cout << X - 2 << endl;
return 0;
}
// P /-1- /1
// BPPPB 1-1/-3- (2/3)/3+1*2=5
// BBPPPBPBPPPBB2-1-1-2/-3-1-3 (6/7)/3+5*2=13... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, X;
cin >> N >> X;
if (N == 1) {
if (X < 5)
cout << X - 1 << endl;
else
cout << X - 2 << endl;
return 0;
}
// P /-1- /1
// BPPPB 1-1/-3- (2/3)/3+1*2=5
// BBPPPBPBPPPBB2-1-1-2/-3-1-3 (6/7)/3+5*2=13... | replace | 30 | 31 | 30 | 31 | 0 | |
p03209 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <random>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
ll total = 1;
vector<ll> length;
vector<ll> P_length;
ll sum(ll N, ll X) {
if (N ==... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <random>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
ll total = 1;
vector<ll> length;
vector<ll> P_length;
ll sum(ll N, ll X) {
if (N ==... | replace | 38 | 40 | 38 | 40 | 0 | |
p03209 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
vector<ll> num;
vector<ll> p;
// レベルN層の左からXにあるPの数
ll findNum(int N, ll X) {
if (N == 0)
return 1;
if (X == 1)
return 0;
else if (X <= num[N] / 2) {
return findNum(N - 1, X - 1);
} else if (X == (num[N] / 2 + 1)) {
... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
vector<ll> num;
vector<ll> p;
// レベルN層の左からXにあるPの数
ll findNum(int N, ll X) {
if (N == 0)
return 1;
if (X == 1)
return 0;
else if (X <= num[N] / 2) {
return findNum(N - 1, X - 1);
} else if (X == (num[N] / 2 + 1)) {
... | replace | 30 | 32 | 30 | 32 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03209 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using pss = pair<string, string>;
using pcc = pair<char, char>;
using pbb = pair<bool, bool>;
using pil = pair<int,... | #define _GLIBCXX_DEBUG
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using pss = pair<string, string>;
using pcc = pair<char, char>;
using pbb = pair<bool, bool>;
using pil = pair<int,... | replace | 298 | 299 | 298 | 299 | 0 | |
p03209 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
template <typename T... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
template <typename T... | replace | 36 | 37 | 36 | 37 | 0 | |
p03209 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/*
L(0) := P
L(n) := B L(n-1) P L(n-1) B
*/
ll f(int n) { return n == 0 ? 1 : f(n - 1) * 2 + 3; }
ll g(int n) { return n == 0 ? 1 : g(n - 1) * 2 + 1; }
ll calc(int n, ll x) {
if (x <= 0)
return 0;
if (n == 0) {
assert(x == 1);
retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/*
L(0) := P
L(n) := B L(n-1) P L(n-1) B
*/
ll f(int n) { return n == 0 ? 1 : f(n - 1) * 2 + 3; }
ll g(int n) { return n == 0 ? 1 : g(n - 1) * 2 + 1; }
ll calc(int n, ll x) {
if (x <= 0)
return 0;
if (n == 0) {
// assert(x==1);
retu... | replace | 17 | 18 | 17 | 18 | 0 | |
p03209 | C++ | Runtime Error | #include <algorithm>
#include <chrono>
#include <climits>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#defin... | #include <algorithm>
#include <chrono>
#include <climits>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#defin... | insert | 50 | 50 | 50 | 52 | 0 | vec.at(50): 4503599627370493
cnt.at(50): 2251799813685247
i: 2, X: 0
|
p03209 | C++ | Runtime Error | #include <iostream>
using namespace std;
long long layer_num[51], patty_num[51];
long long getPatty(long long level, long long x) {
if (level == 0 && x == 1) {
return 1;
} else if (level == 0 && x != 0) {
return 0;
} else {
if (x < layer_num[level - 1] + 1) {
return getPatty(level - 1, x - 1);... | #include <iostream>
using namespace std;
long long layer_num[51], patty_num[51];
long long getPatty(long long level, long long x) {
if (level == 0 && x == 1) {
return 1;
} else if (level == 0 && x != 1) {
return 0;
} else {
if (x < layer_num[level - 1] + 1) {
return getPatty(level - 1, x - 1);... | replace | 8 | 9 | 8 | 9 | 0 | |
p03209 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
int n;
ll x;
ll h[51], p[51];
ll dfs(ll n, ll x) {
if (n == 0 && x > 0)
return 1;
if (n == 0 && x == 0)
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
int n;
ll x;
ll h[51], p[51];
ll dfs(ll n, ll x) {
if (n == 0 && x > 0)
return 1;
if (n == 0 && x <= 0)
... | replace | 14 | 15 | 14 | 15 | -11 | |
p03209 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define invrepr(i, a, b) for (int i = b - 1; i >= a; i--)
#define invrep(i, n) invrepr(i, 0, n)
#define repitr(itr, a) for (auto itr = a.begin(); itr != a.e... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define invrepr(i, a, b) for (int i = b - 1; i >= a; i--)
#define invrep(i, n) invrepr(i, 0, n)
#define repitr(itr, a) for (auto itr = a.begin(); itr != a.e... | replace | 16 | 17 | 16 | 17 | 0 | |
p03209 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define DEBUG 0
#define lli long long unsigned int
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
vector<lli> a, b, p;
lli calc(lli level, lli num) {
lli right = 0;
lli... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define DEBUG 0
#define lli long long unsigned int
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
vector<lli> a, b, p;
lli calc(lli level, lli num) {
lli right = 0;
lli... | replace | 44 | 47 | 44 | 47 | 0 | |
p03209 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MAX 50
long long N;
long long X;
long long num[MAX + 1][2];
long long dfs(long long n, long long x, long long add) {
if (n > 0 && x <= n) {
return add;
} else if (num[n][0] - n <= x && x <= num[n][0]) {
return num[n][1] + add;
} else if (x <= num[n... | #include <bits/stdc++.h>
using namespace std;
#define MAX 50
long long N;
long long X;
long long num[MAX + 1][2];
long long dfs(long long n, long long x, long long add) {
if (n > 0 && x <= n) {
return add;
} else if (num[n][0] - n <= x && x <= num[n][0]) {
return num[n][1] + add;
} else if (x <= num[n... | replace | 30 | 31 | 30 | 31 | 0 | |
p03209 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
};
} hoee;
// 別名
#define int long long
#define ull unsigned long long
#define vec vector
#define con continue
#define bre break
#define brk break
#define is ==
#define eq ==
#define no !=
#def... | #include <bits/stdc++.h>
using namespace std;
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
};
} hoee;
// 別名
#define int long long
#define ull unsigned long long
#define vec vector
#define con continue
#define bre break
#define brk break
#define is ==
#define eq ==
#define no !=
#def... | replace | 792 | 793 | 792 | 793 | 0 | |
p03209 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define se second
#define fi first
#define ll long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mod 1000000007
ll power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b % 2 != 0)
res = (res * a);
a = (a * a);
b... | #include <bits/stdc++.h>
using namespace std;
#define se second
#define fi first
#define ll long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mod 1000000007
ll power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b % 2 != 0)
res = (res * a);
a = (a * a);
b... | replace | 52 | 53 | 52 | 53 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.