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; // VI a(n);
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<VS> VSS;
typedef vector<VC> VCC;
typedef vector<VI> VII; // VII a(n,vector<int>(m)) n * m
typedef vector<VL> VLL;
typedef pair<int, int> PII;
typedef map<int, int> MP; // MP a;
typedef vector<pair<int, int>> PS;
typedef long long ll; // ll とdoubleは違う
template <class T> // chmax(max, a);
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> // chmin(min,a)
bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> // operator << (cout,a);
ostream &operator<<(ostream &os, vector<T> &v) {
os << "{";
rep(i, (int)v.size()) { os << v[i] << (i < v.size() - 1 ? ", " : ""); }
os << "}";
return os;
}
ll Max = -1, Min = 1e9 + 1;
int main() {
ll b, x = 0, y = 0, n, m, k, w, sum = 0;
string s, t;
bool f = true;
cin >> n >> k;
VL a(n);
rep(i, n) { cin >> a[i]; }
sort(ALL(a));
rep(i, n) {
if (Min > a[i + k - 1] - a[i])
Min = a[i + k - 1] - a[i];
}
cout << Min << endl;
return 0;
}
| #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; // VI a(n);
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<VS> VSS;
typedef vector<VC> VCC;
typedef vector<VI> VII; // VII a(n,vector<int>(m)) n * m
typedef vector<VL> VLL;
typedef pair<int, int> PII;
typedef map<int, int> MP; // MP a;
typedef vector<pair<int, int>> PS;
typedef long long ll; // ll とdoubleは違う
template <class T> // chmax(max, a);
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> // chmin(min,a)
bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> // operator << (cout,a);
ostream &operator<<(ostream &os, vector<T> &v) {
os << "{";
rep(i, (int)v.size()) { os << v[i] << (i < v.size() - 1 ? ", " : ""); }
os << "}";
return os;
}
ll Max = -1, Min = 1e9 + 1;
int main() {
ll b, x = 0, y = 0, n, m, k, w, sum = 0;
string s, t;
bool f = true;
cin >> n >> k;
VL a(n);
rep(i, n) { cin >> a[i]; }
sort(ALL(a));
rep(i, n - k + 1) {
if (Min > a[i + k - 1] - a[i])
Min = a[i + k - 1] - a[i];
}
cout << Min << endl;
return 0;
}
| 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) (c).erase(unique(all((c))), end((c)))
int main() {
long long N, K;
cin >> N >> K;
--K;
vector<long long> h(N);
rep(i, 0, N) cin >> h[i];
sort(h.begin(), h.end(), greater<>());
long long ans = INFL;
for (long long i = 0; i < h.size(); i += K) {
ans = min(ans, h[i] - h[i + K]);
}
cout << ans << endl;
} | #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) (c).erase(unique(all((c))), end((c)))
int main() {
long long N, K;
cin >> N >> K;
--K;
vector<long long> h(N);
rep(i, 0, N) cin >> h[i];
sort(h.begin(), h.end(), greater<>());
long long ans = INFL;
for (long long i = 0; i < h.size() - K; i++) {
ans = min(ans, h[i] - h[i + K]);
}
cout << ans << endl;
} | 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 (int i = K; i <= n; i++)
min_val = min(min_val, arr[i] - arr[i - K + 1]);
printf("%d", min_val);
return 0;
} | // 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 (int i = K; i <= n; i++)
min_val = min(min_val, arr[i] - arr[i - K + 1]);
printf("%d", min_val);
return 0;
} | 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 = vec.at(K + X - 1) - vec.at(X);
}
}
cout << H << endl;
} | #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) {
H = vec.at(K + X - 1) - vec.at(X);
}
}
cout << H << endl;
} | 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('\n')
#define inf 2147483647
#define N 10005
#define File(a) freopen(a ".in", "r", stdin), freopen(a ".out", "w", stdout)
template <class T1> inline void read(T1 &);
template <class T1> inline void write(T1);
int a[N];
int main() {
int n, k;
read(n);
read(k);
for (int i = 1; i <= n; ++i) {
read(a[i]);
}
sort(a + 1, a + n + 1);
int ans = inf;
for (int i = 1; i <= n - k + 1; ++i) {
ans = min(ans, a[i + k - 1] - a[i]);
}
write(ans);
EL;
return 0;
}
template <class T1> void read(T1 &r_e_a_d) {
T1 k = 0;
char ch = getchar();
int flag = 1;
while (!isNum(ch)) {
if (ch == '-') {
flag = -1;
}
ch = getchar();
}
while (isNum(ch)) {
k = (k << 1) + (k << 3) + ch - '0';
ch = getchar();
}
r_e_a_d = flag * k;
}
template <class T1> void write(T1 w_r_i_t_e) {
if (w_r_i_t_e < 0) {
putchar('-');
write(-w_r_i_t_e);
} else {
if (w_r_i_t_e < 10) {
putchar(w_r_i_t_e + '0');
} else {
write(w_r_i_t_e / 10);
putchar((w_r_i_t_e % 10) + '0');
}
}
}
| #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('\n')
#define inf 2147483647
#define N 100005
#define File(a) freopen(a ".in", "r", stdin), freopen(a ".out", "w", stdout)
template <class T1> inline void read(T1 &);
template <class T1> inline void write(T1);
int a[N];
int main() {
int n, k;
read(n);
read(k);
for (int i = 1; i <= n; ++i) {
read(a[i]);
}
sort(a + 1, a + n + 1);
int ans = inf;
for (int i = 1; i <= n - k + 1; ++i) {
ans = min(ans, a[i + k - 1] - a[i]);
}
write(ans);
EL;
return 0;
}
template <class T1> void read(T1 &r_e_a_d) {
T1 k = 0;
char ch = getchar();
int flag = 1;
while (!isNum(ch)) {
if (ch == '-') {
flag = -1;
}
ch = getchar();
}
while (isNum(ch)) {
k = (k << 1) + (k << 3) + ch - '0';
ch = getchar();
}
r_e_a_d = flag * k;
}
template <class T1> void write(T1 w_r_i_t_e) {
if (w_r_i_t_e < 0) {
putchar('-');
write(-w_r_i_t_e);
} else {
if (w_r_i_t_e < 10) {
putchar(w_r_i_t_e + '0');
} else {
write(w_r_i_t_e / 10);
putchar((w_r_i_t_e % 10) + '0');
}
}
}
| 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 = 998244353;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
int ans = mod;
rep(i, n + 1 - k) {
int cans = h[k - 1 - i] - h[i];
ans = min(ans, cans);
}
cout << ans << endl;
} | #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 = 998244353;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
int ans = mod;
rep(i, n + 1 - k) {
int cans = h[k - 1 + i] - h[i];
ans = min(ans, cans);
}
cout << ans << endl;
} | 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;
ma = min(ma, a[i + k - 1] - a[i]);
}
cout << ma << 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 <= tc - k; i++) {
// cout<<a[i+k-1]<<' '<<a[i]<<endl;
ma = min(ma, a[i + k - 1] - a[i]);
}
cout << ma << endl;
}
} | 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; ++i) {
cin >> tree[i];
}
sort(tree, &tree[N], std::greater<>());
uint64_t difMin = tree[0] - tree[K - 1];
for (int i = 0; i < N - K; ++i) {
difMin = min(difMin, tree[i] - tree[i - K - 1]);
}
cout << difMin << endl;
return 0;
} | #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; ++i) {
cin >> tree[i];
}
sort(tree, &tree[N], std::greater<>());
uint64_t difMin = tree[0] - tree[K - 1];
for (int i = 0; i < N - K + 1; ++i) {
difMin = min(difMin, tree[i] - tree[i + K - 1]);
}
cout << difMin << endl;
return 0;
} | 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);
int ans = 1e17;
for (int i = 0; i < n; i++) {
ans = min(ans, arr[i + k - 1] - arr[i]);
}
cout << ans;
} | #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);
int ans = 1e17;
for (int i = 0; i <= n - k; i++) {
ans = min(ans, arr[i + k - 1] - arr[i]);
}
cout << ans;
} | 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 - k + 1];
}
cout << min << endl;
return 0;
} | #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 = a[i] - a[i - k + 1];
}
cout << min << endl;
return 0;
} | 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[i];
}
}
cout << min << endl;
} | #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] - h[i];
}
}
cout << min << endl;
} | 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 std;
using ll = long long;
typedef pair<int, int> pii;
int main() {
ll a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, g = 0, h = 0, ans = 0;
string s, t;
ll x[10004] = {};
cin >> a;
cin >> b;
for (int i = 0; i < a; i++) {
cin >> x[i];
}
sort(x, x + a);
c = 10000000000000000;
for (int i = 0; i < a - b + 1; i++) {
c = min(abs(x[i] - x[i + b - 1]), c);
}
cout << c << endl;
// cout << ans << endl;
// cout << << endl;
////std::cout << std::fixed;
// cout << std::setprecision(20) << << endl;
// cout << d+1 << endl;
// cout << "" << endl;
return 0;
}
// char型の文字数字は、-'0'で数値に変換できる
// accumulate(x, x + a, 0);//int型までの配列の合計
// memcpy(x, visited, sizeof(ll)*n);
// void kansuu(ll num, ll visited[10]) {}
// kansuu(1, zz);
// cout << setprecision(15) << v << endl;
// cout << char(z - 'a');
// log10(i) + 1 //10進数の桁数を取得
// int temp;
// for (int i = 0; i < n - 1; i++) {
// for (int j = n - 1; j > i; j--) {
// if (w[j - 1] < w[j]) { /* 前の要素の方が大きかったら */
// temp = w[j]; /* 交換する */
// w[j] = w[j - 1];
// w[j - 1] = temp;
// }
// }
// }
// 最小公倍数
// ll x = a * b;
// ll tmp;
///* 自然数 a > b を確認・入替 */
// if (a<b) {
// tmp = a;
// a = b;
// b = tmp;
// }
///* ユークリッドの互除法 */
// ll r = a % b;
// while (r != 0) {
// a = b;
// b = r;
// r = a % b;
// }
// a = x / b;//答え | #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 std;
using ll = long long;
typedef pair<int, int> pii;
int main() {
ll a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, g = 0, h = 0, ans = 0;
string s, t;
ll x[10000007] = {};
cin >> a;
cin >> b;
for (int i = 0; i < a; i++) {
cin >> x[i];
}
sort(x, x + a);
c = 10000000000000000;
for (int i = 0; i < a - b + 1; i++) {
c = min(abs(x[i] - x[i + b - 1]), c);
}
cout << c << endl;
// cout << ans << endl;
// cout << << endl;
////std::cout << std::fixed;
// cout << std::setprecision(20) << << endl;
// cout << d+1 << endl;
// cout << "" << endl;
return 0;
}
// char型の文字数字は、-'0'で数値に変換できる
// accumulate(x, x + a, 0);//int型までの配列の合計
// memcpy(x, visited, sizeof(ll)*n);
// void kansuu(ll num, ll visited[10]) {}
// kansuu(1, zz);
// cout << setprecision(15) << v << endl;
// cout << char(z - 'a');
// log10(i) + 1 //10進数の桁数を取得
// int temp;
// for (int i = 0; i < n - 1; i++) {
// for (int j = n - 1; j > i; j--) {
// if (w[j - 1] < w[j]) { /* 前の要素の方が大きかったら */
// temp = w[j]; /* 交換する */
// w[j] = w[j - 1];
// w[j - 1] = temp;
// }
// }
// }
// 最小公倍数
// ll x = a * b;
// ll tmp;
///* 自然数 a > b を確認・入替 */
// if (a<b) {
// tmp = a;
// a = b;
// b = tmp;
// }
///* ユークリッドの互除法 */
// ll r = a % b;
// while (r != 0) {
// a = b;
// b = r;
// r = a % b;
// }
// a = x / b;//答え | 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) {
d_min = d;
} else {
if (d < d_min) {
d_min = d;
}
}
}
cout << d_min << endl;
} | #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) {
d_min = d;
} else {
if (d < d_min) {
d_min = d;
}
}
}
cout << d_min << endl;
} | 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++) {
cin >> h[i];
}
sort(h.begin(), h.end());
unsigned long long min = 0 - 1;
for (unsigned long long i = n - 1; i >= n - k; i--) {
if (min > h[i] - h[i - k + 1]) {
min = h[i] - h[i - k + 1];
}
}
cout << min << endl;
}
| #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++) {
cin >> h[i];
}
sort(h.begin(), h.end());
unsigned long long min = 0 - 1;
for (unsigned long long i = n - 1; i >= k - 1; i--) {
if (min > h[i] - h[i - k + 1]) {
min = h[i] - h[i - k + 1];
}
}
cout << min << endl;
}
| 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" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
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 = INF;
rep(i, K) { ans = min(ans, h[i + K - 1] - h[i]); }
print(ans);
}
| #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" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
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 = INF;
rep(i, N - K + 1) { ans = min(ans, h[i + K - 1] - h[i]); }
print(ans);
}
| 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 << endl;
} | 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 _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) \
sort(all(x)); \
x.erase(unique(all(x)), x.end())
#define ten(n) ((int)1e##n)
template <class T, size_t N> size_t sza(const T (&array)[N]) { return N; }
template <class T> inline void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
// dump macro
#ifdef PCM
#include "dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#endif
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int, int> pii;
typedef tuple<int, int, int> iii;
template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
#define fi first
#define se second
// }}}
int solve() {
int n, k;
cin >> n >> k;
int h[n];
rep(i, n) { cin >> h[i]; }
sort(h, h + n);
int ans = INF;
set<int> s;
rep(i, k) { s.insert(h[i]); }
int M = *s.rbegin();
int m = *s.begin();
// dump(M-m);
chmin(ans, M - m);
rep(i, k, n) {
s.erase(h[i - k]);
s.insert(h[i]);
int M = *max_element(all(s));
int m = *min_element(all(s));
chmin(ans, M - m);
}
cout << ans << endl;
return 0;
}
signed main() { //{{{
#ifdef INPUT_FROM_FILE
std::ifstream in(infile);
std::cin.rdbuf(in.rdbuf());
#endif
solve();
return 0;
} //}}}
| // 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 _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) \
sort(all(x)); \
x.erase(unique(all(x)), x.end())
#define ten(n) ((int)1e##n)
template <class T, size_t N> size_t sza(const T (&array)[N]) { return N; }
template <class T> inline void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
// dump macro
#ifdef PCM
#include "dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#endif
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int, int> pii;
typedef tuple<int, int, int> iii;
template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
#define fi first
#define se second
// }}}
int solve() {
int n, k;
cin >> n >> k;
int h[n];
rep(i, n) { cin >> h[i]; }
sort(h, h + n);
int ans = INF;
set<int> s;
rep(i, k) { s.insert(h[i]); }
int M = *s.rbegin();
int m = *s.begin();
// dump(M-m);
chmin(ans, M - m);
rep(i, k, n) {
s.erase(h[i - k]);
s.insert(h[i]);
int M = *s.rbegin();
int m = *s.begin();
chmin(ans, M - m);
}
cout << ans << endl;
return 0;
}
signed main() { //{{{
#ifdef INPUT_FROM_FILE
std::ifstream in(infile);
std::cin.rdbuf(in.rdbuf());
#endif
solve();
return 0;
} //}}}
| 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; i < N - K + 1; i++) {
now = h[i + K - 1] - h[i];
ans = min(ans, now);
}
cout << ans << endl;
}
| #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;
for (int i = 0; i < N - K + 1; i++) {
now = h[i + K - 1] - h[i];
ans = min(ans, now);
}
cout << ans << endl;
}
| 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>
#include <time.h>
#include <tuple>
#include <vector>
using namespace std;
// #define int long long
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define fi first
#define se second
#define chmin(a, b) a = min((a), (b))
#define chmax(a, b) a = max((a), (b))
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
typedef pair<pint, int> P1;
typedef pair<int, pint> P2;
typedef pair<pint, pint> PP;
static const ll maxLL = (ll)1 << 62;
const ll MOD = 1000000007;
const ll INF = 1e18;
const double PI = 3.14159265;
int ca[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
signed main() {
int i, j;
int n, k;
vector<int> list;
cin >> n >> k;
for (i = 0; i < n; i++) {
int num;
cin >> num;
list.push_back(num);
}
sort(list.begin(), list.end(), greater<int>());
int minn = 999999999;
for (i = 0; i < n + (k - 1); i++) {
minn = min(minn, list[i] - list[i + (k - 1)]);
}
cout << minn << endl;
getchar();
getchar();
return 0;
} | #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>
#include <time.h>
#include <tuple>
#include <vector>
using namespace std;
// #define int long long
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define fi first
#define se second
#define chmin(a, b) a = min((a), (b))
#define chmax(a, b) a = max((a), (b))
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
typedef pair<pint, int> P1;
typedef pair<int, pint> P2;
typedef pair<pint, pint> PP;
static const ll maxLL = (ll)1 << 62;
const ll MOD = 1000000007;
const ll INF = 1e18;
const double PI = 3.14159265;
int ca[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
signed main() {
int i, j;
int n, k;
vector<int> list;
cin >> n >> k;
for (i = 0; i < n; i++) {
int num;
cin >> num;
list.push_back(num);
}
sort(list.begin(), list.end(), greater<int>());
int minn = 999999999;
for (i = 0; i < n - (k - 1); i++) {
minn = min(minn, list[i] - list[i + (k - 1)]);
}
cout << minn << endl;
getchar();
getchar();
return 0;
} | 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>
#include <time.h>
#include <tuple>
#include <vector>
using namespace std;
// #define int long long
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define fi first
#define se second
#define chmin(a, b) a = min((a), (b))
#define chmax(a, b) a = max((a), (b))
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
typedef pair<pint, int> P1;
typedef pair<int, pint> P2;
typedef pair<pint, pint> PP;
static const ll maxLL = (ll)1 << 62;
const ll MOD = 1000000007;
const ll INF = 1e18;
const double PI = 3.14159265;
int ca[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
signed main() {
int i, j;
int n, k;
vector<int> list;
cin >> n >> k;
for (i = 0; i < n; i++) {
int num;
cin >> num;
list.push_back(num);
}
sort(list.begin(), list.end(), greater<int>());
int minn = 999999999;
for (i = 0; i < n - (k - 1); i++) {
minn = min(minn, list[i] - list[i - (k - 1)]);
}
cout << minn << endl;
getchar();
getchar();
return 0;
} | #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>
#include <time.h>
#include <tuple>
#include <vector>
using namespace std;
// #define int long long
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define fi first
#define se second
#define chmin(a, b) a = min((a), (b))
#define chmax(a, b) a = max((a), (b))
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
typedef pair<pint, int> P1;
typedef pair<int, pint> P2;
typedef pair<pint, pint> PP;
static const ll maxLL = (ll)1 << 62;
const ll MOD = 1000000007;
const ll INF = 1e18;
const double PI = 3.14159265;
int ca[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
signed main() {
int i, j;
int n, k;
vector<int> list;
cin >> n >> k;
for (i = 0; i < n; i++) {
int num;
cin >> num;
list.push_back(num);
}
sort(list.begin(), list.end(), greater<int>());
int minn = 999999999;
for (i = 0; i < n - (k - 1); i++) {
minn = min(minn, list[i] - list[i + (k - 1)]);
}
cout << minn << endl;
getchar();
getchar();
return 0;
} | 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 <= n - k; i++)
ans = min(ans, h[i + k - 1] - h[i]);
cout << ans << endl;
} | #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 <= n - k; i++)
ans = min(ans, h[i + k - 1] - h[i]);
cout << ans << endl;
} | 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_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
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 ro = n - k;
int ans = INT32_MAX;
for (int i = 0; i <= ro; i++) {
ans =
min(ans, *max_element(next(h.begin(), i), next(h.begin(), i + k)) -
*min_element(next(h.begin(), i), next(h.begin(), i + k)));
}
cout << ans << endl;
return 0;
} | #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_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
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 ro = n - k;
int ans = INT32_MAX;
for (int i = 0; i <= ro; i++) {
ans = min(ans, h[i + k - 1] - h[i]);
}
cout << ans << endl;
return 0;
} | 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 <stack>
// 最大公約数
ll gcd(ll a, ll b) {
if (b == 0LL)
return a;
return gcd(b, a % b);
}
// 最小公倍数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int n;
int k;
cin >> n >> k;
vector<ll> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
ll min = 100000000000;
for (int i = 0; i < n; i++) {
ll t = abs(h[i] - h[i + k - 1]);
if (min > t) {
min = t;
}
}
cout << min << endl;
} | #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 <stack>
// 最大公約数
ll gcd(ll a, ll b) {
if (b == 0LL)
return a;
return gcd(b, a % b);
}
// 最小公倍数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int n;
int k;
cin >> n >> k;
vector<ll> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
ll min = 100000000000;
for (int i = 0; i + k - 1 < n; i++) {
ll t = abs(h[i] - h[i + k - 1]);
if (min > t) {
min = t;
}
}
cout << min << endl;
} | 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) {
ll tmp = 0;
for (int j = 0; j < k - 1; ++j) {
tmp += h[i + j + 1] - h[i + j];
}
minSumH = min(minSumH, tmp);
if (minSumH == 0) {
break;
}
}
cout << minSumH << endl;
return 0;
} | #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) {
minSumH = min(minSumH, h[i + k - 1] - h[i]);
}
cout << minSumH << endl;
return 0;
} | 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; ++i) {
int diff = heights[i + K - 1] - heights[i];
if (diff < minDiff) {
minDiff = diff;
}
}
cout << minDiff << endl;
} | #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 - K; ++i) {
int diff = heights[i + K - 1] - heights[i];
if (diff < minDiff) {
minDiff = diff;
}
}
cout << minDiff << endl;
} | 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 i = m.begin(); i != m.end(); i++)
int main() {
ll N, K, m, M, ans = INF;
cin >> N >> K;
vector<ll> H(N);
repi(i, N, 0) { cin >> H[i]; }
sort(all(H));
repi(i, N - K + 1, 0) {
M = 0;
m = INF;
repi(j, i + K, i) {
M = max(M, H.at(j));
m = min(m, H.at(j));
}
ans = min(ans, M - m);
if (ans == 0) {
cout << ans << endl;
return 0;
}
}
cout << ans << endl;
return 0;
} | // 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 i = m.begin(); i != m.end(); i++)
int main() {
ll N, K, m, M, ans = INF;
cin >> N >> K;
vector<ll> H(N);
repi(i, N, 0) { cin >> H[i]; }
sort(all(H));
for (ll i = 0; i < N - K + 1; i++) {
ans = min(ans, H.at(i + K - 1) - H.at(i));
}
cout << ans << endl;
return 0;
} | 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;
// int A[K];
for (int64_t i = 0; i < N - K + 1; i++) {
int64_t htmp1 = 0, htmp2 = 1e10;
for (int64_t j = i; j < K + i; j++) {
// cout << "i=" << i << ",j=" << j << endl;
// if(j==0){
A[j - i] = H[j];
// }
// else{}
// cout << htmp1 << " " << htmp2 << endl;
}
// cout << htmp1 << " " << htmp2 << endl;
sort(A.begin(), A.end());
ans = min(ans, A[K - 1] - A[0]);
if (ans == 0)
break;
}
cout << ans << endl;
} | #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;
// int A[K];
for (int64_t i = 0; i < N - K + 1; i++) {
int64_t htmp1 = 0, htmp2 = 1e10;
for (int64_t j = i; j < K + i; j++) {
// cout << "i=" << i << ",j=" << j << endl;
// if(j==0){
A[j - i] = H[j];
// }
// else{}
// cout << htmp1 << " " << htmp2 << endl;
}
// cout << htmp1 << " " << htmp2 << endl;
// sort(A.begin(), A.end());
ans = min(ans, A[K - 1] - A[0]);
if (ans == 0)
break;
}
cout << ans << endl;
} | 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 = max(n, m);
m = min(n, m);
if (n % m == 0)
return m;
return gcd(m, n % m);
}
ll lcm(ll n, ll m) { return n * m / gcd(n, m); }
int main() {
int k, n;
cin >> n >> k;
vector<int> h, s;
h.resize(n);
s.resize(n - k);
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h.begin(), h.end());
for (int i = 0; i < n - k + 1; i++)
s[i] = h[i + k - 1] - h[i];
sort(s.begin(), s.end());
cout << s[0] << endl;
} | #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 = max(n, m);
m = min(n, m);
if (n % m == 0)
return m;
return gcd(m, n % m);
}
ll lcm(ll n, ll m) { return n * m / gcd(n, m); }
int main() {
int k, n;
cin >> n >> k;
vector<int> h, s;
h.resize(n);
s.resize(n - k + 1);
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h.begin(), h.end());
for (int i = 0; i < n - k + 1; i++)
s[i] = h[i + k - 1] - h[i];
sort(s.begin(), s.end());
cout << s[0] << endl;
} | 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 - K];
ans = min(ans, dist);
}
cout << ans << endl;
return 0;
}
| #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 << ans << endl;
return 0;
}
| 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];
if (result > (max - min)) {
result = max - min;
}
}
cout << result << endl;
return 0;
}
| #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[i];
if (result > (max - min)) {
result = max - min;
}
}
cout << result << endl;
return 0;
}
| 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) {
// if(ans>x) ans=x;
ans = min(h[i + k - 1] - h[i], ans);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i < (n); i++)
typedef long long ll;
int main() {
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 + 1) {
// if(ans>x) ans=x;
ans = min(h[i + k - 1] - h[i], ans);
}
cout << ans << endl;
} | 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() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
int ans = INTINF;
int prevhight = 0;
for (int i = 0; i < n; i++) {
if (prevhight == h[i]) {
continue;
}
if (ans > h[i + k - 1] - h[i]) {
ans = h[i + k - 1] - h[i];
}
}
cout << ans << endl;
} | // 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() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
int ans = INTINF;
int prevhight = 0;
for (int i = 0; i < n - k + 1; i++) {
if (prevhight == h[i]) {
continue;
}
if (ans > h[i + k - 1] - h[i]) {
ans = h[i + k - 1] - h[i];
}
}
cout << ans << endl;
} | 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, begin, end) \
for (int i = (int)(begin), i##_end = (int)(end); i < i##_end; ++i)
#define rrep2(i, n) rrep3(i, n, 0)
#define rrep3(i, begin, end) \
for (int i = (int)(begin - 1), i##_end = (int)(end); i >= i##_end; --i)
#define foreach(x, a) for (auto &x : a)
using ll = long long;
const ll mod = (ll)1e9 + 7;
//}}}
int p[10000];
int main() {
int N, K;
cin >> N >> K;
rep(i, N) { cin >> p[i]; }
sort(p, p + N);
int ans = p[N - 1] - p[0];
rep(i, N - K + 1) { ans = min(ans, p[i + K - 1] - p[i]); }
cout << ans << endl;
return 0;
}
| //{{{
#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, begin, end) \
for (int i = (int)(begin), i##_end = (int)(end); i < i##_end; ++i)
#define rrep2(i, n) rrep3(i, n, 0)
#define rrep3(i, begin, end) \
for (int i = (int)(begin - 1), i##_end = (int)(end); i >= i##_end; --i)
#define foreach(x, a) for (auto &x : a)
using ll = long long;
const ll mod = (ll)1e9 + 7;
//}}}
int p[100000];
int main() {
int N, K;
cin >> N >> K;
rep(i, N) { cin >> p[i]; }
sort(p, p + N);
int ans = p[N - 1] - p[0];
rep(i, N - K + 1) { ans = min(ans, p[i + K - 1] - p[i]); }
cout << ans << endl;
return 0;
}
| 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];
sort(h, h + n);
long long tmp = 1000000000;
for (int i = 0; i < (n - 2); i++) {
tmp = MIN(h[i + k - 1] - h[i], tmp);
}
cout << tmp << endl;
return 0;
}
| #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];
sort(h, h + n);
long long tmp = 1000000000;
for (int i = 0; i < (n - k + 1); i++) {
tmp = MIN(h[i + k - 1] - h[i], tmp);
}
cout << tmp << endl;
return 0;
}
| 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 + n - 1 < m; i++) {
ans = min(ans, a[i + n - 1] - a[i]);
}
printf("%lld", ans);
} | #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 + n - 1 < m; i++) {
ans = min(ans, a[i + n - 1] - a[i]);
}
printf("%lld", ans);
} | 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;
for (int i = 1; (i + k - 1) <= n; i++) {
ans = min(ans, (h[k + i - 1] - h[i]));
}
printf("%lld\n", ans);
return 0;
}
| #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 = inf;
for (int i = 1; (i + k - 1) <= n; i++) {
ans = min(ans, (h[k + i - 1] - h[i]));
}
printf("%lld\n", ans);
return 0;
}
| 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] - h[i] for i in range(n - k + 1)]))
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03208/Python/s200032587.py", line 4, in <listcomp>
print(min([h[i + k - 1] - h[i] for i in range(n - k + 1)]))
TypeError: unsupported operand type(s) for -: 'str' and 'str'
|
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; ++i) {
ret = min(ret, trees[i + K] - trees[i]);
}
cout << ret << endl;
return 0;
} | #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 - K; ++i) {
ret = min(ret, trees[i + K - 1] - trees[i]);
}
cout << ret << endl;
return 0;
} | 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 long min_diff = LONG_MAX;
for (int i = 0; i < n - k + 1; i++) {
int max_height = 0;
int min_height = INT_MAX;
for (int j = 0; j < k; j++) {
if (max_height < h.at(i + j))
max_height = h.at(i + j);
if (min_height > h.at(i + j))
min_height = h.at(i + j);
}
if (max_height - min_height < min_diff)
min_diff = max_height - min_height;
}
cout << min_diff << endl;
;
} | #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 long min_diff = LONG_MAX;
for (int i = 0; i < n - k + 1; i++) {
int max_height = h.at(i + k - 1);
int min_height = h.at(i);
if (max_height - min_height < min_diff)
min_diff = max_height - min_height;
}
cout << min_diff << endl;
;
} | 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 (dif < min)
min = dif;
}
cout << min << endl;
return 0;
} | #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];
if (dif < min)
min = dif;
}
cout << min << endl;
return 0;
} | 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 readline(s) getline(cin, s)
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define EPS 1e-7
#define modulo ll(1e9 + 7)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
void init() {
cin.tie(0);
cin.sync_with_stdio(0);
#ifdef OnlineJudge
freopen("in.in", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
}
int main() {
init();
ll n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
int ans = INT_MAX;
for (int i = 0; i < n; i += k) {
ans = min(ans, arr[i + k - 1] - arr[i]);
}
cout << ans;
} | #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 readline(s) getline(cin, s)
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define EPS 1e-7
#define modulo ll(1e9 + 7)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
void init() {
cin.tie(0);
cin.sync_with_stdio(0);
#ifdef OnlineJudge
freopen("in.in", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
}
int main() {
init();
ll n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
int ans = INT_MAX;
for (int i = 0; i + k - 1 < n; i++) {
ans = min(ans, arr[i + k - 1] - arr[i]);
}
cout << ans;
} | 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+7,c-1,b);
lucky (a*10+4,c+1,b);
}*/
long long toint(string s) {
long long a = 0, c = 1;
;
for (int i = 0; i < s.size(); i++) {
a += (s[s.size() - i - 1] - '0') * c;
// cout<<a<<endl;
c *= 10;
}
return a;
}
int prime(int x) {
int c = 0;
if (x == 1) {
return 0;
} else {
for (int j = 2; j * j <= x; j++) {
if (x % j == 0) {
c++;
}
}
if (c == 0)
return 1;
return 0;
}
}
long long arr[100000];
int main() {
fast();
long long n, m, c = 1e13, x = 0, y = 0, t, h, z;
string s;
cin >> n >> m;
m--;
for (int i = 0; i < n; i++)
cin >> arr[i];
sort(arr, arr + n);
for (int i = 0; i < n; i++)
c = min(c, abs(arr[i] - arr[m + i]));
cout << c << endl;
// system("pause");
// cout << "-1" << endl;
// transform(x.begin(), x.end(), x.begin(), ::tolower);
return 0;
}
| #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+7,c-1,b);
lucky (a*10+4,c+1,b);
}*/
long long toint(string s) {
long long a = 0, c = 1;
;
for (int i = 0; i < s.size(); i++) {
a += (s[s.size() - i - 1] - '0') * c;
// cout<<a<<endl;
c *= 10;
}
return a;
}
int prime(int x) {
int c = 0;
if (x == 1) {
return 0;
} else {
for (int j = 2; j * j <= x; j++) {
if (x % j == 0) {
c++;
}
}
if (c == 0)
return 1;
return 0;
}
}
long long arr[100000];
int main() {
fast();
long long n, m, c = 1e13, x = 0, y = 0, t, h, z;
string s;
cin >> n >> m;
m--;
for (int i = 0; i < n; i++)
cin >> arr[i];
sort(arr, arr + n);
for (int i = 0; i < n; i++)
if ((m + i) <= (n - 1))
c = min(c, abs(arr[i] - arr[m + i]));
cout << c << endl;
// system("pause");
// cout << "-1" << endl;
// transform(x.begin(), x.end(), x.begin(), ::tolower);
return 0;
}
| 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_pair
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll, ll>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9;
const ll INF = 4e18;
const ll dy[4] = {1, 0, -1, 0};
const ll dx[4] = {0, -1, 0, 1};
int main() {
ll N;
ll K;
cin >> N >> K;
vl h(N);
rep(i, N) { cin >> h.at(i); }
sort(all(h));
vl vec(N - K + 1);
rep(i, N - 2) { vec.at(i) = h.at(i + 2) - h.at(i); }
sort(all(vec));
cout << vec.at(0) << endl;
}
| #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_pair
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll, ll>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9;
const ll INF = 4e18;
const ll dy[4] = {1, 0, -1, 0};
const ll dx[4] = {0, -1, 0, 1};
int main() {
ll N;
ll K;
cin >> N >> K;
vl h(N);
rep(i, N) { cin >> h.at(i); }
sort(all(h));
vl vec(N - K + 1);
rep(i, N - K + 1) { vec.at(i) = h.at(i + K - 1) - h.at(i); }
sort(all(vec));
cout << vec.at(0) << endl;
}
| 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 if (ans > dh)
ans = dh;
}
cout << ans << endl;
} | #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 if (ans > dh)
ans = dh;
}
cout << ans << endl;
} | 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 = 101010101010;
rep(i, n - k + 1) { ans = min(ans, h[n - k + i] - h[i]); }
cout << ans << endl;
}
| #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 = 101010101010;
rep(i, n - k + 1) { ans = min(ans, h[k - 1 + i] - h[i]); }
cout << ans << endl;
}
| 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__":
print(solve())
| 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];
if (dif <= min && dif >= 0) {
min = dif;
}
}
printf("%lld\n", min);
return 0;
} | #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[i];
if (dif <= min && dif >= 0) {
min = dif;
}
}
printf("%lld\n", min);
return 0;
} | 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};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
void Main() {
ll N, K;
cin >> N >> K;
vector<ll> h(N);
rep(i, N) { cin >> h.at(i); }
sort(h.begin(), h.end());
ll ans = INF;
rep(i, N - K + 1) {
auto start = h.begin() + i;
auto end = h.begin() + i + K;
ll tmp = *max_element(start, end) - *min_element(start, end);
if (tmp < ans) {
ans = tmp;
}
}
cout << ans << endl;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 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};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
void Main() {
ll N, K;
cin >> N >> K;
vector<ll> h(N);
rep(i, N) { cin >> h.at(i); }
sort(h.begin(), h.end());
ll ans = INF;
rep(i, N - K + 1) {
auto start = h.begin() + i;
auto end = h.begin() + i + K;
ll tmp = h.at(i + K - 1) - h.at(i);
if (tmp < ans) {
ans = tmp;
}
}
cout << ans << endl;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 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 rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define reps(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define rrep(i, x) for (ll i = ((ll)(x)-1); i >= 0; i--)
#define rreps(i, x) for (ll i = (ll)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
using namespace std;
ll h[10005];
ll dp[10005];
int main() {
ll n, k;
cin >> n >> k;
reps(i, n) { cin >> h[i]; }
sort(h, h + n + 1);
ll mn = 1L << 60;
reps(i, n - k + 1) { mn = min(mn, h[k - 1 + i] - h[i]); }
cout << mn << endl;
}
| #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 rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define reps(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define rrep(i, x) for (ll i = ((ll)(x)-1); i >= 0; i--)
#define rreps(i, x) for (ll i = (ll)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
using namespace std;
ll h[100005];
ll dp[100005];
int main() {
ll n, k;
cin >> n >> k;
reps(i, n) { cin >> h[i]; }
sort(h, h + n + 1);
ll mn = 1L << 60;
reps(i, n - k + 1) { mn = min(mn, h[k - 1 + i] - h[i]); }
cout << mn << endl;
}
| 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 + 1; i++) {
s = a[i + k - 1] - a[i];
if (sum > s)
sum = s;
}
cout << sum;
return 0;
} | #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 - k + 1; i++) {
s = a[i + k - 1] - a[i];
if (sum > s)
sum = s;
}
cout << sum;
return 0;
} | 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 << minn;
} | #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 << minn;
} | 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};
int dy[] = {0, 1, 0, -1};
const ll MOD = 1000000007;
const ll INF = 1000000000;
int h[105];
ll ans = 0;
int main(void) {
int n, k;
int h[10010];
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
int ans = INF;
for (int i = 0; i <= n - k; i++)
ans = min(ans, h[i + k - 1] - h[i]);
cout << ans << endl;
}
| #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};
int dy[] = {0, 1, 0, -1};
const ll MOD = 1000000007;
const ll INF = 1000000000;
int h[105];
ll ans = 0;
int main(void) {
int n, k;
int h[100010];
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
int ans = INF;
for (int i = 0; i <= n - k; i++)
ans = min(ans, h[i + k - 1] - h[i]);
cout << ans << endl;
}
| 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++) {
ans = min(ans, h[j + K - 1] - h[j]);
}
}
cout << ans << endl;
}
| #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]);
}
cout << ans << endl;
} | 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(0);
#define ll long long
#define mm(arr) memset(arr, 0, sizeof(arr))
#define scanArray(a, n) \
for (int i = 0; i < n; i++) { \
cin >> a[i]; \
}
#define pb push_back
#define PI 3.141592653589793
#define MOD 1000000007
using namespace std;
int main() {
FAST ll n, k;
cin >> n >> k;
ll a[n];
scanArray(a, n);
sort(a, a + n);
ll mndf = 1e10;
if (n == 2 && k == 2) {
cout << abs(a[n - 1] - a[0]) << endl;
return 0;
}
bool ok = true;
for (ll i = 0; i < n; i++) {
if (i == n - 1)
break;
if (abs(a[i] - a[i + 1]) != 1) {
ok = false;
break;
}
}
if (ok == true) {
cout << "1" << endl;
return 0;
}
for (ll i = 0; i < i + k - 1; i++) {
if (i == n - 1) {
break;
}
mndf = min(mndf, abs(a[i] - a[i + k - 1]));
}
cout << mndf << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define mm(arr) memset(arr, 0, sizeof(arr))
#define scanArray(a, n) \
for (int i = 0; i < n; i++) { \
cin >> a[i]; \
}
#define pb push_back
#define PI 3.141592653589793
#define MOD 1000000007
using namespace std;
int main() {
FAST ll n, k;
cin >> n >> k;
ll a[n];
scanArray(a, n);
sort(a, a + n);
ll mndf = 1e10;
for (ll i = 0; i + k - 1 < n; i++) {
if (i == n - 1) {
break;
}
mndf = min(mndf, abs(a[i] - a[i + k - 1]));
}
cout << mndf << endl;
return 0;
}
| 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 ll;
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
typedef pair<long long, long long> P;
// typedef pair<long long,P> P1;
// typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
// #define INF 100000000000000000//19桁
#define INF 1e18 + 5 // 19桁
#define mod 1000000007
#define fi first
#define se second
#define rep(i, x) for (long long i = 0; i < x; i++)
#define repn(i, x) for (long long i = 1; i <= x; i++)
#define REP(i, n, x) for (long long i = n; i < x; i++)
#define REPN(i, n, x) for (long long i = n + 1; i < x; i++)
#define repn(i, x) for (long long i = 1; i <= x; i++)
#define rrep(i, x) for (long long i = x - 1; i >= 0; i--)
#define rrepn(i, x) for (long long i = x; i > 1; i--)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
#define ALL(v) (v).begin(), (v).end()
// #define MAX(a,b) if(a>b)
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define popcount __builtin_popcount
const string MINUSINF = "-";
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
void chmax(string &a, string b) {
if (a == MINUSINF)
a = b;
else if (a.size() < b.size())
a = b;
else if (a.size() == b.size()) {
if (a < b)
a = b;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define pr printf
#define re return
#define CASET \
int ___T, case_n = 1; \
scanf("%d ", &___T); \
while (___T-- > 0)
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
stack<long long> sta;
queue<long long> que;
deque<long long> dque;
set<string> s_set;
long long sum, sum1, sum2, sum3, sum4;
long long flg, flg1, flg2, flg3, cnt, cnt1, cnt2, cnt3, cnt4;
long long wk, wk1, wk2, wk3, wk4;
long long ans;
double dsum, dsum1, dsum2, dsum3, dsum4;
double dcnt, dcnt1, dcnt2, dcnt3, dcnt4;
double dwk, dwk1, dwk2, dwk3, dwk4;
double dans;
double dmax, dmax1;
double dmin, dmin1;
// bool f;
long long weight[110],
value[110]; // 品物の個数は 100 個なので少し余裕持たせてサイズ 110 に
// ll a[100010][3]; // a[i], b[i], c[i] をそれぞれまとめて a[i][0], a[i][1],
// a[i][2] にしてしまう
long long n, h[100005];
vector<long long> p, c;
int vis[200001];
vector<string> fi;
int Left[2100][2100], Right[2100][2100], Up[2100][2100], Down[2100][2100];
long long match[10] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<long long> box;
vector<pair<long long, long long>> prime_factorize(long long n) {
vector<pair<long long, long long>> res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0)
continue;
int num = 0;
while (n % p == 0) {
++num;
n /= p;
}
res.push_back(make_pair(p, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
// 約数列挙
vector<long long> calc_divisor(long long n) {
vector<long long> res;
for (long long i = 1LL; i * i <= n; ++i) {
if (n % i == 0) {
res.push_back(i);
long long j = n / i;
if (j != i)
res.push_back(j);
}
}
sort(res.begin(), res.end());
return res;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
long long max, max1;
long long min, min1;
sum = sum1 = sum2 = sum3 = sum4 = 0;
flg = flg1 = flg2 = flg3 = cnt = cnt1 = cnt2 = cnt3 = cnt4 = 0;
max = max1 = 0;
wk = wk1 = wk2 = wk3 = wk4 = 0;
ans = 0;
min = min1 = INF;
dsum = dsum1 = dsum2 = dsum3 = dsum4 = 0;
dcnt = dcnt1 = dcnt2 = dcnt3 = dcnt4 = 0;
dmax = dmax1 = 0;
dwk = dwk1 = dwk2 = dwk3 = dwk4 = 0;
dans = 0;
dmin = dmin1 = INF;
// std::cin >> N;
// std::cin >> N >> M >> X;
// std::cin >> N >> M >> K;
// std::cin >> dB >> dA;
// std::cin >> A >> B;
// std::cin >> A >> B >> C;
// cin >> K;
//**************************こどふぉ用******************************************
// char c[3]={'R', 'G', 'B'};
// scanf("%lld:%lld",&a,&b);
// for(int i=0,j=1;i<n;i+=j,j++)
/*
cin >> T;
while(T--){
cin >> N >> K;
std::vector<long long> v(N);
// 配列入力1
/*
for(long long i=0; i<N; i++){
std::cin >> v[i];
}
*/
// cout << sum << '\n';
// 文字列の出力
// std::cout << s << std::endl;
// }
// re 0;
// std::sort(v.begin(),v.end());//昇順ソート
// std::sort(v.begin(),v.end(),std::greater<long long>());//降順ソート
// vector<ll> v(N, 0);
// map<std::string, int> freq;
// マップ
/*
map<long long,long long> numsx;
map<long long,long long> numsy;
//M.clear();
for(long long i=0; i<M; i++){
wk=w[i]%K;
numsx[wk]++;
}
*/
// マップ②
/*
map<string, int> mp;
for(int i=0; i<n; i++){
string s; cin>>s; mp[s]++;
}
int mx=-1;
for(auto p:mp) mx=MAX(mx, p.second);
for(auto p:mp){
if(mx==p.second){
cout<<p.first<<endl;
}
}
*/
// セット
/*
set<long long> st;
if(st.find(v[i])==st.end()){
st.insert(v[i]);
}
else{
st.erase(v[i]);
}
*/
// ペア
/*
vector<pair<long long, long long> > p(N);
for(long long i=0; i<N; i++){
long long a, b;
cin >> a >> b;
p[i] = make_pair(a, b);
}
//sort(p.begin(), p.end());
//sort(p.begin(), p.end(),greater<pair<long long,long long> >());
*/
// int ret=1<<20;
// cout << sum << '\n';
// 文字列の出力
// std::cout << s << std::endl;
//}
// re 0;
//**************************ここからスタート******************************************
std::cin >> N >> K;
std::vector<long long> v(N);
rep(i, N) { cin >> v[i]; }
sort(v.begin(), v.end());
ll min2;
min2 = INF;
rep(i, N - K + 1) {
min = INF;
max = 0;
for (ll j = i; j < i + K; j++) {
min = MIN(min, v[j]);
max = MAX(max, v[j]);
}
min2 = MIN(min2, abs(max - min));
}
pr("%lld", min2);
re 0;
// std::cin >> N >> M >> X;
// std::cin >> N >> M >> K;
// std::cin >> dB >> dA;
// std::cin >> A >> B;
// std::cin >> A >> B >> C;
// cin >> K;
// std::vector<long long> v(N);
// std::vector<long long> w(N);
// std::vector<long long> x(N);
// std::vector<int> v(100, 0);
// int a[26]={0};
// vector<long long> flagment(N, 0);
// cout << sum << '\n';
if (1) {
// pr("%lld\n",N);
// printf("%lld",(ll)ceil(dB/dA));
// puts("Yes");
// printf("%d",st.size());
// 文字列の出力
// std::cout << s << std::endl;
// printf("%.12f\n",ret);
// cout << sum << endl;
// cout << sum << '\n';
// cout << x[i] << " " ;
// cout << '\n';
// pr("%02lld:%02lld",wk/60,wk%60);
} else {
// puts("No");
}
// v.push_back(i);
// accumulate(vec.begin(), vec.end(), 0)
// 配列入力1
/*
for(long long i=0; i<N; i++){
std::cin >> v[i];
}
*/
// std::sort(v.begin(),v.end());//昇順ソート
// std::sort(v.begin(),v.end(),std::greater<long long>());//降順ソート
// v.erase(unique(v.begin(), v.end()), v.end());
// reverse(t.begin(),t.end());
// 素因数分解
/*
auto pf = prime_factorize(v[i]);
if(pf[0].fi==2){
sum+=pf[0].se;
}
*/
// 約数列挙
/*
vector<long long> div = calc_divisor(M);
// M の約数 d であって、d * N <= M となる最大の d を求める
long long res = 1;
for (auto d : div) {
if (d * N <= M) res = max(res, d);
}
*/
// 素数判定
/*
for(int i=x; ; i++){
bool dame=0;
for(int j=2; j*j<=i; j++){
if(i%j==0){
dame=1;
break;
}
}
if(!dame){
cout<<i<<endl;
return 0;
}
}
*/
// 文字列の出力
// std::cout << s << std::endl;
// cout << sum << '\n';
// cout << sum << '\n';
// ペア
/*
vector<pair<long long, long long> > p(N);
for(long long i=0; i<N; i++){
long long a, b;
cin >> a >> b;
p[i] = make_pair(a, b);
}
//sort(p.begin(), p.end());
//sort(p.begin(), p.end(),greater<pair<long long,long long> >());
*/
// マップ
/*
map<long long,long long> numsx;
map<long long,long long> numsy;
//M.clear();
for(long long i=0; i<M; i++){
wk=w[i]%K;
numsx[wk]++;
}
*/
// マップ②
/*
map<string, int> mp;
for(int i=0; i<n; i++){
string s; cin>>s; mp[s]++;
}
int mx=-1;
for(auto p:mp) mx=MAX(mx, p.second);
for(auto p:mp){
if(mx==p.second){
cout<<p.first<<endl;
}
}
*/
// セット
/*
set<long long> st;
if(st.find(v[i])==st.end()){
st.insert(v[i]);
}
else{
st.erase(v[i]);
}
*/
// if(ceil(sqrt(wk)==floor(sqrt(wk))))
// do{
// }while(next_permutation(v.begin(),v.end()));
// std::cin >> N;
// std::cin >> N >> M >> X;
// std::cin >> N >> M >> K;
// std::cin >> dB >> dA;
// std::cin >> A >> B;
// std::cin >> A >> B >> C;
// cin >> K;
if (1) {
// pr("%lld\n",N);
// printf("%lld",(ll)ceil(dB/dA));
// puts("Yes");
// printf("%d",st.size());
// 文字列の出力
// std::cout << s << std::endl;
// printf("%.12f\n",ret);
// cout << sum << endl;
// cout << sum << '\n';
// cout << x[i] << " " ;
// cout << '\n';
// pr("%02lld:%02lld",wk/60,wk%60);
} else {
// puts("No");
}
return 0;
}
| 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 ll;
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
typedef pair<long long, long long> P;
// typedef pair<long long,P> P1;
// typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
// #define INF 100000000000000000//19桁
#define INF 1e18 + 5 // 19桁
#define mod 1000000007
#define fi first
#define se second
#define rep(i, x) for (long long i = 0; i < x; i++)
#define repn(i, x) for (long long i = 1; i <= x; i++)
#define REP(i, n, x) for (long long i = n; i < x; i++)
#define REPN(i, n, x) for (long long i = n + 1; i < x; i++)
#define repn(i, x) for (long long i = 1; i <= x; i++)
#define rrep(i, x) for (long long i = x - 1; i >= 0; i--)
#define rrepn(i, x) for (long long i = x; i > 1; i--)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
#define ALL(v) (v).begin(), (v).end()
// #define MAX(a,b) if(a>b)
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define popcount __builtin_popcount
const string MINUSINF = "-";
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
void chmax(string &a, string b) {
if (a == MINUSINF)
a = b;
else if (a.size() < b.size())
a = b;
else if (a.size() == b.size()) {
if (a < b)
a = b;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define pr printf
#define re return
#define CASET \
int ___T, case_n = 1; \
scanf("%d ", &___T); \
while (___T-- > 0)
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
stack<long long> sta;
queue<long long> que;
deque<long long> dque;
set<string> s_set;
long long sum, sum1, sum2, sum3, sum4;
long long flg, flg1, flg2, flg3, cnt, cnt1, cnt2, cnt3, cnt4;
long long wk, wk1, wk2, wk3, wk4;
long long ans;
double dsum, dsum1, dsum2, dsum3, dsum4;
double dcnt, dcnt1, dcnt2, dcnt3, dcnt4;
double dwk, dwk1, dwk2, dwk3, dwk4;
double dans;
double dmax, dmax1;
double dmin, dmin1;
// bool f;
long long weight[110],
value[110]; // 品物の個数は 100 個なので少し余裕持たせてサイズ 110 に
// ll a[100010][3]; // a[i], b[i], c[i] をそれぞれまとめて a[i][0], a[i][1],
// a[i][2] にしてしまう
long long n, h[100005];
vector<long long> p, c;
int vis[200001];
vector<string> fi;
int Left[2100][2100], Right[2100][2100], Up[2100][2100], Down[2100][2100];
long long match[10] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<long long> box;
vector<pair<long long, long long>> prime_factorize(long long n) {
vector<pair<long long, long long>> res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0)
continue;
int num = 0;
while (n % p == 0) {
++num;
n /= p;
}
res.push_back(make_pair(p, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
// 約数列挙
vector<long long> calc_divisor(long long n) {
vector<long long> res;
for (long long i = 1LL; i * i <= n; ++i) {
if (n % i == 0) {
res.push_back(i);
long long j = n / i;
if (j != i)
res.push_back(j);
}
}
sort(res.begin(), res.end());
return res;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
long long max, max1;
long long min, min1;
sum = sum1 = sum2 = sum3 = sum4 = 0;
flg = flg1 = flg2 = flg3 = cnt = cnt1 = cnt2 = cnt3 = cnt4 = 0;
max = max1 = 0;
wk = wk1 = wk2 = wk3 = wk4 = 0;
ans = 0;
min = min1 = INF;
dsum = dsum1 = dsum2 = dsum3 = dsum4 = 0;
dcnt = dcnt1 = dcnt2 = dcnt3 = dcnt4 = 0;
dmax = dmax1 = 0;
dwk = dwk1 = dwk2 = dwk3 = dwk4 = 0;
dans = 0;
dmin = dmin1 = INF;
// std::cin >> N;
// std::cin >> N >> M >> X;
// std::cin >> N >> M >> K;
// std::cin >> dB >> dA;
// std::cin >> A >> B;
// std::cin >> A >> B >> C;
// cin >> K;
//**************************こどふぉ用******************************************
// char c[3]={'R', 'G', 'B'};
// scanf("%lld:%lld",&a,&b);
// for(int i=0,j=1;i<n;i+=j,j++)
/*
cin >> T;
while(T--){
cin >> N >> K;
std::vector<long long> v(N);
// 配列入力1
/*
for(long long i=0; i<N; i++){
std::cin >> v[i];
}
*/
// cout << sum << '\n';
// 文字列の出力
// std::cout << s << std::endl;
// }
// re 0;
// std::sort(v.begin(),v.end());//昇順ソート
// std::sort(v.begin(),v.end(),std::greater<long long>());//降順ソート
// vector<ll> v(N, 0);
// map<std::string, int> freq;
// マップ
/*
map<long long,long long> numsx;
map<long long,long long> numsy;
//M.clear();
for(long long i=0; i<M; i++){
wk=w[i]%K;
numsx[wk]++;
}
*/
// マップ②
/*
map<string, int> mp;
for(int i=0; i<n; i++){
string s; cin>>s; mp[s]++;
}
int mx=-1;
for(auto p:mp) mx=MAX(mx, p.second);
for(auto p:mp){
if(mx==p.second){
cout<<p.first<<endl;
}
}
*/
// セット
/*
set<long long> st;
if(st.find(v[i])==st.end()){
st.insert(v[i]);
}
else{
st.erase(v[i]);
}
*/
// ペア
/*
vector<pair<long long, long long> > p(N);
for(long long i=0; i<N; i++){
long long a, b;
cin >> a >> b;
p[i] = make_pair(a, b);
}
//sort(p.begin(), p.end());
//sort(p.begin(), p.end(),greater<pair<long long,long long> >());
*/
// int ret=1<<20;
// cout << sum << '\n';
// 文字列の出力
// std::cout << s << std::endl;
//}
// re 0;
//**************************ここからスタート******************************************
std::cin >> N >> K;
std::vector<long long> v(N);
rep(i, N) { cin >> v[i]; }
sort(v.begin(), v.end());
rep(i, N - K + 1) { min = MIN(min, v[i + K - 1] - v[i]); }
pr("%lld", min);
re 0;
// std::cin >> N >> M >> X;
// std::cin >> N >> M >> K;
// std::cin >> dB >> dA;
// std::cin >> A >> B;
// std::cin >> A >> B >> C;
// cin >> K;
// std::vector<long long> v(N);
// std::vector<long long> w(N);
// std::vector<long long> x(N);
// std::vector<int> v(100, 0);
// int a[26]={0};
// vector<long long> flagment(N, 0);
// cout << sum << '\n';
if (1) {
// pr("%lld\n",N);
// printf("%lld",(ll)ceil(dB/dA));
// puts("Yes");
// printf("%d",st.size());
// 文字列の出力
// std::cout << s << std::endl;
// printf("%.12f\n",ret);
// cout << sum << endl;
// cout << sum << '\n';
// cout << x[i] << " " ;
// cout << '\n';
// pr("%02lld:%02lld",wk/60,wk%60);
} else {
// puts("No");
}
// v.push_back(i);
// accumulate(vec.begin(), vec.end(), 0)
// 配列入力1
/*
for(long long i=0; i<N; i++){
std::cin >> v[i];
}
*/
// std::sort(v.begin(),v.end());//昇順ソート
// std::sort(v.begin(),v.end(),std::greater<long long>());//降順ソート
// v.erase(unique(v.begin(), v.end()), v.end());
// reverse(t.begin(),t.end());
// 素因数分解
/*
auto pf = prime_factorize(v[i]);
if(pf[0].fi==2){
sum+=pf[0].se;
}
*/
// 約数列挙
/*
vector<long long> div = calc_divisor(M);
// M の約数 d であって、d * N <= M となる最大の d を求める
long long res = 1;
for (auto d : div) {
if (d * N <= M) res = max(res, d);
}
*/
// 素数判定
/*
for(int i=x; ; i++){
bool dame=0;
for(int j=2; j*j<=i; j++){
if(i%j==0){
dame=1;
break;
}
}
if(!dame){
cout<<i<<endl;
return 0;
}
}
*/
// 文字列の出力
// std::cout << s << std::endl;
// cout << sum << '\n';
// cout << sum << '\n';
// ペア
/*
vector<pair<long long, long long> > p(N);
for(long long i=0; i<N; i++){
long long a, b;
cin >> a >> b;
p[i] = make_pair(a, b);
}
//sort(p.begin(), p.end());
//sort(p.begin(), p.end(),greater<pair<long long,long long> >());
*/
// マップ
/*
map<long long,long long> numsx;
map<long long,long long> numsy;
//M.clear();
for(long long i=0; i<M; i++){
wk=w[i]%K;
numsx[wk]++;
}
*/
// マップ②
/*
map<string, int> mp;
for(int i=0; i<n; i++){
string s; cin>>s; mp[s]++;
}
int mx=-1;
for(auto p:mp) mx=MAX(mx, p.second);
for(auto p:mp){
if(mx==p.second){
cout<<p.first<<endl;
}
}
*/
// セット
/*
set<long long> st;
if(st.find(v[i])==st.end()){
st.insert(v[i]);
}
else{
st.erase(v[i]);
}
*/
// if(ceil(sqrt(wk)==floor(sqrt(wk))))
// do{
// }while(next_permutation(v.begin(),v.end()));
// std::cin >> N;
// std::cin >> N >> M >> X;
// std::cin >> N >> M >> K;
// std::cin >> dB >> dA;
// std::cin >> A >> B;
// std::cin >> A >> B >> C;
// cin >> K;
if (1) {
// pr("%lld\n",N);
// printf("%lld",(ll)ceil(dB/dA));
// puts("Yes");
// printf("%d",st.size());
// 文字列の出力
// std::cout << s << std::endl;
// printf("%.12f\n",ret);
// cout << sum << endl;
// cout << sum << '\n';
// cout << x[i] << " " ;
// cout << '\n';
// pr("%02lld:%02lld",wk/60,wk%60);
} else {
// puts("No");
}
return 0;
}
| 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 (1e9)
#define PI (acos(-1))
#define pb(a) push_back(a)
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// const int dy[] = { 0, 0, 1, -1 };
// const int dx[] = { 1, -1, 0, 0 };
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
ll gcd(ll a, ll b);
ll lcm(ll x, ll y);
vector<ll> h, hh;
int main() {
ll n, k, ans;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
h.push_back(tmp);
}
sort(h.begin(), h.end());
ans = INF;
for (int i = 0; i < n - k + 1; i++) {
hh.clear();
for (int j = 0; j < k; j++) {
hh.push_back(h[i + j]);
}
ll tmp = hh[k - 1] - hh[0];
ans = min(ans, tmp);
}
cout << ans << endl;
return 0;
}
| #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 (1e9)
#define PI (acos(-1))
#define pb(a) push_back(a)
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// const int dy[] = { 0, 0, 1, -1 };
// const int dx[] = { 1, -1, 0, 0 };
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
ll gcd(ll a, ll b);
ll lcm(ll x, ll y);
vector<ll> h, hh;
int main() {
ll n, k, ans;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
h.push_back(tmp);
}
sort(h.begin(), h.end());
ans = INF;
for (int i = 0; i < n - k + 1; i++) {
ans = min(ans, h[i + k - 1] - h[i]);
}
cout << ans << endl;
return 0;
}
| 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] - tree[j]) {
min = tree[k - 1 - j] - tree[j];
}
}
cout << min;
return 0;
}
| #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 + j] - tree[j])) {
min = tree[k - 1 + j] - tree[j];
}
}
cout << min;
return 0;
}
| 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 > h[i + K - 1] - h[i]) {
min = h[i + K - 1] - h[i];
}
}
cout << min << endl;
}
| #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 > h[i + K - 1] - h[i]) {
min = h[i + K - 1] - h[i];
}
}
cout << min << endl;
}
| 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 0;
} | // 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 0;
} | 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 > (max - min)) {
ans = (max - min);
}
}
cout << ans << endl;
return 0;
} | #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 - 1] - h[i]);
}
}
cout << ans << endl;
return 0;
}
| 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_set>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i < (ll)b; ++i)
#define INF 10e12
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
const long long MOD = 1e9 + 7;
int main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, 0, n) cin >> h[i];
sort(all(h));
ll ans = MOD;
rep(i, 0, n) ans = min(ans, abs(h[i] - h[i + k - 1]));
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i < (ll)b; ++i)
#define INF 10e12
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
const long long MOD = 1e9 + 7;
int main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, 0, n) cin >> h[i];
sort(all(h));
ll ans = MOD;
rep(i, 0, n - k + 1) ans = min(ans, abs(h[i] - h[i + k - 1]));
cout << ans << endl;
}
| 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<string>
#define lin1(x) \
ll int x; \
x = scan();
#define lin2(x, y) \
ll int x, y; \
x = scan(), y = scan();
#define lin3(x, y, z) \
ll int x, y, z; \
x = scan(), y = scan(), z = scan();
#define pb(x) push_back(x)
#define makep(x, y) make_pair(x, y)
#define mx(a, b) (a) > (b) ? (a) : (b)
#define mn(a, b) (a) < (b) ? (a) : (b)
#define fori(s, e) for (i = s; i <= e; i++)
#define forj(s, e) for (j = s; j <= e; j++)
#define fork(s, e) for (k = s; k <= e; k++)
#define rep(i, s, e) for (int i = s; i <= e; i++)
#define brep(i, s, e) for (int i = s; i >= e; i--)
#define all(x) x.begin(), x.end()
#define mem(x, y) memset(x, y, sizeof(x));
#define bits1(x) __builtin_popcount(x)
#define pi 3.14159265358979323846264338327950
#define MOD7 1000000007
#define MOD9 1000000009
#define cn cin >>
#define co cout <<
#define fast \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
using namespace std;
using namespace std::tr1;
int main() {
#ifndef RAHUL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
long long x, t;
cin >> x >> t;
std::vector<long long> v(x);
for (int i = 0; i < x; ++i) {
/* code */
cin >> v[i];
}
sort(v.begin(), v.end());
long long min1 = 10101010000000;
for (int i = 0; i < x - t + 1; ++i) {
/* code */
min1 = min(min1, v[i + t - 1] - v[i]);
}
cout << min1 << endl;
return 0;
} | // 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<string>
#define lin1(x) \
ll int x; \
x = scan();
#define lin2(x, y) \
ll int x, y; \
x = scan(), y = scan();
#define lin3(x, y, z) \
ll int x, y, z; \
x = scan(), y = scan(), z = scan();
#define pb(x) push_back(x)
#define makep(x, y) make_pair(x, y)
#define mx(a, b) (a) > (b) ? (a) : (b)
#define mn(a, b) (a) < (b) ? (a) : (b)
#define fori(s, e) for (i = s; i <= e; i++)
#define forj(s, e) for (j = s; j <= e; j++)
#define fork(s, e) for (k = s; k <= e; k++)
#define rep(i, s, e) for (int i = s; i <= e; i++)
#define brep(i, s, e) for (int i = s; i >= e; i--)
#define all(x) x.begin(), x.end()
#define mem(x, y) memset(x, y, sizeof(x));
#define bits1(x) __builtin_popcount(x)
#define pi 3.14159265358979323846264338327950
#define MOD7 1000000007
#define MOD9 1000000009
#define cn cin >>
#define co cout <<
#define fast \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
using namespace std;
using namespace std::tr1;
int main() {
// #ifndef RAHUL
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
long long x, t;
cin >> x >> t;
std::vector<long long> v(x);
for (int i = 0; i < x; ++i) {
/* code */
cin >> v[i];
}
sort(v.begin(), v.end());
long long min1 = 10101010000000;
for (int i = 0; i < x - t + 1; ++i) {
/* code */
min1 = min(min1, v[i + t - 1] - v[i]);
}
cout << min1 << endl;
return 0;
} | 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;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
f = ch == '-' ? -1 : 1;
for (; isdigit(ch); ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
const int MOD = 1e9 + 7;
int n;
int p[MAXN];
int k;
int main() {
n = read();
k = read();
for (int i = 1; i <= n; ++i) {
p[i] = read();
}
sort(p + 1, p + n + 1);
int minn = MOD;
for (int i = 1; i <= n - k + 1; ++i) {
minn = min(minn, p[i + k - 1] - p[i]);
}
cout << minn << endl;
return 0;
}
| #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 std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
f = ch == '-' ? -1 : 1;
for (; isdigit(ch); ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
const int MOD = 1e9 + 7;
int n;
int p[MAXN];
int k;
int main() {
n = read();
k = read();
for (int i = 1; i <= n; ++i) {
p[i] = read();
}
sort(p + 1, p + n + 1);
int minn = MOD;
for (int i = 1; i <= n - k + 1; ++i) {
minn = min(minn, p[i + k - 1] - p[i]);
}
cout << minn << endl;
return 0;
}
| 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) - 1; i >= int(b); --i)
#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)
#define _all(arg) begin(arg), end(arg)
#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))
#define getidx(ary, key) lower_bound(_all(ary), key) - begin(ary)
#define clr(a, b) memset((a), (b), sizeof(a))
#define bit(n) (1LL << (n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
typedef long long ll;
typedef long double R;
const R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R &r) { return (r > EPS) - (r < -EPS); }
inline R sq(R x) { return sqrt(max(x, 0.0L)); }
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
// Problem Specific Parameter:
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ll ans = 1000000000;
ll minn, maxn;
sort(h.begin(), h.end());
for (int i = 0; i < n; i++) {
minn = 1000000000, maxn = 0;
for (int j = i; j <= i + k - 1; j++) {
if (n < j)
break;
else {
minn = min(minn, h[j]);
maxn = max(maxn, h[j]);
}
}
ans = min(ans, maxn - minn);
}
cout << ans << endl;
return 0;
}
| #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) - 1; i >= int(b); --i)
#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)
#define _all(arg) begin(arg), end(arg)
#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))
#define getidx(ary, key) lower_bound(_all(ary), key) - begin(ary)
#define clr(a, b) memset((a), (b), sizeof(a))
#define bit(n) (1LL << (n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
typedef long long ll;
typedef long double R;
const R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R &r) { return (r > EPS) - (r < -EPS); }
inline R sq(R x) { return sqrt(max(x, 0.0L)); }
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
// Problem Specific Parameter:
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ll ans = 1000000000;
ll minn, maxn;
sort(h.begin(), h.end());
for (int i = 0; i + k - 1 < n; i++) {
minn = h[i];
maxn = h[i + k - 1];
ans = min(ans, maxn - minn);
}
cout << ans << endl;
return 0;
}
| 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];
}
}
cout << mi << endl;
return 0;
} | #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];
}
}
cout << mi << endl;
return 0;
} | 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 main() {
int N, K;
int h[20000];
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h, h + N);
int res = 1000000007;
for (int i = 0; i < N; i++) {
if (i + K - 1 >= N)
break;
res = min(res, h[i + K - 1] - h[i]);
}
cout << res << endl;
return 0;
} | #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 main() {
int N, K;
int h[200000];
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h, h + N);
int res = 1000000007;
for (int i = 0; i < N; i++) {
if (i + K - 1 >= N)
break;
res = min(res, h[i + K - 1] - h[i]);
}
cout << res << endl;
return 0;
} | 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;
freopen("burgers.in", "r", stdin);
freopen("burgers.out", "w", stdout);
scanf("%d%lld", &n, &x);
p[0] = 1;
a[0] = 1;
for (int i = 1; i <= n; i++) {
a[i] = a[i - 1] * 2 + 3;
p[i] = p[i - 1] * 2 + 1;
}
printf("%lld", f(n, x));
return 0;
}
| #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;
// freopen("burgers.in" , "r" , stdin);
// freopen("burgers.out" , "w" , stdout);
scanf("%d%lld", &n, &x);
p[0] = 1;
a[0] = 1;
for (int i = 1; i <= n; i++) {
a[i] = a[i - 1] * 2 + 3;
p[i] = p[i - 1] * 2 + 1;
}
printf("%lld", f(n, x));
return 0;
}
| 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;
a[0] = 1;
p[0] = 1;
for (int i = 1; i <= 50; ++i) {
a[i] = 2 * a[i - 1] + 3;
p[i] = 2 * p[i - 1] + 1;
}
cout << f(n, x) << "\n";
return 0;
} | #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]);
}
}
int main() {
ll n, x;
cin >> n >> x;
a[0] = 1;
p[0] = 1;
for (int i = 1; i <= 50; ++i) {
a[i] = 2 * a[i - 1] + 3;
p[i] = 2 * p[i - 1] + 1;
}
cout << f(n, x) << "\n";
return 0;
} | 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 if (ALL.at(N - 1) + 2 < X && X < 2 * ALL.at(N - 1) + 3)
return P.at(N - 1) + 1 + calc(N - 1, X - 2 - ALL.at(N - 1));
else if (X == 2 * ALL.at(N - 1) + 3)
return 2 * P.at(N - 1) + 1;
}
int main() {
long long N, X;
cin >> N >> X;
P.at(0) = 1;
ALL.at(0) = 1;
for (int i = 1; i <= N; i++) {
P.at(i) = 2 * P.at(i - 1) + 1;
ALL.at(i) = 2 * ALL.at(i - 1) + 3;
}
long long ans = calc(N, X);
cout << ans << endl;
}
| #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, X - 1);
else if (X == ALL.at(N - 1) + 2)
return P.at(N - 1) + 1;
else if (ALL.at(N - 1) + 2 < X && X < 2 * ALL.at(N - 1) + 3)
return P.at(N - 1) + 1 + calc(N - 1, X - 2 - ALL.at(N - 1));
else if (X == 2 * ALL.at(N - 1) + 3)
return 2 * P.at(N - 1) + 1;
}
int main() {
long long N, X;
cin >> N >> X;
P.at(0) = 1;
ALL.at(0) = 1;
for (int i = 1; i <= N; i++) {
P.at(i) = 2 * P.at(i - 1) + 1;
ALL.at(i) = 2 * ALL.at(i - 1) + 3;
}
long long ans = calc(N, X);
cout << ans << endl;
}
| 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]) {
return f(N - 1, X - 1);
} else {
return pat[N - 1] + 1 + f(N - 1, X - 2 - sum[N - 1]);
}
}
int main() {
int N;
cin >> N;
long long X;
cin >> X;
cout << f(N, X) << endl;
} | #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 {
return 1;
}
} else if (X <= 1 + sum[N - 1]) {
return f(N - 1, X - 1);
} else {
return pat[N - 1] + 1 + f(N - 1, X - 2 - sum[N - 1]);
}
}
int main() {
int N;
cin >> N;
long long X;
cin >> X;
cout << f(N, X) << endl;
} | 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_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;
const double eps = 1e-10;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
const int64 mod = 1e9 + 7;
int64 N, X;
vector<int64> lay, pat;
int64 dfs(int64 lev, int64 rest) {
if (lev < 0)
return 0;
if (rest == 0)
return 0;
if (rest == 1)
return lev == 0;
if (lay[lev] <= rest)
return pat[lev];
return dfs(lev - 1, rest - 1) + dfs(lev - 1, rest - lay[lev - 1] - 2) +
(rest >= lay[lev - 1] + 2 ? 1 : 0);
}
int main(void) {
cin >> N >> X;
lay.resize(N + 1);
pat.resize(N + 1);
lay[0] = 1;
pat[0] = 1;
FOR(i, 1, N + 1) {
lay[i] = lay[i - 1] * 2 + 3;
pat[i] = pat[i - 1] * 2 + 1;
}
cout << dfs(N, X) << endl;
}
| #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_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;
const double eps = 1e-10;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
const int64 mod = 1e9 + 7;
int64 N, X;
vector<int64> lay, pat;
int64 dfs(int64 lev, int64 rest) {
if (lev < 0)
return 0;
if (rest <= 0)
return 0;
if (rest == 1)
return lev == 0;
if (lay[lev] <= rest)
return pat[lev];
return dfs(lev - 1, rest - 1) + dfs(lev - 1, rest - lay[lev - 1] - 2) +
(rest >= lay[lev - 1] + 2 ? 1 : 0);
}
int main(void) {
cin >> N >> X;
lay.resize(N + 1);
pat.resize(N + 1);
lay[0] = 1;
pat[0] = 1;
FOR(i, 1, N + 1) {
lay[i] = lay[i - 1] * 2 + 3;
pat[i] = pat[i - 1] * 2 + 1;
}
cout << dfs(N, X) << endl;
}
| 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))
cout << " ";
print(ts...);
}
li solve(li x, const vector<li> &bgr, const vector<li> &pty, int n) {
if (x <= n)
return 0;
else if (x >= bgr[n - 1] + 2) {
return pty[n - 1] + solve(x - bgr[n - 1] - 2, bgr, pty, n - 1) + 1;
} else if (x == bgr[n - 1] + 1) {
return pty[n - 1];
} else {
return solve(x - 1, bgr, pty, n - 1);
}
}
int main() {
int n;
li x;
cin >> n >> x;
vector<li> bgr(n + 1, 0), pty(n + 1, 0);
bgr[0] = 1;
pty[0] = 1;
rep(i, n) {
bgr[i + 1] = bgr[i] * 2 + 3;
pty[i + 1] = pty[i] * 2 + 1;
}
print(solve(x, bgr, pty, n));
}
| #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))
cout << " ";
print(ts...);
}
li solve(li x, const vector<li> &bgr, const vector<li> &pty, int n) {
if (x <= n)
return 0;
else if (x == bgr[n]) {
return pty[n];
} else if (x >= bgr[n - 1] + 2) {
return pty[n - 1] + solve(x - bgr[n - 1] - 2, bgr, pty, n - 1) + 1;
} else if (x == bgr[n - 1] + 1) {
return pty[n - 1];
} else {
return solve(x - 1, bgr, pty, n - 1);
}
}
int main() {
int n;
li x;
cin >> n >> x;
vector<li> bgr(n + 1, 0), pty(n + 1, 0);
bgr[0] = 1;
pty[0] = 1;
rep(i, n) {
bgr[i + 1] = bgr[i] * 2 + 3;
pty[i + 1] = pty[i] * 2 + 1;
}
print(solve(x, bgr, pty, n));
}
| 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 >= pow(2, n + 1) - 1) {
counter += pow(2, n);
set(n - 1, x - pow(2, n + 1) + 1);
return;
} else {
set(n - 1, x - 1);
return;
}
}
int main() {
long long N;
long long X;
cin >> N >> X;
set(N, X);
cout << counter << endl;
}
|
#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 || x == 0) {
return;
} else if (x >= pow(2, n + 1) - 1) {
counter += pow(2, n);
set(n - 1, x - pow(2, n + 1) + 1);
return;
} else {
set(n - 1, x - 1);
return;
}
}
int main() {
long long N;
long long X;
cin >> N >> X;
set(N, X);
cout << counter << endl;
}
| 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); \
cout.tie(NULL);
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define ALLR(X) (X).rbegin(), (X).rend()
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define F first
#define S second
using namespace std;
template <class T> void max_self(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> void min_self(T &a, const T &b) {
if (a > b)
a = b;
}
typedef long long LL;
const int INF = 1e9 + 7;
const double PI = acos(-1.0);
const double EPS = (1e-9);
LL N, k, fl[55], f[55];
LL g(int layer, int rank) {
if (layer == 0)
return 0LL;
if (layer == fl[rank])
return f[rank];
assert(rank >= 0);
// assert(layer >= 0);
if (layer <= 1 + fl[rank - 1])
return g(layer - 1, rank - 1);
layer -= (2 + fl[rank - 1]);
return 1LL + f[rank - 1] + g(layer, rank - 1);
}
int main() {
FAST_IO
cin >> N >> k;
fl[0] = f[0] = 1;
for (int rep = 1; rep <= N; ++rep) {
fl[rep] = 3 + 2LL * fl[rep - 1];
f[rep] = 1 + 2LL * f[rep - 1];
}
// for(int rep = 0; rep <= N; ++rep){
// cout << f[rep] << " " << fl[rep] << '\n';
// }
//
// cout << "\n-------------------\n";
// for(int layer = 0; layer < 30; ++layer){
// cout << g(layer, 3) << '\n';
// }
cout << g(k, N) << '\n';
return 0;
}
| #include "bits/stdc++.h"
#define PRECISION(x) cout << fixed << setprecision(x)
#define FAST_IO \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define ALLR(X) (X).rbegin(), (X).rend()
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define F first
#define S second
using namespace std;
template <class T> void max_self(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> void min_self(T &a, const T &b) {
if (a > b)
a = b;
}
typedef long long LL;
const int INF = 1e9 + 7;
const double PI = acos(-1.0);
const double EPS = (1e-9);
LL N, k, fl[55], f[55];
LL g(LL layer, int rank) {
if (rank == 0) {
return (layer > 0);
}
assert(rank >= 0);
// assert(layer >= 0);
if (layer <= 1 + fl[rank - 1])
return g(layer - 1, rank - 1);
layer -= (2 + fl[rank - 1]);
return 1LL + f[rank - 1] + g(layer, rank - 1);
}
int main() {
FAST_IO
cin >> N >> k;
fl[0] = f[0] = 1;
for (int rep = 1; rep <= N; ++rep) {
fl[rep] = 3 + 2LL * fl[rep - 1];
f[rep] = 1 + 2LL * f[rep - 1];
}
// for(int rep = 0; rep <= N; ++rep){
// cout << f[rep] << " " << fl[rep] << '\n';
// }
//
// cout << "\n-------------------\n";
// for(int layer = 0; layer < 30; ++layer){
// cout << g(layer, 3) << '\n';
// }
cout << g(k, N) << '\n';
return 0;
}
| 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 int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
int N;
ll X;
ll count(int level, ll idx) {
assert(0 <= idx && idx < (1LL << (level + 2)) - 3);
if (level == 0) {
return idx;
}
ll len = (1LL << (level + 2)) - 3;
if (idx == 0) {
return 0;
}
if (idx <= len / 2) {
return count(level - 1, idx - 1);
}
if (idx < len) {
return (1LL << (level)) - 1 + 1 + count(level - 1, idx - len / 2 - 1);
}
return (1LL << (level + 1)) - 1;
}
ll solve() { return count(N, X); }
int main() {
cin >> N >> X;
cout << solve() << endl;
return 0;
}
| /*
[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 int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
int N;
ll X;
ll count(int level, ll idx) {
if (level == 0) {
return idx;
}
ll len = (1LL << (level + 2)) - 3;
if (idx == 0) {
return 0;
}
if (idx <= len / 2) {
return count(level - 1, idx - 1);
}
if (idx < len) {
return (1LL << (level)) - 1 + 1 + count(level - 1, idx - len / 2 - 1);
}
return (1LL << (level + 1)) - 1;
}
ll solve() { return count(N, X); }
int main() {
cin >> N >> X;
cout << solve() << endl;
return 0;
}
| 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 <= 1 + b[n - 1])
return solve(n - 1, x - 1);
else
return p[n - 1] + 1 + solve(n - 1, x - 2 - b[n - 1]);
}
int main() {
ll n, x;
cin >> n >> x;
for (ll i = 1; i <= n; i++) {
p.push_back(2 * p[i - 1] + 1);
b.push_back(2 * b[i - 1] + 3);
}
cout << solve(n, x) << endl;
} | #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;
else if (x <= 1 + b[n - 1])
return solve(n - 1, x - 1);
else
return p[n - 1] + 1 + solve(n - 1, x - 2 - b[n - 1]);
}
int main() {
ll n, x;
cin >> n >> x;
for (ll i = 1; i <= n; i++) {
p.push_back(2 * p[i - 1] + 1);
b.push_back(2 * b[i - 1] + 3);
}
cout << solve(n, x) << endl;
} | 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 <stack>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, double> pld;
typedef pair<double, double> pdd;
typedef pair<double, ll> pdl;
typedef pair<int, char> pic;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef priority_queue<ll, vector<ll>, greater<ll>> llgreaterq;
typedef priority_queue<pll, vector<pll>, greater<pll>> pllgreaterq;
typedef priority_queue<pair<ll, pll>, vector<pair<ll, pll>>,
greater<pair<ll, pll>>>
plpllgreaterq;
typedef priority_queue<vi, vector<vi>, greater<vi>> vigreaterq;
typedef priority_queue<vl, vector<vl>, greater<vl>> vlgreaterq;
template <class o, class p, class q>
using tuple3q = priority_queue<tuple<o, p, q>, vector<tuple<o, p, q>>,
greater<tuple<o, p, q>>>;
template <class o, class p, class q, class r>
using tuple4q = priority_queue<tuple<o, p, q, r>, vector<tuple<o, p, q, r>>,
greater<tuple<o, p, q, r>>>;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
#define bit(x, v) ((ll)x << v)
#define rep(x, n) for (ll x = 0; x < n; x++)
#define rep2(x, f, v) for (ll x = f; x < v; x++)
#define repe(v, x) for (auto v : x)
// 許容する誤差ε
#define EPS (1e-10)
// 2つのスカラーが等しいかどうか
#define EQ(a, b) (std::abs(a - b) < EPS)
// 2つのベクトルが等しいかどうか
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define all(a) a.begin(), a.end()
#define all0(a) memset(a, 0, sizeof(a))
#define allm1(a) memset(a, -1, sizeof(a))
#define put_float(v) \
cout << fixed << setprecision(10); \
cout << v << endl
#define vinsert(v, p, x) v.insert(v.begin() + p, x)
#define vsort(v) sort(all(v));
#define dup(v) v.erase(unique(all(v)), v.end())
#define ion(i, j) ((i & (1LL << j)) > 0)
#define next(i) \
i++; \
i %= 2
#define Len size()
#define ull unsignd long long
#define psp(a, b) push_back(make_pair(a, b))
#define psp2(a, b) push(make_pair(a, b))
#define cini(a) \
a; \
cin >> a
#define infa(a, b) (a + b) % INF
#define infm(a, b) (a * b) % INF
#define infd(a, b) (a * modinv(b)) % INF
#define infs(a, b) (a + INF - b) % INF
#define inf(a) (a) %= INF
#define inff(a) (a) % INF
#define No cout << "No" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
const ll INF = 1000000007;
const int MAX = 2000010;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll getpow(ll b, ll x, ll md) {
ll t = b;
ll res = 1;
while (x > 0) {
if (x & 1) {
res *= t;
res %= md;
}
x >>= 1;
t *= t;
t %= md;
}
return res;
}
ll getpow(ll b, ll x) { return getpow(b, x, INF); }
ll modinv(ll x) { return getpow(x, INF - 2); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int pr[100010];
int lank[100010];
void uini(int n) {
for (size_t i = 0; i <= n; i++) {
pr[i] = i;
lank[i] = 1;
}
}
int parent(int x) {
if (x == pr[x])
return x;
return pr[x] = parent(pr[x]);
}
int same(int x, int y) { return parent(x) == parent(y); }
bool unit(int x, int y) {
int px = parent(x);
int py = parent(y);
if (px == py)
return false;
if (lank[py] < lank[px]) {
pr[py] = px;
lank[px] += lank[py];
} else {
pr[px] = py;
lank[py] += lank[px];
}
return true;
}
ll merge(ll *a, int left, int mid, int right) {
ll n1 = mid - left;
ll n2 = right - mid;
vector<int> L(n1 + 1);
vector<int> R(n2 + 1);
for (size_t i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (size_t i = 0; i < n2; i++) {
R[i] = a[mid + i];
}
L[n1] = INF;
R[n2] = INF;
ll i = 0;
ll j = 0;
ll r = 0;
for (size_t k = left; k < right; k++) {
if (L[i] <= R[j]) {
a[k] = L[i];
i++;
} else {
a[k] = R[j];
r += n1 - i;
j++;
}
}
return r;
}
ll merge2(pair<int, char> *a, int left, int mid, int right) {
ll n1 = mid - left;
ll n2 = right - mid;
vector<pair<int, char>> L(n1 + 1);
vector<pair<int, char>> R(n2 + 1);
for (size_t i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (size_t i = 0; i < n2; i++) {
R[i] = a[mid + i];
}
L[n1] = make_pair(INF, ' ');
R[n2] = make_pair(INF, ' ');
ll i = 0;
ll j = 0;
ll r = 0;
for (size_t k = left; k < right; k++) {
if (L[i].first <= R[j].first) {
a[k] = L[i];
i++;
} else {
a[k] = R[j];
r += n1 - i;
j++;
}
}
return r;
}
ll mergeSort2(pair<int, char> *a, int left, int right) {
ll res = 0;
if (left + 1 < right) {
int mid = (left + right) / 2;
res = mergeSort2(a, left, mid);
res += mergeSort2(a, mid, right);
res += merge2(a, left, mid, right);
}
return res;
}
ll mergeSort(ll *a, int left, int right) {
ll res = 0;
if (left + 1 < right) {
int mid = (left + right) / 2;
res = mergeSort(a, left, mid);
res += mergeSort(a, mid, right);
res += merge(a, left, mid, right);
}
return res;
}
int partition(pair<int, char> *a, int p, int r) {
pair<int, char> x = a[r];
int i = p - 1;
for (size_t j = p; j < r; j++) {
if (a[j].first <= x.first) {
i++;
swap(a[i], a[j]);
}
}
swap(a[i + 1], a[r]);
return i + 1;
}
void quick(pair<int, char> *a, int p, int r) {
if (p < r) {
int q = partition(a, p, r);
quick(a, p, q - 1);
quick(a, q + 1, r);
}
}
ll n;
int ci = 0;
ll P[1000010];
struct Node {
int key;
int priority;
Node *parent, *left, *right;
Node(int key, int priority);
Node() {}
};
Node NIL;
Node::Node(int key, int priority) : key(key), priority(priority) {
left = &NIL;
right = &NIL;
}
Node *root = new Node();
void cenrec(Node *k) {
if (k->key == NIL.key)
return;
cenrec(k->left);
cout << " " << k->key;
cenrec(k->right);
}
void fastrec(Node *k) {
if (k->key == NIL.key)
return;
cout << " " << k->key;
fastrec(k->left);
fastrec(k->right);
}
void insert(Node *v) {
Node *y = &NIL;
Node *x = root;
while (x->key != NIL.key) {
y = x;
if (v->key < x->key) {
x = x->left;
} else {
x = x->right;
}
}
v->parent = y;
if (y->key == NIL.key) {
root = v;
} else if (v->key < y->key) {
y->left = v;
} else {
y->right = v;
}
}
Node *find(Node *k, ll v) {
if (k->key == NIL.key)
return &NIL;
if (k->key == v)
return k;
if (v < k->key)
return find(k->left, v);
return find(k->right, v);
}
void delp12(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key == NIL.key && r->key == NIL.key) {
if (pr->left == x) {
pr->left = &NIL;
} else
pr->right = &NIL;
} else if (l->key != NIL.key) {
if (pr->left == x) {
pr->left = l;
} else
pr->right = l;
l->parent = pr;
} else if (r->key != NIL.key) {
if (pr->left == x) {
pr->left = r;
} else
pr->right = r;
r->parent = pr;
}
}
Node *get_next(Node *k) {
if (k->key == NIL.key)
return &NIL;
Node *res = get_next(k->left);
if (res->key != NIL.key)
return res;
return k;
}
void del(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key != NIL.key && r->key != NIL.key) {
Node *nex = get_next(r);
x->key = nex->key;
delp12(nex);
} else {
delp12(x);
}
}
Node *rightRotate(Node *t) {
Node *s = t->left;
t->left = s->right;
s->right = t;
return s;
}
Node *leftRotate(Node *t) {
Node *s = t->right;
t->right = s->left;
s->left = t;
return s;
}
Node *_insert(Node *t, int key, int priority) {
if (t->key == NIL.key) {
return new Node(key, priority);
}
if (key == t->key) {
return t;
}
if (key < t->key) {
t->left = _insert(t->left, key, priority);
if (t->priority < t->left->priority) {
t = rightRotate(t);
}
} else {
t->right = _insert(t->right, key, priority);
if (t->priority < t->right->priority) {
t = leftRotate(t);
}
}
return t;
}
Node *delete1(Node *t, int key);
Node *_delete(Node *t, int key) {
if (t->left->key == NIL.key && t->right->key == NIL.key) {
return &NIL;
} else if (t->left->key == NIL.key) {
t = leftRotate(t);
} else if (t->right->key == NIL.key) {
t = rightRotate(t);
} else {
if (t->left->priority > t->right->priority) {
t = rightRotate(t);
} else
t = leftRotate(t);
}
return delete1(t, key);
}
Node *delete1(Node *t, int key) {
if (t->key == NIL.key) {
return &NIL;
}
if (key < t->key) {
t->left = delete1(t->left, key);
} else if (key > t->key) {
t->right = delete1(t->right, key);
} else
return _delete(t, key);
return t;
}
int H;
int left(int i) { return i * 2 + 1; }
int right(int i) { return i * 2 + 2; }
struct edge {
int from, to;
ll val;
edge(int from, int to, ll val) : from(from), to(to), val(val) {}
};
ll k;
int _rank[1010];
int temp[1010];
bool compare_sa(int i, int j) {
if (_rank[i] != _rank[j])
return _rank[i] < _rank[j];
else {
int ri = i + k <= n ? _rank[i + k] : -1;
int rj = j + k <= n ? _rank[j + k] : -1;
return ri < rj;
}
}
void construct_sa(string S, int *sa) {
n = S.length();
for (size_t i = 0; i <= n; i++) {
sa[i] = i;
_rank[i] = i < n ? S[i] : -1;
}
for (k = 1; k <= n; k *= 2) {
sort(sa, sa + n + 1, compare_sa);
// saはソート後の接尾辞の並びになっている、rankは元の位置のindexを保持したまま、更新されている。
// ピンとこなかった部分
temp[sa[0]] = 0;
for (size_t i = 1; i <= n; i++) {
temp[sa[i]] = temp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);
}
for (size_t i = 0; i <= n; i++) {
_rank[i] = temp[i];
}
}
}
bool contain(string S, int *sa, string T) {
int a = 0, b = S.length();
// sa は 接尾辞が辞書順に並んでいる、入っているのはその位置のインデックス
while (b - a > 1) {
int c = (a + b) / 2;
if (S.compare(sa[c], T.length(), T) < 0)
a = c;
else
b = c;
}
return S.compare(sa[b], T.length(), T) == 0;
}
#define bit(x, v) ((ll)x << v)
class BIT {
static const int MAX_N = 500010;
public:
BIT() { memset(bit, 0, sizeof(bit)); }
ll bit[MAX_N + 1], n;
ll sum(int i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
};
struct UnionFind {
vector<int> A;
UnionFind(int n) : A(n, -1) {}
int find(int x) {
if (A[x] < 0)
return x;
return A[x] = find(A[x]);
}
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return;
if (A[x] > A[y])
swap(x, y);
A[x] += A[y];
A[y] = x;
}
int ngroups() {
int ans = 0;
for (auto a : A)
if (a < 0)
ans++;
return ans;
}
};
void yes() {
cout << "Yes\n";
exit(0);
}
void no() {
cout << "No\n";
exit(0);
}
vector<ll> getp(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
res.push_back(2);
while (n % 2 == 0)
n /= 2;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(i);
while (n % i == 0)
n /= i;
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<ll> getp2(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
while (n % 2 == 0) {
n /= 2;
res.push_back(2);
}
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
while (n % i == 0) {
n /= i;
res.push_back(i);
}
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<pll> getp3(ll n) {
vector<pll> res;
ll a = 2;
int si = 0;
if (n % 2 == 0) {
res.push_back(make_pair(2, 0));
while (n % 2 == 0) {
n /= 2;
res[si].second++;
}
si++;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(make_pair(i, 0));
while (n % i == 0) {
n /= i;
res[si].second++;
}
si++;
}
}
if (n != 1) {
res.push_back(make_pair(n, 1));
}
return res;
}
vector<ll> getDivisors(ll n) {
vector<ll> res;
ll a = 2;
res.push_back(1);
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (n / i != i)
res.push_back(n / i);
}
}
return res;
}
struct ve {
public:
vector<ve> child;
int _t = INF;
ve(int t) : _t(t) {}
ve(ve _left, ve _right) {
_t = _left._t + _right._t;
child.push_back(_left);
child.push_back(_right);
}
bool operator<(const ve &t) const { return _t > t._t; }
};
vector<bool> elas(ll n) {
vector<bool> r(n);
fill(r.begin(), r.end(), 1);
r[0] = 0;
r[1] = 0;
for (ll i = 2; i * i < n; i++) {
if (!r[i])
continue;
ll ti = i * 2;
while (ti < n) {
r[ti] = false;
ti += i;
}
}
return r;
}
bool isPrime(ll v) {
for (ll i = 2; i * i <= v; i++) {
if (v % i == 0)
return false;
}
return true;
}
class SegTree {
public:
const static int MAX_N = 100010;
const static int DAT_SIZE = (1 << 18) - 1;
int N, Q;
int A[MAX_N];
ll data[DAT_SIZE], datb[DAT_SIZE];
void init(int _n) {
N = 1;
while (N < _n)
N <<= 1;
memset(data, 0, sizeof(data));
memset(datb, 0, sizeof(datb));
}
void init(int _n, ll iv) {
N = 1;
while (N < _n)
N <<= 1;
rep(i, DAT_SIZE) {
data[i] = iv;
datb[i] = iv;
}
}
void add(int a, int b, int x) { add(a, b + 1, x, 0, 0, N); }
void add(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] += x;
} else if (l < b && a < r) {
datb[k] += (min(b, r) - max(a, l)) * x;
add(a, b, x, k * 2 + 1, l, (l + r) / 2);
add(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
void change(int a, int b, int x) { change(a, b + 1, x, 0, 0, N); }
void change(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] = x;
} else if (l < b && a < r) {
datb[k] = x;
change(a, b, x, k * 2 + 1, l, (l + r) / 2);
change(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
ll sum(int a, int b) { return sum(a, b + 1, 0, 0, N); }
ll sum(int a, int b, int k, int l, int r) {
if (b <= l || r <= a) {
return 0;
}
if (a <= l && r <= b) {
return data[k] * (r - l) + datb[k];
}
ll res = (min(b, r) - max(a, l)) * data[k];
res += sum(a, b, k * 2 + 1, l, (l + r) / 2);
res += sum(a, b, k * 2 + 2, (l + r) / 2, r);
return res;
}
};
class Segment;
class Circle;
class Point {
public:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y); }
Point operator-(Point p) { return Point(x - p.x, y - p.y); }
Point operator*(double a) { return Point(a * x, a * y); }
Point operator/(double a) { return Point(x / a, y / a); }
double abs() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const Point &p) const {
return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
}
static double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
static double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
static bool isOrthogonal(Point a, Point b) { return EQ(dot(a, b), 0.0); }
static bool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {
return isOrthogonal(a1 - a2, b1 - b2);
}
static bool isOrthogonal(Segment s1, Segment s2);
static bool isPalallel(Point a, Point b) { return EQ(cross(a, b), 0.0); }
static bool isPalallel(Point a1, Point a2, Point b1, Point b2) {
return isPalallel(a1 - a2, b1 - b2);
}
static bool isPalallel(Segment s1, Segment s2);
static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static const int ONLINE_FRONT = -2;
static const int ON_SEGMENT = 0;
static int ccw(Point p0, Point p1, Point p2) {
// 線分はp0とp1でp2がどこにあるかを探る
Point a = p1 - p0;
Point b = p2 - p0;
if (cross(a, b) > EPS)
return COUNTER_CLOCKWISE;
if (cross(a, b) < -EPS)
return CLOCKWISE;
if (dot(a, b) < -EPS)
return ONLINE_BACK;
if (a.norm() < b.norm())
return ONLINE_FRONT;
return ON_SEGMENT;
}
static bool intersect(Point p1, Point p2, Point p3, Point p4) {
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
static bool intersect(Segment s1, Segment s2);
static Point project(Segment s, Point p);
static Point reflect(Segment s, Point p);
static Point getDistance(Point a, Point b) { return (a - b).abs(); }
static double getDistanceLP(Segment s, Point p);
static double getDistanceSP(Segment s, Point p);
static double getDistance(Segment s1, Segment s2);
static Point getIntersection(Segment s1, Segment s2);
static pair<Point, Point> crossPoints(Circle c, Segment s);
static int contains(vector<Point> g, Point p) {
int n = g.size();
bool x = false;
rep(i, n) {
Point a = g[i] - p, b = g[(i + 1) % n] - p;
// 線の上に載っているか
if (std::abs(cross(a, b)) < EPS && dot(a, b) < EPS)
return 1;
// pを基準として上下にあるか
// または外積が正か?(→にあるか)
if (a.y > b.y)
swap(a, b);
if (a.y < EPS && EPS < b.y && cross(a, b) > EPS)
x = !x;
}
return x ? 2 : 0;
}
static vector<Point> andrewScan(vector<Point> s) {
vector<Point> u, l;
if (s.size() < 3)
return s;
sort(all(s));
u.push_back(s[0]);
u.push_back(s[1]);
l.push_back(s[s.size() - 1]);
l.push_back(s[s.size() - 2]);
for (int i = 2; i < s.size(); i++) {
for (int _n = u.size();
_n >= 2 && ccw(u[_n - 2], u[_n - 1], s[i]) > CLOCKWISE; _n--) {
u.pop_back();
}
u.push_back(s[i]);
}
for (int i = s.size() - 3; i >= 0; i--) {
for (int _n = l.size();
_n >= 2 && ccw(l[_n - 2], l[_n - 1], s[i]) > CLOCKWISE; _n--) {
l.pop_back();
}
l.push_back(s[i]);
}
reverse(all(l));
for (int i = u.size() - 2; i >= 1; i--) {
l.push_back(u[i]);
}
return l;
}
void get_cin() { cin >> x >> y; }
};
class Segment {
public:
Point p1, p2;
Segment() {}
Segment(Point p1, Point p2) : p1(p1), p2(p2) {}
void get_cin() { cin >> p1.x >> p1.y >> p2.x >> p2.y; }
Point p1tp2() { return p2 - p1; }
Point p2tp1() { return p1 - p2; }
double abs() { return std::abs(norm()); }
double norm() { return (p2 - p1).norm(); }
};
bool Point::isOrthogonal(Segment s1, Segment s2) {
return EQ(dot(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::isPalallel(Segment s1, Segment s2) {
return EQ(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::intersect(Segment s1, Segment s2) {
return intersect(s1.p1, s1.p2, s2.p1, s2.p2);
}
Point Point::project(Segment s, Point p) {
Point base = s.p2 - s.p1;
double r = Point::dot(p - s.p1, base) / base.norm();
return s.p1 + base * r;
}
Point Point::reflect(Segment s, Point p) { return (project(s, p) * 2) - p; }
double Point::getDistanceLP(Segment s, Point p) {
return std::abs(cross(s.p2 - s.p1, p - s.p1) / (s.p2 - s.p1).abs());
}
double Point::getDistanceSP(Segment s, Point p) {
if (dot(s.p2 - s.p1, p - s.p1) < 0.0)
return (p - s.p1).abs();
if (dot(s.p1 - s.p2, p - s.p2) < 0.0)
return (p - s.p2).abs();
return getDistanceLP(s, p);
}
double Point::getDistance(Segment s1, Segment s2) {
if (intersect(s1, s2))
return 0.0;
return min({getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2),
getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)});
}
Point Point::getIntersection(Segment s1, Segment s2) {
// (s1.p1 - s2.p1).norm()
auto bs = s1.p2 - s1.p1;
auto n1 = s2.p1 - s1.p1;
auto n2 = s2.p2 - s1.p1;
auto c1 = std::abs(cross(n1, bs)) / bs.norm();
auto c2 = std::abs(cross(n2, bs)) / bs.norm();
return s2.p1 + (s2.p2 - s2.p1) * (c1 / (c1 + c2));
// c1:c2=t:1-t
// c2t=(1-t)c1
// t/(1-t)=c1/(c1+c2)
//
}
double arg(Point p) { return atan2(p.y, p.x); }
Point polar(double a, double r) { return Point(cos(r) * a, sin(r) * a); }
class Circle {
public:
Point c;
double r;
Circle(Point c = Point(), double r = 0.0) : c(c), r(r) {}
void get_cin() { cin >> c.x >> c.y >> r; }
static pair<Point, Point> getCrossPoints(Circle c1, Circle c2) {
double d = (c1.c - c2.c).abs(); // 中心点どうしの距離
double a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));
double t = arg(c2.c - c1.c);
return make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a));
}
};
pair<Point, Point> Point::crossPoints(Circle c, Segment s) {
auto pp = project(s, c.c);
auto f = (pp - c.c).norm();
auto mu = sqrt(c.r * c.r - f);
auto e = s.p1tp2() / s.p1tp2().abs();
return make_pair(pp + e * mu, pp - e * mu);
}
ll divRm(string s, ll x) {
ll r = 0;
for (ll i = 0; i < s.size(); i++) {
r *= 10;
r += s[i] - '0';
r %= x;
}
return r;
}
ll cmbi(ll x, ll b) {
ll res = 1;
for (size_t i = 0; i < b; i++) {
res *= x - i;
res %= INF;
res *= inv[b - i];
res %= INF;
}
return res;
}
double digsum(ll x) {
ll res = 0;
while (x > 0) {
res += x % 10;
x /= 10;
}
return res;
}
bool check_parindrome(string s) {
int n = s.size();
rep(i, n / 2) {
if (s[i] != s[n - i - 1]) {
return false;
}
}
return true;
}
ll rec(ll level, ll p, ll all, ll x) {
if (x == 0)
return 0;
if (x == all)
return p;
if (x == all / 2 + 1)
return p / 2 + 1;
if (x < all / 2) {
// 半分以下
return rec(level - 1, p / 2, all / 2 - 1, x - 1);
} else {
// 半分以上
return rec(level - 1, p / 2, all / 2 - 1, x - all / 2 - 1) + p / 2 + 1;
}
}
void solv() {
ll x;
cin >> n >> x;
ll all = 1;
ll p = 1;
rep(i, n) {
all = all * 2 + 3;
p = p * 2 + 1;
}
cout << rec(n, p, all, x) << endl;
// cin >> n;
// vector<pll> d[4];
// rep(i, n) {
// ll x, y; char v;
// cin >> x >> y >> v;
// if (v == 'R') d[0].psp(x, y);
// if (v == 'L') d[1].psp(x, y);
// if (v == 'U') d[2].psp(x, y);
// if (v == 'D') d[3].psp(x, y);
// }
// rep(i, 4) {
//}
}
int main() {
COMinit();
solv();
return 0;
} | #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 <stack>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, double> pld;
typedef pair<double, double> pdd;
typedef pair<double, ll> pdl;
typedef pair<int, char> pic;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef priority_queue<ll, vector<ll>, greater<ll>> llgreaterq;
typedef priority_queue<pll, vector<pll>, greater<pll>> pllgreaterq;
typedef priority_queue<pair<ll, pll>, vector<pair<ll, pll>>,
greater<pair<ll, pll>>>
plpllgreaterq;
typedef priority_queue<vi, vector<vi>, greater<vi>> vigreaterq;
typedef priority_queue<vl, vector<vl>, greater<vl>> vlgreaterq;
template <class o, class p, class q>
using tuple3q = priority_queue<tuple<o, p, q>, vector<tuple<o, p, q>>,
greater<tuple<o, p, q>>>;
template <class o, class p, class q, class r>
using tuple4q = priority_queue<tuple<o, p, q, r>, vector<tuple<o, p, q, r>>,
greater<tuple<o, p, q, r>>>;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
#define bit(x, v) ((ll)x << v)
#define rep(x, n) for (ll x = 0; x < n; x++)
#define rep2(x, f, v) for (ll x = f; x < v; x++)
#define repe(v, x) for (auto v : x)
// 許容する誤差ε
#define EPS (1e-10)
// 2つのスカラーが等しいかどうか
#define EQ(a, b) (std::abs(a - b) < EPS)
// 2つのベクトルが等しいかどうか
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define all(a) a.begin(), a.end()
#define all0(a) memset(a, 0, sizeof(a))
#define allm1(a) memset(a, -1, sizeof(a))
#define put_float(v) \
cout << fixed << setprecision(10); \
cout << v << endl
#define vinsert(v, p, x) v.insert(v.begin() + p, x)
#define vsort(v) sort(all(v));
#define dup(v) v.erase(unique(all(v)), v.end())
#define ion(i, j) ((i & (1LL << j)) > 0)
#define next(i) \
i++; \
i %= 2
#define Len size()
#define ull unsignd long long
#define psp(a, b) push_back(make_pair(a, b))
#define psp2(a, b) push(make_pair(a, b))
#define cini(a) \
a; \
cin >> a
#define infa(a, b) (a + b) % INF
#define infm(a, b) (a * b) % INF
#define infd(a, b) (a * modinv(b)) % INF
#define infs(a, b) (a + INF - b) % INF
#define inf(a) (a) %= INF
#define inff(a) (a) % INF
#define No cout << "No" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
const ll INF = 1000000007;
const int MAX = 2000010;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll getpow(ll b, ll x, ll md) {
ll t = b;
ll res = 1;
while (x > 0) {
if (x & 1) {
res *= t;
res %= md;
}
x >>= 1;
t *= t;
t %= md;
}
return res;
}
ll getpow(ll b, ll x) { return getpow(b, x, INF); }
ll modinv(ll x) { return getpow(x, INF - 2); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int pr[100010];
int lank[100010];
void uini(int n) {
for (size_t i = 0; i <= n; i++) {
pr[i] = i;
lank[i] = 1;
}
}
int parent(int x) {
if (x == pr[x])
return x;
return pr[x] = parent(pr[x]);
}
int same(int x, int y) { return parent(x) == parent(y); }
bool unit(int x, int y) {
int px = parent(x);
int py = parent(y);
if (px == py)
return false;
if (lank[py] < lank[px]) {
pr[py] = px;
lank[px] += lank[py];
} else {
pr[px] = py;
lank[py] += lank[px];
}
return true;
}
ll merge(ll *a, int left, int mid, int right) {
ll n1 = mid - left;
ll n2 = right - mid;
vector<int> L(n1 + 1);
vector<int> R(n2 + 1);
for (size_t i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (size_t i = 0; i < n2; i++) {
R[i] = a[mid + i];
}
L[n1] = INF;
R[n2] = INF;
ll i = 0;
ll j = 0;
ll r = 0;
for (size_t k = left; k < right; k++) {
if (L[i] <= R[j]) {
a[k] = L[i];
i++;
} else {
a[k] = R[j];
r += n1 - i;
j++;
}
}
return r;
}
ll merge2(pair<int, char> *a, int left, int mid, int right) {
ll n1 = mid - left;
ll n2 = right - mid;
vector<pair<int, char>> L(n1 + 1);
vector<pair<int, char>> R(n2 + 1);
for (size_t i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (size_t i = 0; i < n2; i++) {
R[i] = a[mid + i];
}
L[n1] = make_pair(INF, ' ');
R[n2] = make_pair(INF, ' ');
ll i = 0;
ll j = 0;
ll r = 0;
for (size_t k = left; k < right; k++) {
if (L[i].first <= R[j].first) {
a[k] = L[i];
i++;
} else {
a[k] = R[j];
r += n1 - i;
j++;
}
}
return r;
}
ll mergeSort2(pair<int, char> *a, int left, int right) {
ll res = 0;
if (left + 1 < right) {
int mid = (left + right) / 2;
res = mergeSort2(a, left, mid);
res += mergeSort2(a, mid, right);
res += merge2(a, left, mid, right);
}
return res;
}
ll mergeSort(ll *a, int left, int right) {
ll res = 0;
if (left + 1 < right) {
int mid = (left + right) / 2;
res = mergeSort(a, left, mid);
res += mergeSort(a, mid, right);
res += merge(a, left, mid, right);
}
return res;
}
int partition(pair<int, char> *a, int p, int r) {
pair<int, char> x = a[r];
int i = p - 1;
for (size_t j = p; j < r; j++) {
if (a[j].first <= x.first) {
i++;
swap(a[i], a[j]);
}
}
swap(a[i + 1], a[r]);
return i + 1;
}
void quick(pair<int, char> *a, int p, int r) {
if (p < r) {
int q = partition(a, p, r);
quick(a, p, q - 1);
quick(a, q + 1, r);
}
}
ll n;
int ci = 0;
ll P[1000010];
struct Node {
int key;
int priority;
Node *parent, *left, *right;
Node(int key, int priority);
Node() {}
};
Node NIL;
Node::Node(int key, int priority) : key(key), priority(priority) {
left = &NIL;
right = &NIL;
}
Node *root = new Node();
void cenrec(Node *k) {
if (k->key == NIL.key)
return;
cenrec(k->left);
cout << " " << k->key;
cenrec(k->right);
}
void fastrec(Node *k) {
if (k->key == NIL.key)
return;
cout << " " << k->key;
fastrec(k->left);
fastrec(k->right);
}
void insert(Node *v) {
Node *y = &NIL;
Node *x = root;
while (x->key != NIL.key) {
y = x;
if (v->key < x->key) {
x = x->left;
} else {
x = x->right;
}
}
v->parent = y;
if (y->key == NIL.key) {
root = v;
} else if (v->key < y->key) {
y->left = v;
} else {
y->right = v;
}
}
Node *find(Node *k, ll v) {
if (k->key == NIL.key)
return &NIL;
if (k->key == v)
return k;
if (v < k->key)
return find(k->left, v);
return find(k->right, v);
}
void delp12(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key == NIL.key && r->key == NIL.key) {
if (pr->left == x) {
pr->left = &NIL;
} else
pr->right = &NIL;
} else if (l->key != NIL.key) {
if (pr->left == x) {
pr->left = l;
} else
pr->right = l;
l->parent = pr;
} else if (r->key != NIL.key) {
if (pr->left == x) {
pr->left = r;
} else
pr->right = r;
r->parent = pr;
}
}
Node *get_next(Node *k) {
if (k->key == NIL.key)
return &NIL;
Node *res = get_next(k->left);
if (res->key != NIL.key)
return res;
return k;
}
void del(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key != NIL.key && r->key != NIL.key) {
Node *nex = get_next(r);
x->key = nex->key;
delp12(nex);
} else {
delp12(x);
}
}
Node *rightRotate(Node *t) {
Node *s = t->left;
t->left = s->right;
s->right = t;
return s;
}
Node *leftRotate(Node *t) {
Node *s = t->right;
t->right = s->left;
s->left = t;
return s;
}
Node *_insert(Node *t, int key, int priority) {
if (t->key == NIL.key) {
return new Node(key, priority);
}
if (key == t->key) {
return t;
}
if (key < t->key) {
t->left = _insert(t->left, key, priority);
if (t->priority < t->left->priority) {
t = rightRotate(t);
}
} else {
t->right = _insert(t->right, key, priority);
if (t->priority < t->right->priority) {
t = leftRotate(t);
}
}
return t;
}
Node *delete1(Node *t, int key);
Node *_delete(Node *t, int key) {
if (t->left->key == NIL.key && t->right->key == NIL.key) {
return &NIL;
} else if (t->left->key == NIL.key) {
t = leftRotate(t);
} else if (t->right->key == NIL.key) {
t = rightRotate(t);
} else {
if (t->left->priority > t->right->priority) {
t = rightRotate(t);
} else
t = leftRotate(t);
}
return delete1(t, key);
}
Node *delete1(Node *t, int key) {
if (t->key == NIL.key) {
return &NIL;
}
if (key < t->key) {
t->left = delete1(t->left, key);
} else if (key > t->key) {
t->right = delete1(t->right, key);
} else
return _delete(t, key);
return t;
}
int H;
int left(int i) { return i * 2 + 1; }
int right(int i) { return i * 2 + 2; }
struct edge {
int from, to;
ll val;
edge(int from, int to, ll val) : from(from), to(to), val(val) {}
};
ll k;
int _rank[1010];
int temp[1010];
bool compare_sa(int i, int j) {
if (_rank[i] != _rank[j])
return _rank[i] < _rank[j];
else {
int ri = i + k <= n ? _rank[i + k] : -1;
int rj = j + k <= n ? _rank[j + k] : -1;
return ri < rj;
}
}
void construct_sa(string S, int *sa) {
n = S.length();
for (size_t i = 0; i <= n; i++) {
sa[i] = i;
_rank[i] = i < n ? S[i] : -1;
}
for (k = 1; k <= n; k *= 2) {
sort(sa, sa + n + 1, compare_sa);
// saはソート後の接尾辞の並びになっている、rankは元の位置のindexを保持したまま、更新されている。
// ピンとこなかった部分
temp[sa[0]] = 0;
for (size_t i = 1; i <= n; i++) {
temp[sa[i]] = temp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);
}
for (size_t i = 0; i <= n; i++) {
_rank[i] = temp[i];
}
}
}
bool contain(string S, int *sa, string T) {
int a = 0, b = S.length();
// sa は 接尾辞が辞書順に並んでいる、入っているのはその位置のインデックス
while (b - a > 1) {
int c = (a + b) / 2;
if (S.compare(sa[c], T.length(), T) < 0)
a = c;
else
b = c;
}
return S.compare(sa[b], T.length(), T) == 0;
}
#define bit(x, v) ((ll)x << v)
class BIT {
static const int MAX_N = 500010;
public:
BIT() { memset(bit, 0, sizeof(bit)); }
ll bit[MAX_N + 1], n;
ll sum(int i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
};
struct UnionFind {
vector<int> A;
UnionFind(int n) : A(n, -1) {}
int find(int x) {
if (A[x] < 0)
return x;
return A[x] = find(A[x]);
}
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return;
if (A[x] > A[y])
swap(x, y);
A[x] += A[y];
A[y] = x;
}
int ngroups() {
int ans = 0;
for (auto a : A)
if (a < 0)
ans++;
return ans;
}
};
void yes() {
cout << "Yes\n";
exit(0);
}
void no() {
cout << "No\n";
exit(0);
}
vector<ll> getp(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
res.push_back(2);
while (n % 2 == 0)
n /= 2;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(i);
while (n % i == 0)
n /= i;
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<ll> getp2(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
while (n % 2 == 0) {
n /= 2;
res.push_back(2);
}
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
while (n % i == 0) {
n /= i;
res.push_back(i);
}
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<pll> getp3(ll n) {
vector<pll> res;
ll a = 2;
int si = 0;
if (n % 2 == 0) {
res.push_back(make_pair(2, 0));
while (n % 2 == 0) {
n /= 2;
res[si].second++;
}
si++;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(make_pair(i, 0));
while (n % i == 0) {
n /= i;
res[si].second++;
}
si++;
}
}
if (n != 1) {
res.push_back(make_pair(n, 1));
}
return res;
}
vector<ll> getDivisors(ll n) {
vector<ll> res;
ll a = 2;
res.push_back(1);
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (n / i != i)
res.push_back(n / i);
}
}
return res;
}
struct ve {
public:
vector<ve> child;
int _t = INF;
ve(int t) : _t(t) {}
ve(ve _left, ve _right) {
_t = _left._t + _right._t;
child.push_back(_left);
child.push_back(_right);
}
bool operator<(const ve &t) const { return _t > t._t; }
};
vector<bool> elas(ll n) {
vector<bool> r(n);
fill(r.begin(), r.end(), 1);
r[0] = 0;
r[1] = 0;
for (ll i = 2; i * i < n; i++) {
if (!r[i])
continue;
ll ti = i * 2;
while (ti < n) {
r[ti] = false;
ti += i;
}
}
return r;
}
bool isPrime(ll v) {
for (ll i = 2; i * i <= v; i++) {
if (v % i == 0)
return false;
}
return true;
}
class SegTree {
public:
const static int MAX_N = 100010;
const static int DAT_SIZE = (1 << 18) - 1;
int N, Q;
int A[MAX_N];
ll data[DAT_SIZE], datb[DAT_SIZE];
void init(int _n) {
N = 1;
while (N < _n)
N <<= 1;
memset(data, 0, sizeof(data));
memset(datb, 0, sizeof(datb));
}
void init(int _n, ll iv) {
N = 1;
while (N < _n)
N <<= 1;
rep(i, DAT_SIZE) {
data[i] = iv;
datb[i] = iv;
}
}
void add(int a, int b, int x) { add(a, b + 1, x, 0, 0, N); }
void add(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] += x;
} else if (l < b && a < r) {
datb[k] += (min(b, r) - max(a, l)) * x;
add(a, b, x, k * 2 + 1, l, (l + r) / 2);
add(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
void change(int a, int b, int x) { change(a, b + 1, x, 0, 0, N); }
void change(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] = x;
} else if (l < b && a < r) {
datb[k] = x;
change(a, b, x, k * 2 + 1, l, (l + r) / 2);
change(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
ll sum(int a, int b) { return sum(a, b + 1, 0, 0, N); }
ll sum(int a, int b, int k, int l, int r) {
if (b <= l || r <= a) {
return 0;
}
if (a <= l && r <= b) {
return data[k] * (r - l) + datb[k];
}
ll res = (min(b, r) - max(a, l)) * data[k];
res += sum(a, b, k * 2 + 1, l, (l + r) / 2);
res += sum(a, b, k * 2 + 2, (l + r) / 2, r);
return res;
}
};
class Segment;
class Circle;
class Point {
public:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y); }
Point operator-(Point p) { return Point(x - p.x, y - p.y); }
Point operator*(double a) { return Point(a * x, a * y); }
Point operator/(double a) { return Point(x / a, y / a); }
double abs() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const Point &p) const {
return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
}
static double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
static double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
static bool isOrthogonal(Point a, Point b) { return EQ(dot(a, b), 0.0); }
static bool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {
return isOrthogonal(a1 - a2, b1 - b2);
}
static bool isOrthogonal(Segment s1, Segment s2);
static bool isPalallel(Point a, Point b) { return EQ(cross(a, b), 0.0); }
static bool isPalallel(Point a1, Point a2, Point b1, Point b2) {
return isPalallel(a1 - a2, b1 - b2);
}
static bool isPalallel(Segment s1, Segment s2);
static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static const int ONLINE_FRONT = -2;
static const int ON_SEGMENT = 0;
static int ccw(Point p0, Point p1, Point p2) {
// 線分はp0とp1でp2がどこにあるかを探る
Point a = p1 - p0;
Point b = p2 - p0;
if (cross(a, b) > EPS)
return COUNTER_CLOCKWISE;
if (cross(a, b) < -EPS)
return CLOCKWISE;
if (dot(a, b) < -EPS)
return ONLINE_BACK;
if (a.norm() < b.norm())
return ONLINE_FRONT;
return ON_SEGMENT;
}
static bool intersect(Point p1, Point p2, Point p3, Point p4) {
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
static bool intersect(Segment s1, Segment s2);
static Point project(Segment s, Point p);
static Point reflect(Segment s, Point p);
static Point getDistance(Point a, Point b) { return (a - b).abs(); }
static double getDistanceLP(Segment s, Point p);
static double getDistanceSP(Segment s, Point p);
static double getDistance(Segment s1, Segment s2);
static Point getIntersection(Segment s1, Segment s2);
static pair<Point, Point> crossPoints(Circle c, Segment s);
static int contains(vector<Point> g, Point p) {
int n = g.size();
bool x = false;
rep(i, n) {
Point a = g[i] - p, b = g[(i + 1) % n] - p;
// 線の上に載っているか
if (std::abs(cross(a, b)) < EPS && dot(a, b) < EPS)
return 1;
// pを基準として上下にあるか
// または外積が正か?(→にあるか)
if (a.y > b.y)
swap(a, b);
if (a.y < EPS && EPS < b.y && cross(a, b) > EPS)
x = !x;
}
return x ? 2 : 0;
}
static vector<Point> andrewScan(vector<Point> s) {
vector<Point> u, l;
if (s.size() < 3)
return s;
sort(all(s));
u.push_back(s[0]);
u.push_back(s[1]);
l.push_back(s[s.size() - 1]);
l.push_back(s[s.size() - 2]);
for (int i = 2; i < s.size(); i++) {
for (int _n = u.size();
_n >= 2 && ccw(u[_n - 2], u[_n - 1], s[i]) > CLOCKWISE; _n--) {
u.pop_back();
}
u.push_back(s[i]);
}
for (int i = s.size() - 3; i >= 0; i--) {
for (int _n = l.size();
_n >= 2 && ccw(l[_n - 2], l[_n - 1], s[i]) > CLOCKWISE; _n--) {
l.pop_back();
}
l.push_back(s[i]);
}
reverse(all(l));
for (int i = u.size() - 2; i >= 1; i--) {
l.push_back(u[i]);
}
return l;
}
void get_cin() { cin >> x >> y; }
};
class Segment {
public:
Point p1, p2;
Segment() {}
Segment(Point p1, Point p2) : p1(p1), p2(p2) {}
void get_cin() { cin >> p1.x >> p1.y >> p2.x >> p2.y; }
Point p1tp2() { return p2 - p1; }
Point p2tp1() { return p1 - p2; }
double abs() { return std::abs(norm()); }
double norm() { return (p2 - p1).norm(); }
};
bool Point::isOrthogonal(Segment s1, Segment s2) {
return EQ(dot(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::isPalallel(Segment s1, Segment s2) {
return EQ(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::intersect(Segment s1, Segment s2) {
return intersect(s1.p1, s1.p2, s2.p1, s2.p2);
}
Point Point::project(Segment s, Point p) {
Point base = s.p2 - s.p1;
double r = Point::dot(p - s.p1, base) / base.norm();
return s.p1 + base * r;
}
Point Point::reflect(Segment s, Point p) { return (project(s, p) * 2) - p; }
double Point::getDistanceLP(Segment s, Point p) {
return std::abs(cross(s.p2 - s.p1, p - s.p1) / (s.p2 - s.p1).abs());
}
double Point::getDistanceSP(Segment s, Point p) {
if (dot(s.p2 - s.p1, p - s.p1) < 0.0)
return (p - s.p1).abs();
if (dot(s.p1 - s.p2, p - s.p2) < 0.0)
return (p - s.p2).abs();
return getDistanceLP(s, p);
}
double Point::getDistance(Segment s1, Segment s2) {
if (intersect(s1, s2))
return 0.0;
return min({getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2),
getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)});
}
Point Point::getIntersection(Segment s1, Segment s2) {
// (s1.p1 - s2.p1).norm()
auto bs = s1.p2 - s1.p1;
auto n1 = s2.p1 - s1.p1;
auto n2 = s2.p2 - s1.p1;
auto c1 = std::abs(cross(n1, bs)) / bs.norm();
auto c2 = std::abs(cross(n2, bs)) / bs.norm();
return s2.p1 + (s2.p2 - s2.p1) * (c1 / (c1 + c2));
// c1:c2=t:1-t
// c2t=(1-t)c1
// t/(1-t)=c1/(c1+c2)
//
}
double arg(Point p) { return atan2(p.y, p.x); }
Point polar(double a, double r) { return Point(cos(r) * a, sin(r) * a); }
class Circle {
public:
Point c;
double r;
Circle(Point c = Point(), double r = 0.0) : c(c), r(r) {}
void get_cin() { cin >> c.x >> c.y >> r; }
static pair<Point, Point> getCrossPoints(Circle c1, Circle c2) {
double d = (c1.c - c2.c).abs(); // 中心点どうしの距離
double a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));
double t = arg(c2.c - c1.c);
return make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a));
}
};
pair<Point, Point> Point::crossPoints(Circle c, Segment s) {
auto pp = project(s, c.c);
auto f = (pp - c.c).norm();
auto mu = sqrt(c.r * c.r - f);
auto e = s.p1tp2() / s.p1tp2().abs();
return make_pair(pp + e * mu, pp - e * mu);
}
ll divRm(string s, ll x) {
ll r = 0;
for (ll i = 0; i < s.size(); i++) {
r *= 10;
r += s[i] - '0';
r %= x;
}
return r;
}
ll cmbi(ll x, ll b) {
ll res = 1;
for (size_t i = 0; i < b; i++) {
res *= x - i;
res %= INF;
res *= inv[b - i];
res %= INF;
}
return res;
}
double digsum(ll x) {
ll res = 0;
while (x > 0) {
res += x % 10;
x /= 10;
}
return res;
}
bool check_parindrome(string s) {
int n = s.size();
rep(i, n / 2) {
if (s[i] != s[n - i - 1]) {
return false;
}
}
return true;
}
ll rec(ll level, ll p, ll all, ll x) {
if (x == 0)
return 0;
if (x == all)
return p;
if (x == all / 2 + 1)
return p / 2 + 1;
if (level == 0)
return 0;
if (x <= all / 2) {
// 半分以下
return rec(level - 1, p / 2, all / 2 - 1, x - 1);
} else {
// 半分以上
return rec(level - 1, p / 2, all / 2 - 1, x - all / 2 - 1) + p / 2 + 1;
}
}
void solv() {
ll x;
cin >> n >> x;
ll all = 1;
ll p = 1;
rep(i, n) {
all = all * 2 + 3;
p = p * 2 + 1;
}
cout << rec(n, p, all, x) << endl;
// cin >> n;
// vector<pll> d[4];
// rep(i, n) {
// ll x, y; char v;
// cin >> x >> y >> v;
// if (v == 'R') d[0].psp(x, y);
// if (v == 'L') d[1].psp(x, y);
// if (v == 'U') d[2].psp(x, y);
// if (v == 'D') d[3].psp(x, y);
// }
// rep(i, 4) {
//}
}
int main() {
COMinit();
solv();
return 0;
} | 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)
return 0;
if (n == 0)
return 1;
if (k >= all(n))
return apy(n - 1) * 2 + 1;
if (k <= a)
return pty(n - 1, k - 1);
sum += apy(n - 1);
if (k > a + 2)
sum += pty(n - 1, k - (a + 2));
return sum;
}
int main() {
ll n, x;
cin >> n >> x;
cout << pty(n, x) << endl;
return 0;
} | #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 (k <= 0 || k <= n)
return 0;
if (n == 0)
return 1;
if (k >= all(n))
return apy(n - 1) * 2 + 1;
if (k <= a)
return pty(n - 1, k - 1);
sum += apy(n - 1);
if (k > a + 2)
sum += pty(n - 1, k - (a + 2));
return sum;
}
int main() {
ll n, x;
cin >> n >> x;
cout << pty(n, x) << endl;
return 0;
} | 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) + 1;
mp[{i + 1, x + 1}] = res;
return res;
}
int main() {
ll n, x;
cin >> n >> x;
cout << f(n, x) << endl;
}
| #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);
else
res = f(i, a) + f(i, x - a - 1) + 1;
mp[{i + 1, x + 1}] = res;
return res;
}
int main() {
ll n, x;
cin >> n >> x;
cout << f(n, x) << endl;
}
| 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;
if (2 <= i && i <= 1 + a.at(n - 1))
return dfs(n - 1, i - 1);
if (i == 2 + a.at(n - 1))
return dfs(n - 1, a.at(i - 1)) + 1;
if (3 + a.at(n - 1) <= i && i <= 2 + 2 * a.at(n - 1))
return dfs(n - 1, a.at(n - 1)) + 1 + dfs(n - 1, i - 2 - a.at(n - 1));
else
return 1 + 2 * dfs(n - 1, a.at(n - 1));
}
int main() {
ll n, x;
cin >> n >> x;
ttl(n);
cout << dfs(n, x);
} | #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;
if (2 <= i && i <= 1 + a.at(n - 1))
return dfs(n - 1, i - 1);
if (i == 2 + a.at(n - 1))
return dfs(n - 1, a.at(n - 1)) + 1;
if (3 + a.at(n - 1) <= i && i <= 2 + 2 * a.at(n - 1))
return dfs(n - 1, a.at(n - 1)) + 1 + dfs(n - 1, i - 2 - a.at(n - 1));
else
return 1 + 2 * dfs(n - 1, a.at(n - 1));
}
int main() {
ll n, x;
cin >> n >> x;
ttl(n);
cout << dfs(n, x);
} | 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
// BBBPPPBPBPPPBBPBBPPPBPBPPPBBB3-1-1-2-2-1-1-3/-3-1-3-1-3-1-3/
// (14/15)3+13*2=29
// BBBBPPPBPBPPPBBPBBPPPBPBPPPBBBPBBBPPPBPBPPPBBPBBPPPBPBPPPBBBB
// (30/31)/3+29*2=61
// 4-1-1-2-2-1-1-3-3-1-1-2-2-1-1-4/-3-1-3-1-3-1-3-1-3-1-3-1-3-1-3
// BBBBBPPPBPBPPPBBPBBPPPBPBPPPBBBPBBBPPPBPBPPPBBPBBPPPBPBPPPBBBBPBBBBPPPBPBPPPBBPBBPPPBPBPPPBBBPBBBPPPBPBPPPBBPBBPPPBPBPPPBBBBB
// B>P>B
// 総数出しとく。抜粋数に対してどうする？
// B0P0B=1
// B1P1B=2
// B2P2B=3
// B3P3B=4
//-----=50
// 2文探索みたいな感じで終了地点を探す。～以下にあるなら総数/2を足してそうじゃないなら範囲狭めるだけ
vector<ll> Z(N, 1);
for (int i = 1; i <= N; i++) {
Z[i] = Z[i - 1] * 2 + 3;
}
ll ans = 0, h = Z[N], l = 1, mid = (h + l) / 2;
while (1) {
if (mid <= X) {
l = mid;
ans += (h - l) / 2 + 1;
} else if (mid > X)
h = mid;
l++;
h--;
if (l > h)
break;
mid = (h + l) / 2;
}
cout << ans << endl;
} | #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
// BBBPPPBPBPPPBBPBBPPPBPBPPPBBB3-1-1-2-2-1-1-3/-3-1-3-1-3-1-3/
// (14/15)3+13*2=29
// BBBBPPPBPBPPPBBPBBPPPBPBPPPBBBPBBBPPPBPBPPPBBPBBPPPBPBPPPBBBB
// (30/31)/3+29*2=61
// 4-1-1-2-2-1-1-3-3-1-1-2-2-1-1-4/-3-1-3-1-3-1-3-1-3-1-3-1-3-1-3
// BBBBBPPPBPBPPPBBPBBPPPBPBPPPBBBPBBBPPPBPBPPPBBPBBPPPBPBPPPBBBBPBBBBPPPBPBPPPBBPBBPPPBPBPPPBBBPBBBPPPBPBPPPBBPBBPPPBPBPPPBBBBB
// B>P>B
// 総数出しとく。抜粋数に対してどうする？
// B0P0B=1
// B1P1B=2
// B2P2B=3
// B3P3B=4
//-----=50
// 2文探索みたいな感じで終了地点を探す。～以下にあるなら総数/2を足してそうじゃないなら範囲狭めるだけ
vector<ll> Z(N + 1, 1);
for (int i = 1; i <= N; i++) {
Z[i] = Z[i - 1] * 2 + 3;
}
ll ans = 0, h = Z[N], l = 1, mid = (h + l) / 2;
while (1) {
if (mid <= X) {
l = mid;
ans += (h - l) / 2 + 1;
} else if (mid > X)
h = mid;
l++;
h--;
if (l > h)
break;
mid = (h + l) / 2;
}
cout << ans << endl;
} | 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 == 0) {
if (X <= 0) {
return 0;
} else {
return 1;
}
} else if (X <= 1 + length[N - 1]) {
return sum(N - 1, X - 1);
} else {
return P_length[N - 1] + 1 + sum(N - 1, X - 2 - length[N - 1]);
}
}
int main() {
ll N, X;
cin >> N >> X;
// length
length = vector<ll>(N, 1);
P_length = vector<ll>(N, 1);
for (ll i = 1; i <= N; i++) {
length[i] = 2 * length[i - 1] + 3;
P_length[i] = 2 * P_length[i - 1] + 1;
}
/*
cout << length[N] << endl;
//バンズのとこだけ
if(N >= X){
cout << "0" << endl;
return 0;
}
//パティをすべて食べれるとき
if(N >= length[N] - X ){
cout << P_length[N] << endl;
return 0;
}
//パティを半分くらいまで食べれるとき
if(length[N - 1] == X){
cout << P_length[N-1] << endl;
return 0;
}
//半分より少し多めに食べれるとき
if(length[N - 1] + 1 <= X || length[N - 1] + (N - 1) >= X){
cout << P_length[N-1] + 1 << endl;
return 0;
}
*/
// それ以外
// レベルLバーガーの中にL-1バーガー更にL-1バーガーの中に．．．というとき
total = sum(N, X);
cout << total << endl;
} | #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 == 0) {
if (X <= 0) {
return 0;
} else {
return 1;
}
} else if (X <= 1 + length[N - 1]) {
return sum(N - 1, X - 1);
} else {
return P_length[N - 1] + 1 + sum(N - 1, X - 2 - length[N - 1]);
}
}
int main() {
ll N, X;
cin >> N >> X;
// length
length = vector<ll>(N + 1, 1);
P_length = vector<ll>(N + 1, 1);
for (ll i = 1; i <= N; i++) {
length[i] = 2 * length[i - 1] + 3;
P_length[i] = 2 * P_length[i - 1] + 1;
}
/*
cout << length[N] << endl;
//バンズのとこだけ
if(N >= X){
cout << "0" << endl;
return 0;
}
//パティをすべて食べれるとき
if(N >= length[N] - X ){
cout << P_length[N] << endl;
return 0;
}
//パティを半分くらいまで食べれるとき
if(length[N - 1] == X){
cout << P_length[N-1] << endl;
return 0;
}
//半分より少し多めに食べれるとき
if(length[N - 1] + 1 <= X || length[N - 1] + (N - 1) >= X){
cout << P_length[N-1] + 1 << endl;
return 0;
}
*/
// それ以外
// レベルLバーガーの中にL-1バーガー更にL-1バーガーの中に．．．というとき
total = sum(N, X);
cout << total << endl;
} | 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)) {
return 1 + findNum(N - 1, X - 2);
}
return 1 + p[N - 1] + findNum(N - 1, X - 2 - num[N - 1]);
}
int main() {
int N;
ll X;
cin >> N >> X;
num.resize(N);
p.resize(N);
num[0] = 1;
p[0] = 1;
for (int i = 0; i < 50; ++i) {
num[i + 1] = 2 * num[i] + 3;
p[i + 1] = 2 * p[i] + 1;
}
ll ans = findNum(N, X);
cout << ans << endl;
return 0;
}
| #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)) {
return 1 + findNum(N - 1, X - 2);
}
return 1 + p[N - 1] + findNum(N - 1, X - 2 - num[N - 1]);
}
int main() {
int N;
ll X;
cin >> N >> X;
num.resize(50);
p.resize(50);
num[0] = 1;
p[0] = 1;
for (int i = 0; i < 50; ++i) {
num[i + 1] = 2 * num[i] + 3;
p[i + 1] = 2 * p[i] + 1;
}
ll ans = findNum(N, X);
cout << ans << endl;
return 0;
}
| 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, ll>;
using pli = pair<ll, int>;
using ti3 = tuple<int, int, int>;
using tl3 = tuple<ll, ll, ll>;
using td3 = tuple<double, double, double>;
using ts3 = tuple<string, string, string>;
using tc3 = tuple<char, char, char>;
using tb3 = tuple<bool, bool, bool>;
using ti4 = tuple<int, int, int, int>;
using tl4 = tuple<ll, ll, ll, ll>;
using td4 = tuple<double, double, double, double>;
using ts4 = tuple<string, string, string, string>;
using tc4 = tuple<char, char, char, char>;
using tb4 = tuple<bool, bool, bool, bool>;
using vi = vector<int>;
using vl = vector<ll>;
using vd = vector<double>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvd = vector<vd>;
using vvs = vector<vs>;
using vvc = vector<vc>;
using vvb = vector<vb>;
using vvvi = vector<vvi>;
using vvvl = vector<vvl>;
using vvvd = vector<vvd>;
using vvvs = vector<vvs>;
using vvvc = vector<vvc>;
using vvvb = vector<vvb>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vpdd = vector<pdd>;
using vpss = vector<pss>;
using vpcc = vector<pcc>;
using vpbb = vector<pbb>;
using vpil = vector<pil>;
using vpli = vector<pli>;
using vti3 = vector<ti3>;
using vtl3 = vector<tl3>;
using vtd3 = vector<td3>;
using vts3 = vector<ts3>;
using vtc3 = vector<tc3>;
using vtb3 = vector<tb3>;
using vti4 = vector<ti4>;
using vtl4 = vector<tl4>;
using vtd4 = vector<td4>;
using vts4 = vector<ts4>;
using vtc4 = vector<tc4>;
using vtb4 = vector<tb4>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using msi = map<string, int>;
using mci = map<char, int>;
using mil = map<int, ll>;
using mli = map<ll, int>;
using si = set<int>;
using sl = set<ll>;
using sd = set<double>;
using ss = set<string>;
using sc = set<char>;
using sb = set<bool>;
using spii = set<pii>;
using spll = set<pll>;
using spdd = set<pdd>;
using spss = set<pss>;
using spcc = set<pcc>;
using spbb = set<pbb>;
using spil = set<pil>;
using spli = set<pli>;
using sti3 = set<ti3>;
using stl3 = set<tl3>;
using std3 = set<td3>;
using sts3 = set<ts3>;
using stc3 = set<tc3>;
using stb3 = set<tb3>;
#define rep0(TMS) for (int CNT = 0; CNT < (int)(TMS); CNT++)
#define rep(CNT, GOAL) for (int CNT = 0; CNT < (int)(GOAL); CNT++)
#define rep2(CNT, START, GOAL) \
for (ll CNT = (ll)(START); CNT < (ll)(GOAL); CNT++)
#define rep3(CNT, START, GOAL) \
for (ll CNT = (ll)(START); CNT > (ll)(GOAL); CNT--)
#define all(CONT) begin(CONT), end(CONT)
#define fr1(CONT) next(begin(CONT)), end(CONT)
#define itrep(ITR, CONT) for (auto ITR = begin(CONT); ITR != end(CONT); ITR++)
#define itrep1(ITR, CONT) \
for (auto ITR = next(begin(CONT)); ITR != end(CONT); ITR++)
#define maxel(CONT) *max_element(all(CONT))
#define minel(CONT) *min_element(all(CONT))
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> T sum(const vector<T> &VEC) {
return accumulate(all(VEC), 0.0);
}
template <typename T> vector<T> acm(const vector<T> &VEC) {
vector<T> RES(VEC.size() + 1);
rep(CNT, VEC.size()) RES[CNT + 1] = RES[CNT] + VEC[CNT];
return RES;
}
template <typename T> void fil(vector<T> &VEC, const int NUM, const T &VAL) {
VEC.assign(NUM, VAL);
}
template <typename T> void fil(vector<T> &VEC, const int NUM) {
VEC.assign(NUM, 0.0);
}
template <typename T>
void fil(vector<vector<T>> &VV, const int RNUM, const int CNUM, const T &VAL) {
fil(VV, RNUM, vector<T>());
rep(CNT, RNUM) fil(VV[CNT], CNUM, VAL);
}
template <typename T>
void fil(vector<vector<T>> &VV, const int RNUM, const int CNUM) {
fil(VV, RNUM, vector<T>());
rep(CNT, RNUM) fil(VV[CNT], CNUM);
}
template <typename T> void fil(vector<vector<T>> &VV, const int RNUM) {
fil(VV, RNUM, vector<T>());
}
void prec(const int &DIG) {
cerr << fixed << setprecision(DIG);
cout << fixed << setprecision(DIG);
}
template <typename T> void COUT(const T &ELEM) { cout << ELEM; }
template <typename T> void pout(const T &ELEM) {
COUT(ELEM);
cout << " ";
}
template <typename T, typename... Ts>
void pout(const T &FIRST, const Ts &...REST) {
pout(FIRST);
pout(REST...);
}
template <typename T> void print(T ELEM) {
COUT(ELEM);
cout << "\n";
}
template <typename T, typename... Ts>
void print(const T &FIRST, const Ts &...REST) {
print(FIRST);
print(REST...);
}
void CERR() { cerr << "\n"; }
template <typename T> void CERR(const T &ELEM) { cerr << ELEM; }
template <typename T, typename... Ts>
void CERR(const T &FIRST, const Ts &...REST) {
CERR(FIRST);
cerr << ", ";
CERR(REST...);
}
template <typename T1, typename T2> void CERR(const pair<T1, T2> &PAIR) {
cerr << "(";
CERR(PAIR.first);
cerr << ", ";
CERR(PAIR.second);
cerr << ")";
}
template <typename T1, typename T2, typename T3>
void CERR(const tuple<T1, T2, T3> &TUP3) {
cerr << "(";
CERR(get<0>(TUP3));
cerr << ", ";
CERR(get<1>(TUP3));
cerr << ", ";
CERR(get<2>(TUP3));
cerr << ")";
}
template <typename T1, typename T2, typename T3, typename T4>
void CERR(const tuple<T1, T2, T3, T4> &TUP4) {
cerr << "(";
CERR(get<0>(TUP4));
cerr << ", ";
CERR(get<1>(TUP4));
cerr << ", ";
CERR(get<2>(TUP4));
cerr << ", ";
CERR(get<3>(TUP4));
cerr << ")";
}
template <typename T> void CERR(const vector<T> &VEC) {
cerr << "{ ";
itrep(ITR, VEC) {
CERR(*ITR);
cerr << ", ";
}
cerr << "}";
}
template <typename T> void CERR1(const vector<T> &VEC) {
cerr << "{ ";
itrep1(ITR, VEC) {
CERR(*ITR);
cerr << ", ";
}
cerr << "}";
}
template <typename T> void CERR(const set<T> &SET) {
cerr << "{ ";
itrep(ITR, SET) {
CERR(*ITR);
cerr << ", ";
}
cerr << "}";
}
template <typename T1, typename T2> void CERR(const map<T1, T2> &MAP) {
cerr << "{ ";
itrep(ITR, MAP) {
CERR(*ITR);
cerr << ", ";
}
cerr << "}";
}
#define db(OBJ) \
cerr << #OBJ << ": "; \
CERR(OBJ); \
cerr << ", "
#define dbl(OBJ) \
cerr << #OBJ << ": "; \
CERR(OBJ); \
cerr << "\n"
#define db1(OBJ) \
cerr << #OBJ << ": "; \
CERR1(OBJ); \
cerr << "\n"
#define dbs(...) \
cerr << "(" << #__VA_ARGS__ << "): ("; \
CERR(__VA_ARGS__); \
cerr << ")\n"
#define dbvv(VV) \
cerr << #VV << ": {\n"; \
rep(CNT, VV.size()) { \
cerr << #VV << "[" << CNT << "]: "; \
CERR(VV[CNT]); \
cerr << ",\n"; \
} \
cerr << "}\n"
#define db01(VV) \
cerr << #VV << ": {\n"; \
rep(CNT, VV.size()) { \
cerr << #VV << "[" << CNT << "]: "; \
CERR1(VV[CNT]); \
cerr << ",\n"; \
} \
cerr << "}\n"
#define db10(VV) \
cerr << #VV << ": {\n"; \
rep2(CNT, 1, VV.size()) { \
cerr << #VV << "[" << CNT << "]: "; \
CERR(VV[CNT]); \
cerr << ",\n"; \
} \
cerr << "}\n"
#define db11(VV) \
cerr << #VV << ": {\n"; \
rep2(CNT, 1, VV.size()) { \
cerr << #VV << "[" << CNT << "]: "; \
CERR1(VV[CNT]); \
cerr << ",\n"; \
} \
cerr << "}\n"
#define YN(FLG) cout << (FLG ? "YES" : "NO") << "\n"
#define Yn(FLG) cout << (FLG ? "Yes" : "No") << "\n"
#define yn(FLG) cout << (FLG ? "yes" : "no") << "\n"
#define pcase(NUM) \
cout << "Case #" << NUM << ":" \
<< " "
#define pcasel(NUM) \
cout << "Case #" << NUM << ":" \
<< "\n"
const int INF = 1'000'000'007;
// db
const int Nmax = 50;
vl b(Nmax + 1);
ll rec(int m, int k) {
// dbs(m, k);
assert(0 <= m);
assert(0 <= k);
assert(k <= b[m]);
if (m == 0)
return k;
// dbs(b[m], b[m-1]);
if (k == 0)
return 0;
else if (k <= 1 + b[m - 1])
return rec(m - 1, k - 1);
else if (k == 1 + b[m - 1] + 1)
return rec(m - 1, b[m - 1]) + 1;
else if (k < 1 + b[m - 1] + 1 + b[m - 1])
return rec(m - 1, b[m - 1]) + 1 + rec(m - 1, k - (1 + b[m - 1] + 1));
else
return rec(m - 1, b[m - 1]) * 2 + 1;
}
int main() {
b[0] = 1;
rep(i, 50) b[i + 1] = b[i] * 2 + 3;
// dbl(b);
int N;
ll X;
cin >> N >> X;
print(rec(N, X));
} | #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, ll>;
using pli = pair<ll, int>;
using ti3 = tuple<int, int, int>;
using tl3 = tuple<ll, ll, ll>;
using td3 = tuple<double, double, double>;
using ts3 = tuple<string, string, string>;
using tc3 = tuple<char, char, char>;
using tb3 = tuple<bool, bool, bool>;
using ti4 = tuple<int, int, int, int>;
using tl4 = tuple<ll, ll, ll, ll>;
using td4 = tuple<double, double, double, double>;
using ts4 = tuple<string, string, string, string>;
using tc4 = tuple<char, char, char, char>;
using tb4 = tuple<bool, bool, bool, bool>;
using vi = vector<int>;
using vl = vector<ll>;
using vd = vector<double>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvd = vector<vd>;
using vvs = vector<vs>;
using vvc = vector<vc>;
using vvb = vector<vb>;
using vvvi = vector<vvi>;
using vvvl = vector<vvl>;
using vvvd = vector<vvd>;
using vvvs = vector<vvs>;
using vvvc = vector<vvc>;
using vvvb = vector<vvb>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vpdd = vector<pdd>;
using vpss = vector<pss>;
using vpcc = vector<pcc>;
using vpbb = vector<pbb>;
using vpil = vector<pil>;
using vpli = vector<pli>;
using vti3 = vector<ti3>;
using vtl3 = vector<tl3>;
using vtd3 = vector<td3>;
using vts3 = vector<ts3>;
using vtc3 = vector<tc3>;
using vtb3 = vector<tb3>;
using vti4 = vector<ti4>;
using vtl4 = vector<tl4>;
using vtd4 = vector<td4>;
using vts4 = vector<ts4>;
using vtc4 = vector<tc4>;
using vtb4 = vector<tb4>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using msi = map<string, int>;
using mci = map<char, int>;
using mil = map<int, ll>;
using mli = map<ll, int>;
using si = set<int>;
using sl = set<ll>;
using sd = set<double>;
using ss = set<string>;
using sc = set<char>;
using sb = set<bool>;
using spii = set<pii>;
using spll = set<pll>;
using spdd = set<pdd>;
using spss = set<pss>;
using spcc = set<pcc>;
using spbb = set<pbb>;
using spil = set<pil>;
using spli = set<pli>;
using sti3 = set<ti3>;
using stl3 = set<tl3>;
using std3 = set<td3>;
using sts3 = set<ts3>;
using stc3 = set<tc3>;
using stb3 = set<tb3>;
#define rep0(TMS) for (int CNT = 0; CNT < (int)(TMS); CNT++)
#define rep(CNT, GOAL) for (int CNT = 0; CNT < (int)(GOAL); CNT++)
#define rep2(CNT, START, GOAL) \
for (ll CNT = (ll)(START); CNT < (ll)(GOAL); CNT++)
#define rep3(CNT, START, GOAL) \
for (ll CNT = (ll)(START); CNT > (ll)(GOAL); CNT--)
#define all(CONT) begin(CONT), end(CONT)
#define fr1(CONT) next(begin(CONT)), end(CONT)
#define itrep(ITR, CONT) for (auto ITR = begin(CONT); ITR != end(CONT); ITR++)
#define itrep1(ITR, CONT) \
for (auto ITR = next(begin(CONT)); ITR != end(CONT); ITR++)
#define maxel(CONT) *max_element(all(CONT))
#define minel(CONT) *min_element(all(CONT))
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> T sum(const vector<T> &VEC) {
return accumulate(all(VEC), 0.0);
}
template <typename T> vector<T> acm(const vector<T> &VEC) {
vector<T> RES(VEC.size() + 1);
rep(CNT, VEC.size()) RES[CNT + 1] = RES[CNT] + VEC[CNT];
return RES;
}
template <typename T> void fil(vector<T> &VEC, const int NUM, const T &VAL) {
VEC.assign(NUM, VAL);
}
template <typename T> void fil(vector<T> &VEC, const int NUM) {
VEC.assign(NUM, 0.0);
}
template <typename T>
void fil(vector<vector<T>> &VV, const int RNUM, const int CNUM, const T &VAL) {
fil(VV, RNUM, vector<T>());
rep(CNT, RNUM) fil(VV[CNT], CNUM, VAL);
}
template <typename T>
void fil(vector<vector<T>> &VV, const int RNUM, const int CNUM) {
fil(VV, RNUM, vector<T>());
rep(CNT, RNUM) fil(VV[CNT], CNUM);
}
template <typename T> void fil(vector<vector<T>> &VV, const int RNUM) {
fil(VV, RNUM, vector<T>());
}
void prec(const int &DIG) {
cerr << fixed << setprecision(DIG);
cout << fixed << setprecision(DIG);
}
template <typename T> void COUT(const T &ELEM) { cout << ELEM; }
template <typename T> void pout(const T &ELEM) {
COUT(ELEM);
cout << " ";
}
template <typename T, typename... Ts>
void pout(const T &FIRST, const Ts &...REST) {
pout(FIRST);
pout(REST...);
}
template <typename T> void print(T ELEM) {
COUT(ELEM);
cout << "\n";
}
template <typename T, typename... Ts>
void print(const T &FIRST, const Ts &...REST) {
print(FIRST);
print(REST...);
}
void CERR() { cerr << "\n"; }
template <typename T> void CERR(const T &ELEM) { cerr << ELEM; }
template <typename T, typename... Ts>
void CERR(const T &FIRST, const Ts &...REST) {
CERR(FIRST);
cerr << ", ";
CERR(REST...);
}
template <typename T1, typename T2> void CERR(const pair<T1, T2> &PAIR) {
cerr << "(";
CERR(PAIR.first);
cerr << ", ";
CERR(PAIR.second);
cerr << ")";
}
template <typename T1, typename T2, typename T3>
void CERR(const tuple<T1, T2, T3> &TUP3) {
cerr << "(";
CERR(get<0>(TUP3));
cerr << ", ";
CERR(get<1>(TUP3));
cerr << ", ";
CERR(get<2>(TUP3));
cerr << ")";
}
template <typename T1, typename T2, typename T3, typename T4>
void CERR(const tuple<T1, T2, T3, T4> &TUP4) {
cerr << "(";
CERR(get<0>(TUP4));
cerr << ", ";
CERR(get<1>(TUP4));
cerr << ", ";
CERR(get<2>(TUP4));
cerr << ", ";
CERR(get<3>(TUP4));
cerr << ")";
}
template <typename T> void CERR(const vector<T> &VEC) {
cerr << "{ ";
itrep(ITR, VEC) {
CERR(*ITR);
cerr << ", ";
}
cerr << "}";
}
template <typename T> void CERR1(const vector<T> &VEC) {
cerr << "{ ";
itrep1(ITR, VEC) {
CERR(*ITR);
cerr << ", ";
}
cerr << "}";
}
template <typename T> void CERR(const set<T> &SET) {
cerr << "{ ";
itrep(ITR, SET) {
CERR(*ITR);
cerr << ", ";
}
cerr << "}";
}
template <typename T1, typename T2> void CERR(const map<T1, T2> &MAP) {
cerr << "{ ";
itrep(ITR, MAP) {
CERR(*ITR);
cerr << ", ";
}
cerr << "}";
}
#define db(OBJ) \
cerr << #OBJ << ": "; \
CERR(OBJ); \
cerr << ", "
#define dbl(OBJ) \
cerr << #OBJ << ": "; \
CERR(OBJ); \
cerr << "\n"
#define db1(OBJ) \
cerr << #OBJ << ": "; \
CERR1(OBJ); \
cerr << "\n"
#define dbs(...) \
cerr << "(" << #__VA_ARGS__ << "): ("; \
CERR(__VA_ARGS__); \
cerr << ")\n"
#define dbvv(VV) \
cerr << #VV << ": {\n"; \
rep(CNT, VV.size()) { \
cerr << #VV << "[" << CNT << "]: "; \
CERR(VV[CNT]); \
cerr << ",\n"; \
} \
cerr << "}\n"
#define db01(VV) \
cerr << #VV << ": {\n"; \
rep(CNT, VV.size()) { \
cerr << #VV << "[" << CNT << "]: "; \
CERR1(VV[CNT]); \
cerr << ",\n"; \
} \
cerr << "}\n"
#define db10(VV) \
cerr << #VV << ": {\n"; \
rep2(CNT, 1, VV.size()) { \
cerr << #VV << "[" << CNT << "]: "; \
CERR(VV[CNT]); \
cerr << ",\n"; \
} \
cerr << "}\n"
#define db11(VV) \
cerr << #VV << ": {\n"; \
rep2(CNT, 1, VV.size()) { \
cerr << #VV << "[" << CNT << "]: "; \
CERR1(VV[CNT]); \
cerr << ",\n"; \
} \
cerr << "}\n"
#define YN(FLG) cout << (FLG ? "YES" : "NO") << "\n"
#define Yn(FLG) cout << (FLG ? "Yes" : "No") << "\n"
#define yn(FLG) cout << (FLG ? "yes" : "no") << "\n"
#define pcase(NUM) \
cout << "Case #" << NUM << ":" \
<< " "
#define pcasel(NUM) \
cout << "Case #" << NUM << ":" \
<< "\n"
const int INF = 1'000'000'007;
// db
const int Nmax = 50;
vl b(Nmax + 1);
ll rec(int m, ll k) {
// dbs(m, k);
assert(0 <= m);
assert(0 <= k);
assert(k <= b[m]);
if (m == 0)
return k;
// dbs(b[m], b[m-1]);
if (k == 0)
return 0;
else if (k <= 1 + b[m - 1])
return rec(m - 1, k - 1);
else if (k == 1 + b[m - 1] + 1)
return rec(m - 1, b[m - 1]) + 1;
else if (k < 1 + b[m - 1] + 1 + b[m - 1])
return rec(m - 1, b[m - 1]) + 1 + rec(m - 1, k - (1 + b[m - 1] + 1));
else
return rec(m - 1, b[m - 1]) * 2 + 1;
}
int main() {
b[0] = 1;
rep(i, 50) b[i + 1] = b[i] * 2 + 3;
// dbl(b);
int N;
ll X;
cin >> N >> X;
print(rec(N, X));
} | 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> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
const int INT_INF = 1LL << 30;
#define MOD 1000000007LL
ll N, X;
vll length(51);
vll pnum(51);
ll func(ll lv, ll x) {
if (x == length.at(lv))
return pnum.at(lv);
ll xx;
if (x < length.at(lv) / 2) {
xx = x;
if (xx == 1)
return 0;
return func(lv - 1, xx - 1);
} else {
xx = length.at(lv) - x;
if (xx == 1)
return pnum.at(lv);
return pnum.at(lv) - func(lv - 1, xx - 1);
}
}
int main() {
cin >> N >> X;
length.at(0) = 1LL;
pnum.at(0) = 1LL;
for (int i = 1; i <= N; i++) {
length.at(i) = 2LL * length.at(i - 1) + 3LL;
pnum.at(i) = 2LL * pnum.at(i - 1) + 1LL;
}
cout << func(N, X) << endl;
} | #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> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
const int INT_INF = 1LL << 30;
#define MOD 1000000007LL
ll N, X;
vll length(51);
vll pnum(51);
ll func(ll lv, ll x) {
if (x == length.at(lv))
return pnum.at(lv);
ll xx;
if (x <= length.at(lv) / 2) {
xx = x;
if (xx == 1)
return 0;
return func(lv - 1, xx - 1);
} else {
xx = length.at(lv) - x;
if (xx == 1)
return pnum.at(lv);
return pnum.at(lv) - func(lv - 1, xx - 1);
}
}
int main() {
cin >> N >> X;
length.at(0) = 1LL;
pnum.at(0) = 1LL;
for (int i = 1; i <= N; i++) {
length.at(i) = 2LL * length.at(i - 1) + 3LL;
pnum.at(i) = 2LL * pnum.at(i - 1) + 1LL;
}
cout << func(N, X) << endl;
} | 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);
return 1;
}
ll fn = f(n);
if (x > fn / 2)
return g(n - 1) + 1 + calc(n - 1, x - (fn / 2 + 1));
else
return calc(n - 1, x - 1);
}
int main(void) {
int n;
ll x;
cin >> n >> x;
cout << calc(n, x) << endl;
return 0;
}
| #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);
return 1;
}
ll fn = f(n);
if (x > fn / 2)
return g(n - 1) + 1 + calc(n - 1, x - (fn / 2 + 1));
else
return calc(n - 1, x - 1);
}
int main(void) {
int n;
ll x;
cin >> n >> x;
cout << calc(n, x) << endl;
return 0;
}
| 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++)
#define P pair<int, int>
#define debug(x) cerr << #x << ": " << x << ", "
#define debugln(x) cerr << #x << ": " << x << '\n'
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ll N, X;
cin >> N >> X;
vector<ll> vec(51);
vector<ll> cnt(51);
vec.at(0) = 1;
cnt.at(0) = 1;
for (int i = 1; i <= 50; i++) {
vec.at(i) = vec.at(i - 1) * 2 + 3;
cnt.at(i) = cnt.at(i - 1) * 2 + 1;
}
debugln(vec.at(50));
debugln(cnt.at(50));
ll ans = 0;
for (int i = N; i >= 0; i--) {
if (X >= vec.at(i)) {
ans += cnt.at(i);
break;
}
if (X >= vec.at(i - 1) + 2) {
X -= vec.at(i - 1) + 2;
ans += cnt.at(i - 1) + 1;
} else if (X == vec.at(i - 1) + 1) {
ans += cnt.at(i - 1);
break;
} else if (X >= 1) {
X--;
} else {
break;
}
debug(i);
debugln(X);
}
cout << ans << endl;
} | #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++)
#define P pair<int, int>
#define debug(x) cerr << #x << ": " << x << ", "
#define debugln(x) cerr << #x << ": " << x << '\n'
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ll N, X;
cin >> N >> X;
vector<ll> vec(51);
vector<ll> cnt(51);
vec.at(0) = 1;
cnt.at(0) = 1;
for (int i = 1; i <= 50; i++) {
vec.at(i) = vec.at(i - 1) * 2 + 3;
cnt.at(i) = cnt.at(i - 1) * 2 + 1;
}
debugln(vec.at(50));
debugln(cnt.at(50));
ll ans = 0;
for (int i = N; i >= 0; i--) {
if (X >= vec.at(i)) {
ans += cnt.at(i);
break;
}
if (i == 0)
continue;
if (X >= vec.at(i - 1) + 2) {
X -= vec.at(i - 1) + 2;
ans += cnt.at(i - 1) + 1;
} else if (X == vec.at(i - 1) + 1) {
ans += cnt.at(i - 1);
break;
} else if (X >= 1) {
X--;
} else {
break;
}
debug(i);
debugln(X);
}
cout << ans << endl;
} | 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);
} else if (x == layer_num[level - 1] + 1) {
return patty_num[level - 1];
} else if (x == layer_num[level - 1] + 2) {
return patty_num[level - 1] + 1;
} else if (x == 2 * layer_num[level - 1] + 2 ||
x == 2 * layer_num[level - 1] + 3) {
return 2 * patty_num[level - 1] + 1;
} else {
return patty_num[level - 1] + 1 +
getPatty(level - 1, x - (layer_num[level - 1] + 2));
}
}
}
int main() {
long long N, X;
cin >> N >> X;
layer_num[0] = 1;
patty_num[0] = 1;
for (int i = 1; i <= 50; i++) {
layer_num[i] = 2 * layer_num[i - 1] + 3;
patty_num[i] = 2 * patty_num[i - 1] + 1;
}
long long ans = getPatty(N, X);
cout << ans << endl;
} | #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);
} else if (x == layer_num[level - 1] + 1) {
return patty_num[level - 1];
} else if (x == layer_num[level - 1] + 2) {
return patty_num[level - 1] + 1;
} else if (x == 2 * layer_num[level - 1] + 2 ||
x == 2 * layer_num[level - 1] + 3) {
return 2 * patty_num[level - 1] + 1;
} else {
return patty_num[level - 1] + 1 +
getPatty(level - 1, x - (layer_num[level - 1] + 2));
}
}
}
int main() {
long long N, X;
cin >> N >> X;
layer_num[0] = 1;
patty_num[0] = 1;
for (int i = 1; i <= 50; i++) {
layer_num[i] = 2 * layer_num[i - 1] + 3;
patty_num[i] = 2 * patty_num[i - 1] + 1;
}
long long ans = getPatty(N, X);
cout << ans << endl;
} | 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)
return 0;
if (x <= h[n - 1] + 1)
return dfs(n - 1, x - 1);
return dfs(n - 1, x - h[n - 1] - 2) + p[n - 1] + 1;
}
int main() {
cin >> n >> x;
h[0] = 1, p[0] = 1;
FOR(i, 1, n) {
h[i] = h[i - 1] * 2 + 3;
p[i] = p[i - 1] * 2 + 1;
}
cout << dfs(n, x) << endl;
return 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)
return 0;
if (x <= h[n - 1] + 1)
return dfs(n - 1, x - 1);
return dfs(n - 1, x - h[n - 1] - 2) + p[n - 1] + 1;
}
int main() {
cin >> n >> x;
h[0] = 1, p[0] = 1;
FOR(i, 1, n) {
h[i] = h[i - 1] * 2 + 3;
p[i] = p[i - 1] * 2 + 1;
}
cout << dfs(n, x) << endl;
return 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.end(); ++itr)
#define P pair<int, int>
const int MOD = 998244353;
const ll INF = 2e15;
const double PI = acos(-1);
vector<ll> a(55), p(55);
ll f(ll n, ll x) {
if (n == 0 && x > 1)
return 1;
else if (x <= n)
return 0;
else if (x <= 1 + a[n - 1])
return f(n - 1, x - 1);
else if (x == 2 + a[n - 1])
return p[n - 1] + 1;
else
return p[n - 1] + 1 + f(n - 1, x - a[n - 1] - 2);
}
int main() {
ios_base::sync_with_stdio(false);
ll n, x;
cin >> n >> x;
a[0] = 1;
p[0] = 1;
rep(i, n) {
a[i + 1] = 2 * a[i] + 3;
p[i + 1] = 2 * p[i] + 1;
}
cout << f(n, x) << endl;
return 0;
}
| #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.end(); ++itr)
#define P pair<int, int>
const int MOD = 998244353;
const ll INF = 2e15;
const double PI = acos(-1);
vector<ll> a(55), p(55);
ll f(ll n, ll x) {
if (n == 0)
return 1;
else if (x <= n)
return 0;
else if (x <= 1 + a[n - 1])
return f(n - 1, x - 1);
else if (x == 2 + a[n - 1])
return p[n - 1] + 1;
else
return p[n - 1] + 1 + f(n - 1, x - a[n - 1] - 2);
}
int main() {
ios_base::sync_with_stdio(false);
ll n, x;
cin >> n >> x;
a[0] = 1;
p[0] = 1;
rep(i, n) {
a[i + 1] = 2 * a[i] + 3;
p[i + 1] = 2 * p[i] + 1;
}
cout << f(n, x) << endl;
return 0;
}
| 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 left = a[level] - 1;
lli middle = (right + left) / 2;
if (DEBUG)
cout << "level=" << level << " num= " << num << endl;
if (level == 0)
return 1;
if (num == 0)
return 0;
else if (num < middle) {
return calc(level - 1, num - 1);
} else if (num == middle) {
return p[level - 1] + 1;
} else if (middle < num) {
return p[level - 1] + 1 + calc(level - 1, num - middle - 1);
} else {
return p[level];
}
}
int main() {
lli n, x;
cin >> n >> x;
a.resize(n);
b.resize(n);
p.resize(n);
a[0] = 1;
b[0] = 0;
p[0] = 1;
lli d = 2;
for (lli i = 1; i <= n; i++) {
b[i] = b[i - 1] + d;
p[i] = p[i - 1] + d;
a[i] = b[i] + p[i];
d *= 2;
}
cout << calc(n, x - 1) << endl;
return 0;
} | #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 left = a[level] - 1;
lli middle = (right + left) / 2;
if (DEBUG)
cout << "level=" << level << " num= " << num << endl;
if (level == 0)
return 1;
if (num == 0)
return 0;
else if (num < middle) {
return calc(level - 1, num - 1);
} else if (num == middle) {
return p[level - 1] + 1;
} else if (middle < num) {
return p[level - 1] + 1 + calc(level - 1, num - middle - 1);
} else {
return p[level];
}
}
int main() {
lli n, x;
cin >> n >> x;
a.resize(n + 1);
b.resize(n + 1);
p.resize(n + 1);
a[0] = 1;
b[0] = 0;
p[0] = 1;
lli d = 2;
for (lli i = 1; i <= n; i++) {
b[i] = b[i - 1] + d;
p[i] = p[i - 1] + d;
a[i] = b[i] + p[i];
d *= 2;
}
cout << calc(n, x - 1) << endl;
return 0;
} | 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 - 1][0] - (n - 1) + 1) {
return dfs(n - 1, x - 1, add);
} else if (num[n - 1][0] - (n - 1) + 1 <= x && x <= num[n - 1][0] + 1) {
return num[n - 1][1] + add;
} else if (num[n - 1][0] + 1 < x && x <= num[n - 1][0] + 2) {
return num[n - 1][1] + 1 + add;
}
return dfs(n - 1, x - (num[n - 1][0] + 2), add + num[n - 1][1] + 1);
}
int main() {
cin >> N >> X;
num[0][0] = 1;
num[0][1] = 1;
for (int i = 0; i < 51; i++) {
num[i + 1][0] = num[i][0] + (1LL << (i + 1)) * 2;
num[i + 1][1] = num[i][1] + (1LL << (i + 1));
}
long long ans = dfs(N, X, 0);
cout << ans << endl;
return 0;
}
| #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 - 1][0] - (n - 1) + 1) {
return dfs(n - 1, x - 1, add);
} else if (num[n - 1][0] - (n - 1) + 1 <= x && x <= num[n - 1][0] + 1) {
return num[n - 1][1] + add;
} else if (num[n - 1][0] + 1 < x && x <= num[n - 1][0] + 2) {
return num[n - 1][1] + 1 + add;
}
return dfs(n - 1, x - (num[n - 1][0] + 2), add + num[n - 1][1] + 1);
}
int main() {
cin >> N >> X;
num[0][0] = 1;
num[0][1] = 1;
for (int i = 0; i < 50; i++) {
num[i + 1][0] = num[i][0] + (1LL << (i + 1)) * 2;
num[i + 1][1] = num[i][1] + (1LL << (i + 1));
}
long long ans = dfs(N, X, 0);
cout << ans << endl;
return 0;
}
| 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 !=
#define ne !=
#define dif !=
#define df !=
#define rs resize
#define PQ priority_queue<ll, vector<ll>, greater<ll>>
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvi = vector<vi>;
using vs = vector<string>;
using vl = vector<ll>;
using vvl = vector<vl>;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using vp = vector<P>;
using dou = double;
using itn = int;
using str = string;
using bo = bool;
#define uset unordered_set
#define umap unordered_map
#define F first
#define S second
// 定数
#define k4 10101
#define k5 101010
#define k6 1010101
#define k7 10101010
const int INF = (int)1e9 + 100;
const int MINF = (int)-1e9 - 100;
const ll LINF = (ll)1e18 + 100;
const ll MLINF = (ll)1e18 - 100;
const double EPS = 1e-9;
const int y4[] = {-1, 1, 0, 0};
const int x4[] = {0, 0, -1, 1};
const int y8[] = {0, 1, 0, -1, -1, 1, 1, -1};
const int x8[] = {1, 0, -1, 0, 1, -1, 1, -1};
// 配列
#define sz(a) (sizeof(a) / sizeof(a[0]))
// コンテナ
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
template <class T> inline void sort(vector<T> &a) { sort(a.begin(), a.end()); };
template <class T> inline void rsort(vector<T> &a) {
sort(a.begin(), a.end(), greater<T>());
};
template <class T> inline void sort(vector<T> &a, int len) {
sort(a.begin(), a.begin() + len);
};
template <class T> inline void rsort(vector<T> &a, int len) {
sort(a.begin(), a.begin() + len, greater<T>());
};
// 繰り返し
#define _overloadrep(_1, _2, _3, name, ...) name
#define _rep(i, n) for (int i = 0; i < n; i++)
#define repi(i, m, n) for (int i = m; i < n; i++)
#define rep(...) _overloadrep(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rer(i, n) for (int i = n; i >= 0; i--)
#define reri(i, m, n) for (int i = m; i >= n; i--)
#define rer(...) _overloadrep(__VA_ARGS__, reri, _rer, )(__VA_ARGS__)
#define fora(a, b) for (auto &&a : b)
#define rea(a, b) for (auto &&a : b)
#define repa(a, b) for (auto &&a : b)
template <typename A, size_t N, typename T> void fill(A (&a)[N], const T &v) {
rep(i, N) a[i] = v;
}
template <typename A, size_t N, size_t O, typename T>
void fill(A (&a)[N][O], const T &v) {
rep(i, N) rep(j, O) a[i][j] = v;
}
template <typename A, size_t N, size_t O, size_t P, typename T>
void fill(A (&a)[N][O][P], const T &v) {
rep(i, N) rep(j, O) rep(k, P) a[i][j][k] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, typename T>
void fill(A (&a)[N][O][P][Q], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) a[i][j][k][l] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
typename T>
void fill(A (&a)[N][O][P][Q][R], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) a[i][j][k][l][m] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S, typename T>
void fill(A (&a)[N][O][P][Q][R][S], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) rep(n, S)
a[i][j][k][l][m][n] = v;
}
template <class T, class U> void fill(vector<T> &a, U v) {
rep(i, a.size()) a[i] = v;
}
template <class T, class U> void fill(vector<vector<T>> &a, U v) {
rep(i, a.size()) rep(j, a[0].size()) a[i][j] = v;
}
template <class T, class U> void fill(vector<vector<vector<T>>> &a, U v) {
rep(i, a.size()) rep(j, a[0].size()) rep(k, a[0][0].size()) a[i][j][k] = v;
}
#define arcpy(a, b) memcpy(a, b, sizeof(b))
// 入力
template <typename T = int> T in() {
T x;
cin >> x;
return (x);
}
string sin() { return in<string>(); }
double din() { return in<double>(); }
ll lin() { return in<ll>(); }
#define na(a, n) rep(i, n) cin >> a[i];
#define nad(a, n) rep(i, n) cin >> a[i], a[i]--;
#define na3(a, b, c, n) rep(i, n) cin >> a[i] >> b[i] >> c[i];
#define add3(a, b, c, n) rep(i, n) a.pb(in()), b.pb(in()), c.pb(in());
#define na2(a, b, n) rep(i, n) cin >> a[i] >> b[i];
#define nt(a, h, w) rep(hi, h) rep(wi, w) cin >> a[hi][wi];
#define ntd(a, h, w) rep(hi, h) rep(wi, w) cin >> a[hi][wi], a[hi][wi]--;
#define ntp(a, h, w) \
fill(a, '#'); \
rep(hi, 1, h + 1) rep(wi, 1, w + 1) cin >> a[hi][wi];
#define addAll(a, n) rep(i, n) a.pb(in());
#define addAlld(a, n) rep(i, n) a.pb(in() - 1);
// 出力
template <class T> void out(T x) {
if (typeid(x) == typeid(double))
cout << fixed << setprecision(10) << x << endl;
else
cout << x << endl;
}
// デバッグ
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n';
// よく使うクラス、構造体
class UnionFind {
public:
vi par, rank, sizes;
int n, trees;
UnionFind(int n) : n(n), trees(n) {
par.resize(n), rank.resize(n), sizes.resize(n);
rep(i, n) par[i] = i, sizes[i] = 1;
}
int root(int x) {
if (par[x] == x)
return x;
else
return par[x] = root(par[x]);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (rank[x] < rank[y])
swap(x, y);
trees--;
par[y] = x;
sizes[x] += sizes[y];
if (rank[x] == rank[y])
rank[x]++;
}
bool same(int x, int y) { return root(x) == root(y); }
int size(int x) { return sizes[root(x)]; }
// 順不同 umapなので
vvi sets() {
vvi res(trees);
umap<int, vi> map;
rep(i, n) map[root(i)].push_back(i);
int i = 0;
for (auto &&p : map) {
int r = p.F;
res[i].push_back(r);
for (auto &&v : p.S) {
if (r == v)
continue;
res[i].push_back(v);
}
i++;
}
return res;
}
};
// MOD関連
ll MOD = (int)1e9 + 7;
int mpow(int v, ll a) {
ll x = v, n = a, res = 1;
while (n) {
if (n & 1)
res = (res * x) % MOD;
x = (x * x) % MOD;
n >>= 1;
}
return res;
}
class mint {
private:
ll v;
public:
static ll mod(ll a) { return (a % MOD + MOD) % MOD; }
mint(ll a = 0) { this->v = mod(a); };
mint(const mint &a) { v = a.v; }
mint operator+(const mint &a) { return mint(v + a.v); }
mint operator+(const ll a) { return mint(v + a % MOD); }
mint operator+(const signed a) { return mint(v + a % MOD); }
friend mint operator+(const ll a, const mint &b) {
return mint(a % MOD + b.v);
}
void operator+=(const mint &a) { v = (v + a.v) % MOD; }
void operator+=(const ll a) { v = mod(v + a % MOD); }
void operator+=(const signed a) { v = mod(v + a % MOD); }
friend void operator+=(ll &a, const mint &b) { a = mod(a % MOD + b.v); }
mint operator-(const mint &a) { return mint(v - a.v); }
mint operator-(const ll a) { return mint(v - a % MOD); }
mint operator-(const signed a) { return mint(v - a % MOD); }
friend mint operator-(const ll a, const mint &b) {
return mint(a % MOD - b.v);
}
void operator-=(const mint &a) { v = mod(v - a.v); }
void operator-=(const ll a) { v = mod(v - a % MOD); }
void operator-=(const signed a) { v = mod(v - a % MOD); }
friend void operator-=(ll &a, const mint &b) { a = mod(a % MOD - b.v); }
mint operator*(const mint &a) { return mint(v * a.v); }
mint operator*(const ll a) { return mint(v * (a % MOD)); }
mint operator*(const signed a) { return mint(v * (a % MOD)); }
friend mint operator*(const ll a, const mint &b) {
return mint(a % MOD * b.v);
}
void operator*=(const mint &a) { v = (v * a.v) % MOD; }
void operator*=(const ll a) { v = mod(v * (a % MOD)); }
void operator*=(const signed a) { v = mod(v * (a % MOD)); }
friend void operator*=(ll &a, const mint &b) { a = mod(a % MOD * b.v); }
mint operator/(const mint &a);
mint operator/(const ll a);
mint operator/(const signed a);
friend mint operator/(const ll a, const mint &b);
void operator/=(const mint &a);
void operator/=(const ll a);
void operator/=(const signed a);
friend void operator/=(ll &a, const mint &b);
mint operator^(const mint &a) { return mpow(v, a.v); };
mint operator^(const ll a) { return mpow(v, a); };
mint operator^(const signed a) { return mpow(v, a); };
friend mint operator^(const ll a, const mint &b) { return mpow(a, b.v); };
void operator^=(const mint &a) { v = mpow(v, a.v); }
void operator^=(const ll a) { v = mpow(v, a); }
void operator^=(const signed a) { v = mpow(v, a); }
// 単項演算子
mint operator+() { return *this; }
mint operator++() {
v++;
return *this;
}
mint operator++(signed d) {
mint res = *this;
v++;
return res;
}
mint operator-() { return operator*(-1); }
mint operator--() {
v++;
return *this;
}
void operator--(signed d) {
mint res = *this;
v++;
}
bool operator==(mint &a) { return v == a.v; }
bool operator==(signed a) { return v == a; }
friend bool operator==(signed a, mint &b) { return a == b.v; }
bool operator!=(mint &a) { return v != a.v; }
bool operator!=(signed a) { return v != a; }
friend bool operator!=(signed a, mint &b) { return a != b.v; }
operator int() { return v; }
};
const int setModMax = 510000;
mint fac[setModMax], finv[setModMax], inv[setModMax];
void setMod() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < setModMax; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
mint minv(ll a) {
if (fac[0] == 0)
setMod();
if (a < setModMax)
return inv[a];
a %= MOD;
ll b = MOD, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return (x % MOD + MOD) % MOD;
}
mint mint::operator/(const mint &a) { return mint(v * minv(a.v)); }
mint mint::operator/(const ll a) { return mint(v * minv(a)); }
mint mint::operator/(const signed a) { return mint(v * minv(a)); }
mint operator/(const ll a, const mint &b) { return mint(a % MOD * minv(b.v)); }
void mint::operator/=(const mint &a) { v = (v * minv(a.v)) % MOD; }
void mint::operator/=(const ll a) { v = mod(v * minv(a)); }
void mint::operator/=(const signed a) { v = mod(v * minv(a)); }
void operator/=(ll &a, const mint &b) { a = mint::mod(a % MOD * minv(b.v)); }
bool isPrime[4010101];
vi primes;
void setPrime() {
fill(isPrime, true);
isPrime[0] = isPrime[1] = false;
for (int i = 2; i <= sqrt(sz(isPrime)) + 5; ++i) {
if (!isPrime[i])
continue;
for (int j = 2; i * j < sz(isPrime); ++j) {
isPrime[i * j] = false;
}
}
rep(i, sz(isPrime)) if (isPrime[i]) primes.pb(i);
}
mint com(ll n, ll r) {
if (n < r || n < 0 || r < 0)
return 0;
if (fac[0] == 0)
setMod();
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
// 便利関数
ll reverse(ll a) {
ll res = 0;
while (a) {
res *= 10;
res += a % 10;
a /= 10;
}
return res;
}
ll ceil(ll a, ll b) { return (a + b - 1) / b; }
ll sqrt(ll a) {
ll res = (ll)sqrt(a);
while (res * res < a)
res++;
return res;
}
ll sig(ll t) { return (1 + t) * t / 2; }
ll sig(ll s, ll t) { return (s + t) * (t - s + 1) / 2; }
vi divisors(int v) {
vi res;
for (int i = 1; i <= sqrt(v); ++i) {
if (v % i == 0) {
res.pb(i);
if (i != v / i)
res.pb(v / i);
}
}
return res;
}
unordered_map<int, int> factorization(int v) {
unordered_map<int, int> res;
if (!isPrime[2])
setPrime();
for (auto &&p : primes) {
while (v % p == 0) {
res[p]++;
v /= p;
}
if (v == 1)
break;
}
return res;
}
int get(int a, int keta) {
a /= (int)pow(10, keta);
return a % 10;
}
// 変換系
template <class T, class U> vector<U> keys(map<T, U> a) {
vector<U> res;
for (auto &&k : a)
res.pb(k.F);
return res;
}
template <class T, class U> vector<U> keys(umap<T, U> a) {
vector<U> res;
for (auto &&k : a)
res.pb(k.F);
return res;
}
template <class T, class U> vector<T> values(map<T, U> a) {
vector<T> res;
for (auto &&k : a)
res.pb(k.S);
return res;
}
template <class T, class U> vector<T> values(umap<T, U> a) {
vector<T> res;
for (auto &&k : a)
res.pb(k.S);
return res;
}
vi list(int a) {
vi res;
while (a) {
res.insert(res.begin(), a % 10);
a /= 10;
}
return res;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> T min(T a, signed b) { return a < b ? a : b; }
template <class T> T max(T a, signed b) { return a < b ? b : a; }
template <class T> T sum(vector<T> &v, int len = -1) {
if (len == -1)
len = v.size();
T res = 0;
rep(i, min((int)len, (int)v.size())) res += v[i];
return res;
}
void clear(PQ &q) {
while (q.size())
q.pop();
}
template <class T> void clear(queue<T> &q) {
while (q.size())
q.pop();
}
template <class T> vector<T> ruiv(vector<T> &a) {
vector<T> res(a.size() + 1);
rep(i, a.size()) res[i + 1] = res[i] + a[i];
return res;
}
template <class T> void plus(vector<T> &a, T v = 1) {
for (auto &&u : a)
u += v;
}
template <class T> void minu(vector<T> &a, T v = 1) {
for (auto &&u : a)
u -= v;
}
template <class T> void minus(vector<T> &a, T v = 1) {
for (auto &&u : a)
u -= v;
}
inline bool inside(int y, int x, int H, int W) {
return y >= 0 && x >= 0 && y < H && x < W;
}
ll u(ll a) { return a < 0 ? 0 : a; }
#define inc(s, x, t) s <= x &&x < t
#define MIN(a) numeric_limits<a>::min()
#define MAX(a) numeric_limits<a>::max()
template <class T> T min(vector<vector<T>> &a) {
T res = MAX(T);
rep(i, a.size()) chmin(res, *min_element(all(a[i])));
return res;
}
template <class T> T max(vector<vector<T>> &a) {
T res = MIN(T);
rep(i, a.size()) chmax(res, *max_element(all(a[i])));
return res;
}
bool bget(ll m, int keta) { return (m >> keta) & 1; }
int bget(ll m, int keta, int sinsuu) {
m /= (ll)pow(sinsuu, keta);
return m % sinsuu;
}
inline ll bit(int n) { return (1LL << (n)); }
inline ll bit(int n, int sinsuu) { return (ll)pow(sinsuu, n); }
int bcou(ll m) {
return __builtin_popcount(m & 0xFFFFFFFF) + __builtin_popcount(m >> 32);
}
// 初期化は0を渡す
ll nextComb(ll &mask, int n, int r) {
if (!mask)
return mask = (1LL << r) - 1;
ll x = mask & -mask; // 最下位の1
ll y = mask + x; // 連続した下の1を繰り上がらせる
ll res = ((mask & ~y) / x >> 1) | y;
if (bget(res, n))
return mask = 0;
else
return mask = res;
}
// n桁以下でビットがr個立っているもののvectorを返す
vl bitCombList(int n, int r) {
vl res;
int m = 0;
while (nextComb(m, n, r)) {
res.pb(m);
}
return res;
}
int ctoi(char c) {
if ('A' <= c && c <= 'Z')
return c - 'A';
return c - 'a' + 26;
}
char itoc(int i) {
if (i < 26)
return 'A' + i;
return 'a' + i - 26;
}
#define lowerIndex(a, v) (lower_bound(all(a), v) - a.begin())
#define lowerBound(a, v) (*lower_bound(all(a), v))
#define upperIndex(a, v) (upper_bound(all(a), v) - a.begin())
#define upperBound(a, v) (*upper_bound(all(a), v))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
void compress(vi &a) {
vi b;
int len = a.size();
for (int i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
UNIQUE(b);
for (int i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
}
void compress(int a[], int len) {
vi b;
for (int i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
UNIQUE(b);
for (int i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
}
template <class T> inline void fin(T s) { cout << s << endl, exit(0); }
#define ans(a) \
cout << a << endl; \
continue;
#define lower_index(a, v) lower_bound(all(a), v) - a.begin()
#define upper_index(a, v) upper_bound(all(a), v) - a.begin()
#define poll(a) \
q.front(); \
q.pop()
#define dpoll(a) \
q.front(); \
q.pop_front()
#define pollLast(a) \
q.back(); \
q.pop_back()
#define pollBack(a) \
q.back(); \
q.pop_back()
template <class T> struct edge {
int from, to;
T cost;
int id;
int type;
edge(int f, int t, T c = 1, int id = -1, int ty = -1)
: from(f), to(t), cost(c), id(id), type(ty) {}
bool operator<(const edge &b) const { return cost < b.cost; }
bool operator>(const edge &b) const { return cost > b.cost; }
};
template <typename T> class graph {
protected:
vector<bool> _used;
public:
vector<vector<edge<T>>> g;
vector<edge<T>> edges;
int n;
graph(int n) : n(n) {
g.resize(n);
_used.resize(n);
}
void clear() {
g.clear();
edges.clear();
}
void resize(int n) {
this->n = n;
g.resize(n);
_used.resize(n);
}
bool isleaf(int v, int r) { return g[v].size() == 1 && g[v][0].to == r; }
virtual void add(int from, int to, T cost, int ty) = 0;
virtual bool used(edge<T> &e) = 0;
virtual bool used(int id) = 0;
virtual void del(edge<T> &e) = 0;
virtual void del(int id) = 0;
};
template <class T = int> class undigraph : public graph<T> {
public:
using graph<T>::g;
using graph<T>::n;
using graph<T>::edges;
using graph<T>::_used;
undigraph(int n) : graph<T>(n) {}
void add(int f, int t, T cost = 1, int ty = -1) {
assert(0 <= f && f < n && 0 <= t && t < n);
int id = edges.size();
g[f].emplace_back(f, t, cost, id, ty);
g[t].emplace_back(t, f, cost, id + 1, ty);
edges.emplace_back(f, t, cost, id, ty);
edges.emplace_back(t, f, cost, id + 1, ty);
}
void add(edge<T> &e) {
int f = e.from, t = e.to, ty = e.type;
T cost = e.cost;
add(f, t, cost, ty);
}
bool used(edge<T> &e) { return _used[e.id]; }
bool used(int id) { return _used[id]; }
void del(edge<T> &e) { _used[e.id] = _used[e.id ^ 1] = 1; }
void del(int id) { _used[id] = _used[id ^ 1] = 1; }
};
template <typename T = ll> class digraph : public graph<T> {
public:
using graph<T>::g;
using graph<T>::n;
using graph<T>::edges;
using graph<T>::_used;
digraph(int n) : graph<T>(n) {}
void add(int f, int t, T cost = 1, int ty = -1) {
assert(0 <= f && f < n && 0 <= t && t < n);
int id = edges.size();
g[f].emplace_back(t, cost, ty, id);
edges.emplace_back(f, t, cost, ty, id);
}
bool used(edge<T> &e) { return _used[e.id]; }
bool used(int id) { return _used[id]; }
void del(edge<T> &e) { _used[e.id] = _used[e.id ^ 1] = 1; }
void del(int id) { _used[id] = _used[id ^ 1] = 1; }
};
template <class T> bool nibu(const graph<T> &g) {
UnionFind uf(g.n * 2);
for (auto &&e : g.edges)
uf.unite(e.f, e.t + g.n), uf.unite(e.f + g.n, e.t);
return !uf.same(0, g.n);
}
template <class T> vector<T> dijkstra(const graph<T> &g, int s) {
assert(inc(0, s, g.n));
T initValue = MAX(T);
vector<T> dis(g.n, initValue);
priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> q;
dis[s] = 0;
q.emplace(0, s);
while (q.size()) {
T nowc = q.top().F;
int i = q.top().S;
q.pop();
if (dis[i] != nowc)
continue;
for (auto &&e : g.g[i]) {
int to = e.to;
T cost = nowc + e.cost;
if (dis[to] > cost) {
dis[to] = cost;
q.emplace(dis[to], to);
}
}
}
// たどり着かないなら-1
for (auto &&d : dis)
if (d == initValue)
d = -1;
return dis;
}
// 機能拡張
template <typename T> void remove(vector<T> &v, unsigned int i) {
v.erase(v.begin() + i);
}
template <typename T>
void remove(vector<T> &v, unsigned int s, unsigned int e) {
v.erase(v.begin() + s, v.begin() + e);
}
template <typename T>
void removen(vector<T> &v, unsigned int s, unsigned int n) {
v.erase(v.begin() + s, v.begin() + s + n);
}
template <typename T> void erase(vector<T> &v, unsigned int i) {
v.erase(v.begin() + i);
}
template <typename T> void erase(vector<T> &v, unsigned int s, unsigned int e) {
v.erase(v.begin() + s, v.begin() + e);
}
template <typename T>
void erasen(vector<T> &v, unsigned int s, unsigned int n) {
v.erase(v.begin() + s, v.begin() + s + n);
}
template <typename T> void insert(vector<T> &v, unsigned int i, T t) {
v.insert(v.begin() + i, t);
}
template <typename T>
void insert(vector<T> &v, unsigned int i, vector<T> list) {
for (auto &&va : list)
v.insert(v.begin() + i++, va);
}
template <typename T>
void insert(vector<T> &v, unsigned int i, initializer_list<T> list) {
for (auto &&va : list)
v.insert(v.begin() + i++, va);
}
ll ma = numeric_limits<ll>::min();
ll mi = numeric_limits<ll>::max();
int N, K, M, H, W, q, r, cou;
vi A, B, C;
int pa[100], zen[100];
int f(int lev, int x) {
if (x == 0)
return 0;
// 全部のパティを食べれる
if (x >= zen[lev] - 1) {
return pa[lev];
// 真ん中までは食べれない
} else if (x <= zen[lev - 1] + 1) {
return f(lev - 1, x - 1);
// 真ん中以上食べれる
} else {
return pa[lev - 1] + 1 + f(lev - 1, x - zen[lev - 1] - 2);
}
}
signed main() {
int x;
cin >> N >> x;
pa[0] = zen[0] = 1;
rep(i, 100) {
pa[i + 1] = pa[i] * 2 + 1;
zen[i + 1] = zen[i] * 2 + 3;
}
cout << f(N, x) << endl;
return 0;
}
| #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 !=
#define ne !=
#define dif !=
#define df !=
#define rs resize
#define PQ priority_queue<ll, vector<ll>, greater<ll>>
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvi = vector<vi>;
using vs = vector<string>;
using vl = vector<ll>;
using vvl = vector<vl>;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using vp = vector<P>;
using dou = double;
using itn = int;
using str = string;
using bo = bool;
#define uset unordered_set
#define umap unordered_map
#define F first
#define S second
// 定数
#define k4 10101
#define k5 101010
#define k6 1010101
#define k7 10101010
const int INF = (int)1e9 + 100;
const int MINF = (int)-1e9 - 100;
const ll LINF = (ll)1e18 + 100;
const ll MLINF = (ll)1e18 - 100;
const double EPS = 1e-9;
const int y4[] = {-1, 1, 0, 0};
const int x4[] = {0, 0, -1, 1};
const int y8[] = {0, 1, 0, -1, -1, 1, 1, -1};
const int x8[] = {1, 0, -1, 0, 1, -1, 1, -1};
// 配列
#define sz(a) (sizeof(a) / sizeof(a[0]))
// コンテナ
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
template <class T> inline void sort(vector<T> &a) { sort(a.begin(), a.end()); };
template <class T> inline void rsort(vector<T> &a) {
sort(a.begin(), a.end(), greater<T>());
};
template <class T> inline void sort(vector<T> &a, int len) {
sort(a.begin(), a.begin() + len);
};
template <class T> inline void rsort(vector<T> &a, int len) {
sort(a.begin(), a.begin() + len, greater<T>());
};
// 繰り返し
#define _overloadrep(_1, _2, _3, name, ...) name
#define _rep(i, n) for (int i = 0; i < n; i++)
#define repi(i, m, n) for (int i = m; i < n; i++)
#define rep(...) _overloadrep(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rer(i, n) for (int i = n; i >= 0; i--)
#define reri(i, m, n) for (int i = m; i >= n; i--)
#define rer(...) _overloadrep(__VA_ARGS__, reri, _rer, )(__VA_ARGS__)
#define fora(a, b) for (auto &&a : b)
#define rea(a, b) for (auto &&a : b)
#define repa(a, b) for (auto &&a : b)
template <typename A, size_t N, typename T> void fill(A (&a)[N], const T &v) {
rep(i, N) a[i] = v;
}
template <typename A, size_t N, size_t O, typename T>
void fill(A (&a)[N][O], const T &v) {
rep(i, N) rep(j, O) a[i][j] = v;
}
template <typename A, size_t N, size_t O, size_t P, typename T>
void fill(A (&a)[N][O][P], const T &v) {
rep(i, N) rep(j, O) rep(k, P) a[i][j][k] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, typename T>
void fill(A (&a)[N][O][P][Q], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) a[i][j][k][l] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
typename T>
void fill(A (&a)[N][O][P][Q][R], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) a[i][j][k][l][m] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S, typename T>
void fill(A (&a)[N][O][P][Q][R][S], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) rep(n, S)
a[i][j][k][l][m][n] = v;
}
template <class T, class U> void fill(vector<T> &a, U v) {
rep(i, a.size()) a[i] = v;
}
template <class T, class U> void fill(vector<vector<T>> &a, U v) {
rep(i, a.size()) rep(j, a[0].size()) a[i][j] = v;
}
template <class T, class U> void fill(vector<vector<vector<T>>> &a, U v) {
rep(i, a.size()) rep(j, a[0].size()) rep(k, a[0][0].size()) a[i][j][k] = v;
}
#define arcpy(a, b) memcpy(a, b, sizeof(b))
// 入力
template <typename T = int> T in() {
T x;
cin >> x;
return (x);
}
string sin() { return in<string>(); }
double din() { return in<double>(); }
ll lin() { return in<ll>(); }
#define na(a, n) rep(i, n) cin >> a[i];
#define nad(a, n) rep(i, n) cin >> a[i], a[i]--;
#define na3(a, b, c, n) rep(i, n) cin >> a[i] >> b[i] >> c[i];
#define add3(a, b, c, n) rep(i, n) a.pb(in()), b.pb(in()), c.pb(in());
#define na2(a, b, n) rep(i, n) cin >> a[i] >> b[i];
#define nt(a, h, w) rep(hi, h) rep(wi, w) cin >> a[hi][wi];
#define ntd(a, h, w) rep(hi, h) rep(wi, w) cin >> a[hi][wi], a[hi][wi]--;
#define ntp(a, h, w) \
fill(a, '#'); \
rep(hi, 1, h + 1) rep(wi, 1, w + 1) cin >> a[hi][wi];
#define addAll(a, n) rep(i, n) a.pb(in());
#define addAlld(a, n) rep(i, n) a.pb(in() - 1);
// 出力
template <class T> void out(T x) {
if (typeid(x) == typeid(double))
cout << fixed << setprecision(10) << x << endl;
else
cout << x << endl;
}
// デバッグ
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n';
// よく使うクラス、構造体
class UnionFind {
public:
vi par, rank, sizes;
int n, trees;
UnionFind(int n) : n(n), trees(n) {
par.resize(n), rank.resize(n), sizes.resize(n);
rep(i, n) par[i] = i, sizes[i] = 1;
}
int root(int x) {
if (par[x] == x)
return x;
else
return par[x] = root(par[x]);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (rank[x] < rank[y])
swap(x, y);
trees--;
par[y] = x;
sizes[x] += sizes[y];
if (rank[x] == rank[y])
rank[x]++;
}
bool same(int x, int y) { return root(x) == root(y); }
int size(int x) { return sizes[root(x)]; }
// 順不同 umapなので
vvi sets() {
vvi res(trees);
umap<int, vi> map;
rep(i, n) map[root(i)].push_back(i);
int i = 0;
for (auto &&p : map) {
int r = p.F;
res[i].push_back(r);
for (auto &&v : p.S) {
if (r == v)
continue;
res[i].push_back(v);
}
i++;
}
return res;
}
};
// MOD関連
ll MOD = (int)1e9 + 7;
int mpow(int v, ll a) {
ll x = v, n = a, res = 1;
while (n) {
if (n & 1)
res = (res * x) % MOD;
x = (x * x) % MOD;
n >>= 1;
}
return res;
}
class mint {
private:
ll v;
public:
static ll mod(ll a) { return (a % MOD + MOD) % MOD; }
mint(ll a = 0) { this->v = mod(a); };
mint(const mint &a) { v = a.v; }
mint operator+(const mint &a) { return mint(v + a.v); }
mint operator+(const ll a) { return mint(v + a % MOD); }
mint operator+(const signed a) { return mint(v + a % MOD); }
friend mint operator+(const ll a, const mint &b) {
return mint(a % MOD + b.v);
}
void operator+=(const mint &a) { v = (v + a.v) % MOD; }
void operator+=(const ll a) { v = mod(v + a % MOD); }
void operator+=(const signed a) { v = mod(v + a % MOD); }
friend void operator+=(ll &a, const mint &b) { a = mod(a % MOD + b.v); }
mint operator-(const mint &a) { return mint(v - a.v); }
mint operator-(const ll a) { return mint(v - a % MOD); }
mint operator-(const signed a) { return mint(v - a % MOD); }
friend mint operator-(const ll a, const mint &b) {
return mint(a % MOD - b.v);
}
void operator-=(const mint &a) { v = mod(v - a.v); }
void operator-=(const ll a) { v = mod(v - a % MOD); }
void operator-=(const signed a) { v = mod(v - a % MOD); }
friend void operator-=(ll &a, const mint &b) { a = mod(a % MOD - b.v); }
mint operator*(const mint &a) { return mint(v * a.v); }
mint operator*(const ll a) { return mint(v * (a % MOD)); }
mint operator*(const signed a) { return mint(v * (a % MOD)); }
friend mint operator*(const ll a, const mint &b) {
return mint(a % MOD * b.v);
}
void operator*=(const mint &a) { v = (v * a.v) % MOD; }
void operator*=(const ll a) { v = mod(v * (a % MOD)); }
void operator*=(const signed a) { v = mod(v * (a % MOD)); }
friend void operator*=(ll &a, const mint &b) { a = mod(a % MOD * b.v); }
mint operator/(const mint &a);
mint operator/(const ll a);
mint operator/(const signed a);
friend mint operator/(const ll a, const mint &b);
void operator/=(const mint &a);
void operator/=(const ll a);
void operator/=(const signed a);
friend void operator/=(ll &a, const mint &b);
mint operator^(const mint &a) { return mpow(v, a.v); };
mint operator^(const ll a) { return mpow(v, a); };
mint operator^(const signed a) { return mpow(v, a); };
friend mint operator^(const ll a, const mint &b) { return mpow(a, b.v); };
void operator^=(const mint &a) { v = mpow(v, a.v); }
void operator^=(const ll a) { v = mpow(v, a); }
void operator^=(const signed a) { v = mpow(v, a); }
// 単項演算子
mint operator+() { return *this; }
mint operator++() {
v++;
return *this;
}
mint operator++(signed d) {
mint res = *this;
v++;
return res;
}
mint operator-() { return operator*(-1); }
mint operator--() {
v++;
return *this;
}
void operator--(signed d) {
mint res = *this;
v++;
}
bool operator==(mint &a) { return v == a.v; }
bool operator==(signed a) { return v == a; }
friend bool operator==(signed a, mint &b) { return a == b.v; }
bool operator!=(mint &a) { return v != a.v; }
bool operator!=(signed a) { return v != a; }
friend bool operator!=(signed a, mint &b) { return a != b.v; }
operator int() { return v; }
};
const int setModMax = 510000;
mint fac[setModMax], finv[setModMax], inv[setModMax];
void setMod() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < setModMax; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
mint minv(ll a) {
if (fac[0] == 0)
setMod();
if (a < setModMax)
return inv[a];
a %= MOD;
ll b = MOD, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return (x % MOD + MOD) % MOD;
}
mint mint::operator/(const mint &a) { return mint(v * minv(a.v)); }
mint mint::operator/(const ll a) { return mint(v * minv(a)); }
mint mint::operator/(const signed a) { return mint(v * minv(a)); }
mint operator/(const ll a, const mint &b) { return mint(a % MOD * minv(b.v)); }
void mint::operator/=(const mint &a) { v = (v * minv(a.v)) % MOD; }
void mint::operator/=(const ll a) { v = mod(v * minv(a)); }
void mint::operator/=(const signed a) { v = mod(v * minv(a)); }
void operator/=(ll &a, const mint &b) { a = mint::mod(a % MOD * minv(b.v)); }
bool isPrime[4010101];
vi primes;
void setPrime() {
fill(isPrime, true);
isPrime[0] = isPrime[1] = false;
for (int i = 2; i <= sqrt(sz(isPrime)) + 5; ++i) {
if (!isPrime[i])
continue;
for (int j = 2; i * j < sz(isPrime); ++j) {
isPrime[i * j] = false;
}
}
rep(i, sz(isPrime)) if (isPrime[i]) primes.pb(i);
}
mint com(ll n, ll r) {
if (n < r || n < 0 || r < 0)
return 0;
if (fac[0] == 0)
setMod();
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
// 便利関数
ll reverse(ll a) {
ll res = 0;
while (a) {
res *= 10;
res += a % 10;
a /= 10;
}
return res;
}
ll ceil(ll a, ll b) { return (a + b - 1) / b; }
ll sqrt(ll a) {
ll res = (ll)sqrt(a);
while (res * res < a)
res++;
return res;
}
ll sig(ll t) { return (1 + t) * t / 2; }
ll sig(ll s, ll t) { return (s + t) * (t - s + 1) / 2; }
vi divisors(int v) {
vi res;
for (int i = 1; i <= sqrt(v); ++i) {
if (v % i == 0) {
res.pb(i);
if (i != v / i)
res.pb(v / i);
}
}
return res;
}
unordered_map<int, int> factorization(int v) {
unordered_map<int, int> res;
if (!isPrime[2])
setPrime();
for (auto &&p : primes) {
while (v % p == 0) {
res[p]++;
v /= p;
}
if (v == 1)
break;
}
return res;
}
int get(int a, int keta) {
a /= (int)pow(10, keta);
return a % 10;
}
// 変換系
template <class T, class U> vector<U> keys(map<T, U> a) {
vector<U> res;
for (auto &&k : a)
res.pb(k.F);
return res;
}
template <class T, class U> vector<U> keys(umap<T, U> a) {
vector<U> res;
for (auto &&k : a)
res.pb(k.F);
return res;
}
template <class T, class U> vector<T> values(map<T, U> a) {
vector<T> res;
for (auto &&k : a)
res.pb(k.S);
return res;
}
template <class T, class U> vector<T> values(umap<T, U> a) {
vector<T> res;
for (auto &&k : a)
res.pb(k.S);
return res;
}
vi list(int a) {
vi res;
while (a) {
res.insert(res.begin(), a % 10);
a /= 10;
}
return res;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> T min(T a, signed b) { return a < b ? a : b; }
template <class T> T max(T a, signed b) { return a < b ? b : a; }
template <class T> T sum(vector<T> &v, int len = -1) {
if (len == -1)
len = v.size();
T res = 0;
rep(i, min((int)len, (int)v.size())) res += v[i];
return res;
}
void clear(PQ &q) {
while (q.size())
q.pop();
}
template <class T> void clear(queue<T> &q) {
while (q.size())
q.pop();
}
template <class T> vector<T> ruiv(vector<T> &a) {
vector<T> res(a.size() + 1);
rep(i, a.size()) res[i + 1] = res[i] + a[i];
return res;
}
template <class T> void plus(vector<T> &a, T v = 1) {
for (auto &&u : a)
u += v;
}
template <class T> void minu(vector<T> &a, T v = 1) {
for (auto &&u : a)
u -= v;
}
template <class T> void minus(vector<T> &a, T v = 1) {
for (auto &&u : a)
u -= v;
}
inline bool inside(int y, int x, int H, int W) {
return y >= 0 && x >= 0 && y < H && x < W;
}
ll u(ll a) { return a < 0 ? 0 : a; }
#define inc(s, x, t) s <= x &&x < t
#define MIN(a) numeric_limits<a>::min()
#define MAX(a) numeric_limits<a>::max()
template <class T> T min(vector<vector<T>> &a) {
T res = MAX(T);
rep(i, a.size()) chmin(res, *min_element(all(a[i])));
return res;
}
template <class T> T max(vector<vector<T>> &a) {
T res = MIN(T);
rep(i, a.size()) chmax(res, *max_element(all(a[i])));
return res;
}
bool bget(ll m, int keta) { return (m >> keta) & 1; }
int bget(ll m, int keta, int sinsuu) {
m /= (ll)pow(sinsuu, keta);
return m % sinsuu;
}
inline ll bit(int n) { return (1LL << (n)); }
inline ll bit(int n, int sinsuu) { return (ll)pow(sinsuu, n); }
int bcou(ll m) {
return __builtin_popcount(m & 0xFFFFFFFF) + __builtin_popcount(m >> 32);
}
// 初期化は0を渡す
ll nextComb(ll &mask, int n, int r) {
if (!mask)
return mask = (1LL << r) - 1;
ll x = mask & -mask; // 最下位の1
ll y = mask + x; // 連続した下の1を繰り上がらせる
ll res = ((mask & ~y) / x >> 1) | y;
if (bget(res, n))
return mask = 0;
else
return mask = res;
}
// n桁以下でビットがr個立っているもののvectorを返す
vl bitCombList(int n, int r) {
vl res;
int m = 0;
while (nextComb(m, n, r)) {
res.pb(m);
}
return res;
}
int ctoi(char c) {
if ('A' <= c && c <= 'Z')
return c - 'A';
return c - 'a' + 26;
}
char itoc(int i) {
if (i < 26)
return 'A' + i;
return 'a' + i - 26;
}
#define lowerIndex(a, v) (lower_bound(all(a), v) - a.begin())
#define lowerBound(a, v) (*lower_bound(all(a), v))
#define upperIndex(a, v) (upper_bound(all(a), v) - a.begin())
#define upperBound(a, v) (*upper_bound(all(a), v))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
void compress(vi &a) {
vi b;
int len = a.size();
for (int i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
UNIQUE(b);
for (int i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
}
void compress(int a[], int len) {
vi b;
for (int i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
UNIQUE(b);
for (int i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
}
template <class T> inline void fin(T s) { cout << s << endl, exit(0); }
#define ans(a) \
cout << a << endl; \
continue;
#define lower_index(a, v) lower_bound(all(a), v) - a.begin()
#define upper_index(a, v) upper_bound(all(a), v) - a.begin()
#define poll(a) \
q.front(); \
q.pop()
#define dpoll(a) \
q.front(); \
q.pop_front()
#define pollLast(a) \
q.back(); \
q.pop_back()
#define pollBack(a) \
q.back(); \
q.pop_back()
template <class T> struct edge {
int from, to;
T cost;
int id;
int type;
edge(int f, int t, T c = 1, int id = -1, int ty = -1)
: from(f), to(t), cost(c), id(id), type(ty) {}
bool operator<(const edge &b) const { return cost < b.cost; }
bool operator>(const edge &b) const { return cost > b.cost; }
};
template <typename T> class graph {
protected:
vector<bool> _used;
public:
vector<vector<edge<T>>> g;
vector<edge<T>> edges;
int n;
graph(int n) : n(n) {
g.resize(n);
_used.resize(n);
}
void clear() {
g.clear();
edges.clear();
}
void resize(int n) {
this->n = n;
g.resize(n);
_used.resize(n);
}
bool isleaf(int v, int r) { return g[v].size() == 1 && g[v][0].to == r; }
virtual void add(int from, int to, T cost, int ty) = 0;
virtual bool used(edge<T> &e) = 0;
virtual bool used(int id) = 0;
virtual void del(edge<T> &e) = 0;
virtual void del(int id) = 0;
};
template <class T = int> class undigraph : public graph<T> {
public:
using graph<T>::g;
using graph<T>::n;
using graph<T>::edges;
using graph<T>::_used;
undigraph(int n) : graph<T>(n) {}
void add(int f, int t, T cost = 1, int ty = -1) {
assert(0 <= f && f < n && 0 <= t && t < n);
int id = edges.size();
g[f].emplace_back(f, t, cost, id, ty);
g[t].emplace_back(t, f, cost, id + 1, ty);
edges.emplace_back(f, t, cost, id, ty);
edges.emplace_back(t, f, cost, id + 1, ty);
}
void add(edge<T> &e) {
int f = e.from, t = e.to, ty = e.type;
T cost = e.cost;
add(f, t, cost, ty);
}
bool used(edge<T> &e) { return _used[e.id]; }
bool used(int id) { return _used[id]; }
void del(edge<T> &e) { _used[e.id] = _used[e.id ^ 1] = 1; }
void del(int id) { _used[id] = _used[id ^ 1] = 1; }
};
template <typename T = ll> class digraph : public graph<T> {
public:
using graph<T>::g;
using graph<T>::n;
using graph<T>::edges;
using graph<T>::_used;
digraph(int n) : graph<T>(n) {}
void add(int f, int t, T cost = 1, int ty = -1) {
assert(0 <= f && f < n && 0 <= t && t < n);
int id = edges.size();
g[f].emplace_back(t, cost, ty, id);
edges.emplace_back(f, t, cost, ty, id);
}
bool used(edge<T> &e) { return _used[e.id]; }
bool used(int id) { return _used[id]; }
void del(edge<T> &e) { _used[e.id] = _used[e.id ^ 1] = 1; }
void del(int id) { _used[id] = _used[id ^ 1] = 1; }
};
template <class T> bool nibu(const graph<T> &g) {
UnionFind uf(g.n * 2);
for (auto &&e : g.edges)
uf.unite(e.f, e.t + g.n), uf.unite(e.f + g.n, e.t);
return !uf.same(0, g.n);
}
template <class T> vector<T> dijkstra(const graph<T> &g, int s) {
assert(inc(0, s, g.n));
T initValue = MAX(T);
vector<T> dis(g.n, initValue);
priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> q;
dis[s] = 0;
q.emplace(0, s);
while (q.size()) {
T nowc = q.top().F;
int i = q.top().S;
q.pop();
if (dis[i] != nowc)
continue;
for (auto &&e : g.g[i]) {
int to = e.to;
T cost = nowc + e.cost;
if (dis[to] > cost) {
dis[to] = cost;
q.emplace(dis[to], to);
}
}
}
// たどり着かないなら-1
for (auto &&d : dis)
if (d == initValue)
d = -1;
return dis;
}
// 機能拡張
template <typename T> void remove(vector<T> &v, unsigned int i) {
v.erase(v.begin() + i);
}
template <typename T>
void remove(vector<T> &v, unsigned int s, unsigned int e) {
v.erase(v.begin() + s, v.begin() + e);
}
template <typename T>
void removen(vector<T> &v, unsigned int s, unsigned int n) {
v.erase(v.begin() + s, v.begin() + s + n);
}
template <typename T> void erase(vector<T> &v, unsigned int i) {
v.erase(v.begin() + i);
}
template <typename T> void erase(vector<T> &v, unsigned int s, unsigned int e) {
v.erase(v.begin() + s, v.begin() + e);
}
template <typename T>
void erasen(vector<T> &v, unsigned int s, unsigned int n) {
v.erase(v.begin() + s, v.begin() + s + n);
}
template <typename T> void insert(vector<T> &v, unsigned int i, T t) {
v.insert(v.begin() + i, t);
}
template <typename T>
void insert(vector<T> &v, unsigned int i, vector<T> list) {
for (auto &&va : list)
v.insert(v.begin() + i++, va);
}
template <typename T>
void insert(vector<T> &v, unsigned int i, initializer_list<T> list) {
for (auto &&va : list)
v.insert(v.begin() + i++, va);
}
ll ma = numeric_limits<ll>::min();
ll mi = numeric_limits<ll>::max();
int N, K, M, H, W, q, r, cou;
vi A, B, C;
int pa[100], zen[100];
int f(int lev, int x) {
if (x == 0)
return 0;
// 全部のパティを食べれる
if (x >= zen[lev] - 1) {
return pa[lev];
// 真ん中までは食べれない
} else if (x <= zen[lev - 1] + 1) {
return f(lev - 1, x - 1);
// 真ん中以上食べれる
} else {
return pa[lev - 1] + 1 + f(lev - 1, x - zen[lev - 1] - 2);
}
}
signed main() {
int x;
cin >> N >> x;
pa[0] = zen[0] = 1;
rep(i, 60) {
pa[i + 1] = pa[i] * 2 + 1;
zen[i + 1] = zen[i] * 2 + 3;
}
cout << f(N, x) << endl;
return 0;
}
| 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 /= 2;
}
return res;
}
ll ncr(ll n, ll k) {
if (k == 0 || k == n)
return 1ll;
if (k > n - k)
k = n - k;
ll pro = 1;
for (ll i = 0; i < k; i++) {
pro = (pro * (n - i));
pro /= (i + 1);
}
return pro;
}
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, k;
cin >> n >> k;
vector<ll> siz, pat;
siz.push_back(1ll);
pat.push_back(1ll);
for (int i = 1; i <= n; i++) {
siz.push_back(2 * siz[i - 1] + 3ll);
pat.push_back(2 * pat[i - 1] + 1ll);
}
ll ans = 0;
for (ll i = n; i >= 0; i--) {
if (k == siz[i]) {
ans += pat[i];
break;
} else if (k == 1ll || k == 0ll) {
break;
}
assert(i > 1);
if (k <= 1ll + siz[i - 1]) {
k--;
} else {
ans += 1ll + pat[i - 1];
k -= (2ll + siz[i - 1]);
}
}
cout << ans;
return 0;
}
| #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 /= 2;
}
return res;
}
ll ncr(ll n, ll k) {
if (k == 0 || k == n)
return 1ll;
if (k > n - k)
k = n - k;
ll pro = 1;
for (ll i = 0; i < k; i++) {
pro = (pro * (n - i));
pro /= (i + 1);
}
return pro;
}
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, k;
cin >> n >> k;
vector<ll> siz, pat;
siz.push_back(1ll);
pat.push_back(1ll);
for (int i = 1; i <= n; i++) {
siz.push_back(2 * siz[i - 1] + 3ll);
pat.push_back(2 * pat[i - 1] + 1ll);
}
ll ans = 0;
for (ll i = n; i >= 0; i--) {
if (k == siz[i]) {
ans += pat[i];
break;
} else if (k == 1ll || k == 0ll) {
break;
}
assert(i > 0);
if (k <= 1ll + siz[i - 1]) {
k--;
} else {
ans += 1ll + pat[i - 1];
k -= (2ll + siz[i - 1]);
}
}
cout << ans;
return 0;
}
| replace | 52 | 53 | 52 | 53 | 0 |
Subsets and Splits