problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03111 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
typedef long long ll;
using P = pair<int, int>;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VP = vector<P>;
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 (a > b) {
a = b;
return true;
}
return false;
}
int n, ans;
VI abc, l;
const int INF = 1 << 20;
int f(int x, VI useL) {
int cost = INF;
int sz = useL.size();
for (int i = 1; i < (1 << sz); i++) {
VI used;
rep(j, sz) if (i >> j & 1) used.push_back(j);
int len = 0;
int merge = 0;
rep(j, used.size()) {
if (j != 0)
merge += 10;
len += useL[j];
cost = min(cost, abs(len - x) + merge);
}
}
return cost;
}
void dfs(VI nums) {
if ((int)nums.size() == n) {
int sum = 0;
for (int j = 0; j < 3; j++) {
int x = abc[j];
VI useL;
for (int k = 0; k < n; k++) {
if (nums[k] == j)
useL.push_back(l[k]);
}
sum += f(x, useL);
}
ans = min(ans, sum);
} else {
for (int j = 0; j < 3; j++) {
nums.push_back(j);
dfs(nums);
nums.pop_back();
}
}
}
int main() {
cin >> n;
abc.resize(3);
l.resize(n);
rep(i, 3) cin >> abc[i];
rep(i, n) cin >> l[i];
ans = INF;
dfs(VI(0));
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
typedef long long ll;
using P = pair<int, int>;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VP = vector<P>;
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 (a > b) {
a = b;
return true;
}
return false;
}
int n, ans;
VI abc, l;
const int INF = 1 << 20;
int f(int x, VI useL) {
int cost = INF;
int sz = useL.size();
for (int i = 1; i < (1 << sz); i++) {
VI used;
rep(j, sz) if (i >> j & 1) used.push_back(j);
int len = 0;
int merge = 0;
rep(j, used.size()) {
if (j != 0)
merge += 10;
len += useL[used[j]];
cost = min(cost, abs(len - x) + merge);
}
}
return cost;
}
void dfs(VI nums) {
if ((int)nums.size() == n) {
int sum = 0;
for (int j = 0; j < 3; j++) {
int x = abc[j];
VI useL;
for (int k = 0; k < n; k++) {
if (nums[k] == j)
useL.push_back(l[k]);
}
sum += f(x, useL);
}
ans = min(ans, sum);
} else {
for (int j = 0; j < 3; j++) {
nums.push_back(j);
dfs(nums);
nums.pop_back();
}
}
}
int main() {
cin >> n;
abc.resize(3);
l.resize(n);
rep(i, 3) cin >> abc[i];
rep(i, n) cin >> l[i];
ans = INF;
dfs(VI(0));
cout << ans << endl;
return 0;
} | [] | 923,884 | 923,885 | u084949493 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define X real()
#define Y imag()
/* REPmacro */
#define REPS(i, a, n) for (ll i = (a); i < (ll)(n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (ll i = (a); i >= (ll)(n); --i)
#define DEP(i, n) DEPS(i, n, 0)
#define EACH(i, n) for (auto &&i : n)
/* debug */
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n';
/* alias */
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using plglg = pair<ll, ll>;
using tlglglg = tuple<ll, ll, ll>;
using D = double;
using P = complex<D>;
using vs = vector<string>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
const D EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
/* func */
inline bool inside(int y, int x, int H, int W) {
return y >= 0 && x >= 0 && y < H && x < W;
}
inline int in() {
int x;
cin >> x;
return x;
}
inline ll IN() {
ll x;
cin >> x;
return x;
}
inline vs split(const string &t, char c) {
vs v;
stringstream s(t);
string b;
while (getline(s, b, c))
v.eb(b);
return v;
}
template <typename T> inline bool chmin(T &a, const T &b) {
if (a > b)
a = b;
return a > b;
}
template <typename T> inline bool chmax(T &a, const T &b) {
if (a < b)
a = b;
return a < b;
}
template <typename T, typename S> inline void print(const pair<T, S> &p) {
cout << p.first << " " << p.second << endl;
}
template <typename T> inline void print(const T &x) { cout << x << endl; }
template <typename T, typename S>
inline void print(const vector<pair<T, S>> &v) {
for (auto &&p : v)
print(p);
}
template <typename T> inline void print(const vector<T> &v, string s = " ") {
REP(i, v.size()) cout << v[i] << (i != (ll)v.size() - 1 ? s : "\n");
}
inline void yesno(bool ok, string yes = "Yes", string no = "No") {
cout << (ok ? yes : no) << endl;
}
class Radix {
private:
const char *s;
int a[128];
public:
Radix(const char *s = "0123456789ABCDEF") : s(s) {
int i;
for (i = 0; s[i]; ++i)
a[(int)s[i]] = i;
}
std::string to(long long p, int q) {
int i;
if (!p)
return "0";
char t[64] = {};
for (i = 62; p; --i) {
t[i] = s[p % q];
p /= q;
}
return std::string(t + i + 1);
}
std::string to(const std::string &t, int p, int q) { return to(to(t, p), q); }
long long to(const std::string &t, int p) {
int i;
long long sm = a[(int)t[0]];
for (i = 1; i < (int)t.length(); ++i)
sm = sm * p + a[(int)t[i]];
return sm;
}
};
signed main() {
// my-code
int n, a, b, c;
cin >> n >> a >> b >> c;
vi l(n);
REP(i, n) cin >> l[i];
int ptnmx = 1;
REP(i, n) ptnmx *= 4;
string ptnstr;
int zpad;
int acnt, bcnt, ccnt, alen, blen, clen;
int ans = INF;
int subans;
REP(ptn, ptnmx) {
Radix r;
ptnstr = r.to(ptn, 4);
zpad = n - ptnstr.length();
acnt = 0;
bcnt = 0;
ccnt = 0;
alen = 0;
blen = 0;
clen = 0;
REPS(i, zpad, n) {
if (ptnstr[i] == '1') {
acnt++;
alen += l[i];
} else if (ptnstr[i] == '2') {
bcnt++;
blen += l[i];
} else if (ptnstr[i] == '3') {
ccnt++;
clen += l[i];
}
}
if (acnt * bcnt * ccnt == 0)
continue;
subans = 0;
subans += 10 * (acnt - 1 + bcnt - 1 + ccnt - 1);
subans += abs(alen - a) + abs(blen - b) + abs(clen - c);
chmin(ans, subans);
}
print(ans);
return 0;
}
// https://github.com/kurokoji/.cpp-Template/wiki テンプレートについて
// http://www.creativ.xyz/dump-cpp-652 dump()について
// https://gist.github.com/rigibun/7905920 色々 | #include <bits/stdc++.h>
using namespace std;
// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define X real()
#define Y imag()
/* REPmacro */
#define REPS(i, a, n) for (ll i = (a); i < (ll)(n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (ll i = (a); i >= (ll)(n); --i)
#define DEP(i, n) DEPS(i, n, 0)
#define EACH(i, n) for (auto &&i : n)
/* debug */
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n';
/* alias */
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using plglg = pair<ll, ll>;
using tlglglg = tuple<ll, ll, ll>;
using D = double;
using P = complex<D>;
using vs = vector<string>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
const D EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
/* func */
inline bool inside(int y, int x, int H, int W) {
return y >= 0 && x >= 0 && y < H && x < W;
}
inline int in() {
int x;
cin >> x;
return x;
}
inline ll IN() {
ll x;
cin >> x;
return x;
}
inline vs split(const string &t, char c) {
vs v;
stringstream s(t);
string b;
while (getline(s, b, c))
v.eb(b);
return v;
}
template <typename T> inline bool chmin(T &a, const T &b) {
if (a > b)
a = b;
return a > b;
}
template <typename T> inline bool chmax(T &a, const T &b) {
if (a < b)
a = b;
return a < b;
}
template <typename T, typename S> inline void print(const pair<T, S> &p) {
cout << p.first << " " << p.second << endl;
}
template <typename T> inline void print(const T &x) { cout << x << endl; }
template <typename T, typename S>
inline void print(const vector<pair<T, S>> &v) {
for (auto &&p : v)
print(p);
}
template <typename T> inline void print(const vector<T> &v, string s = " ") {
REP(i, v.size()) cout << v[i] << (i != (ll)v.size() - 1 ? s : "\n");
}
inline void yesno(bool ok, string yes = "Yes", string no = "No") {
cout << (ok ? yes : no) << endl;
}
class Radix {
private:
const char *s;
int a[128];
public:
Radix(const char *s = "0123456789ABCDEF") : s(s) {
int i;
for (i = 0; s[i]; ++i)
a[(int)s[i]] = i;
}
std::string to(long long p, int q) {
int i;
if (!p)
return "0";
char t[64] = {};
for (i = 62; p; --i) {
t[i] = s[p % q];
p /= q;
}
return std::string(t + i + 1);
}
std::string to(const std::string &t, int p, int q) { return to(to(t, p), q); }
long long to(const std::string &t, int p) {
int i;
long long sm = a[(int)t[0]];
for (i = 1; i < (int)t.length(); ++i)
sm = sm * p + a[(int)t[i]];
return sm;
}
};
signed main() {
// my-code
int n, a, b, c;
cin >> n >> a >> b >> c;
vi l(n);
REP(i, n) cin >> l[i];
int ptnmx = 1;
REP(i, n) ptnmx *= 4;
string ptnstr;
int zpad;
int acnt, bcnt, ccnt, alen, blen, clen;
int ans = INF;
int subans;
REP(ptn, ptnmx) {
Radix r;
ptnstr = r.to(ptn, 4);
zpad = n - ptnstr.length();
acnt = 0;
bcnt = 0;
ccnt = 0;
alen = 0;
blen = 0;
clen = 0;
REPS(i, zpad, n) {
if (ptnstr[i - zpad] == '1') {
acnt++;
alen += l[i];
} else if (ptnstr[i - zpad] == '2') {
bcnt++;
blen += l[i];
} else if (ptnstr[i - zpad] == '3') {
ccnt++;
clen += l[i];
}
}
if (acnt * bcnt * ccnt == 0)
continue;
subans = 0;
subans += 10 * (acnt - 1 + bcnt - 1 + ccnt - 1);
subans += abs(alen - a) + abs(blen - b) + abs(clen - c);
chmin(ans, subans);
}
print(ans);
return 0;
}
// https://github.com/kurokoji/.cpp-Template/wiki テンプレートについて
// http://www.creativ.xyz/dump-cpp-652 dump()について
// https://gist.github.com/rigibun/7905920 色々 | [
"control_flow.branch.if.condition.change"
] | 923,886 | 923,887 | u545411641 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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 perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(), (x).end()
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9 + 10;
const ll INF = 4e18;
const ll dy[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const ll dx[8] = {0, -1, 0, 1, 1, -1, 1, -1};
using Graph = vector<vector<int>>;
const double pi = acos(-1);
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<MOD>;
mint calc(long long N, long long K) {
mint res = 1;
for (long long n = 0; n < K; ++n) {
res *= (N - n);
res /= (n + 1);
}
return res;
}
int main() {
// cout << fixed << setprecision(12);
ll n, a, b, c;
cin >> n >> a >> b >> c;
ll l[n] = {};
ll aa = 0, bb = 0, cc = 0, ans = 0, ca = 0;
rep(i, n) { cin >> l[i]; }
for (ll i = 0; i < (1 << 2 * n); i++) {
bitset<16> s(i);
ll j = 0;
aa = 0, bb = 0, cc = 0;
ll aaa = 0, bbb = 0, ccc = 0;
for (ll k = 0; k < 16; k = k + 2) {
if (s.test(k) == 1 && s.test(k + 1) == 1) {
aa += l[j];
aaa++;
} else if (s.test(k) == 1) {
bb += l[j];
bbb++;
} else if (s.test(k + 1) == 1) {
cc += l[j];
ccc++;
}
j++;
}
if (aa == 0 || bb == 0 || cc == 0) {
continue;
}
ans += abs(aa - a) + abs(bb - b) + abs(cc - c);
if (aaa > 1)
ans += 10 * (aaa - 1);
if (bbb > 1)
ans += 10 * (bbb - 1);
if (ccc > 1)
ans += 10 * (ccc - 1);
ca = max(ca, ans);
ans = 0;
}
cout << ca << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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 perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(), (x).end()
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9 + 10;
const ll INF = 4e18;
const ll dy[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const ll dx[8] = {0, -1, 0, 1, 1, -1, 1, -1};
using Graph = vector<vector<int>>;
const double pi = acos(-1);
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<MOD>;
mint calc(long long N, long long K) {
mint res = 1;
for (long long n = 0; n < K; ++n) {
res *= (N - n);
res /= (n + 1);
}
return res;
}
int main() {
// cout << fixed << setprecision(12);
ll n, a, b, c;
cin >> n >> a >> b >> c;
ll l[n] = {};
ll aa = 0, bb = 0, cc = 0, ans = 0, ca = INF;
rep(i, n) { cin >> l[i]; }
for (ll i = 0; i < (1 << 2 * n); i++) {
bitset<16> s(i);
ll j = 0;
aa = 0, bb = 0, cc = 0;
ll aaa = 0, bbb = 0, ccc = 0;
for (ll k = 0; k < 16; k = k + 2) {
if (s.test(k) == 1 && s.test(k + 1) == 1) {
aa += l[j];
aaa++;
} else if (s.test(k) == 1) {
bb += l[j];
bbb++;
} else if (s.test(k + 1) == 1) {
cc += l[j];
ccc++;
}
j++;
}
if (aa == 0 || bb == 0 || cc == 0) {
continue;
}
ans += abs(aa - a) + abs(bb - b) + abs(cc - c);
if (aaa > 1)
ans += 10 * (aaa - 1);
if (bbb > 1)
ans += 10 * (bbb - 1);
if (ccc > 1)
ans += 10 * (ccc - 1);
ca = min(ca, ans);
ans = 0;
}
cout << ca << endl;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 923,892 | 923,893 | u722640678 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int main() {
ll n, a, b, c;
cin >> n >> a >> b >> c;
vector<ll> l(8, 0);
for (int i = 0; i < n; i++)
cin >> l[i];
vector<ll> ans(4);
ll MIN = 1000000000;
ll count = 0;
for (int p = 0; p < 4; p++) {
ans[p] += l[0];
if (!p && l[0])
count += 10;
for (int q = 0; q < 4; q++) {
ans[q] += l[1];
if (q && l[1])
count += 10;
for (int r = 0; r < 4; r++) {
ans[r] += l[2];
if (r && l[2])
count += 10;
for (int s = 0; s < 4; s++) {
ans[s] += l[3];
if (s && l[3])
count += 10;
for (int t = 0; t < 4; t++) {
ans[t] += l[4];
if (t && l[4])
count += 10;
for (int u = 0; u < 4; u++) {
ans[u] += l[5];
if (u && l[5])
count += 10;
for (int v = 0; v < 4; v++) {
ans[v] += l[6];
if (v && l[6])
count += 10;
for (int w = 0; w < 4; w++) {
ans[w] += l[7];
if (w && l[7])
count += 10;
ll x = ans[1] - a;
if (x < 0)
x *= -1;
ll y = ans[2] - b;
if (y < 0)
y *= -1;
ll z = ans[3] - c;
if (z < 0)
z *= -1;
if (ans[1] && ans[2] && ans[3])
MIN = min(MIN, count + x + y + z - 30);
ans[w] -= l[7];
if (w && l[7])
count -= 10;
}
ans[v] -= l[6];
if (v && l[6])
count -= 10;
}
ans[u] -= l[5];
if (u && l[5])
count -= 10;
}
ans[t] -= l[4];
if (t && l[4])
count -= 10;
}
ans[s] -= l[3];
if (s && l[3])
count -= 10;
}
ans[r] -= l[2];
if (r && l[2])
count -= 10;
}
ans[q] -= l[1];
if (q && l[1])
count -= 10;
}
ans[p] -= l[0];
if (p && l[0])
count -= 10;
}
cout << MIN << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int main() {
ll n, a, b, c;
cin >> n >> a >> b >> c;
vector<ll> l(8, 0);
for (int i = 0; i < n; i++)
cin >> l[i];
vector<ll> ans(4);
ll MIN = 1000000000;
ll count = 0;
for (int p = 0; p < 4; p++) {
ans[p] += l[0];
if (p && l[0])
count += 10;
for (int q = 0; q < 4; q++) {
ans[q] += l[1];
if (q && l[1])
count += 10;
for (int r = 0; r < 4; r++) {
ans[r] += l[2];
if (r && l[2])
count += 10;
for (int s = 0; s < 4; s++) {
ans[s] += l[3];
if (s && l[3])
count += 10;
for (int t = 0; t < 4; t++) {
ans[t] += l[4];
if (t && l[4])
count += 10;
for (int u = 0; u < 4; u++) {
ans[u] += l[5];
if (u && l[5])
count += 10;
for (int v = 0; v < 4; v++) {
ans[v] += l[6];
if (v && l[6])
count += 10;
for (int w = 0; w < 4; w++) {
ans[w] += l[7];
if (w && l[7])
count += 10;
ll x = ans[1] - a;
if (x < 0)
x *= -1;
ll y = ans[2] - b;
if (y < 0)
y *= -1;
ll z = ans[3] - c;
if (z < 0)
z *= -1;
if (ans[1] && ans[2] && ans[3])
MIN = min(MIN, count + x + y + z - 30);
ans[w] -= l[7];
if (w && l[7])
count -= 10;
}
ans[v] -= l[6];
if (v && l[6])
count -= 10;
}
ans[u] -= l[5];
if (u && l[5])
count -= 10;
}
ans[t] -= l[4];
if (t && l[4])
count -= 10;
}
ans[s] -= l[3];
if (s && l[3])
count -= 10;
}
ans[r] -= l[2];
if (r && l[2])
count -= 10;
}
ans[q] -= l[1];
if (q && l[1])
count -= 10;
}
ans[p] -= l[0];
if (p && l[0])
count -= 10;
}
cout << MIN << endl;
}
| [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 923,903 | 923,904 | u028906014 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define INF 1000000000000
using ll = long long;
void chmin(int &a, int b) {
if (a > b)
a = b;
} // aを短い方にする。
int N, A, B, C;
vector<int> L;
//再起
int rec(int i, int a, int b, int c) {
if (i == N) {
if (!a || !b || !c)
return INF;
return abs(a - A) + abs(b - B) + abs(c - C);
}
//今ある竹を採用しない。
int res = rec(i + 1, a, b, c);
// A,B,Cそれぞれに採用
chmin(res, rec(i + 1, a + L.at(i), b, c) + (a ? 10 : 0));
chmin(res, rec(i + 1, a, b + L.at(i), c) + (b ? 10 : 0));
chmin(res, rec(i + 1, a, b, c + L.at(i)) + (c ? 10 : 0));
return res;
}
int main() {
cin >> N >> A >> B >> C;
L.resize(N);
rep(i, N) cin >> L.at(i);
cout << rec(0, 0, 0, 0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define INF 1000000
using ll = long long;
void chmin(int &a, int b) {
if (a > b)
a = b;
} // aを短い方にする。
int N, A, B, C;
vector<int> L;
//再起
int rec(int i, int a, int b, int c) {
if (i == N) {
if (!a || !b || !c)
return INF;
return abs(a - A) + abs(b - B) + abs(c - C);
}
//今ある竹を採用しない。
int res = rec(i + 1, a, b, c);
// A,B,Cそれぞれに採用
chmin(res, rec(i + 1, a + L.at(i), b, c) + (a ? 10 : 0));
chmin(res, rec(i + 1, a, b + L.at(i), c) + (b ? 10 : 0));
chmin(res, rec(i + 1, a, b, c + L.at(i)) + (c ? 10 : 0));
return res;
}
int main() {
cin >> N >> A >> B >> C;
L.resize(N);
rep(i, N) cin >> L.at(i);
cout << rec(0, 0, 0, 0) << endl;
return 0;
} | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 923,913 | 923,914 | u779216084 | cpp |
p03111 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int n, A, B, C;
vector<int> l;
int dfs(int depth, int a, int b, int c, int cost) {
if (depth == n) {
if (min({a, b, c}) < 0)
return 1e9;
else
return abs(a - A) + abs(b - B) + abs(c - C) + cost;
}
int ret0 = dfs(depth + 1, a, b, c, cost);
int ret1 = dfs(depth + 1, a + l[depth], b, c, cost + ((a == 0) ? 0 : 10));
int ret2 = dfs(depth + 1, a, b + l[depth], c, cost + ((b == 0) ? 0 : 10));
int ret3 = dfs(depth + 1, a, b, c + l[depth], cost + ((c == 0) ? 0 : 10));
return min({ret0, ret1, ret2, ret3});
}
int main() {
cin >> n >> A >> B >> C;
l.resize(n);
rep(i, n) cin >> l[i];
cout << dfs(0, 0, 0, 0, 0) << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int n, A, B, C;
vector<int> l;
int dfs(int depth, int a, int b, int c, int cost) {
if (depth == n) {
if (min({a, b, c}) == 0)
return 1e9;
else
return abs(a - A) + abs(b - B) + abs(c - C) + cost;
}
int ret0 = dfs(depth + 1, a, b, c, cost);
int ret1 = dfs(depth + 1, a + l[depth], b, c, cost + ((a == 0) ? 0 : 10));
int ret2 = dfs(depth + 1, a, b + l[depth], c, cost + ((b == 0) ? 0 : 10));
int ret3 = dfs(depth + 1, a, b, c + l[depth], cost + ((c == 0) ? 0 : 10));
return min({ret0, ret1, ret2, ret3});
}
int main() {
cin >> n >> A >> B >> C;
l.resize(n);
rep(i, n) cin >> l[i];
cout << dfs(0, 0, 0, 0, 0) << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 923,915 | 923,916 | u697968316 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 10100000
#define INF 1e15
#define MAP 110
#define initial_value -1
#define LINF 1LL << 60
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int N, A, B, C;
int L[10];
int dfs(int cnt, int a, int b, int c) {
if (cnt == N) {
if (a == 0 || b == 0 || c == 0)
return INF;
else
return abs(a - A) + abs(b - B) + abs(c - C);
}
int ans = MM;
ans = min(ans, dfs(cnt + 1, a, b, c));
ans = min(ans, dfs(cnt + 1, a + L[cnt], b, c) + (a > 0 ? 10 : 0));
ans = min(ans, dfs(cnt + 1, a, b + L[cnt], c) + (b > 0 ? 10 : 0));
ans = min(ans, dfs(cnt + 1, a, b, c + L[cnt]) + (c > 0 ? 10 : 0));
return ans;
}
int main() {
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++)
cin >> L[i];
cout << dfs(0, 0, 0, 0) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 10100000
#define INF 1e15
#define MAP 110
#define initial_value -1
#define LINF 1LL << 60
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int N, A, B, C;
int L[10];
int dfs(int cnt, int a, int b, int c) {
if (cnt == N) {
if (a == 0 || b == 0 || c == 0)
return MM;
else
return abs(a - A) + abs(b - B) + abs(c - C);
}
int ans = MM;
ans = min(ans, dfs(cnt + 1, a, b, c));
ans = min(ans, dfs(cnt + 1, a + L[cnt], b, c) + (a > 0 ? 10 : 0));
ans = min(ans, dfs(cnt + 1, a, b + L[cnt], c) + (b > 0 ? 10 : 0));
ans = min(ans, dfs(cnt + 1, a, b, c + L[cnt]) + (c > 0 ? 10 : 0));
return ans;
}
int main() {
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++)
cin >> L[i];
cout << dfs(0, 0, 0, 0) << endl;
}
| [
"identifier.change",
"function.return_value.change"
] | 923,917 | 923,918 | u342051078 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 10100000
#define INF 1e15
#define MAP 110
#define initial_value -1
#define LINF 1LL << 60
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int N, A, B, C;
int L[10];
int dfs(int cnt, int a, int b, int c) {
if (cnt == N) {
if (a == 0 || b == 0 || c == 0)
return INF;
else
return abs(a - A) + abs(b - B) + abs(c - C);
}
int ans = INF;
ans = min(ans, dfs(cnt + 1, a, b, c));
ans = min(ans, dfs(cnt + 1, a + L[cnt], b, c) + (a > 0 ? 10 : 0));
ans = min(ans, dfs(cnt + 1, a, b + L[cnt], c) + (b > 0 ? 10 : 0));
ans = min(ans, dfs(cnt + 1, a, b, c + L[cnt]) + (c > 0 ? 10 : 0));
return ans;
}
int main() {
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++)
cin >> L[i];
cout << dfs(0, 0, 0, 0) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 10100000
#define INF 1e15
#define MAP 110
#define initial_value -1
#define LINF 1LL << 60
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int N, A, B, C;
int L[10];
int dfs(int cnt, int a, int b, int c) {
if (cnt == N) {
if (a == 0 || b == 0 || c == 0)
return MM;
else
return abs(a - A) + abs(b - B) + abs(c - C);
}
int ans = MM;
ans = min(ans, dfs(cnt + 1, a, b, c));
ans = min(ans, dfs(cnt + 1, a + L[cnt], b, c) + (a > 0 ? 10 : 0));
ans = min(ans, dfs(cnt + 1, a, b + L[cnt], c) + (b > 0 ? 10 : 0));
ans = min(ans, dfs(cnt + 1, a, b, c + L[cnt]) + (c > 0 ? 10 : 0));
return ans;
}
int main() {
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++)
cin >> L[i];
cout << dfs(0, 0, 0, 0) << endl;
}
| [
"identifier.change",
"function.return_value.change",
"variable_declaration.value.change"
] | 923,919 | 923,918 | u342051078 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
ll INF = 1e18;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int N, A, B, C;
int ans = 0;
int L[10];
int dfs(int k, int a, int b, int c) {
if (k == N) {
if (min(a, min(b, c))) {
return abs(a - A) + abs(b - B) + abs(c - C);
} else {
return MAX;
}
}
int ans = MAX;
ans = min(ans, dfs(k + 1, a, b, c));
ans = min(ans, dfs(k + 1, a + L[k], b, c) + (a > 0 ? 10 : 0));
ans = min(ans, dfs(k + 1, a, b + L[k], c) + (b > 0 ? 10 : 0));
ans = min(ans, dfs(k + 1, a, b, c + L[k]) + (c > 0 ? 10 : 0));
return ans;
}
int main() {
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++)
cin >> L[i];
int res = dfs(0, 0, 0, 0);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
ll INF = 1e18;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int N, A, B, C;
int ans = 0;
int L[10];
int dfs(int k, int a, int b, int c) {
if (k == N) {
if (min(a, min(b, c))) {
return abs(a - A) + abs(b - B) + abs(c - C);
} else {
return MAX;
}
}
int ans = MAX;
ans = min(ans, dfs(k + 1, a, b, c));
ans = min(ans, dfs(k + 1, a + L[k], b, c) + (a > 0 ? 10 : 0));
ans = min(ans, dfs(k + 1, a, b + L[k], c) + (b > 0 ? 10 : 0));
ans = min(ans, dfs(k + 1, a, b, c + L[k]) + (c > 0 ? 10 : 0));
return ans;
}
int main() {
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++)
cin >> L[i];
int res = dfs(0, 0, 0, 0);
cout << res << endl;
}
| [
"identifier.change",
"io.output.change"
] | 923,920 | 923,921 | u342051078 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
ll INF = 1e18;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int N, A, B, C;
int ans = 0;
int L[10];
int dfs(int k, int a, int b, int c) {
if (k == N) {
if (min(a, min(b, c))) {
return abs(a - A) + abs(b - B) + abs(c - C);
} else {
return MAX;
}
}
ans = min(ans, dfs(k + 1, a, b, c));
ans = min(ans, dfs(k + 1, a + L[k], b, c) + (a > 0 ? 10 : 0));
ans = min(ans, dfs(k + 1, a, b + L[k], c) + (b > 0 ? 10 : 0));
ans = min(ans, dfs(k + 1, a, b, c + L[k]) + (c > 0 ? 10 : 0));
return ans;
}
int main() {
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++)
cin >> L[i];
int res = dfs(0, 0, 0, 0);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
ll INF = 1e18;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int N, A, B, C;
int ans = 0;
int L[10];
int dfs(int k, int a, int b, int c) {
if (k == N) {
if (min(a, min(b, c))) {
return abs(a - A) + abs(b - B) + abs(c - C);
} else {
return MAX;
}
}
int ans = MAX;
ans = min(ans, dfs(k + 1, a, b, c));
ans = min(ans, dfs(k + 1, a + L[k], b, c) + (a > 0 ? 10 : 0));
ans = min(ans, dfs(k + 1, a, b + L[k], c) + (b > 0 ? 10 : 0));
ans = min(ans, dfs(k + 1, a, b, c + L[k]) + (c > 0 ? 10 : 0));
return ans;
}
int main() {
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++)
cin >> L[i];
int res = dfs(0, 0, 0, 0);
cout << res << endl;
}
| [
"variable_declaration.add",
"identifier.change",
"io.output.change"
] | 923,922 | 923,921 | u342051078 | cpp |
p03111 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ITR(x, c) for(__typeof(c.begin() x=c.begin();x!=c.end();x++)
#define RITR(x, c) for(__typeof(c.rbegin() x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)
#define lf double
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define pi pair<int, int>
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ins insert
using namespace std;
ll n;
ll A, B, C;
vll l;
ll dfs(ll cur, ll a, ll b, ll c) {
if (cur == n) {
if (a != 0 && b != 0 && c != 0) {
return abs(A - a) + abs(B - b) + abs(C - c) - 30;
} else {
return 3000;
}
}
ll ret = LONG_LONG_MAX;
ret = min(ret, 10 + dfs(cur + 1, a + l[cur], b, c));
ret = min(ret, 10 + dfs(cur + 1, a, b + l[cur], c));
ret = min(ret, 10 + dfs(cur + 1, a, b, c + l[cur]));
ret = min(ret, 10 + dfs(cur + 1, a, b, c));
return ret;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
cin >> A >> B >> C;
l.resize(n);
rep(i, n) cin >> l[i];
cout << dfs(0, 0, 0, 0) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ITR(x, c) for(__typeof(c.begin() x=c.begin();x!=c.end();x++)
#define RITR(x, c) for(__typeof(c.rbegin() x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)
#define lf double
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define pi pair<int, int>
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ins insert
using namespace std;
ll n;
ll A, B, C;
vll l;
ll dfs(ll cur, ll a, ll b, ll c) {
if (cur == n) {
if (a != 0 && b != 0 && c != 0) {
return abs(A - a) + abs(B - b) + abs(C - c) - 30;
} else {
return 3000;
}
}
ll ret = LONG_LONG_MAX;
ret = min(ret, 10 + dfs(cur + 1, a + l[cur], b, c));
ret = min(ret, 10 + dfs(cur + 1, a, b + l[cur], c));
ret = min(ret, 10 + dfs(cur + 1, a, b, c + l[cur]));
ret = min(ret, dfs(cur + 1, a, b, c));
return ret;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
cin >> A >> B >> C;
l.resize(n);
rep(i, n) cin >> l[i];
cout << dfs(0, 0, 0, 0) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 923,923 | 923,924 | u682686221 | cpp |
p03111 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
ll A, B, C;
ll dfs(vll &l, ll n, ll a, ll b, ll c, ll cu) {
if (cu == n - 1) {
if (min(min(a, b), c) > 0) {
return abs(A - a) + abs(B - b) + abs(C - c) - 30;
} else {
return INF;
}
}
ll w1 = dfs(l, n, a, b, c, cu + 1);
ll w2 = dfs(l, n, a + l[cu], b, c, cu + 1) + 10;
ll w3 = dfs(l, n, a, b + l[cu], c, cu + 1) + 10;
ll w4 = dfs(l, n, a, b, c + l[cu], cu + 1) + 10;
return min(w1, min(w2, min(w3, w4)));
}
int main() {
ll n;
cin >> n >> A >> B >> C;
vll l(n);
rep(i, n) cin >> l[i];
COUT(dfs(l, n, 0, 0, 0, 0));
} | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
ll A, B, C;
ll dfs(vll &l, ll n, ll a, ll b, ll c, ll cu) {
if (cu == n) {
if (min(min(a, b), c) > 0) {
return abs(A - a) + abs(B - b) + abs(C - c) - 30;
} else {
return INF;
}
}
ll w1 = dfs(l, n, a, b, c, cu + 1);
ll w2 = dfs(l, n, a + l[cu], b, c, cu + 1) + 10;
ll w3 = dfs(l, n, a, b + l[cu], c, cu + 1) + 10;
ll w4 = dfs(l, n, a, b, c + l[cu], cu + 1) + 10;
return min(w1, min(w2, min(w3, w4)));
}
int main() {
ll n;
cin >> n >> A >> B >> C;
vll l(n);
rep(i, n) cin >> l[i];
COUT(dfs(l, n, 0, 0, 0, 0));
} | [
"expression.operation.binary.remove"
] | 923,925 | 923,926 | u103850114 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
#define DUMP(x) std::cerr << (#x) << " = " << (x) << "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define ALL(r) r.begin(), r.end()
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define IMP cout << "IMPOSSIBLE" << endl
#define Imp cout << "Impossible" << endl
#define imp cout << "impossible" << endl
#define M1 cout << "-1" << endl
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
os << "{";
rep(i, v.size()) os << v[i] << (i == (int)v.size() - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T> T dup(T x, T y) { return (x + y - 1) / y; };
template <typename A, size_t N, typename T>
inline void arrayFill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
struct in {
const size_t n = 0;
in() = default;
in(size_t n) : n(n){};
template <typename T> operator T() {
T ret;
cin >> ret;
return ret;
}
template <typename T> operator vector<T>() {
assert(n != 0);
vector<T> ret(n);
for (auto &x : ret)
cin >> x;
return ret;
}
};
using ll = int64_t;
using vint = vector<int32_t>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pint = pair<int32_t, int32_t>;
using vpint = vector<pint>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using setint = set<int32_t>;
using setstr = set<string>;
using qint = queue<int32_t>;
using qpint = queue<pint>;
constexpr std::int32_t INF = 1001001001;
constexpr std::int64_t LINF = 1001001001001001001;
int n, A, B, C;
int l[10];
int f(int i, int a, int b, int c, int x) {
int ret = INF;
if (i == n) {
if (a & b & c) {
ret = abs(A - a) + abs(B - b) + abs(C - c) + (x - 3) * 10;
}
return ret;
}
ret = min(ret, f(i + 1, a, b, c, x));
ret = min(ret, f(i + 1, a + l[i], b, c, x + 1));
ret = min(ret, f(i + 1, a, b + l[i], c, x + 1));
ret = min(ret, f(i + 1, a, b, c + l[i], x + 1));
return ret;
}
void Main() {
cin >> n >> A >> B >> C;
rep(i, n) cin >> l[i];
cout << f(0, 0, 0, 0, 0) << endl;
}
signed main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define DUMP(x) std::cerr << (#x) << " = " << (x) << "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define ALL(r) r.begin(), r.end()
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define IMP cout << "IMPOSSIBLE" << endl
#define Imp cout << "Impossible" << endl
#define imp cout << "impossible" << endl
#define M1 cout << "-1" << endl
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
os << "{";
rep(i, v.size()) os << v[i] << (i == (int)v.size() - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T> T dup(T x, T y) { return (x + y - 1) / y; };
template <typename A, size_t N, typename T>
inline void arrayFill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
struct in {
const size_t n = 0;
in() = default;
in(size_t n) : n(n){};
template <typename T> operator T() {
T ret;
cin >> ret;
return ret;
}
template <typename T> operator vector<T>() {
assert(n != 0);
vector<T> ret(n);
for (auto &x : ret)
cin >> x;
return ret;
}
};
using ll = int64_t;
using vint = vector<int32_t>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pint = pair<int32_t, int32_t>;
using vpint = vector<pint>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using setint = set<int32_t>;
using setstr = set<string>;
using qint = queue<int32_t>;
using qpint = queue<pint>;
constexpr std::int32_t INF = 1001001001;
constexpr std::int64_t LINF = 1001001001001001001;
int n, A, B, C;
int l[10];
int f(int i, int a, int b, int c, int x) {
int ret = INF;
if (i == n) {
if (a && b && c)
ret = abs(A - a) + abs(B - b) + abs(C - c) + (x - 3) * 10;
return ret;
}
ret = min(ret, f(i + 1, a, b, c, x));
ret = min(ret, f(i + 1, a + l[i], b, c, x + 1));
ret = min(ret, f(i + 1, a, b + l[i], c, x + 1));
ret = min(ret, f(i + 1, a, b, c + l[i], x + 1));
return ret;
}
void Main() {
cin >> n >> A >> B >> C;
rep(i, n) cin >> l[i];
cout << f(0, 0, 0, 0, 0) << endl;
}
signed main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 923,929 | 923,930 | u664394831 | cpp |
p03111 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define pb push_back
#define eb emplace_back
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 50;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
int n, a, b, c;
vector<vector<int>> l;
int rec(int i, int j, int comb = 0, int suma = 0, int sumb = 0, int sumc = 0) {
if (i == n) {
if (suma & sumb & sumc)
return comb + abs(suma - a) + abs(sumb - b) + abs(sumc - c);
else
return 1e5;
}
if (!j) {
if (suma)
comb += 10;
suma += l[i][j];
}
if (j == 1) {
if (sumb)
comb += 10;
sumb += l[i][j];
}
if (j == 2) {
if (sumc)
comb += 10;
sumc += l[i][j];
}
int res = 1e5;
rep(j, 4) { chmin(res, rec(i + 1, j, comb, suma, sumb, sumc)); }
return res;
}
void solve() {
cin >> n >> a >> b >> c;
l.resize(n, vector<int>(3));
int x, ans = 1e5;
rep(i, n) {
cin >> x;
rep(j, 3) l[i][j] = x;
}
rep(i, 4) chmin(ans, rec(0, i));
cout << ans << "\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
solve();
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define pb push_back
#define eb emplace_back
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 50;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
int n, a, b, c;
vector<vector<int>> l;
int rec(int i, int j, int comb = 0, int suma = 0, int sumb = 0, int sumc = 0) {
if (i == n) {
if (suma && sumb && sumc)
return comb + abs(suma - a) + abs(sumb - b) + abs(sumc - c);
else
return 1e5;
}
if (!j) {
if (suma)
comb += 10;
suma += l[i][j];
}
if (j == 1) {
if (sumb)
comb += 10;
sumb += l[i][j];
}
if (j == 2) {
if (sumc)
comb += 10;
sumc += l[i][j];
}
int res = 1e5;
rep(j, 4) { chmin(res, rec(i + 1, j, comb, suma, sumb, sumc)); }
return res;
}
void solve() {
cin >> n >> a >> b >> c;
l.resize(n, vector<int>(3));
int x, ans = 1e5;
rep(i, n) {
cin >> x;
rep(j, 3) l[i][j] = x;
}
rep(i, 4) chmin(ans, rec(0, i));
cout << ans << "\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
solve();
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 923,931 | 923,932 | u698883164 | cpp |
p03111 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, a, b, c, m = 1000000000;
cin >> n >> a >> b >> c;
vector<int> v(n);
rep(i, n) cin >> v[i];
rep(i, pow(4, n)) {
int ta = 0, tb = 0, tc = 0, tm = 0, tmp = i;
rep(j, n) {
if (tmp % 4 == 1) {
if (ta != 0)
tm += 10;
ta += v[j];
} else if (tmp % 4 == 2) {
if (tb != 0)
tm += 10;
tb += v[j];
} else if (tmp % 4 == 3) {
if (tb != 0)
tm += 10;
tc += v[j];
}
tmp /= 4;
}
if (ta == 0 || tb == 0 || tc == 0)
continue;
else {
tm += abs(ta - a) + abs(tb - b) + abs(tc - c);
m = min(m, tm);
}
}
cout << m << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, a, b, c, m = 1000000000;
cin >> n >> a >> b >> c;
vector<int> v(n);
rep(i, n) cin >> v[i];
rep(i, pow(4, n)) {
int ta = 0, tb = 0, tc = 0, tm = 0, tmp = i;
rep(j, n) {
if (tmp % 4 == 1) {
if (ta != 0)
tm += 10;
ta += v[j];
} else if (tmp % 4 == 2) {
if (tb != 0)
tm += 10;
tb += v[j];
} else if (tmp % 4 == 3) {
if (tc != 0)
tm += 10;
tc += v[j];
}
tmp /= 4;
}
if (ta == 0 || tb == 0 || tc == 0)
continue;
else {
tm += abs(ta - a) + abs(tb - b) + abs(tc - c);
m = min(m, tm);
}
}
cout << m << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 923,939 | 923,940 | u757584836 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
static const int INF = 1e9;
int n, A, B, C, D;
vector<int> l(8);
int solve(int i, int a, int b, int c) {
if (i == n) {
if (a == 0 && b == 0 && c == 0)
return INF;
else
return abs(a - A) + abs(B - b) + abs(C - c); //ここで合成無しで調節する
}
int ans = solve(i + 1, a, b, c);
int adda = 0, addb = 0, addc = 0;
if (a != 0)
adda = 10;
if (b != 0)
addb = 10;
if (c != 0)
addc = 10;
ans = min(solve(i + 1, a + l[i], b, c) + adda, ans);
ans = min(solve(i + 1, a, b + l[i], c) + addb, ans);
ans = min(solve(i + 1, a, b, c + l[i]) + addc, ans);
return ans;
}
int main() {
cin >> n >> A >> B >> C;
for (int i = 0; i < n; i++) {
cin >> l[i];
}
cout << solve(0, 0, 0, 0) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
static const int INF = 1e9;
int n, A, B, C;
vector<int> l(8);
int solve(int i, int a, int b, int c) {
if (i == n) {
if (a == 0 || b == 0 || c == 0)
return INF;
else
return abs(a - A) + abs(B - b) + abs(C - c); //ここで合成無しで調節する
}
int ans = solve(i + 1, a, b, c);
int adda = 0, addb = 0, addc = 0;
if (a != 0)
adda = 10;
if (b != 0)
addb = 10;
if (c != 0)
addc = 10;
ans = min(solve(i + 1, a + l[i], b, c) + adda, ans);
ans = min(solve(i + 1, a, b + l[i], c) + addb, ans);
ans = min(solve(i + 1, a, b, c + l[i]) + addc, ans);
return ans;
}
int main() {
cin >> n >> A >> B >> C;
for (int i = 0; i < n; i++) {
cin >> l[i];
}
cout << solve(0, 0, 0, 0) << endl;
return 0;
}
| [
"variable_declaration.remove",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 923,949 | 923,950 | u843292252 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int N, A, B, C;
std::vector<int> l;
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (min(min(a, b), c) > 0)
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
else
return -1;
}
int ret0 = dfs(cur + 1, a, b, c) + 10;
int ret1 = dfs(cur + 1, a + l[cur], b, c) + 10;
int ret2 = dfs(cur + 1, a, b + l[cur], c) + 10;
int ret3 = dfs(cur + 1, a, b, c + l[cur]) + 10;
return min(min(min(ret0, ret1), ret2), ret3);
}
int main(int argc, char const *argv[]) {
std::cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++) {
int z;
std::cin >> z;
l.push_back(z);
}
int ans = dfs(0, 0, 0, 0);
std::cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int N, A, B, C;
std::vector<int> l;
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (min(min(a, b), c) > 0)
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
else
return 100000;
}
int ret0 = dfs(cur + 1, a, b, c);
int ret1 = dfs(cur + 1, a + l[cur], b, c) + 10;
int ret2 = dfs(cur + 1, a, b + l[cur], c) + 10;
int ret3 = dfs(cur + 1, a, b, c + l[cur]) + 10;
return min(min(min(ret0, ret1), ret2), ret3);
}
int main(int argc, char const *argv[]) {
std::cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++) {
int z;
std::cin >> z;
l.push_back(z);
}
int ans = dfs(0, 0, 0, 0);
std::cout << ans << '\n';
return 0;
}
| [
"literal.number.change",
"function.return_value.change",
"expression.operation.binary.remove"
] | 923,959 | 923,960 | u053035261 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll n, a, b, c, d[10], e[10], ans = INF;
void cal() {
ll A = 0, B = 0, C = 0, sum = 0;
for (int i = 0; i < n; i++) {
if (e[i] == 1) {
if (A != 0) {
sum += 10;
}
A += d[i];
} else if (e[i] == 2) {
if (B != 0) {
sum += 10;
}
B += d[i];
} else if (e[i] == 3) {
if (C != 0) {
sum += 10;
}
C += d[i];
}
}
if (A == 0 && B == 0 && C == 0) {
return;
}
sum += abs(A - a) + abs(B - b) + abs(C - c);
ans = min(sum, ans);
}
void dep(ll now) {
if (now == n) {
cal();
return;
}
e[now] = 0;
dep(now + 1);
e[now] = 1;
dep(now + 1);
e[now] = 2;
dep(now + 1);
e[now] = 3;
dep(now + 1);
}
int main() {
cin >> n >> a >> b >> c;
for (int i = 0; i < n; i++) {
cin >> d[i];
}
dep(0);
cout << ans;
// your code goes here
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll n, a, b, c, d[10], e[10], ans = INF;
void cal() {
ll A = 0, B = 0, C = 0, sum = 0;
for (int i = 0; i < n; i++) {
if (e[i] == 1) {
if (A != 0) {
sum += 10;
}
A += d[i];
} else if (e[i] == 2) {
if (B != 0) {
sum += 10;
}
B += d[i];
} else if (e[i] == 3) {
if (C != 0) {
sum += 10;
}
C += d[i];
}
}
if (A == 0 || B == 0 || C == 0) {
return;
}
sum += abs(A - a) + abs(B - b) + abs(C - c);
ans = min(sum, ans);
}
void dep(ll now) {
if (now == n) {
cal();
return;
}
e[now] = 0;
dep(now + 1);
e[now] = 1;
dep(now + 1);
e[now] = 2;
dep(now + 1);
e[now] = 3;
dep(now + 1);
}
int main() {
cin >> n >> a >> b >> c;
for (int i = 0; i < n; i++) {
cin >> d[i];
}
dep(0);
cout << ans;
// your code goes here
return 0;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 923,964 | 923,965 | u166378830 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
const int N = 10;
vector<int> L(N);
int n, a, b, c;
vector<char> C = {'0', 'A', 'B', 'C'};
vector<string> S;
void dfs(int now, string str) {
for (int i = 0; i < 4; i++) {
if (now == n) {
vector<bool> F(3, false);
for (int j = 0; j < n; j++) {
if (str[j] == 'A')
F[0] = true;
else if (str[j] == 'B')
F[1] = true;
else if (str[j] == 'C')
F[2] = true;
}
int cnt = count(F.begin(), F.end(), true);
if (cnt == 3) {
S.push_back(str + C[i]);
}
} else
dfs(now + 1, str + C[i]);
}
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cin >> n >> a >> b >> c;
for (int i = 0; i < n; i++) {
cin >> L[i];
}
dfs(0, "");
int ans = 1e9;
int ss = S.size();
for (int i = 0; i < ss; i++) {
int mp = 0;
int a_total = 0, b_total = 0, c_total = 0;
int a_cnt = 0, b_cnt = 0, c_cnt = 0;
for (int j = 0; j < n; j++) {
if (S[i][j] == '0')
;
else if (S[i][j] == 'A') {
a_total += L[j];
a_cnt++;
} else if (S[i][j] == 'B') {
b_total += L[j];
b_cnt++;
} else if (S[i][j] == 'C') {
c_total += L[j];
c_cnt++;
}
}
mp += max(0, a_cnt - 1) * 10 + max(0, b_cnt - 1) * 10 + max(0, c_cnt - 1);
mp += abs(a - a_total);
mp += abs(b - b_total);
mp += abs(c - c_total);
ans = min(ans, mp);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 10;
vector<int> L(N);
int n, a, b, c;
vector<char> C = {'0', 'A', 'B', 'C'};
vector<string> S;
void dfs(int now, string str) {
for (int i = 0; i < 4; i++) {
if (now == n) {
vector<bool> F(3, false);
for (int j = 0; j < n; j++) {
if (str[j] == 'A')
F[0] = true;
else if (str[j] == 'B')
F[1] = true;
else if (str[j] == 'C')
F[2] = true;
}
int cnt = count(F.begin(), F.end(), true);
if (cnt == 3) {
S.push_back(str + C[i]);
}
} else
dfs(now + 1, str + C[i]);
}
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cin >> n >> a >> b >> c;
for (int i = 0; i < n; i++) {
cin >> L[i];
}
dfs(0, "");
int ans = 1e9;
int ss = S.size();
for (int i = 0; i < ss; i++) {
int mp = 0;
int a_total = 0, b_total = 0, c_total = 0;
int a_cnt = 0, b_cnt = 0, c_cnt = 0;
for (int j = 0; j < n; j++) {
if (S[i][j] == '0')
;
else if (S[i][j] == 'A') {
a_total += L[j];
a_cnt++;
} else if (S[i][j] == 'B') {
b_total += L[j];
b_cnt++;
} else if (S[i][j] == 'C') {
c_total += L[j];
c_cnt++;
}
}
mp += max(0, a_cnt - 1) * 10 + max(0, b_cnt - 1) * 10 +
max(0, c_cnt - 1) * 10;
mp += abs(a - a_total);
mp += abs(b - b_total);
mp += abs(c - c_total);
ans = min(ans, mp);
}
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 923,966 | 923,967 | u136869985 | cpp |
p03111 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using ll = long long;
using graph = std::vector<std::vector<ll>>;
using namespace std;
int main() {
int N;
int A[3];
cin >> N >> A[0] >> A[1] >> A[2];
int l[N];
for (int i = 0; i < N; i++) {
cin >> l[i];
}
ll minCost = 1ll << 60;
for (int p = 0; p < pow(4, N); p++) {
int tmpP = p;
int currentId = 0;
int id[N];
for (int i = 0; i < N; i++) {
id[i] = -1;
}
while (tmpP != 0) {
int tmp = tmpP % 4;
tmpP = (tmpP - tmp) / 4;
id[currentId] = tmp;
currentId++;
}
int sum[3];
ll currentCost = 0;
for (int i = 0; i < 3; i++) {
sum[i] = 0;
}
for (int i = 0; i < N; i++) {
if (id[i] == 3) {
continue;
}
if (sum[id[i]] > 0) {
sum[id[i]] += l[i];
currentCost += 10;
} else {
sum[id[i]] += l[i];
}
}
for (int i = 0; i < 3; i++) {
currentCost += abs(sum[i] - A[i]);
}
if (sum[0] == 0 || sum[1] == 0 || sum[2] == 0) {
continue;
}
minCost = min(minCost, currentCost);
}
cout << minCost << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using ll = long long;
using graph = std::vector<std::vector<ll>>;
using namespace std;
int main() {
int N;
int A[3];
cin >> N >> A[0] >> A[1] >> A[2];
int l[N];
for (int i = 0; i < N; i++) {
cin >> l[i];
}
ll minCost = 1ll << 60;
for (int p = 0; p < pow(4, N); p++) {
int tmpP = p;
int currentId = 0;
int id[N];
for (int i = 0; i < N; i++) {
id[i] = -1;
}
while (currentId < N) {
int tmp = tmpP % 4;
tmpP = (tmpP - tmp) / 4;
id[currentId] = tmp;
currentId++;
}
int sum[3];
ll currentCost = 0;
for (int i = 0; i < 3; i++) {
sum[i] = 0;
}
for (int i = 0; i < N; i++) {
if (id[i] == 3) {
continue;
}
if (sum[id[i]] > 0) {
sum[id[i]] += l[i];
currentCost += 10;
} else {
sum[id[i]] += l[i];
}
}
for (int i = 0; i < 3; i++) {
currentCost += abs(sum[i] - A[i]);
}
if (sum[0] == 0 || sum[1] == 0 || sum[2] == 0) {
continue;
}
minCost = min(minCost, currentCost);
}
cout << minCost << endl;
}
| [
"control_flow.loop.for.condition.change"
] | 923,968 | 923,969 | u204973596 | cpp |
p03111 | #ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pli pair<ll, int>
#define pdd pair<ld, ld>
#define mp make_pair
#define pb push_back
#define reset(x, v) memset(x, v, sizeof(x))
#define mod 1000000007
using namespace std;
int n, a, b, c;
ll solve(ll l[], int i, ll a1, ll b1, ll c1) {
if (i == n) {
if (a1 == 0 && b1 == 0 && c1 == 0)
return INT_MAX;
return abs(a - a1) + abs(b - b1) + abs(c - c1);
}
ll ans = solve(l, i + 1, a1, b1, c1);
ans = min(ans, (a1 ? 10 : 0) + solve(l, i + 1, a1 + l[i], b1, c1));
ans = min(ans, (b1 ? 10 : 0) + solve(l, i + 1, a1, b1 + l[i], c1));
ans = min(ans, (c1 ? 10 : 0) + solve(l, i + 1, a1, b1, c1 + l[i]));
return ans;
}
int main() {
FASTIO
cin >> n >> a >> b >> c;
ll l[n];
rep(i, 0, n) cin >> l[i];
cout << solve(l, 0, 0, 0, 0);
return 0;
} | #ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pli pair<ll, int>
#define pdd pair<ld, ld>
#define mp make_pair
#define pb push_back
#define reset(x, v) memset(x, v, sizeof(x))
#define mod 1000000007
using namespace std;
int n, a, b, c;
ll solve(ll l[], int i, ll a1, ll b1, ll c1) {
if (i == n) {
if (a1 == 0 || b1 == 0 || c1 == 0)
return INT_MAX;
return abs(a - a1) + abs(b - b1) + abs(c - c1);
}
ll ans = solve(l, i + 1, a1, b1, c1);
ans = min(ans, (a1 ? 10 : 0) + solve(l, i + 1, a1 + l[i], b1, c1));
ans = min(ans, (b1 ? 10 : 0) + solve(l, i + 1, a1, b1 + l[i], c1));
ans = min(ans, (c1 ? 10 : 0) + solve(l, i + 1, a1, b1, c1 + l[i]));
return ans;
}
int main() {
FASTIO
cin >> n >> a >> b >> c;
ll l[n];
rep(i, 0, n) cin >> l[i];
cout << solve(l, 0, 0, 0, 0);
return 0;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 924,009 | 924,010 | u100869561 | cpp |
p03111 | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void chmin(int &a, int b) {
if (a > b)
a = b;
}
//↑参照渡し:ポインタ私と同様、引数に用いた値も書き換えられるが
//中身は通常引数と同様に書ける
int N, A, B, C;
vector<int> L;
// DFSによる再帰
int rec(int i, int a, int b, int c) {
if (i == N) {
if (!a || !b || !c)
return INFINITY; // A,B,Cいずれも竹は一本は使う
return abs(a - A) + abs(b - B) +
abs(c - C); //合体してできたa,b,cをA,B,Cにするコスト
}
//今ある竹を採用しない場合
int res = rec(i + 1, a, b, c);
// A,B,Cを使う場合
chmin(res, rec(i + 1, a + L[i], b, c) + (a ? 10 : 0));
chmin(res, rec(i + 1, a, b + L[i], c) + (b ? 10 : 0));
chmin(res, rec(i + 1, a, b, c + L[i]) + (c ? 10 : 0));
return res;
}
int main() {
cin >> N >> A >> B >> C;
L.resize(N);
for (int i = 0; i < N; i++)
cin >> L[i];
cout << rec(0, 0, 0, 0) << endl;
return 0;
}
| #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void chmin(int &a, int b) {
if (a > b)
a = b;
}
//↑参照渡し:ポインタ私と同様、引数に用いた値も書き換えられるが
//中身は通常引数と同様に書ける
int N, A, B, C;
vector<int> L;
// DFSによる再帰
int rec(int i, int a, int b, int c) {
if (i == N) {
if (!a || !b || !c)
return 50000; // A,B,Cいずれも竹は一本は使う
return abs(a - A) + abs(b - B) +
abs(c - C); //合体してできたa,b,cをA,B,Cにするコスト
}
//今ある竹を採用しない場合
int res = rec(i + 1, a, b, c);
// A,B,Cを使う場合
chmin(res, rec(i + 1, a + L[i], b, c) + (a ? 10 : 0));
chmin(res, rec(i + 1, a, b + L[i], c) + (b ? 10 : 0));
chmin(res, rec(i + 1, a, b, c + L[i]) + (c ? 10 : 0));
return res;
}
int main() {
cin >> N >> A >> B >> C;
L.resize(N);
for (int i = 0; i < N; i++)
cin >> L[i];
cout << rec(0, 0, 0, 0) << endl;
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change"
] | 924,015 | 924,016 | u955954291 | cpp |
p03111 | #include <iostream>
#include <vector>
using namespace std;
void pl(vector<int> &l) {
l[0]++;
for (int i = 0; i < l.size() - 1; i++) {
if (l[i] > 3) {
l[i] = 0;
l[i + 1]++;
}
}
return;
}
int d(int a, int b) {
if (a < b)
return b - a;
else
return a - b;
}
int main() {
int n, a, b, c;
cin >> n >> a >> b >> c;
vector<int> l(n);
vector<int> ho(n, 0);
for (int i = 0; i < n; i++)
cin >> l[i];
vector<int> ans(3);
int rslt, min = 1e9 + 1, cnt;
while (ho[n - 1] < 4) {
for (int i = 0; i < 4; i++)
ans[i] = 0;
cnt = 0;
for (int i = 0; i < n; i++) {
if (ans[ho[i]] != 0 && i < 3)
cnt++;
ans[ho[i]] += l[i];
}
if (ans[0] > 0 && ans[1] > 0 && ans[2] > 0) {
rslt = d(a, ans[0]) + d(b, ans[1]) + d(c, ans[2]) + cnt * 10;
if (min > rslt)
min = rslt;
}
pl(ho);
}
cout << min << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
void pl(vector<int> &l) {
l[0]++;
for (int i = 0; i < l.size() - 1; i++) {
if (l[i] > 3) {
l[i] = 0;
l[i + 1]++;
}
}
return;
}
int d(int a, int b) {
if (a < b)
return b - a;
else
return a - b;
}
int main() {
int n, a, b, c;
cin >> n >> a >> b >> c;
vector<int> l(n);
vector<int> ho(n, 0);
for (int i = 0; i < n; i++)
cin >> l[i];
vector<int> ans(3);
int rslt, min = 1e9 + 1, cnt;
while (ho[n - 1] < 4) {
for (int i = 0; i < 4; i++)
ans[i] = 0;
cnt = 0;
for (int i = 0; i < n; i++) {
if (ans[ho[i]] != 0 && ho[i] < 3)
cnt++;
ans[ho[i]] += l[i];
}
if (ans[0] > 0 && ans[1] > 0 && ans[2] > 0) {
rslt = d(a, ans[0]) + d(b, ans[1]) + d(c, ans[2]) + cnt * 10;
if (min > rslt)
min = rslt;
}
pl(ho);
}
cout << min << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 924,046 | 924,047 | u732502311 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define pb push_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin())
#define ub(v, k) (upper_bound(all(v), k) - v.begin())
typedef long long ll;
typedef multiset<ll> S;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> PP;
typedef priority_queue<ll> PQ;
typedef priority_queue<ll, vector<ll>, greater<ll>> SPQ;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
const ll inf = 1001001001001001;
const int INF = 1001001001;
const int mod = 1000000007;
bool chmin(auto &a, auto b) {
if (a > b) {
a = b;
return true;
}
return false;
}
bool chmax(auto &a, auto b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int n;
cin >> n;
vi x(3);
rep(i, 3) cin >> x[i];
ll ans = inf;
vi v(n);
rep(i, n) cin >> v[i];
rep(i, (1 << n * 2)) {
ll k = i;
vi num(4);
vi sum(4);
rep(j, n) {
num[(k & 11)]++;
sum[(k & 11)] += v[j];
k >>= 2;
}
if (num[1] == 0 || num[2] == 0 || num[3] == 0)
continue;
ll p = 0;
rep(j, 3) p += (num[j + 1] - 1) * 10;
rep(j, 3) p += abs(sum[j + 1] - x[j]);
chmin(ans, p);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define pb push_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin())
#define ub(v, k) (upper_bound(all(v), k) - v.begin())
typedef long long ll;
typedef multiset<ll> S;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> PP;
typedef priority_queue<ll> PQ;
typedef priority_queue<ll, vector<ll>, greater<ll>> SPQ;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
const ll inf = 1001001001001001;
const int INF = 1001001001;
const int mod = 1000000007;
bool chmin(auto &a, auto b) {
if (a > b) {
a = b;
return true;
}
return false;
}
bool chmax(auto &a, auto b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int n;
cin >> n;
vi x(3);
rep(i, 3) cin >> x[i];
ll ans = inf;
vi v(n);
rep(i, n) cin >> v[i];
rep(i, (1 << n * 2)) {
ll k = i;
vi num(4);
vi sum(4);
rep(j, n) {
num[(k & 3)]++;
sum[(k & 3)] += v[j];
k >>= 2;
}
if (num[1] == 0 || num[2] == 0 || num[3] == 0)
continue;
ll p = 0;
rep(j, 3) p += (num[j + 1] - 1) * 10;
rep(j, 3) p += abs(sum[j + 1] - x[j]);
chmin(ans, p);
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.variable.change"
] | 924,048 | 924,049 | u422633119 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define pb push_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin())
#define ub(v, k) (upper_bound(all(v), k) - v.begin())
typedef long long ll;
typedef multiset<ll> S;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> PP;
typedef priority_queue<ll> PQ;
typedef priority_queue<ll, vector<ll>, greater<ll>> SPQ;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
const ll inf = 1001001001001001;
const int INF = 1001001001;
const int mod = 1000000007;
bool chmin(auto &a, auto b) {
if (a > b) {
a = b;
return true;
}
return false;
}
bool chmax(auto &a, auto b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int n;
cin >> n;
vi x(3);
rep(i, 3) cin >> x[i];
ll ans = inf;
vi v(n);
rep(i, n) cin >> v[i];
rep(i, (1 << n * 2)) {
ll k = i;
vi num(4);
vi sum(4);
rep(j, n) {
num[(k | 0)]++;
sum[(k | 0)] += v[j];
k >>= 2;
}
if (num[1] == 0 || num[2] == 0 || num[3] == 0)
continue;
ll p = 0;
rep(j, 3) p += (num[j + 1] - 1) * 10;
rep(j, 3) p += abs(sum[j + 1] - x[j]);
chmin(ans, p);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define pb push_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin())
#define ub(v, k) (upper_bound(all(v), k) - v.begin())
typedef long long ll;
typedef multiset<ll> S;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> PP;
typedef priority_queue<ll> PQ;
typedef priority_queue<ll, vector<ll>, greater<ll>> SPQ;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
const ll inf = 1001001001001001;
const int INF = 1001001001;
const int mod = 1000000007;
bool chmin(auto &a, auto b) {
if (a > b) {
a = b;
return true;
}
return false;
}
bool chmax(auto &a, auto b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int n;
cin >> n;
vi x(3);
rep(i, 3) cin >> x[i];
ll ans = inf;
vi v(n);
rep(i, n) cin >> v[i];
rep(i, (1 << n * 2)) {
ll k = i;
vi num(4);
vi sum(4);
rep(j, n) {
num[(k & 3)]++;
sum[(k & 3)] += v[j];
k >>= 2;
}
if (num[1] == 0 || num[2] == 0 || num[3] == 0)
continue;
ll p = 0;
rep(j, 3) p += (num[j + 1] - 1) * 10;
rep(j, 3) p += abs(sum[j + 1] - x[j]);
chmin(ans, p);
}
cout << ans << endl;
}
| [] | 924,050 | 924,049 | u422633119 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int n, a, b, c, l[10], ans = 2e9;
void dfs(int i, int x, int y, int z, int combo) {
if (i > n) {
if (x && y && z) {
ans = min(ans, abs(x - a) + abs(y - b) + abs(z - c) + combo * 10);
}
return;
}
dfs(i + 1, x + l[i], y, z, combo + 1);
dfs(i + 1, x, y + l[i], z, combo + 1);
dfs(i + 1, x, y, z + l[i], combo + 1);
dfs(i + 1, x, y, z, combo);
}
int main() {
cin >> n >> a >> b >> c;
for (int i = 0; i < n; i++) {
cin >> l[i];
}
dfs(1, 0, 0, 0, -3);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int n, a, b, c, l[10], ans = 2e9;
void dfs(int i, int x, int y, int z, int combo) {
if (i > n) {
if (x && y && z) {
ans = min(ans, abs(x - a) + abs(y - b) + abs(z - c) + combo * 10);
}
return;
}
dfs(i + 1, x + l[i], y, z, combo + 1);
dfs(i + 1, x, y + l[i], z, combo + 1);
dfs(i + 1, x, y, z + l[i], combo + 1);
dfs(i + 1, x, y, z, combo);
}
int main() {
cin >> n >> a >> b >> c;
for (int i = 1; i <= n; i++) {
cin >> l[i];
}
dfs(1, 0, 0, 0, -3);
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 924,059 | 924,060 | u794565416 | cpp |
p03111 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int rec(int N, int i, const std::vector<int> &L, int a, int b, int c, int A,
int B, int C) {
if (i >= N - 1) {
if (a == 0 || b == 0 || c == 0)
return 99999999;
return std::abs(a - A) + std::abs(b - B) + std::abs(c - C) - 30;
}
int r0 = rec(N, i + 1, L, a, b, c, A, B, C);
int r1 = rec(N, i + 1, L, a + L[i], b, c, A, B, C) + 10;
int r2 = rec(N, i + 1, L, a, b + L[i], c, A, B, C) + 10;
int r3 = rec(N, i + 1, L, a, b, c + L[i], A, B, C) + 10;
return std::min({r0, r1, r2, r3});
}
int main() {
int N, A, B, C;
std::cin >> N >> A >> B >> C;
std::vector<int> L(N);
for (int i = 0; i < N; i++)
std::cin >> L[i];
int ans = rec(N, 0, L, 0, 0, 0, A, B, C);
std::cout << ans << std::endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int rec(int N, int i, const std::vector<int> &L, int a, int b, int c, int A,
int B, int C) {
if (i > N) {
if (a == 0 || b == 0 || c == 0)
return 99999999;
return std::abs(a - A) + std::abs(b - B) + std::abs(c - C) - 30;
}
int r0 = rec(N, i + 1, L, a, b, c, A, B, C);
int r1 = rec(N, i + 1, L, a + L[i], b, c, A, B, C) + 10;
int r2 = rec(N, i + 1, L, a, b + L[i], c, A, B, C) + 10;
int r3 = rec(N, i + 1, L, a, b, c + L[i], A, B, C) + 10;
return std::min({r0, r1, r2, r3});
}
int main() {
int N, A, B, C;
std::cin >> N >> A >> B >> C;
std::vector<int> L(N);
for (int i = 0; i < N; i++)
std::cin >> L[i];
int ans = rec(N, 0, L, 0, 0, 0, A, B, C);
std::cout << ans << std::endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 924,063 | 924,064 | u922974720 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> L;
int A, B, C;
int ans = 1e9;
void dfs(int depth, int a, int b, int c, int mp) {
if (depth == N) { //ベースケース
if (a > 0 && b > 0 && c > 0) {
mp += abs(a - A) + abs(b - B) + abs(c - C);
ans = min(ans, mp - 30);
} else {
return;
}
}
dfs(depth + 1, a + L[depth], b, c, mp + 10);
dfs(depth + 1, a, b + L[depth], c, mp + 10);
dfs(depth + 1, a, b, c + L[depth], mp + 10);
dfs(depth + 1, a, b, c, mp);
}
int main() {
cin >> N >> A >> B >> C;
L.resize(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
dfs(0, 0, 0, 0, 0);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> L;
int A, B, C;
int ans = 1e9;
void dfs(int depth, int a, int b, int c, int mp) {
if (depth == N) { //ベースケース
if (a > 0 && b > 0 && c > 0) {
mp += abs(a - A) + abs(b - B) + abs(c - C);
ans = min(ans, mp - 30);
return;
} else {
return;
}
}
dfs(depth + 1, a + L[depth], b, c, mp + 10);
dfs(depth + 1, a, b + L[depth], c, mp + 10);
dfs(depth + 1, a, b, c + L[depth], mp + 10);
dfs(depth + 1, a, b, c, mp);
}
int main() {
cin >> N >> A >> B >> C;
L.resize(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
dfs(0, 0, 0, 0, 0);
cout << ans << endl;
return 0;
}
| [
"control_flow.return.add"
] | 924,072 | 924,073 | u904123392 | cpp |
p03111 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int N, A, B, C;
vector<int> l;
int dfs(int depth, int La, int Lb, int Lc) {
if (depth == N + 1) {
if (La != 0 && Lb != 0 && Lc != 0) {
return abs(A - La) + abs(Lb - B) + abs(Lc - C) - 30;
}
} else {
return (1 << 29);
}
int r1 = dfs(depth + 1, La + l[depth], Lb, Lc) + 10;
int r2 = dfs(depth + 1, La, Lb + l[depth], Lc) + 10;
int r3 = dfs(depth + 1, La, Lb, Lc + l[depth]) + 10;
int r4 = dfs(depth + 1, La, Lb, Lc);
return min(min(r1, r2), min(r3, r4));
}
int main() {
cin >> N >> A >> B >> C;
l.resize(N + 1);
for (int i = 1; i <= N; i++) {
cin >> l[i];
} // 1-indexed
cout << dfs(1, 0, 0, 0) << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int N, A, B, C;
vector<int> l;
int dfs(int depth, int La, int Lb, int Lc) {
if (depth == N + 1) {
if (La != 0 && Lb != 0 && Lc != 0) {
return abs(A - La) + abs(Lb - B) + abs(Lc - C) - 30;
} else {
return (1 << 29);
}
}
int r1 = dfs(depth + 1, La + l[depth], Lb, Lc) + 10;
int r2 = dfs(depth + 1, La, Lb + l[depth], Lc) + 10;
int r3 = dfs(depth + 1, La, Lb, Lc + l[depth]) + 10;
int r4 = dfs(depth + 1, La, Lb, Lc);
return min(min(r1, r2), min(r3, r4));
}
int main() {
cin >> N >> A >> B >> C;
l.resize(N + 1);
for (int i = 1; i <= N; i++) {
cin >> l[i];
} // 1-indexed
cout << dfs(1, 0, 0, 0) << endl;
return 0;
}
| [] | 924,074 | 924,075 | u904123392 | cpp |
p03111 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
const int inf = 1 << 29;
int N, A, B, C;
vector<int> l;
int dfs(int depth, int LA, int LB, int LC) {
if (depth == N) {
if (LA > 0 && LB > 0 && LC > 0) {
return abs(A - LA) + abs(B - LB) + abs(C - LC) - 30;
} else {
return inf;
}
} else {
int c1 = dfs(depth + 1, LA + l[depth], LB, LC) + 10;
int c2 = dfs(depth + 1, LA, LB + l[depth], LC) + 10;
int c3 = dfs(depth + 1, LA, LB, LC + l[depth]) + 10;
int c4 = dfs(depth + 1, LA, LB, LC);
return min(min(c1, c2), (c3, c4));
}
}
int main() {
cin >> N >> A >> B >> C;
l.resize(N);
for (int i = 0; i < N; i++) {
cin >> l[i];
}
cout << dfs(0, 0, 0, 0) << endl;
return 0;
}
| #include <iostream>
#include <string>
#include <vector>
using namespace std;
const int inf = 1 << 29;
int N, A, B, C;
vector<int> l;
int dfs(int depth, int LA, int LB, int LC) {
if (depth == N) {
if (LA > 0 && LB > 0 && LC > 0) {
return abs(A - LA) + abs(B - LB) + abs(C - LC) - 30;
} else {
return inf;
}
} else {
int c1 = dfs(depth + 1, LA + l[depth], LB, LC) + 10;
int c2 = dfs(depth + 1, LA, LB + l[depth], LC) + 10;
int c3 = dfs(depth + 1, LA, LB, LC + l[depth]) + 10;
int c4 = dfs(depth + 1, LA, LB, LC);
return min(min(c1, c2), min(c3, c4));
}
}
int main() {
cin >> N >> A >> B >> C;
l.resize(N);
for (int i = 0; i < N; i++) {
cin >> l[i];
}
cout << dfs(0, 0, 0, 0) << endl;
return 0;
}
| [
"call.add",
"call.arguments.change",
"function.return_value.change"
] | 924,076 | 924,077 | u904123392 | cpp |
p03111 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
const int inf = 1 << 29;
int N, A, B, C;
vector<int> l;
int dfs(int depth, int LA, int LB, int LC) {
if (depth == N) {
if (LA > 0 && LB > 0 && LC > 0) {
return abs(A - LA) + abs(B - LB) + abs(C - LC) - 30;
} else {
return inf;
}
} else {
int c1 = dfs(depth + 1, LA + l[depth], LB, LC) + 10;
int c2 = dfs(depth + 1, LA, LB + l[depth], LC) + 10;
int c3 = dfs(depth + 1, LA, LB, LC + l[depth]) + 10;
int c4 = dfs(depth + 1, LA, LB, LC) + 10;
return min(min(c1, c2), (c3, c4));
}
}
int main() {
cin >> N >> A >> B >> C;
l.resize(N);
for (int i = 0; i < N; i++) {
cin >> l[i];
}
cout << dfs(0, 0, 0, 0) << endl;
return 0;
}
| #include <iostream>
#include <string>
#include <vector>
using namespace std;
const int inf = 1 << 29;
int N, A, B, C;
vector<int> l;
int dfs(int depth, int LA, int LB, int LC) {
if (depth == N) {
if (LA > 0 && LB > 0 && LC > 0) {
return abs(A - LA) + abs(B - LB) + abs(C - LC) - 30;
} else {
return inf;
}
} else {
int c1 = dfs(depth + 1, LA + l[depth], LB, LC) + 10;
int c2 = dfs(depth + 1, LA, LB + l[depth], LC) + 10;
int c3 = dfs(depth + 1, LA, LB, LC + l[depth]) + 10;
int c4 = dfs(depth + 1, LA, LB, LC);
return min(min(c1, c2), min(c3, c4));
}
}
int main() {
cin >> N >> A >> B >> C;
l.resize(N);
for (int i = 0; i < N; i++) {
cin >> l[i];
}
cout << dfs(0, 0, 0, 0) << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"call.add",
"call.arguments.change",
"function.return_value.change"
] | 924,078 | 924,077 | u904123392 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int N;
int A, B, C;
int l[1010];
int dfs(int a, int b, int c, int i) {
if (i == N) {
if (a != 0 || b != 0 || c != 0) {
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
} else
return 1e9;
}
int ans = dfs(a, b, c, i + 1);
ans = min(ans, dfs(a + l[i], b, c, i + 1) + 10);
ans = min(ans, dfs(a, b + l[i], c, i + 1) + 10);
ans = min(ans, dfs(a, b, c + l[i], i + 1) + 10);
return ans;
}
int main(void) {
cin >> N;
cin >> A >> B >> C;
for (int i = 0; i < N; i++)
cin >> l[i];
int ans = dfs(0, 0, 0, 0);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int N;
int A, B, C;
int l[9];
int dfs(int a, int b, int c, int i) {
if (i == N) {
if (a != 0 && b != 0 && c != 0) {
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
} else
return 1e9;
}
int ans = dfs(a, b, c, i + 1);
ans = min(ans, dfs(a + l[i], b, c, i + 1) + 10);
ans = min(ans, dfs(a, b + l[i], c, i + 1) + 10);
ans = min(ans, dfs(a, b, c + l[i], i + 1) + 10);
return ans;
}
int main(void) {
cin >> N;
cin >> A >> B >> C;
for (int i = 0; i < N; i++)
cin >> l[i];
int ans = dfs(0, 0, 0, 0);
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 924,079 | 924,080 | u998251394 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int N;
int A, B, C;
int l[9];
int dfs(int a, int b, int c, int i) {
if (i == N) {
if (a != 0 || b != 0 || c != 0) {
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
} else
return 1e9;
}
int ans = dfs(a, b, c, i + 1);
ans = min(ans, dfs(a + l[i], b, c, i + 1) + 10);
ans = min(ans, dfs(a, b + l[i], c, i + 1) + 10);
ans = min(ans, dfs(a, b, c + l[i], i + 1) + 10);
return ans;
}
int main(void) {
cin >> N;
cin >> A >> B >> C;
for (int i = 0; i < N; i++)
cin >> l[i];
int ans = dfs(0, 0, 0, 0);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int N;
int A, B, C;
int l[9];
int dfs(int a, int b, int c, int i) {
if (i == N) {
if (a != 0 && b != 0 && c != 0) {
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
} else
return 1e9;
}
int ans = dfs(a, b, c, i + 1);
ans = min(ans, dfs(a + l[i], b, c, i + 1) + 10);
ans = min(ans, dfs(a, b + l[i], c, i + 1) + 10);
ans = min(ans, dfs(a, b, c + l[i], i + 1) + 10);
return ans;
}
int main(void) {
cin >> N;
cin >> A >> B >> C;
for (int i = 0; i < N; i++)
cin >> l[i];
int ans = dfs(0, 0, 0, 0);
cout << ans << endl;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 924,081 | 924,080 | u998251394 | cpp |
p03111 | // SeeAlso: https://atcoder.jp/contests/abc119/tasks/abc119_c
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MAX 100000
typedef int _loop_int;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < (_loop_int)(b); ++i)
#define FORR(i, a, b) \
for (_loop_int i = (_loop_int)(b)-1; i >= (_loop_int)(a); --i)
#define DEBUG(x) cout << #x << ": " << x << endl
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << " " << v[i]; \
cout << endl
#define ALL(a) (a).begin(), (a).end()
#define CHMIN(a, b) a = min((a), (b))
#define CHMAX(a, b) a = max((a), (b))
// 最大公約数
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
// 最小公倍数
inline constexpr ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
#define print2D(h, w, arr) \
REP(i, h) { \
REP(j, w) cout << arr[i][j] << " "; \
cout << endl; \
}
template <class T> void print(const T &x) {
cout << setprecision(12) << x << endl;
}
template <class T, class... A> void print(const T &first, const A &...rest) {
cout << first << " ";
print(rest...);
}
int N, A, B, C;
int l[MAX];
int dfs(int n, int a, int b, int c) {
if (n == N) {
if (min(a, min(b, c)) <= 0) {
return 50;
} else {
return abs(A - a) + abs(B - b) + abs(C - c) - 30;
}
}
int r1 = dfs(n + 1, a, b, c);
int r2 = dfs(n + 1, a + l[n], b, c) + 10;
int r3 = dfs(n + 1, a, b + l[n], c) + 10;
int r4 = dfs(n + 1, a, b, c + l[n]) + 10;
int m1 = min(r1, r2);
int m2 = min(r3, r4);
return min(m1, m2);
}
int main() {
cin >> N >> A >> B >> C;
REP(i, N) { cin >> l[i]; }
print(dfs(0, 0, 0, 0));
return 0;
}
| // SeeAlso: https://atcoder.jp/contests/abc119/tasks/abc119_c
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MAX 100000
typedef int _loop_int;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < (_loop_int)(b); ++i)
#define FORR(i, a, b) \
for (_loop_int i = (_loop_int)(b)-1; i >= (_loop_int)(a); --i)
#define DEBUG(x) cout << #x << ": " << x << endl
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << " " << v[i]; \
cout << endl
#define ALL(a) (a).begin(), (a).end()
#define CHMIN(a, b) a = min((a), (b))
#define CHMAX(a, b) a = max((a), (b))
// 最大公約数
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
// 最小公倍数
inline constexpr ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
#define print2D(h, w, arr) \
REP(i, h) { \
REP(j, w) cout << arr[i][j] << " "; \
cout << endl; \
}
template <class T> void print(const T &x) {
cout << setprecision(12) << x << endl;
}
template <class T, class... A> void print(const T &first, const A &...rest) {
cout << first << " ";
print(rest...);
}
int N, A, B, C;
int l[MAX];
int dfs(int n, int a, int b, int c) {
if (n == N) {
if (min(a, min(b, c)) <= 0) {
return 100000;
} else {
return abs(A - a) + abs(B - b) + abs(C - c) - 30;
}
}
int r1 = dfs(n + 1, a, b, c);
int r2 = dfs(n + 1, a + l[n], b, c) + 10;
int r3 = dfs(n + 1, a, b + l[n], c) + 10;
int r4 = dfs(n + 1, a, b, c + l[n]) + 10;
int m1 = min(r1, r2);
int m2 = min(r3, r4);
return min(m1, m2);
}
int main() {
cin >> N >> A >> B >> C;
REP(i, N) { cin >> l[i]; }
print(dfs(0, 0, 0, 0));
return 0;
}
| [
"literal.number.change",
"function.return_value.change"
] | 924,090 | 924,091 | u185518252 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = int(1e5) + 7;
int n, a, b, c;
int ARR[10];
int dfs(int curr, int A, int B, int C) {
if (curr == n) {
if (min({a, b, c}) <= 0)
return (1 << 30);
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
}
int r1 = dfs(curr + 1, A, B, C);
int r2 = dfs(curr + 1, A + ARR[curr], B, C) + 10;
int r3 = dfs(curr + 1, A, B + ARR[curr], C) + 10;
int r4 = dfs(curr + 1, A, B, C + ARR[curr]) + 10;
return min({r1, r2, r3, r4});
}
void solve() {
scanf("%d%d%d%d", &n, &a, &b, &c);
for (int i = 0; i < n; i++)
scanf("%d", &ARR[i]);
printf("%d\n", dfs(0, 0, 0, 0));
}
int main() {
int test_cases_number = 1;
// scanf("%d", &test_cases_number);
// ios_base::sync_with_stdio(0);
// cin.tie(0); cout.tie(0);
// cin >> test_cases_number;
for (int i = 0; i < test_cases_number; i++)
solve();
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = int(1e5) + 7;
int n, a, b, c;
int ARR[10];
int dfs(int curr, int A, int B, int C) {
if (curr == n) {
if (min({A, B, C}) <= 0)
return (1 << 30);
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
}
int r1 = dfs(curr + 1, A, B, C);
int r2 = dfs(curr + 1, A + ARR[curr], B, C) + 10;
int r3 = dfs(curr + 1, A, B + ARR[curr], C) + 10;
int r4 = dfs(curr + 1, A, B, C + ARR[curr]) + 10;
return min({r1, r2, r3, r4});
}
void solve() {
scanf("%d%d%d%d", &n, &a, &b, &c);
for (int i = 0; i < n; i++)
scanf("%d", &ARR[i]);
printf("%d\n", dfs(0, 0, 0, 0));
}
int main() {
int test_cases_number = 1;
// scanf("%d", &test_cases_number);
// ios_base::sync_with_stdio(0);
// cin.tie(0); cout.tie(0);
// cin >> test_cases_number;
for (int i = 0; i < test_cases_number; i++)
solve();
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 924,092 | 924,093 | u800645121 | cpp |
p03111 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
#define INF 10000000
using ll = long long;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
using namespace std;
vector<int> l;
int N, A, B, C;
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (min({a, b, c}) > 0)
return abs(A - a) + abs(B - b) + abs(C - c) - 30;
else
return INF;
int ret0 = dfs(cur + 1, a, b, c);
int ret1 = dfs(cur + 1, a + l[cur], b, c) + 10;
int ret2 = dfs(cur + 1, a, b + l[cur], c) + 10;
int ret3 = dfs(cur + 1, a, b, c + l[cur]) + 10;
return min({ret0, ret1, ret2, ret3});
}
}
int main() {
cin >> N >> A >> B >> C;
rep(i, N) {
int t;
cin >> t;
l.push_back(t);
}
int ans = dfs(0, 0, 0, 0);
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
#define INF 10000000
using ll = long long;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
using namespace std;
vector<int> l;
int N, A, B, C;
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (min({a, b, c}) > 0)
return abs(A - a) + abs(B - b) + abs(C - c) - 30;
else
return INF;
}
int ret0 = dfs(cur + 1, a, b, c);
int ret1 = dfs(cur + 1, a + l[cur], b, c) + 10;
int ret2 = dfs(cur + 1, a, b + l[cur], c) + 10;
int ret3 = dfs(cur + 1, a, b, c + l[cur]) + 10;
return min({ret0, ret1, ret2, ret3});
}
int main() {
cin >> N >> A >> B >> C;
rep(i, N) {
int t;
cin >> t;
l.push_back(t);
}
int ans = dfs(0, 0, 0, 0);
cout << ans << endl;
} | [] | 924,096 | 924,097 | u975481854 | cpp |
p03111 | #include <algorithm>
#include <iostream>
int N, A, B, C;
int INF = 1000000000;
int *l;
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (std::min({a, b, c}) < 0) {
return INF;
}
return std::abs(a - A) + std::abs(b - B) + std::abs(c - C) - 30;
}
int ret0 = dfs(cur + 1, a, b, c);
int ret1 = dfs(cur + 1, a + l[cur], b, c) + 10;
int ret2 = dfs(cur + 1, a, b + l[cur], c) + 10;
int ret3 = dfs(cur + 1, a, b, c + l[cur]) + 10;
return std::min({ret0, ret1, ret2, ret3});
}
int main() {
std::cin >> N >> A >> B >> C;
int in[N];
for (int i = 0; i < N; i++) {
std::cin >> in[i];
}
l = in;
std::cout << dfs(0, 0, 0, 0);
} | #include <algorithm>
#include <iostream>
int N, A, B, C;
int INF = 1000000000;
int *l;
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (std::min({a, b, c}) <= 0) {
return INF;
}
return std::abs(a - A) + std::abs(b - B) + std::abs(c - C) - 30;
}
int ret0 = dfs(cur + 1, a, b, c);
int ret1 = dfs(cur + 1, a + l[cur], b, c) + 10;
int ret2 = dfs(cur + 1, a, b + l[cur], c) + 10;
int ret3 = dfs(cur + 1, a, b, c + l[cur]) + 10;
return std::min({ret0, ret1, ret2, ret3});
}
int main() {
std::cin >> N >> A >> B >> C;
int in[N];
for (int i = 0; i < N; i++) {
std::cin >> in[i];
}
l = in;
std::cout << dfs(0, 0, 0, 0);
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 924,100 | 924,101 | u815222360 | cpp |
p03111 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v), h, sizeof(v))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
ll N, A, B, C;
vector<int> L;
int rec(int i, int a, int b, int c) {
if (i == N) {
if (!a || !b || !c)
return INT_MAX;
return abs(a - A) + abs(b - B) + abs(c - C);
}
int res = rec(i + 1, a, b, c);
chmin(res, rec(i + 1, a + L[i], b, c) + (a ? 10 : 0));
chmin(res, rec(i + 1, a, b + L[i], c) + (b ? 10 : 0));
chmin(res, rec(i + 1, a, b, c + L[i]) + (c ? 10 : 0));
return res;
}
int main() {
cin >> N >> A >> B >> C;
L.resize(N);
for (int i = 0; i < N; ++i)
cin >> L[i];
cout << rec(0, 0, 0, 0) << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v), h, sizeof(v))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
ll N, A, B, C;
vector<int> L;
int rec(int i, int a, int b, int c) {
if (i == N) {
if (!a || !b || !c)
return 1e9;
return abs(a - A) + abs(b - B) + abs(c - C);
}
int res = rec(i + 1, a, b, c);
chmin(res, rec(i + 1, a + L[i], b, c) + (a ? 10 : 0));
chmin(res, rec(i + 1, a, b + L[i], c) + (b ? 10 : 0));
chmin(res, rec(i + 1, a, b, c + L[i]) + (c ? 10 : 0));
return res;
}
int main() {
cin >> N >> A >> B >> C;
L.resize(N);
for (int i = 0; i < N; ++i)
cin >> L[i];
cout << rec(0, 0, 0, 0) << endl;
} | [
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change"
] | 924,105 | 924,106 | u135572611 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int N, A, B, C;
vector<int> bamboo;
int dfs(int depth, int a, int b, int c) {
if (depth == N) {
if (a == 0 && b == 0 && c == 0)
return INT_MAX;
return abs(A - a) + abs(B - b) + abs(C - c);
}
int ans = dfs(depth + 1, a, b, c);
if (a >= 1) {
ans = (min)({ans, dfs(depth + 1, a + bamboo[depth], b, c) + 10});
} else
ans = (min)({ans, dfs(depth + 1, a + bamboo[depth], b, c)});
if (b >= 1) {
ans = (min)({ans, dfs(depth + 1, a, b + bamboo[depth], c) + 10});
} else
ans = (min)({ans, dfs(depth + 1, a, b + bamboo[depth], c)});
if (c >= 1) {
ans = (min)({ans, dfs(depth + 1, a, b, c + bamboo[depth]) + 10});
} else
ans = (min)({ans, dfs(depth + 1, a, b, c + bamboo[depth])});
return ans;
}
int main(void) {
cin >> N >> A >> B >> C;
bamboo.resize(N + 1);
for (int i = 0; i < N; i++) {
cin >> bamboo[i];
}
cout << dfs(0, 0, 0, 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int N, A, B, C;
vector<int> bamboo;
int dfs(int depth, int a, int b, int c) {
if (depth == N) {
if (a == 0 || b == 0 || c == 0)
return 1000000000;
return abs(A - a) + abs(B - b) + abs(C - c);
}
int ans = dfs(depth + 1, a, b, c);
if (a >= 1) {
ans = (min)({ans, dfs(depth + 1, a + bamboo[depth], b, c) + 10});
} else
ans = (min)({ans, dfs(depth + 1, a + bamboo[depth], b, c)});
if (b >= 1) {
ans = (min)({ans, dfs(depth + 1, a, b + bamboo[depth], c) + 10});
} else
ans = (min)({ans, dfs(depth + 1, a, b + bamboo[depth], c)});
if (c >= 1) {
ans = (min)({ans, dfs(depth + 1, a, b, c + bamboo[depth]) + 10});
} else
ans = (min)({ans, dfs(depth + 1, a, b, c + bamboo[depth])});
return ans;
}
int main(void) {
cin >> N >> A >> B >> C;
bamboo.resize(N + 1);
for (int i = 0; i < N; i++) {
cin >> bamboo[i];
}
cout << dfs(0, 0, 0, 0) << endl;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change"
] | 924,117 | 924,118 | u728702354 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
int main() {
int N, A, B, C;
cin >> N >> A >> B >> C;
vector<int> l(N);
for (int i = 0; i < N; i++)
cin >> l.at(i);
long long ans = INF;
for (int i = 0; i < pow(4, N); i++) {
long long at = 0, bt = 0, ct = 0;
long long al = 0, bl = 0, cl = 0;
for (int j = 0, p = 1; j < N; j++) {
int Z = (i / p) % 4;
if (Z == 1) {
at++;
al += l.at(j);
} else if (Z == 2) {
bt++;
bl += l.at(j);
} else if (Z == 3) {
ct++;
cl += l.at(j);
}
p *= j;
}
if (at > 0 && bt > 0 && ct > 0) {
long long MP =
(at + bt + ct - 3) * 10 + abs(A - al) + abs(B - bl) + abs(C - cl);
chmin(ans, MP);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
int main() {
int N, A, B, C;
cin >> N >> A >> B >> C;
vector<int> l(N);
for (int i = 0; i < N; i++)
cin >> l.at(i);
long long ans = INF;
for (int i = 0; i < pow(4, N); i++) {
long long at = 0, bt = 0, ct = 0;
long long al = 0, bl = 0, cl = 0;
for (int j = 0, p = 1; j < N; j++) {
int Z = (i / p) % 4;
if (Z == 1) {
at++;
al += l.at(j);
} else if (Z == 2) {
bt++;
bl += l.at(j);
} else if (Z == 3) {
ct++;
cl += l.at(j);
}
p *= 4;
}
if (at > 0 && bt > 0 && ct > 0) {
long long MP =
(at + bt + ct - 3) * 10 + abs(A - al) + abs(B - bl) + abs(C - cl);
chmin(ans, MP);
}
}
cout << ans << endl;
} | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 924,126 | 924,127 | u811472478 | cpp |
p03111 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
typedef long long ll;
using namespace std;
int N, A, B, C;
int l[1004];
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (min(A, min(B, C)) > 0)
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
else
return 100000000;
}
int ret[4] = {0};
ret[0] = dfs(cur + 1, a, b, c);
ret[1] = dfs(cur + 1, a + l[cur], b, c) + 10;
ret[2] = dfs(cur + 1, a, b + l[cur], c) + 10;
ret[3] = dfs(cur + 1, a, b, c + l[cur]) + 10;
return min(ret[0], min(ret[1], min(ret[2], ret[3])));
}
int main() {
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++) {
cin >> l[i];
}
cout << dfs(0, 0, 0, 0) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
typedef long long ll;
using namespace std;
int N, A, B, C;
int l[1004];
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (min(a, min(b, c)) > 0)
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
else
return 1000000000;
}
int ret[4] = {0};
ret[0] = dfs(cur + 1, a, b, c);
ret[1] = dfs(cur + 1, a + l[cur], b, c) + 10;
ret[2] = dfs(cur + 1, a, b + l[cur], c) + 10;
ret[3] = dfs(cur + 1, a, b, c + l[cur]) + 10;
return min(ret[0], min(ret[1], min(ret[2], ret[3])));
}
int main() {
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++) {
cin >> l[i];
}
cout << dfs(0, 0, 0, 0) << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"function.return_value.change"
] | 924,132 | 924,133 | u831873811 | cpp |
p03111 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define push emplace_back
#define each(i, x) for (auto i = 0; i < x; i++)
#define INF LLONG_MAX;
// using ull = unsigned long long;
using ull = long long;
using namespace std;
template <typename T> inline void dump(const T &x) {
cout << "[" << x << "]" << endl;
}
template <typename T> inline void dump(const vector<T> &x) {
for (const auto v : x) {
cout << v << " ";
}
cout << endl;
}
template <typename T> inline void sort_asc(vector<T> &x) {
std::sort(x.begin(), x.end());
}
template <typename T> inline void sort_desc(vector<T> &x) {
std::sort(x.begin(), x.end(), greater<T>());
}
/**
* @param bottom 与えられた竹の本数
* @param l 竹配列
* @param A 求めたいAの長さ
* @param B 求めたいBの長さ
* @param C 求めたいCの長さ
* @param depth 探索中の深さ
* @param a 現在までのAの長さ
* @param b 現在までのBの長さ
* @param c 現在までのCの長さ
*/
ull dfs(ull bottom, const vector<ull> &l, ull A, ull B, ull C, ull depth, ull a,
ull b, ull c) {
if (depth == bottom) {
// 最下層まで行ったので延長魔法と短縮魔法を使用してMPを算出 (無は除外)
if (a > 0 && b > 0 && c > 0) {
return abs(A - a) + abs(B - b) + abs(C - c) - 30;
} else {
return INF;
}
}
vector<ull> res;
// 選ばない
res.push(dfs(bottom, l, A, B, C, depth + 1, a, b, c));
// Aの材料にする
res.push(dfs(bottom, l, A, B, C, depth + 1, a + l[depth], b, c) + 10);
// Bの材料にする
res.push(dfs(bottom, l, A, B, C, depth + 1, a, b + l[depth], c) + 10);
// Cの材料にする
res.push(dfs(bottom, l, A, B, C, depth + 1, a, b, c + l[depth]) + 10);
return *min_element(res.begin(), res.end());
}
int main() {
ull n, a, b, c;
vector<ull> l;
cin >> n >> a >> b >> c;
each(i, n) {
ull tmp;
cin >> tmp;
l.push(tmp);
}
/*
1.
延長短縮したあとにがっちゃんこするのと、がっちゃんこしたあとに延長短縮するのは手数が同じ
2.
延長短縮は求めたい値A,B,Cとがっちゃんこ後の絶対値差分ですぐわかるので、まずはがっちゃんこする
3. 所有している竹に対して採用できる選択肢は下記
(1) 求めたい竹長Aの材料にする
(2) 求めたい竹長Bの材料にする
(3) 求めたい竹長Cの材料にする
(4) どこにも使わない
4. 各竹(最大8本)に対して(1)〜(4)を採用するので、フルケースで4 ^ 8 =
65536通り l (竹1) : (1)〜(4)のいずれかを採用 l (竹2) :
(1)〜(4)のいずれかを採用 l (竹3) : (1)〜(4)のいずれかを採用 l (竹4) :
(1)〜(4)のいずれかを採用 l (竹5) : (1)〜(4)のいずれかを採用 l (竹6) :
(1)〜(4)のいずれかを採用 l (竹7) : (1)〜(4)のいずれかを採用 l (竹8) :
(1)〜(4)のいずれかを採用
5. AもBもCも1以上
*/
auto r = dfs(n, l, a, b, c, 0, 0, 0, 0);
cout << r << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define push emplace_back
#define each(i, x) for (auto i = 0; i < x; i++)
#define INF LLONG_MAX;
// using ull = unsigned long long;
using ull = long long;
using namespace std;
template <typename T> inline void dump(const T &x) {
cout << "[" << x << "]" << endl;
}
template <typename T> inline void dump(const vector<T> &x) {
for (const auto v : x) {
cout << v << " ";
}
cout << endl;
}
template <typename T> inline void sort_asc(vector<T> &x) {
std::sort(x.begin(), x.end());
}
template <typename T> inline void sort_desc(vector<T> &x) {
std::sort(x.begin(), x.end(), greater<T>());
}
/**
* @param bottom 与えられた竹の本数
* @param l 竹配列
* @param A 求めたいAの長さ
* @param B 求めたいBの長さ
* @param C 求めたいCの長さ
* @param depth 探索中の深さ
* @param a 現在までのAの長さ
* @param b 現在までのBの長さ
* @param c 現在までのCの長さ
*/
ull dfs(ull bottom, const vector<ull> &l, ull A, ull B, ull C, ull depth, ull a,
ull b, ull c) {
if (depth == bottom) {
// 最下層まで行ったので延長魔法と短縮魔法を使用してMPを算出 (無は除外)
if (a > 0 && b > 0 && c > 0) {
return abs(A - a) + abs(B - b) + abs(C - c) - 30;
} else {
return pow(10, 9);
}
}
vector<ull> res;
// 選ばない
res.push(dfs(bottom, l, A, B, C, depth + 1, a, b, c));
// Aの材料にする
res.push(dfs(bottom, l, A, B, C, depth + 1, a + l[depth], b, c) + 10);
// Bの材料にする
res.push(dfs(bottom, l, A, B, C, depth + 1, a, b + l[depth], c) + 10);
// Cの材料にする
res.push(dfs(bottom, l, A, B, C, depth + 1, a, b, c + l[depth]) + 10);
return *min_element(res.begin(), res.end());
}
int main() {
ull n, a, b, c;
vector<ull> l;
cin >> n >> a >> b >> c;
each(i, n) {
ull tmp;
cin >> tmp;
l.push(tmp);
}
/*
1.
延長短縮したあとにがっちゃんこするのと、がっちゃんこしたあとに延長短縮するのは手数が同じ
2.
延長短縮は求めたい値A,B,Cとがっちゃんこ後の絶対値差分ですぐわかるので、まずはがっちゃんこする
3. 所有している竹に対して採用できる選択肢は下記
(1) 求めたい竹長Aの材料にする
(2) 求めたい竹長Bの材料にする
(3) 求めたい竹長Cの材料にする
(4) どこにも使わない
4. 各竹(最大8本)に対して(1)〜(4)を採用するので、フルケースで4 ^ 8 =
65536通り l (竹1) : (1)〜(4)のいずれかを採用 l (竹2) :
(1)〜(4)のいずれかを採用 l (竹3) : (1)〜(4)のいずれかを採用 l (竹4) :
(1)〜(4)のいずれかを採用 l (竹5) : (1)〜(4)のいずれかを採用 l (竹6) :
(1)〜(4)のいずれかを採用 l (竹7) : (1)〜(4)のいずれかを採用 l (竹8) :
(1)〜(4)のいずれかを採用
5. AもBもCも1以上
*/
auto r = dfs(n, l, a, b, c, 0, 0, 0, 0);
cout << r << endl;
return 0;
}
| [
"function.return_value.change",
"call.arguments.add"
] | 924,134 | 924,135 | u244806387 | cpp |
p03111 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll) INF *INF
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(i, a, n) for (int i = a; i < (n); i++)
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef vector<pii> vp;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int N, A, B, C;
int l[9];
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (min({a, b, c}) > 0)
return abs(A - a) + abs(B - b) + abs(C - c) - 30;
else
return INF;
}
int rec0 = dfs(cur + 1, a + l[cur], b, c) + 10;
int rec1 = dfs(cur + 1, a, b + l[cur], c) + 10;
int rec2 = dfs(cur + 1, a, b, c + l[cur]) + 10;
int rec3 = dfs(cur + 1, a, b, c);
return min({rec0, rec1, rec2, rec3});
}
signed main(void) {
cin >> N >> A >> B >> C;
rep(i, N) cin >> l[i];
dfs(0, 0, 0, 0);
}
| #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll) INF *INF
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(i, a, n) for (int i = a; i < (n); i++)
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef vector<pii> vp;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int N, A, B, C;
int l[9];
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (min({a, b, c}) > 0)
return abs(A - a) + abs(B - b) + abs(C - c) - 30;
else
return INF;
}
int rec0 = dfs(cur + 1, a + l[cur], b, c) + 10;
int rec1 = dfs(cur + 1, a, b + l[cur], c) + 10;
int rec2 = dfs(cur + 1, a, b, c + l[cur]) + 10;
int rec3 = dfs(cur + 1, a, b, c);
return min({rec0, rec1, rec2, rec3});
}
signed main(void) {
cin >> N >> A >> B >> C;
rep(i, N) cin >> l[i];
cout << dfs(0, 0, 0, 0) << endl;
}
| [
"io.output.change",
"io.output.newline.add"
] | 924,136 | 924,137 | u332843157 | cpp |
p03111 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ll long long
#define eps 1e-8
#define inf 1e6
using namespace std;
vector<int> v;
int n, A, B, C;
int dfs(int pos, int a, int b, int c) {
if (pos == n) {
if (min({a, b, c}) >= 0)
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
else
return inf;
}
int q = dfs(pos + 1, a, b, c), w = dfs(pos + 1, a + v[pos], b, c) + 10,
e = dfs(pos + 1, a, b + v[pos], c) + 10,
r = dfs(pos + 1, a, b, c + v[pos]) + 10;
return min({q, w, e, r});
}
int main() {
speed;
cin >> n >> A >> B >> C;
v.resize(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
cout << dfs(0, 0, 0, 0);
} | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ll long long
#define eps 1e-8
#define inf 1e6
using namespace std;
vector<int> v;
int n, A, B, C;
int dfs(int pos, int a, int b, int c) {
if (pos == n) {
if (min({a, b, c}) > 0)
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
else
return inf;
}
int q = dfs(pos + 1, a, b, c), w = dfs(pos + 1, a + v[pos], b, c) + 10,
e = dfs(pos + 1, a, b + v[pos], c) + 10,
r = dfs(pos + 1, a, b, c + v[pos]) + 10;
return min({q, w, e, r});
}
int main() {
speed;
cin >> n >> A >> B >> C;
v.resize(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
cout << dfs(0, 0, 0, 0);
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 924,146 | 924,147 | u330326085 | cpp |
p03111 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ll long long
#define eps 1e-8
#define inf INT_MAX
using namespace std;
vector<int> v;
int n, A, B, C;
int dfs(int pos, int a, int b, int c) {
if (pos == n) {
if (min({a, b, c}) >= 0)
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
else
return inf;
}
int q = dfs(pos + 1, a, b, c), w = dfs(pos + 1, a + v[pos], b, c) + 10,
e = dfs(pos + 1, a, b + v[pos], c) + 10,
r = dfs(pos + 1, a, b, c + v[pos]) + 10;
return min({q, w, e, r});
}
int main() {
speed;
cin >> n >> A >> B >> C;
v.resize(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
cout << dfs(0, 0, 0, 0);
} | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ll long long
#define eps 1e-8
#define inf 1e6
using namespace std;
vector<int> v;
int n, A, B, C;
int dfs(int pos, int a, int b, int c) {
if (pos == n) {
if (min({a, b, c}) > 0)
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
else
return inf;
}
int q = dfs(pos + 1, a, b, c), w = dfs(pos + 1, a + v[pos], b, c) + 10,
e = dfs(pos + 1, a, b + v[pos], c) + 10,
r = dfs(pos + 1, a, b, c + v[pos]) + 10;
return min({q, w, e, r});
}
int main() {
speed;
cin >> n >> A >> B >> C;
v.resize(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
cout << dfs(0, 0, 0, 0);
}
| [
"preprocessor.define.value.change",
"literal.float.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 924,148 | 924,147 | u330326085 | cpp |
p03111 | #define rep(i, x) for (int i = 0; i < x; i++)
#define mod 1000000007
#define MOD 998244353
#define inf 1e20
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p;
typedef complex<double> com;
int main() {
ll n, a, b, c;
cin >> n >> a >> b >> c;
vector<int> f(n);
rep(i, n) { cin >> f[i]; }
ll ans = inf;
rep(i, pow(4, n)) {
ll sub = 0;
ll aa = 0, bb = 0, cc = 0;
ll cnta = 0, cntb = 0, cntc = 0;
rep(j, n) {
int s = i / pow(4, j);
if (s % 4 == 1) {
aa += f[j];
cnta++;
}
if (s % 4 == 2) {
bb += f[j];
cntb++;
}
if (s % 4 == 3) {
cc += f[j];
cntc++;
}
}
if (min(aa, min(bb, cc)) > 0) {
sub = abs(aa - a) + abs(bb - b) + abs(cc - c);
} else {
sub = inf;
}
if (cnta != 0)
sub += (cnta - 1) * 10;
if (cntb != 0)
sub += (cntb - 1) * 10;
if (cntc != 0)
sub += (cntc - 1) * 10;
ans = min(ans, sub);
}
cout << ans << endl;
return 0;
} | #define rep(i, x) for (int i = 0; i < x; i++)
#define mod 1000000007
#define MOD 998244353
#define inf 1e18
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p;
typedef complex<double> com;
int main() {
ll n, a, b, c;
cin >> n >> a >> b >> c;
vector<int> f(n);
rep(i, n) { cin >> f[i]; }
ll ans = inf;
rep(i, pow(4, n)) {
ll sub = 0;
ll aa = 0, bb = 0, cc = 0;
ll cnta = 0, cntb = 0, cntc = 0;
rep(j, n) {
int s = i / pow(4, j);
if (s % 4 == 1) {
aa += f[j];
cnta++;
}
if (s % 4 == 2) {
bb += f[j];
cntb++;
}
if (s % 4 == 3) {
cc += f[j];
cntc++;
}
}
if (min(aa, min(bb, cc)) > 0) {
sub = abs(aa - a) + abs(bb - b) + abs(cc - c);
} else {
sub = inf;
}
if (cnta != 0)
sub += (cnta - 1) * 10;
if (cntb != 0)
sub += (cntb - 1) * 10;
if (cntc != 0)
sub += (cntc - 1) * 10;
ans = min(ans, sub);
}
cout << ans << endl;
return 0;
} | [
"preprocessor.define.value.change",
"literal.float.change"
] | 924,155 | 924,156 | u407614884 | cpp |
p03111 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repf(i, m, n) for (int(i) = m; (i) < n; (i)++)
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vec(n, m, v) vector<long long> v((n), (m));
int ans = INT_MAX;
int n;
vec(8, 0, k);
int a[3];
vec(8, 0, v);
void init() {
cin >> n >> a[0] >> a[1] >> a[2];
rep(i, n) cin >> v[i];
}
int dfs(int i) {
if (i == n) {
int mp = 0;
vec(4, 0, cnt);
vec(3, 0, tmp);
/* rep(kk,n){
cout<<k[kk]<<" ";
}
cout<<endl;*/
rep(jj, n) {
cnt[k[jj]]++;
tmp[k[jj]] += v[jj];
}
if (cnt[0] * cnt[1] * cnt[2] != 0) {
rep(jj, 3) mp += abs(tmp[jj] - a[jj]);
mp += ((cnt[0] + cnt[1] + cnt[2] - 3) * 10);
return mp;
}
return INT_MAX;
}
rep(j, 4) {
k[i] = j;
// cout<<"dd"<<endl;
ans = min(dfs(i + 1), ans);
}
return ans;
}
int main() {
init();
cout << dfs(0) << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repf(i, m, n) for (int(i) = m; (i) < n; (i)++)
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vec(n, m, v) vector<int> v((n), (m));
int ans = INT_MAX;
int n;
vec(8, 0, k);
int a[3];
vec(8, 0, v);
void init() {
cin >> n >> a[0] >> a[1] >> a[2];
rep(i, n) cin >> v[i];
}
int dfs(int i) {
if (i == n) {
int mp = 0;
vec(4, 0, cnt);
vec(3, 0, tmp);
/* rep(kk,n){
cout<<k[kk]<<" ";
}
cout<<endl;*/
rep(jj, n) {
cnt[k[jj]]++;
tmp[k[jj]] += v[jj];
}
if (cnt[0] * cnt[1] * cnt[2] != 0) {
rep(jj, 3) mp += abs(tmp[jj] - a[jj]);
mp += ((cnt[0] + cnt[1] + cnt[2] - 3) * 10);
return mp;
}
return INT_MAX;
}
rep(j, 4) {
k[i] = j;
// cout<<"dd"<<endl;
ans = min(dfs(i + 1), ans);
}
return ans;
}
int main() {
init();
cout << dfs(0) << endl;
return 0;
} | [
"preprocessor.define.value.change"
] | 924,157 | 924,158 | u190234543 | cpp |
p03111 | /*
∧＿∧ やあ
（´・ω・｀) / ようこそ、バーボンハウスへ。
／∇y:::::＼
[￣] このテキーラはサービスだから、まず飲んで落ち着いて欲しい。
|:⊃:|:::::| |──|
￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣| うん、「また」なんだ。済まない。
￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣|￣
仏の顔もって言うしね、謝って許してもらおうとも思っていない。
￣￣￣￣￣￣￣￣￣￣￣￣￣￣／|
∇ ∇ ∇ ∇ ／.／| でも、この提出を見たとき、君は、きっと言葉では言い表せない
┴ ┴ ┴ ┴ ／ ／
| 「ときめき」みたいなものを感じてくれたと思う。
￣￣￣￣￣￣￣￣￣￣|／
| 殺伐としたコンテストの中で、そういう気持ちを忘れないで欲しい
￣￣￣￣￣￣￣￣￣￣ | そう思って、この提出を投げたんだ。
(⊆⊇) (⊆⊇) (⊆⊇) |
|| || || | じゃあ、判定を聞こうか。
.／|＼ ／|＼ ／|＼
*/
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define fst first
#define snd second
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) \
cerr << #x << " -> " << x << " (line:" << __LINE__ << ")" << '\n';
#define debugpair(x, y) \
cerr << "(" << #x << ", " << #y << ") -> (" << x << ", " << y \
<< ") (line:" << __LINE__ << ")" << '\n';
typedef long long lint;
typedef priority_queue<int> p_que;
typedef priority_queue<int, vector<int>, greater<int>()> p_que_rev;
const int INF = INT_MAX;
const lint LINF = LLONG_MAX;
const int MOD = 1000000000 + 7;
const double EPS = 1e-9;
const double PI = acos(-1);
const int di[]{0, -1, 0, 1, -1, -1, 1, 1};
const int dj[]{1, 0, -1, 0, 1, -1, -1, 1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
lint c, b, a, num;
vector<lint> l(n);
cin >> c >> b >> a;
for (int i = 0; i < n; ++i) {
cin >> l[i];
}
lint loop = 1;
lint pow[9];
for (int i = 0; i <= n; ++i) {
pow[i] = loop;
loop *= 4;
// debug(pow[i]);
}
lint use[8];
lint len[3];
lint count[3];
lint ans = INF;
for (int i = 0; i < pow[n]; ++i) {
num = i;
for (int j = 0; j < 3; ++j) {
len[j] = 0;
count[j] = 0;
}
for (int j = 7; j >= 0; --j) {
use[j] = num / pow[j];
num -= (num / pow[j]) * pow[j];
// debug(use[j]);
}
lint mp = 0;
for (int j = 0; j < n; ++j) {
if (use[j] == 0) {
// use for A
count[0]++;
len[0] += l[j];
} else if (use[j] == 1) {
// use for B
count[1]++;
len[1] += l[j];
} else if (use[j] == 2) {
count[2]++;
len[2] += l[j];
}
}
if (count[0] == 0 || count[1] == 0 || count[2] == 0) {
continue;
} else {
if (count[0] == 1) {
mp += abs(len[0] - a);
} else {
mp += abs(len[0] - a) + 10 * (count[0] - 1);
}
if (count[1] == 1) {
mp += abs(len[1] - b);
} else {
mp += abs(len[1] - b) + 10 * (count[1] - 1);
}
if (count[2] == 1) {
mp += abs(len[2] - c);
} else {
mp += abs(len[2] - c) + 10 * (count[2] - 1);
}
// debug(mp);
ans = min(ans, mp);
}
}
cout << ans << endl;
return 0;
} | /*
∧＿∧ やあ
（´・ω・｀) / ようこそ、バーボンハウスへ。
／∇y:::::＼
[￣] このテキーラはサービスだから、まず飲んで落ち着いて欲しい。
|:⊃:|:::::| |──|
￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣| うん、「また」なんだ。済まない。
￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣|￣
仏の顔もって言うしね、謝って許してもらおうとも思っていない。
￣￣￣￣￣￣￣￣￣￣￣￣￣￣／|
∇ ∇ ∇ ∇ ／.／| でも、この提出を見たとき、君は、きっと言葉では言い表せない
┴ ┴ ┴ ┴ ／ ／
| 「ときめき」みたいなものを感じてくれたと思う。
￣￣￣￣￣￣￣￣￣￣|／
| 殺伐としたコンテストの中で、そういう気持ちを忘れないで欲しい
￣￣￣￣￣￣￣￣￣￣ | そう思って、この提出を投げたんだ。
(⊆⊇) (⊆⊇) (⊆⊇) |
|| || || | じゃあ、判定を聞こうか。
.／|＼ ／|＼ ／|＼
*/
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define fst first
#define snd second
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) \
cerr << #x << " -> " << x << " (line:" << __LINE__ << ")" << '\n';
#define debugpair(x, y) \
cerr << "(" << #x << ", " << #y << ") -> (" << x << ", " << y \
<< ") (line:" << __LINE__ << ")" << '\n';
typedef long long lint;
typedef priority_queue<int> p_que;
typedef priority_queue<int, vector<int>, greater<int>()> p_que_rev;
const int INF = INT_MAX;
const lint LINF = LLONG_MAX;
const int MOD = 1000000000 + 7;
const double EPS = 1e-9;
const double PI = acos(-1);
const int di[]{0, -1, 0, 1, -1, -1, 1, 1};
const int dj[]{1, 0, -1, 0, 1, -1, -1, 1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
lint c, b, a, num;
vector<lint> l(n);
cin >> c >> b >> a;
for (int i = 0; i < n; ++i) {
cin >> l[i];
}
lint loop = 1;
lint pow[9];
for (int i = 0; i <= 8; ++i) {
pow[i] = loop;
loop *= 4;
// debug(pow[i]);
}
lint use[8];
lint len[3];
lint count[3];
lint ans = INF;
for (int i = 0; i < pow[n]; ++i) {
num = i;
for (int j = 0; j < 3; ++j) {
len[j] = 0;
count[j] = 0;
}
for (int j = 7; j >= 0; --j) {
use[j] = num / pow[j];
num -= (num / pow[j]) * pow[j];
// debug(use[j]);
}
lint mp = 0;
for (int j = 0; j < n; ++j) {
if (use[j] == 0) {
// use for A
count[0]++;
len[0] += l[j];
} else if (use[j] == 1) {
// use for B
count[1]++;
len[1] += l[j];
} else if (use[j] == 2) {
count[2]++;
len[2] += l[j];
}
}
if (count[0] == 0 || count[1] == 0 || count[2] == 0) {
continue;
} else {
if (count[0] == 1) {
mp += abs(len[0] - a);
} else {
mp += abs(len[0] - a) + 10 * (count[0] - 1);
}
if (count[1] == 1) {
mp += abs(len[1] - b);
} else {
mp += abs(len[1] - b) + 10 * (count[1] - 1);
}
if (count[2] == 1) {
mp += abs(len[2] - c);
} else {
mp += abs(len[2] - c) + 10 * (count[2] - 1);
}
// debug(mp);
ans = min(ans, mp);
}
}
cout << ans << endl;
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 924,159 | 924,160 | u625092455 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int l[9], n, A, B, C;
int dfs(int i, int a, int b, int c) {
if (i == n) {
if (a == 0 || b == 0 || c == 0)
return 8001;
return abs(a - A) + abs(b - B) + abs(c - C);
}
int r1 = dfs(i + 1, a + l[i + 1], b, c) + 10;
int r2 = dfs(i + 1, a, b + l[i + 1], c) + 10;
int r3 = dfs(i + 1, a, b, c + l[i + 1]) + 10;
int r4 = dfs(i + 1, a, b, c) + 10;
return min(r1, min(r2, min(r3, r4)));
}
int main() {
int i;
scanf("%d %d %d %d", &n, &A, &B, &C);
for (i = 1; i <= n; i++)
scanf("%d", &l[i]);
printf("%d", dfs(0, 0, 0, 0) - 30);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int l[9], n, A, B, C;
int dfs(int i, int a, int b, int c) {
if (i == n) {
if (a == 0 || b == 0 || c == 0)
return 8001;
return abs(a - A) + abs(b - B) + abs(c - C);
}
int r1 = dfs(i + 1, a + l[i + 1], b, c) + 10;
int r2 = dfs(i + 1, a, b + l[i + 1], c) + 10;
int r3 = dfs(i + 1, a, b, c + l[i + 1]) + 10;
int r4 = dfs(i + 1, a, b, c);
return min(r1, min(r2, min(r3, r4)));
}
int main() {
int i;
scanf("%d %d %d %d", &n, &A, &B, &C);
for (i = 1; i <= n; i++)
scanf("%d", &l[i]);
printf("%d", dfs(0, 0, 0, 0) - 30);
return 0;
}
| [
"expression.operation.binary.remove"
] | 924,166 | 924,167 | u379393519 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int l[9], n, A, B, C;
int dfs(int i, int a, int b, int c) {
if (i == n) {
if (a == 0 && b == 0 && c == 0)
return 8001;
return abs(a - A) + abs(b - B) + abs(c - C);
}
int r1 = dfs(i + 1, a + l[i + 1], b, c) + 10;
int r2 = dfs(i + 1, a, b + l[i + 1], c) + 10;
int r3 = dfs(i + 1, a, b, c + l[i + 1]) + 10;
int r4 = dfs(i + 1, a, b, c) + 10;
return min(r1, min(r2, min(r3, r4)));
}
int main() {
int i;
scanf("%d %d %d %d", &n, &A, &B, &C);
for (i = 1; i <= n; i++)
scanf("%d", &l[i]);
printf("%d", dfs(0, 0, 0, 0) - 30);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int l[9], n, A, B, C;
int dfs(int i, int a, int b, int c) {
if (i == n) {
if (a == 0 || b == 0 || c == 0)
return 8001;
return abs(a - A) + abs(b - B) + abs(c - C);
}
int r1 = dfs(i + 1, a + l[i + 1], b, c) + 10;
int r2 = dfs(i + 1, a, b + l[i + 1], c) + 10;
int r3 = dfs(i + 1, a, b, c + l[i + 1]) + 10;
int r4 = dfs(i + 1, a, b, c);
return min(r1, min(r2, min(r3, r4)));
}
int main() {
int i;
scanf("%d %d %d %d", &n, &A, &B, &C);
for (i = 1; i <= n; i++)
scanf("%d", &l[i]);
printf("%d", dfs(0, 0, 0, 0) - 30);
return 0;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 924,168 | 924,167 | u379393519 | cpp |
p03111 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
// typedef pair<string,string> P;
// double dat[100][100];
// int dp[6][1010];//動的計画法
// int prime[100001];
// char str[1010][1010];
// vector<pair<ll,ll>> pc;
// int ABS(int a){return max(a,-a);}
// int a[100001];
const int INF = 100000009;
int N, A, B, C;
vector<int> l;
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (min(a, min(b, c)) > 0)
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
else
return INF;
}
int ret0 = dfs(cur + 1, a, b, c);
int ret1 = dfs(cur + 1, a + l[cur], b, c) + 10;
int ret2 = dfs(cur + 1, a, b + l[cur], c) + 10;
int ret3 = dfs(cur + 1, a, b, c + l[cur]) + 10;
return min(min(ret0, ret1), min(ret2, ret3));
}
int main() {
cin >> N >> A >> B >> C;
for (int i = 0; i > N; i++) {
int a;
cin >> a;
l.push_back(a);
}
cout << dfs(0, 0, 0, 0) << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
// typedef pair<string,string> P;
// double dat[100][100];
// int dp[6][1010];//動的計画法
// int prime[100001];
// char str[1010][1010];
// vector<pair<ll,ll>> pc;
// int ABS(int a){return max(a,-a);}
// int a[100001];
const int INF = 100000009;
int N, A, B, C;
vector<int> l;
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (min(a, min(b, c)) > 0)
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
else
return INF;
}
int ret0 = dfs(cur + 1, a, b, c);
int ret1 = dfs(cur + 1, a + l[cur], b, c) + 10;
int ret2 = dfs(cur + 1, a, b + l[cur], c) + 10;
int ret3 = dfs(cur + 1, a, b, c + l[cur]) + 10;
return min(min(ret0, ret1), min(ret2, ret3));
}
int main() {
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
l.push_back(a);
}
cout << dfs(0, 0, 0, 0) << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 924,175 | 924,176 | u559645647 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
int N, A, B, C;
cin >> N >> A >> B >> C;
vector<int> l(N);
int ans = 0;
for (int i = 0; i < N; i++)
cin >> l[i];
// bit全探索みたいなのを4進数でやりたい
for (ll i = 0; i < pow(4, N); i++) {
ll qq = i;
vector<int> useA, useB, useC;
// 4進数の桁が0=>その竹を使わない
// 1=>Aの材料,2=>Bの材料,3=>Cの材料にする
for (int j = 0; j < N; j++) {
int use = qq % 4;
qq /= 4;
switch (use) {
case 1:
useA.push_back(l[j]);
break;
case 2:
useB.push_back(l[j]);
break;
case 3:
useC.push_back(l[j]);
break;
default:
break;
}
}
// A,B,Cどれかに材料がなかったらcontinue
if (useA.size() == 0)
continue;
if (useB.size() == 0)
continue;
if (useC.size() == 0)
continue;
int aa = 0, bb = 0, cc = 0; //材料の竹の長さの合計
int mpA = 0, mpB = 0, mpC = 0; //それぞれの竹を作るのに使うmp
//まず材料の竹をすべて合成する
for (int j = 0; j < useA.size(); j++)
aa += useA[j];
mpA += (useA.size() - 1) * 10;
for (int j = 0; j < useB.size(); j++)
bb += useB[j];
mpB += (useB.size() - 1) * 10;
for (int j = 0; j < useC.size(); j++)
cc += useC[j];
mpC += (useC.size() - 1) * 10;
//延長or短縮の魔法を使う
mpA += abs(aa - A);
mpB += abs(bb - B);
mpC += abs(cc - C);
int cost = mpA + mpB + mpC;
// cout<<cost<<" "<<aa<<" "<<bb<<" "<<cc<<" ";
// cout<<mpA<<" "<<mpB<<" "<<mpC<<endl;
if (i == 0)
ans = cost;
else
ans = (ans < cost) ? ans : cost;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
int N, A, B, C;
cin >> N >> A >> B >> C;
vector<int> l(N);
int ans = 1000000000;
for (int i = 0; i < N; i++)
cin >> l[i];
// bit全探索みたいなのを4進数でやりたい
for (ll i = 0; i < pow(4, N); i++) {
ll qq = i;
vector<int> useA, useB, useC;
// 4進数の桁が0=>その竹を使わない
// 1=>Aの材料,2=>Bの材料,3=>Cの材料にする
for (int j = 0; j < N; j++) {
int use = qq % 4;
qq /= 4;
switch (use) {
case 1:
useA.push_back(l[j]);
break;
case 2:
useB.push_back(l[j]);
break;
case 3:
useC.push_back(l[j]);
break;
default:
break;
}
}
// A,B,Cどれかに材料がなかったらcontinue
if (useA.size() == 0)
continue;
if (useB.size() == 0)
continue;
if (useC.size() == 0)
continue;
int aa = 0, bb = 0, cc = 0; //材料の竹の長さの合計
int mpA = 0, mpB = 0, mpC = 0; //それぞれの竹を作るのに使うmp
//まず材料の竹をすべて合成する
for (int j = 0; j < useA.size(); j++)
aa += useA[j];
mpA += (useA.size() - 1) * 10;
for (int j = 0; j < useB.size(); j++)
bb += useB[j];
mpB += (useB.size() - 1) * 10;
for (int j = 0; j < useC.size(); j++)
cc += useC[j];
mpC += (useC.size() - 1) * 10;
//延長or短縮の魔法を使う
mpA += abs(aa - A);
mpB += abs(bb - B);
mpC += abs(cc - C);
int cost = mpA + mpB + mpC;
// cout<<cost<<" "<<aa<<" "<<bb<<" "<<cc<<" ";
// cout<<mpA<<" "<<mpB<<" "<<mpC<<endl;
if (i == 0)
ans = cost;
else
ans = (ans < cost) ? ans : cost;
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 924,190 | 924,191 | u891178744 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int n, A, B, C, l[8], ans = 1e9;
void dfs(int cur, int a, int b, int c, int sum) {
if (cur == n) {
if (a & b & c) {
ans = min(ans, abs(a - A) + abs(b - B) + abs(c - C) + sum - 30);
}
return;
}
dfs(cur + 1, a, b, c, sum);
dfs(cur + 1, a + l[cur], b, c, sum + 10);
dfs(cur + 1, a, b + l[cur], c, sum + 10);
dfs(cur + 1, a, b, c + l[cur], sum + 10);
}
int main() {
cin >> n >> A >> B >> C;
for (int i = 0; i < n; i++) {
cin >> l[i];
}
dfs(0, 0, 0, 0, 0);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int n, A, B, C, l[8], ans = 1e9;
void dfs(int cur, int a, int b, int c, int sum) {
if (cur == n) {
if (a * b * c) {
ans = min(ans, abs(a - A) + abs(b - B) + abs(c - C) + sum - 30);
}
return;
}
dfs(cur + 1, a, b, c, sum);
dfs(cur + 1, a + l[cur], b, c, sum + 10);
dfs(cur + 1, a, b + l[cur], c, sum + 10);
dfs(cur + 1, a, b, c + l[cur], sum + 10);
}
int main() {
cin >> n >> A >> B >> C;
for (int i = 0; i < n; i++) {
cin >> l[i];
}
dfs(0, 0, 0, 0, 0);
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 924,201 | 924,202 | u546943614 | cpp |
p03111 | // Created by sz
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 9;
int l[N];
int n, a, b, c;
int dfs(int cur, int ca, int cb, int cc) {
if (cur == n) {
if (ca * cb * cc)
return abs(a - ca) + abs(b - cb) + abs(c - cc);
else
return 1e9;
}
int ret0 = dfs(cur + 1, ca, cb, cc);
int ret1 = dfs(cur + 1, ca + l[cur], cb, cc) + 10;
int ret2 = dfs(cur + 1, ca, cb + l[cur], cc) + 10;
int ret3 = dfs(cur + 1, ca, cb, cc + l[cur]) + 10;
return min(min(ret0, ret1), min(ret2, ret3));
}
int main() {
#ifdef LOCAL
freopen("./input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> a >> b >> c;
for (int i = 0; i < n; i++)
cin >> l[i];
cout << dfs(0, 0, 0, 0) << endl;
return 0;
}
| // Created by sz
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 9;
int l[N];
int n, a, b, c;
int dfs(int cur, int ca, int cb, int cc) {
if (cur == n) {
if (ca * cb * cc)
return abs(a - ca) + abs(b - cb) + abs(c - cc) - 30;
else
return 1e9;
}
int ret0 = dfs(cur + 1, ca, cb, cc);
int ret1 = dfs(cur + 1, ca + l[cur], cb, cc) + 10;
int ret2 = dfs(cur + 1, ca, cb + l[cur], cc) + 10;
int ret3 = dfs(cur + 1, ca, cb, cc + l[cur]) + 10;
return min(min(ret0, ret1), min(ret2, ret3));
}
int main() {
#ifdef LOCAL
freopen("./input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> a >> b >> c;
for (int i = 0; i < n; i++)
cin >> l[i];
cout << dfs(0, 0, 0, 0) << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 924,205 | 924,206 | u041075929 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<double, int> DIP;
typedef pair<DIP, P> PP;
const ll MOD = 1000000007;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(2e5 + 5);
const double EPS = 1e-11;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).begin(), (v).end())
#define ALL(v) (v).begin(), (v).end()
int n, l[10], a[3];
int rec(int i, int m, vector<int> &v) {
int res = IINF;
if (m == 0) {
int tmp = 0;
REP(j, 3) tmp += abs(a[j] - v[j]);
tmp += (i - 3) * 10;
res = min(res, tmp);
}
if (i >= n)
return IINF;
else {
v.push_back(l[i]);
res = min(res, rec(i + 1, m - 1, v));
v.pop_back();
if (m < 3) {
v.back() += l[i];
res = min(res, rec(i + 1, m, v));
v.back() -= l[i];
}
}
return res;
}
int main() {
cin >> n;
REP(i, 3) cin >> a[i];
REP(i, n) cin >> l[i];
sort(a, a + 3);
sort(l, l + n);
int ans = IINF;
vector<int> v;
while (1) {
ans = min(ans, rec(0, 3, v));
if (!next_permutation(l, l + n))
break;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<double, int> DIP;
typedef pair<DIP, P> PP;
const ll MOD = 1000000007;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(2e5 + 5);
const double EPS = 1e-11;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).begin(), (v).end())
#define ALL(v) (v).begin(), (v).end()
int n, l[10], a[3];
int rec(int i, int m, vector<int> &v) {
int res = IINF;
if (m == 0) {
int tmp = 0;
REP(j, 3) tmp += abs(a[j] - v[j]);
tmp += (i - 3) * 10;
res = min(res, tmp);
}
if (i >= n)
return res;
else {
v.push_back(l[i]);
res = min(res, rec(i + 1, m - 1, v));
v.pop_back();
if (m < 3) {
v.back() += l[i];
res = min(res, rec(i + 1, m, v));
v.back() -= l[i];
}
}
return res;
}
int main() {
cin >> n;
REP(i, 3) cin >> a[i];
REP(i, n) cin >> l[i];
sort(a, a + 3);
sort(l, l + n);
int ans = IINF;
vector<int> v;
while (1) {
ans = min(ans, rec(0, 3, v));
if (!next_permutation(l, l + n))
break;
}
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"function.return_value.change"
] | 924,209 | 924,210 | u271063202 | cpp |
p03111 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define show(x) cerr << #x << " = " << (x) << endl;
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int a, b, c;
int solve(int num, const vector<int> &d) {
// show(num);
int res = 1 << 30;
if (num == 0) {
int n = (int)d.size();
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
continue;
for (int k = 0; k < n; k++) {
if (i == k or j == k)
continue;
if (i != j and j != k and k != i)
res = min(res, abs(a - d[i]) + abs(b - d[j]) + abs(c - d[k]));
}
}
}
} else {
int n = (int)d.size();
for (int i = 0; i < n - 1; i++) {
vector<int> dd;
for (int j = 0; j < n; j++)
if (j != i)
dd.push_back(d[j]);
for (int j = i + 1; j < n - 1; j++) {
dd[j] += d[i];
res = min(res, solve(num - 1, dd) + 10);
dd[j] -= d[i];
}
res = min(res, solve(num - 1, dd) + 10);
}
}
return res;
}
int main() {
int n;
cin >> n >> a >> b >> c;
vector<int> d(n);
rep(i, n) cin >> d[i];
int ans = 1 << 30;
// solve(2,d);
for (int i = 0; i <= n - 3; i++) {
ans = min(ans, solve(i, d));
// show(solve(i,d));
}
cout << ans << endl;
}
| #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define show(x) cerr << #x << " = " << (x) << endl;
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int a, b, c;
int solve(int num, const vector<int> &d) {
// show(num);
int res = 1 << 30;
if (num == 0) {
int n = (int)d.size();
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
continue;
for (int k = 0; k < n; k++) {
if (i == k or j == k)
continue;
if (i != j and j != k and k != i)
res = min(res, abs(a - d[i]) + abs(b - d[j]) + abs(c - d[k]));
}
}
}
} else {
int n = (int)d.size();
for (int i = 0; i < n - 1; i++) {
vector<int> dd;
for (int j = 0; j < n; j++)
if (j != i)
dd.push_back(d[j]);
for (int j = i; j < n - 1; j++) {
dd[j] += d[i];
res = min(res, solve(num - 1, dd) + 10);
dd[j] -= d[i];
}
res = min(res, solve(num - 1, dd) + 10);
}
}
return res;
}
int main() {
int n;
cin >> n >> a >> b >> c;
vector<int> d(n);
rep(i, n) cin >> d[i];
int ans = 1 << 30;
// solve(2,d);
for (int i = 0; i <= n - 3; i++) {
ans = min(ans, solve(i, d));
// show(solve(i,d));
}
cout << ans << endl;
}
| [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 924,216 | 924,217 | u628047647 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef int Int;
typedef pair<Int, Int> pii;
typedef pair<Int, double> pid;
typedef pair<double, double> pdd;
typedef pair<Int, pii> pip;
typedef pair<double, Int> pdp;
#define A first
#define B second
#define pb(x) push_back(x)
#define ALL(x) x.begin(), x.end()
#define SZ(x) (x).size()
#define CLR(x) memset(x, 0, sizeof x)
#define pdebug() printf("%d\n", __LINE__)
#define Itype(a) typeof(a.begin())
#define REP(i, a, b) for (int i = (a); i <= (b); i++)
#define FORO(i, n) REP(i, 0, (int)n - 1)
#define FORI(i, n) REP(i, 1, (int)n)
#define FORIT(i, t) for (Itype(t) i = t.begin(); i != t.end(); i++)
#define eps 1e-6
#define sqr(x) ((x) * (x))
#define dist(_a, _b) sqrt(sqr(_a.A - _b.A) + sqr(_a.B - _b.B))
#define norm(_a) sqrt(sqr(_a.A) + sqr(_a.B))
template <typename T> void getMin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void getMax(T &a, T b) {
if (a < b)
a = b;
}
const int inf = 100000000;
const int MAX = 1 << 10;
int N;
vector<int> l;
int A, B, C;
int a, b, c;
int ans;
void solve(int k, int p) {
if (k <= N - 3) {
// cout << a << " " << b << " " << c << endl;
getMin(ans, abs(a - A) + abs(b - B) + abs(c - C) + p);
}
if (k == N - 3)
return;
solve(k + 1, p + 10);
a += l[k];
solve(k + 1, p + 10);
a -= l[k];
b += l[k];
solve(k + 1, p + 10);
b -= l[k];
c += l[k];
solve(k + 1, p + 10);
c -= l[k];
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> A >> B >> C;
vector<int> tl(N);
FORO(i, N) cin >> tl[i];
ans = inf;
FORO(i, N) {
FORO(j, N) {
if (i == j)
continue;
FORO(k, N) {
if (j == k || k == i)
continue;
l.clear();
a = tl[i];
b = tl[j];
c = tl[k];
FORO(t, N) {
if (t != i && t != j && t != k) {
l.pb(tl[t]);
}
}
solve(0, 0);
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef int Int;
typedef pair<Int, Int> pii;
typedef pair<Int, double> pid;
typedef pair<double, double> pdd;
typedef pair<Int, pii> pip;
typedef pair<double, Int> pdp;
#define A first
#define B second
#define pb(x) push_back(x)
#define ALL(x) x.begin(), x.end()
#define SZ(x) (x).size()
#define CLR(x) memset(x, 0, sizeof x)
#define pdebug() printf("%d\n", __LINE__)
#define Itype(a) typeof(a.begin())
#define REP(i, a, b) for (int i = (a); i <= (b); i++)
#define FORO(i, n) REP(i, 0, (int)n - 1)
#define FORI(i, n) REP(i, 1, (int)n)
#define FORIT(i, t) for (Itype(t) i = t.begin(); i != t.end(); i++)
#define eps 1e-6
#define sqr(x) ((x) * (x))
#define dist(_a, _b) sqrt(sqr(_a.A - _b.A) + sqr(_a.B - _b.B))
#define norm(_a) sqrt(sqr(_a.A) + sqr(_a.B))
template <typename T> void getMin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void getMax(T &a, T b) {
if (a < b)
a = b;
}
const int inf = 100000000;
const int MAX = 1 << 10;
int N;
vector<int> l;
int A, B, C;
int a, b, c;
int ans;
void solve(int k, int p) {
if (k <= N - 3) {
// cout << a << " " << b << " " << c << endl;
getMin(ans, abs(a - A) + abs(b - B) + abs(c - C) + p);
}
if (k == N - 3)
return;
solve(k + 1, p);
a += l[k];
solve(k + 1, p + 10);
a -= l[k];
b += l[k];
solve(k + 1, p + 10);
b -= l[k];
c += l[k];
solve(k + 1, p + 10);
c -= l[k];
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> A >> B >> C;
vector<int> tl(N);
FORO(i, N) cin >> tl[i];
ans = inf;
FORO(i, N) {
FORO(j, N) {
if (i == j)
continue;
FORO(k, N) {
if (j == k || k == i)
continue;
l.clear();
a = tl[i];
b = tl[j];
c = tl[k];
FORO(t, N) {
if (t != i && t != j && t != k) {
l.pb(tl[t]);
}
}
solve(0, 0);
}
}
}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 924,228 | 924,229 | u414444658 | cpp |
p03111 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, m, n) for (int i = m; i < n; i++)
#define mrep(i, m, n) for (int i = m; i > n; i--)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define Yes cout << "Yes" << endl;
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
//(int)'a'は97 (int)'A'は65 (int)'1'は49
//おまじない
int n, a, b, c;
int ans = INF;
int kado[8];
vector<vector<int>> use;
void solve(int i = 0) {
if (i == n) {
if (use[1].size() == 0 || use[2].size() == 0 || use[3].size() == 0) {
return;
} else {
int kl[4] = {0};
rep(j, 1, 4) {
rep(k, 0, use[i].size()) { kl[j] += use[j][k]; }
}
int sub = 10 * (use[1].size() + use[2].size() + use[3].size() - 3) +
abs(a - kl[1]) + abs(b - kl[2]) + abs(c - kl[3]);
ans = min(ans, sub);
}
} else {
rep(j, 0, 4) {
use[j].push_back(kado[i]);
solve(i + 1);
use[j].pop_back();
}
}
return;
}
int main() {
cin >> n >> a >> b >> c;
rep(i, 0, n) { cin >> kado[i]; }
solve();
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, m, n) for (int i = m; i < n; i++)
#define mrep(i, m, n) for (int i = m; i > n; i--)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define Yes cout << "Yes" << endl;
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
//(int)'a'は97 (int)'A'は65 (int)'1'は49
//おまじない
int n, a, b, c;
int ans = INF;
int kado[8];
vector<vector<int>> use(4);
void solve(int i = 0) {
if (i == n) {
if (use[1].size() == 0 || use[2].size() == 0 || use[3].size() == 0) {
return;
} else {
int kl[4] = {0};
rep(j, 1, 4) {
rep(k, 0, use[j].size()) { kl[j] += use[j][k]; }
}
int sub = 10 * (use[1].size() + use[2].size() + use[3].size() - 3) +
abs(a - kl[1]) + abs(b - kl[2]) + abs(c - kl[3]);
ans = min(ans, sub);
}
} else {
rep(j, 0, 4) {
use[j].push_back(kado[i]);
solve(i + 1);
use[j].pop_back();
}
}
return;
}
int main() {
cin >> n >> a >> b >> c;
rep(i, 0, n) { cin >> kado[i]; }
solve();
cout << ans << endl;
return 0;
}
| [
"call.arguments.add",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 924,230 | 924,231 | u297203024 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int bamboom[9], A, B, C, n;
int dfs(int l, int a, int b, int c) {
if (l == n) {
if (a == 0 || b == 0 || c == 0)
return 8001;
return abs(A - a) + abs(B - b) + abs(C - c);
}
int r1 = dfs(l + 1, bamboom[l + 1] + a, b, c) + 10;
int r2 = dfs(l + 1, a, bamboom[l + 1] + b, c) + 10;
int r3 = dfs(l + 1, a, b, bamboom[l + 1] + c) + 10;
int r4 = dfs(l + 1, a, b, c);
return min(min(r1, r2), min(r3, r4));
}
int main() {
scanf("%d %d %d %d", &n, &A, &B, &C);
for (int i = 1; i <= n; i++)
scanf("%d", &bamboom[i]);
printf("%d", dfs(1, 0, 0, 0) - 30);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int bamboom[9], A, B, C, n;
int dfs(int l, int a, int b, int c) {
if (l == n) {
if (a == 0 || b == 0 || c == 0)
return 8001;
return abs(A - a) + abs(B - b) + abs(C - c);
}
int r1 = dfs(l + 1, bamboom[l + 1] + a, b, c) + 10;
int r2 = dfs(l + 1, a, bamboom[l + 1] + b, c) + 10;
int r3 = dfs(l + 1, a, b, bamboom[l + 1] + c) + 10;
int r4 = dfs(l + 1, a, b, c);
return min(min(r1, r2), min(r3, r4));
}
int main() {
scanf("%d %d %d %d", &n, &A, &B, &C);
for (int i = 1; i <= n; i++)
scanf("%d", &bamboom[i]);
printf("%d", dfs(0, 0, 0, 0) - 30);
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 924,238 | 924,239 | u897518464 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int bamboom[9], A, B, C, n;
int dfs(int l, int a, int b, int c) {
if (l == n) {
if (a == 0 || b == 0 || c == 0)
return 8001;
return abs(A - a) + abs(B - b) + abs(C - c);
}
int r1 = dfs(l + 1, bamboom[l + 1] + a, b, c) + 10;
int r2 = dfs(l + 1, a, bamboom[l + 1] + b, c) + 10;
int r3 = dfs(l + 1, a, b, bamboom[l + 1] + c) + 10;
int r4 = dfs(l + 1, a, b, c);
return min(min(r1, r2), min(r3, r4));
}
int main() {
scanf("%d %d %d %d", &n, &A, &B, &C);
for (int i = 0; i < n; i++)
scanf("%d", &bamboom[i]);
printf("%d", dfs(1, 0, 0, 0));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int bamboom[9], A, B, C, n;
int dfs(int l, int a, int b, int c) {
if (l == n) {
if (a == 0 || b == 0 || c == 0)
return 8001;
return abs(A - a) + abs(B - b) + abs(C - c);
}
int r1 = dfs(l + 1, bamboom[l + 1] + a, b, c) + 10;
int r2 = dfs(l + 1, a, bamboom[l + 1] + b, c) + 10;
int r3 = dfs(l + 1, a, b, bamboom[l + 1] + c) + 10;
int r4 = dfs(l + 1, a, b, c);
return min(min(r1, r2), min(r3, r4));
}
int main() {
scanf("%d %d %d %d", &n, &A, &B, &C);
for (int i = 1; i <= n; i++)
scanf("%d", &bamboom[i]);
printf("%d", dfs(0, 0, 0, 0) - 30);
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change",
"io.output.change"
] | 924,240 | 924,239 | u897518464 | cpp |
p03111 | #include <iostream>
#include <string>
using namespace std;
int N, A, B, C, l[1000];
int dsf(int n, int a, int b, int c) {
int ans1, ans2;
if (n > N) {
if (a && B && C) {
return abs(A - a) + abs(B - b) + abs(C - c);
} else {
return 1e9;
}
}
//４つの中で最もMPの消費のないものを返す
ans1 = min(dsf(n + 1, a, b, c), dsf(n + 1, a + l[n], b, c) + 10 * (a > 0));
ans2 = min(dsf(n + 1, a, b + l[n], c) + 10 * (b > 0),
dsf(n + 1, a, b, c + l[n]) + 10 * (c > 0));
return min(ans1, ans2);
}
int main() {
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++)
cin >> l[i];
cout << dsf(0, 0, 0, 0);
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int N, A, B, C, l[1000];
int dsf(int n, int a, int b, int c) {
int ans1, ans2;
if (n >= N) {
if (a && b && c) {
return abs(A - a) + abs(B - b) + abs(C - c);
} else {
return 1e9;
}
}
//４つの中で最もMPの消費のないものを返す
ans1 = min(dsf(n + 1, a, b, c), dsf(n + 1, a + l[n], b, c) + 10 * (a > 0));
ans2 = min(dsf(n + 1, a, b + l[n], c) + 10 * (b > 0),
dsf(n + 1, a, b, c + l[n]) + 10 * (c > 0));
return min(ans1, ans2);
}
int main() {
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++)
cin >> l[i];
cout << dsf(0, 0, 0, 0);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 924,254 | 924,255 | u935620673 | cpp |
p03111 | #include <iostream>
#include <string>
using namespace std;
int N, A, B, C, l[1000];
int dsf(int n, int a, int b, int c) {
int ans1, ans2;
if (n >= N) {
if (a && B && C) {
return abs(A - a) + abs(B - b) + abs(C - c);
} else {
return 1e9;
}
}
//４つの中で最もMPの消費のないものを返す
ans1 = min(dsf(n + 1, a, b, c), dsf(n + 1, a + l[n], b, c) + 10 * (a > 0));
ans2 = min(dsf(n + 1, a, b + l[n], c) + 10 * (b > 0),
dsf(n + 1, a, b, c + l[n]) + 10 * (c > 0));
return min(ans1, ans2);
}
int main() {
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++)
cin >> l[i];
cout << dsf(0, 0, 0, 0);
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int N, A, B, C, l[1000];
int dsf(int n, int a, int b, int c) {
int ans1, ans2;
if (n >= N) {
if (a && b && c) {
return abs(A - a) + abs(B - b) + abs(C - c);
} else {
return 1e9;
}
}
//４つの中で最もMPの消費のないものを返す
ans1 = min(dsf(n + 1, a, b, c), dsf(n + 1, a + l[n], b, c) + 10 * (a > 0));
ans2 = min(dsf(n + 1, a, b + l[n], c) + 10 * (b > 0),
dsf(n + 1, a, b, c + l[n]) + 10 * (c > 0));
return min(ans1, ans2);
}
int main() {
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++)
cin >> l[i];
cout << dsf(0, 0, 0, 0);
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 924,256 | 924,255 | u935620673 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int r, l, m, n;
vector<int> v;
int dfs(int a, int b, int c, int dep) {
if (r == dep) {
return min({a, b, c}) > 0 ? (abs(a - l) + abs(b - m) + abs(c - n) - 30)
: 2e9;
}
int t = v[dep++];
int t1 = dfs(a + t, b, c, dep) + 10;
int t2 = dfs(a, b + t, c, dep) + 10;
int t3 = dfs(a, b, c + t, dep) + 10;
int t4 = dfs(a, b, c, dep);
return min({t1, t2, t3, t4});
}
int main() {
cin >> r >> l >> m >> n;
v.resize(n);
for (int i = 0; i < r; i++) {
cin >> v[i];
}
cout << dfs(0, 0, 0, 0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int r, l, m, n;
vector<int> v;
int dfs(int a, int b, int c, int dep) {
if (r == dep) {
return min({a, b, c}) > 0 ? (abs(a - l) + abs(b - m) + abs(c - n) - 30)
: 2e9;
}
int t = v[dep++];
int t1 = dfs(a + t, b, c, dep) + 10;
int t2 = dfs(a, b + t, c, dep) + 10;
int t3 = dfs(a, b, c + t, dep) + 10;
int t4 = dfs(a, b, c, dep);
return min({t1, t2, t3, t4});
}
int main() {
cin >> r >> l >> m >> n;
v.resize(r);
for (int i = 0; i < r; i++) {
cin >> v[i];
}
cout << dfs(0, 0, 0, 0) << endl;
return 0;
} | [
"identifier.change",
"call.arguments.change"
] | 924,257 | 924,258 | u612721349 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int r, l, m, n;
vector<int> v;
int dfs(int a, int b, int c, int dep) {
if (r == dep) {
return min({a, b, c}) > 0 ? (abs(a - l) + abs(b - m) + abs(c - n) - 30)
: (2e9);
}
int t = v[dep++];
int t1 = dfs(a + t, b, c, dep) + 10;
int t2 = dfs(a, b + t, c, dep) + 10;
int t3 = dfs(a, b, c + t, dep) + 10;
int t4 = dfs(a, b, c, dep);
return min({t1, t2, t3, t4});
}
int main() {
cin >> r >> l >> m >> n;
v.resize(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
cout << dfs(0, 0, 0, 0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int r, l, m, n;
vector<int> v;
int dfs(int a, int b, int c, int dep) {
if (r == dep) {
return min({a, b, c}) > 0 ? (abs(a - l) + abs(b - m) + abs(c - n) - 30)
: 2e9;
}
int t = v[dep++];
int t1 = dfs(a + t, b, c, dep) + 10;
int t2 = dfs(a, b + t, c, dep) + 10;
int t3 = dfs(a, b, c + t, dep) + 10;
int t4 = dfs(a, b, c, dep);
return min({t1, t2, t3, t4});
}
int main() {
cin >> r >> l >> m >> n;
v.resize(r);
for (int i = 0; i < r; i++) {
cin >> v[i];
}
cout << dfs(0, 0, 0, 0) << endl;
return 0;
} | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 924,259 | 924,258 | u612721349 | cpp |
p03111 | #include "bits/stdc++.h"
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a << endl;
#define all(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define TDARRAY(int, a, n, m) vector<vector<int>> a(n, vector<int>(m, 0));
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
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;
}
vector<int> demical(ll n, int k, int l) {
vector<int> rtn(l);
REP(i, l) {
rtn[i] = n % k;
n /= k;
}
/*while(n>0){
rtn.push_back(n%k);
n/=k;
}*/
return rtn;
}
int n;
vector<int> a(3);
int main() {
cin >> n;
REP(i, 3) { cin >> a[i]; }
vector<int> l(8, 1e6);
REP(i, n) { cin >> l[i]; }
int res = INT_MAX;
ll f = pow(4, 8);
REP(i, f) {
int cost = 0;
vector<int> v(4, 0);
vector<int> k = demical(i, 4, 8);
REP(j, k.size()) {
v[k[j]] += l[j];
if (k[j] != 3)
cost += 10;
}
REP(j, v.size()) { cost += abs(v[j] - a[j]); }
if (v[0] && v[1] && v[2]) {
chmin(res, cost);
}
}
put(res - 30);
return 0;
}
| #include "bits/stdc++.h"
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a << endl;
#define all(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define TDARRAY(int, a, n, m) vector<vector<int>> a(n, vector<int>(m, 0));
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
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;
}
vector<int> demical(ll n, int k, int l) {
vector<int> rtn(l);
REP(i, l) {
rtn[i] = n % k;
n /= k;
}
/*while(n>0){
rtn.push_back(n%k);
n/=k;
}*/
return rtn;
}
int n;
vector<int> a(3);
int main() {
cin >> n;
REP(i, 3) { cin >> a[i]; }
vector<int> l(8, 1e6);
REP(i, n) { cin >> l[i]; }
int res = INT_MAX;
ll f = pow(4, 8);
REP(i, f) {
int cost = 0;
vector<int> v(4, 0);
vector<int> k = demical(i, 4, 8);
REP(j, k.size()) {
v[k[j]] += l[j];
if (k[j] != 3)
cost += 10;
}
REP(j, 3) { cost += abs(v[j] - a[j]); }
if (v[0] && v[1] && v[2]) {
chmin(res, cost);
}
}
put(res - 30);
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"call.remove"
] | 924,263 | 924,264 | u030685402 | cpp |
p03111 | #include "bits/stdc++.h"
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a << endl;
#define all(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define TDARRAY(int, a, n, m) vector<vector<int>> a(n, vector<int>(m, 0));
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
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;
}
vector<int> demical(ll n, int k, int l) {
// 10進数nをk進数で表す。ただし、長さlで固定(これはbit全探索の一般化のためのものである)
vector<int> rtn(l);
REP(i, l) {
rtn[i] = n % k;
n /= k;
}
/*while(n>0){
rtn.push_back(n%k);
n/=k;
}*/
return rtn;
}
int n;
vector<int> a(3);
int main() {
cin >> n;
REP(i, 3) { cin >> a[i]; }
vector<int> l(8, 1e6);
REP(i, n) { cin >> l[i]; }
int res = INT_MAX;
ll f = pow(4, 8);
REP(i, f) {
int cost = 0;
vector<int> v(4, 0);
vector<int> k = demical(i, 4, 8);
REP(j, k.size()) {
v[k[j]] += l[j];
if (k[j] != 3)
cost += 10;
}
REP(j, v.size()) { cost += abs(v[j] - a[j]); }
if (v[0] && v[1] && v[2]) {
chmin(res, cost);
}
}
/*REP(d,4){
REP(e,4){
REP(f,4){
REP(g,4){
REP(h,4){
REP(i,4){
REP(j,4){
REP(k,4){
int cost = 0;
vector<int> v(4);
v[d]+=l[0];
v[e]+=l[1];
v[f]+=l[2];
v[g]+=l[3];
v[h]+=l[4];
v[i]+=l[5];
v[j]+=l[6];
v[k]+=l[7];
if(d!=3)cost+=10;
if(e!=3)cost+=10;
if(f!=3)cost+=10;
if(g!=3)cost+=10;
if(h!=3)cost+=10;
if(i!=3)cost+=10;
if(j!=3)cost+=10;
if(k!=3)cost+=10;
cost+=abs(v[0]-a[0]);
cost+=abs(v[1]-a[1]);
cost+=abs(v[2]-a[2]);
if(v[0]&&v[1]&&v[2]){
chmin(res,cost);
}
}
}
}
}
}
}
}
}*/
put(res - 30);
return 0;
}
| #include "bits/stdc++.h"
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a << endl;
#define all(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define TDARRAY(int, a, n, m) vector<vector<int>> a(n, vector<int>(m, 0));
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
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;
}
vector<int> demical(ll n, int k, int l) {
vector<int> rtn(l);
REP(i, l) {
rtn[i] = n % k;
n /= k;
}
/*while(n>0){
rtn.push_back(n%k);
n/=k;
}*/
return rtn;
}
int n;
vector<int> a(3);
int main() {
cin >> n;
REP(i, 3) { cin >> a[i]; }
vector<int> l(8, 1e6);
REP(i, n) { cin >> l[i]; }
int res = INT_MAX;
ll f = pow(4, 8);
REP(i, f) {
int cost = 0;
vector<int> v(4, 0);
vector<int> k = demical(i, 4, 8);
REP(j, k.size()) {
v[k[j]] += l[j];
if (k[j] != 3)
cost += 10;
}
REP(j, 3) { cost += abs(v[j] - a[j]); }
if (v[0] && v[1] && v[2]) {
chmin(res, cost);
}
}
put(res - 30);
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"call.remove"
] | 924,265 | 924,264 | u030685402 | cpp |
p03111 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int dfs(int i, int a, int b, int c, int N, int A[], int L[]) {
if (i == N) {
if (a == 0 || b == 0 || c == 0) {
return INT32_MAX;
}
return (abs(a - A[0]) + abs(b - A[1]) + abs(c - A[2]) - 30);
}
int ret1 = dfs(i + 1, a, b, c, N, A, L);
int ret2 = dfs(i + 1, a + L[i], b, c, N, A, L) + 10;
int ret3 = dfs(i + 1, a, b + L[i], c, N, A, L) + 10;
int ret4 = dfs(i + 1, a, b, c + L[i], N, A, L) + 10;
return min(ret1, min(ret2, min(ret3, ret4)));
}
int main() {
int N;
cin >> N;
int A[3];
cin >> A[0] >> A[1] >> A[2];
int L[8] = {0};
for (int i = 0; i < N; ++i) {
cin >> L[i];
}
// L[i] を A[0]に使うか、A[1]に使うか、A[2]に使うか、使わないかの4通り
int ans = dfs(0, 0, 0, 0, N, A, L);
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int dfs(int i, int a, int b, int c, int N, int A[], int L[]) {
if (i == N) {
if (a == 0 || b == 0 || c == 0) {
return 10 << 9;
}
return (abs(a - A[0]) + abs(b - A[1]) + abs(c - A[2]) - 30);
}
int ret1 = dfs(i + 1, a, b, c, N, A, L);
int ret2 = dfs(i + 1, a + L[i], b, c, N, A, L) + 10;
int ret3 = dfs(i + 1, a, b + L[i], c, N, A, L) + 10;
int ret4 = dfs(i + 1, a, b, c + L[i], N, A, L) + 10;
return min(ret1, min(ret2, min(ret3, ret4)));
}
int main() {
int N;
cin >> N;
int A[3];
cin >> A[0] >> A[1] >> A[2];
int L[8] = {0};
for (int i = 0; i < N; ++i) {
cin >> L[i];
}
// L[i] を A[0]に使うか、A[1]に使うか、A[2]に使うか、使わないかの4通り
int ans = dfs(0, 0, 0, 0, N, A, L);
cout << ans << endl;
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change"
] | 924,266 | 924,267 | u642210599 | cpp |
p03111 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int dfs(int i, int a, int b, int c, int N, int A[], int L[]) {
if (i == N) {
if (a == 0 || b == 0 || c == 0) {
return 1 << 9;
}
return (abs(a - A[0]) + abs(b - A[1]) + abs(c - A[2]) - 30);
}
int ret1 = dfs(i + 1, a, b, c, N, A, L);
int ret2 = dfs(i + 1, a + L[i], b, c, N, A, L) + 10;
int ret3 = dfs(i + 1, a, b + L[i], c, N, A, L) + 10;
int ret4 = dfs(i + 1, a, b, c + L[i], N, A, L) + 10;
return min(ret1, min(ret2, min(ret3, ret4)));
}
int main() {
int N;
cin >> N;
int A[3];
cin >> A[0] >> A[1] >> A[2];
int L[8] = {0};
for (int i = 0; i < N; ++i) {
cin >> L[i];
}
// L[i] を A[0]に使うか、A[1]に使うか、A[2]に使うか、使わないかの4通り
int ans = dfs(0, 0, 0, 0, N, A, L);
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int dfs(int i, int a, int b, int c, int N, int A[], int L[]) {
if (i == N) {
if (a == 0 || b == 0 || c == 0) {
return 10 << 9;
}
return (abs(a - A[0]) + abs(b - A[1]) + abs(c - A[2]) - 30);
}
int ret1 = dfs(i + 1, a, b, c, N, A, L);
int ret2 = dfs(i + 1, a + L[i], b, c, N, A, L) + 10;
int ret3 = dfs(i + 1, a, b + L[i], c, N, A, L) + 10;
int ret4 = dfs(i + 1, a, b, c + L[i], N, A, L) + 10;
return min(ret1, min(ret2, min(ret3, ret4)));
}
int main() {
int N;
cin >> N;
int A[3];
cin >> A[0] >> A[1] >> A[2];
int L[8] = {0};
for (int i = 0; i < N; ++i) {
cin >> L[i];
}
// L[i] を A[0]に使うか、A[1]に使うか、A[2]に使うか、使わないかの4通り
int ans = dfs(0, 0, 0, 0, N, A, L);
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 924,268 | 924,267 | u642210599 | cpp |
p03111 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int INF = 1000000000;
int N, A, B, C;
vector<int> l;
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (min({a, b, c}) < 0)
return INF;
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
}
int ret0 = dfs(cur + 1, a, b, c);
int ret1 = dfs(cur + 1, a + l[cur], b, c) + 10;
int ret2 = dfs(cur + 1, a, b + l[cur], c) + 10;
int ret3 = dfs(cur + 1, a, b, c + l[cur]) + 10;
return min({ret0, ret1, ret2, ret3});
}
int main() {
cin >> N >> A >> B >> C;
l.resize(N);
for (int i = 0; i < N; i++) {
cin >> l[i];
}
cout << dfs(0, 0, 0, 0) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int INF = 1000000000;
int N, A, B, C;
vector<int> l;
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (min({a, b, c}) <= 0)
return INF;
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
}
int ret0 = dfs(cur + 1, a, b, c);
int ret1 = dfs(cur + 1, a + l[cur], b, c) + 10;
int ret2 = dfs(cur + 1, a, b + l[cur], c) + 10;
int ret3 = dfs(cur + 1, a, b, c + l[cur]) + 10;
return min({ret0, ret1, ret2, ret3});
}
int main() {
cin >> N >> A >> B >> C;
l.resize(N);
for (int i = 0; i < N; i++) {
cin >> l[i];
}
cout << dfs(0, 0, 0, 0) << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 924,277 | 924,278 | u564056510 | cpp |
p03111 | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template <class T1, class T2> bool chmin(T1 &a, T2 b) {
return b < a && (a = b, true);
}
template <class T1, class T2> bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<ll, ll>;
using ld = long double;
using vld = vector<ld>;
using vi = vector<int>;
using vvi = vector<vi>;
vll conv(vi &v) {
vll r(v.size());
rep(i, v.size()) r[i] = v[i];
return r;
}
inline void input(int &v) {
v = 0;
char c = 0;
int p = 1;
while (c < '0' || c > '9') {
if (c == '-')
p = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
v = (v << 3) + (v << 1) + c - '0';
c = getchar();
}
v *= p;
} // これを使うならば、tieとかを消して！！
template <typename T, typename U>
ostream &operator<<(ostream &o, const pair<T, U> &v) {
o << "(" << v.first << ", " << v.second << ")";
return o;
}
template <size_t...> struct seq {};
template <size_t N, size_t... Is>
struct gen_seq : gen_seq<N - 1, N - 1, Is...> {};
template <size_t... Is> struct gen_seq<0, Is...> : seq<Is...> {};
template <class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch, Tr> &os, Tuple const &t, seq<Is...>) {
using s = int[];
(void)s{0, (void(os << (Is == 0 ? "" : ", ") << get<Is>(t)), 0)...};
}
template <class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr> &os, tuple<Args...> const &t)
-> basic_ostream<Ch, Tr> & {
os << "(";
print_tuple(os, t, gen_seq<sizeof...(Args)>());
return os << ")";
}
ostream &operator<<(ostream &o, const vvll &v) {
rep(i, v.size()) {
rep(j, v[i].size()) o << v[i][j] << " ";
o << endl;
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T>
ostream &operator<<(ostream &o, const unordered_set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U>
ostream &operator<<(ostream &o, const map<T, U> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U, typename V>
ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it;
o << "]";
return o;
}
vector<int> range(const int x, const int y) {
vector<int> v(y - x + 1);
iota(v.begin(), v.end(), x);
return v;
}
template <typename T> istream &operator>>(istream &i, vector<T> &o) {
rep(j, o.size()) i >> o[j];
return i;
}
template <typename T, typename S, typename U>
ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.front();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> unordered_map<T, ll> counter(vector<T> vec) {
unordered_map<T, ll> ret;
for (auto &&x : vec)
ret[x]++;
return ret;
};
string substr(string s, P x) { return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll &g, int mode = 0, string filename = "out.png") {
ofstream ofs("./out.dot");
ofs << "digraph graph_name {" << endl;
set<P> memo;
rep(i, g.size()) rep(j, g[i].size()) {
if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i))))
continue;
memo.insert(P(i, g[i][j]));
ofs << " " << i << " -> " << g[i][j]
<< (mode ? " [arrowhead = none]" : "") << endl;
}
ofs << "}" << endl;
ofs.close();
system(((string) "dot -T png out.dot >" + filename).c_str());
}
size_t random_seed;
namespace std {
using argument_type = P;
template <> struct hash<argument_type> {
size_t operator()(argument_type const &x) const {
size_t seed = random_seed;
seed ^= hash<ll>{}(x.fi);
seed ^= (hash<ll>{}(x.se) << 1);
return seed;
}
};
}; // namespace std
#define ldout fixed << setprecision(40)
#define EPS (double)1e-14
#define INF (ll)1e18
#define mo (ll)(1e9 + 7)
// end of hamko utils
int N, A, B, C;
vector<int> L;
int dfs(int depth, int a, int b, int c) {
int ret0, ret1, ret2, ret3, ret4;
if (depth == N) { // Nまで潜ったら
if (a != 0 && b != 0 && c != 0)
return abs(A - a) + abs(B - b) + abs(C - c) -
30; //かつA,B,Cで最低1本ちゃんと使うようになってたら、合成竹とA,B,Cの絶対値差を出して合成魔法最初の1発分全部余分だからさっ引きましょう
else
return INF; // 0本使用があったら最小値にならないようにINFにしとけ
}
ret0 = dfs(
depth + 1, a, b,
c); //まだN本まで潜ってなかったらその竹について4つの作業のうちどれをとるか検討。ret0は放置
ret1 = dfs(depth + 1, a + L[depth], b, c) + 10; // ret1はaに合成
ret2 = dfs(depth + 1, a, b + L[depth], c) + 10; // ret2はbに合成
ret3 = dfs(depth + 1, a, b, c + L[depth]) + 10; // ret3はcに合成
return min({ret0, ret1, ret2, ret3}); // ret0～3の中で最小の手段をとる
}
int main() {
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++)
cin >> L[i];
cout << dfs(0, 0, 0, 0) << endl;
return 0;
} | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template <class T1, class T2> bool chmin(T1 &a, T2 b) {
return b < a && (a = b, true);
}
template <class T1, class T2> bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<ll, ll>;
using ld = long double;
using vld = vector<ld>;
using vi = vector<int>;
using vvi = vector<vi>;
vll conv(vi &v) {
vll r(v.size());
rep(i, v.size()) r[i] = v[i];
return r;
}
inline void input(int &v) {
v = 0;
char c = 0;
int p = 1;
while (c < '0' || c > '9') {
if (c == '-')
p = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
v = (v << 3) + (v << 1) + c - '0';
c = getchar();
}
v *= p;
} // これを使うならば、tieとかを消して！！
template <typename T, typename U>
ostream &operator<<(ostream &o, const pair<T, U> &v) {
o << "(" << v.first << ", " << v.second << ")";
return o;
}
template <size_t...> struct seq {};
template <size_t N, size_t... Is>
struct gen_seq : gen_seq<N - 1, N - 1, Is...> {};
template <size_t... Is> struct gen_seq<0, Is...> : seq<Is...> {};
template <class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch, Tr> &os, Tuple const &t, seq<Is...>) {
using s = int[];
(void)s{0, (void(os << (Is == 0 ? "" : ", ") << get<Is>(t)), 0)...};
}
template <class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr> &os, tuple<Args...> const &t)
-> basic_ostream<Ch, Tr> & {
os << "(";
print_tuple(os, t, gen_seq<sizeof...(Args)>());
return os << ")";
}
ostream &operator<<(ostream &o, const vvll &v) {
rep(i, v.size()) {
rep(j, v[i].size()) o << v[i][j] << " ";
o << endl;
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T>
ostream &operator<<(ostream &o, const unordered_set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U>
ostream &operator<<(ostream &o, const map<T, U> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U, typename V>
ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it;
o << "]";
return o;
}
vector<int> range(const int x, const int y) {
vector<int> v(y - x + 1);
iota(v.begin(), v.end(), x);
return v;
}
template <typename T> istream &operator>>(istream &i, vector<T> &o) {
rep(j, o.size()) i >> o[j];
return i;
}
template <typename T, typename S, typename U>
ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.front();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> unordered_map<T, ll> counter(vector<T> vec) {
unordered_map<T, ll> ret;
for (auto &&x : vec)
ret[x]++;
return ret;
};
string substr(string s, P x) { return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll &g, int mode = 0, string filename = "out.png") {
ofstream ofs("./out.dot");
ofs << "digraph graph_name {" << endl;
set<P> memo;
rep(i, g.size()) rep(j, g[i].size()) {
if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i))))
continue;
memo.insert(P(i, g[i][j]));
ofs << " " << i << " -> " << g[i][j]
<< (mode ? " [arrowhead = none]" : "") << endl;
}
ofs << "}" << endl;
ofs.close();
system(((string) "dot -T png out.dot >" + filename).c_str());
}
size_t random_seed;
namespace std {
using argument_type = P;
template <> struct hash<argument_type> {
size_t operator()(argument_type const &x) const {
size_t seed = random_seed;
seed ^= hash<ll>{}(x.fi);
seed ^= (hash<ll>{}(x.se) << 1);
return seed;
}
};
}; // namespace std
#define ldout fixed << setprecision(40)
#define EPS (double)1e-14
#define INF (ll)1e9
#define mo (ll)(1e9 + 7)
// end of hamko utils
int N, A, B, C;
vector<int> L(100);
int dfs(int depth, int a, int b, int c) {
int ret0, ret1, ret2, ret3, ret4;
if (depth == N) { // Nまで潜ったら
if (a != 0 && b != 0 && c != 0)
return abs(A - a) + abs(B - b) + abs(C - c) -
30; //かつA,B,Cで最低1本ちゃんと使うようになってたら、合成竹とA,B,Cの絶対値差を出して合成魔法最初の1発分全部余分だからさっ引きましょう
else
return INF; // 0本使用があったら最小値にならないようにINFにしとけ
}
ret0 = dfs(
depth + 1, a, b,
c); //まだN本まで潜ってなかったらその竹について4つの作業のうちどれをとるか検討。ret0は放置
ret1 = dfs(depth + 1, a + L[depth], b, c) + 10; // ret1はaに合成
ret2 = dfs(depth + 1, a, b + L[depth], c) + 10; // ret2はbに合成
ret3 = dfs(depth + 1, a, b, c + L[depth]) + 10; // ret3はcに合成
return min({ret0, ret1, ret2, ret3}); // ret0～3の中で最小の手段をとる
}
int main() {
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++)
cin >> L[i];
cout << dfs(0, 0, 0, 0) << endl;
return 0;
} | [
"preprocessor.define.value.change",
"literal.float.change",
"call.arguments.add"
] | 924,279 | 924,280 | u142878260 | cpp |
p03111 | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <sys/time.h>
#include <sys/timeb.h>
#include <time.h>
using namespace std;
#define ll long long
#define uint unsigned int
#define ulong unsigned long long int
#define Vec vector
template <typename T> bool InRange(T t, T l, T r) { return l <= t && t < r; }
int main() {
int N, A, B, C;
cin >> N >> A >> B >> C;
Vec<int> L(N);
for (int i = 0; i < N; i++)
cin >> L[i];
int mi = (int)1e9;
for (int i = 0; i < (1 << N); i++) {
for (int j = 0; j < (1 << N); j++) {
for (int k = 0; k < (1 << N); k++) {
if (((i & j) > 0) || ((j & k) > 0) || ((k & i) > 0))
continue;
int a = 0;
int b = 0;
int c = 0;
int tot = 0;
int ca = 0, cb = 0, cc = 0;
for (int t = 0; t < N; t++) {
if ((i >> t) % 2 == 1) {
a += L[t];
ca++;
}
if ((j >> t) % 2 == 1) {
b += L[t];
cb++;
}
if ((k >> t) % 2 == 1) {
c += L[t];
cc++;
}
}
tot += max(0, (ca - 1)) * 10;
tot += max(0, (cb - 1)) * 10;
tot += max(0, (cc - 1)) * 10;
tot += abs(a - A);
tot += abs(b - B);
tot += abs(c - C);
// cout << i << " " << j << " " << k <<" : " << a << " " << b << " " <<
// c << " tot:" << tot << endl;
mi = min(mi, tot);
}
}
}
cout << mi << endl;
return 0;
} | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <sys/time.h>
#include <sys/timeb.h>
#include <time.h>
using namespace std;
#define ll long long
#define uint unsigned int
#define ulong unsigned long long int
#define Vec vector
template <typename T> bool InRange(T t, T l, T r) { return l <= t && t < r; }
int main() {
int N, A, B, C;
cin >> N >> A >> B >> C;
Vec<int> L(N);
for (int i = 0; i < N; i++)
cin >> L[i];
int mi = (int)1e9;
for (int i = 1; i < (1 << N); i++) {
for (int j = 1; j < (1 << N); j++) {
for (int k = 1; k < (1 << N); k++) {
if (((i & j) > 0) || ((j & k) > 0) || ((k & i) > 0))
continue;
int a = 0;
int b = 0;
int c = 0;
int tot = 0;
int ca = 0, cb = 0, cc = 0;
for (int t = 0; t < N; t++) {
if ((i >> t) % 2 == 1) {
a += L[t];
ca++;
}
if ((j >> t) % 2 == 1) {
b += L[t];
cb++;
}
if ((k >> t) % 2 == 1) {
c += L[t];
cc++;
}
}
tot += max(0, (ca - 1)) * 10;
tot += max(0, (cb - 1)) * 10;
tot += max(0, (cc - 1)) * 10;
tot += abs(a - A);
tot += abs(b - B);
tot += abs(c - C);
// cout << i << " " << j << " " << k <<" : " << a << " " << b << " " <<
// c << " tot:" << tot << endl;
mi = min(mi, tot);
}
}
}
cout << mi << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 924,293 | 924,294 | u774845108 | cpp |
p03111 | #include <iostream>
#include <vector>
using namespace std;
struct Bamboo {
int mp;
int da;
int db;
int dc;
};
int main() {
int n, a, b, c;
cin >> n >> a >> b >> c;
vector<int> l(n);
for (int i = 0; i < n; ++i)
cin >> l[i];
vector<Bamboo> bamboo;
for (int i = 0; i < (1 << n); ++i) {
int length = 0;
int mp = -10;
for (int j = 0; j < n; ++j) {
if ((i >> j) & 1) {
length += l[j];
mp += 10;
}
}
mp = max(mp, 0);
int da = abs(a - length);
int db = abs(b - length);
int dc = abs(c - length);
bamboo.emplace_back(Bamboo{mp, da, db, dc});
}
const int m = 1 << n;
int ret = 1000000000;
for (int ia = 0; ia < m; ++ia) {
for (int ib = 0; ib < m; ++ib) {
if (ia & ib)
continue;
for (int ic = 0; ic < m; ++ic) {
if ((ia & ic) || (ib & ic))
continue;
int cost = bamboo[ia].da + bamboo[ia].mp + bamboo[ib].db +
bamboo[ib].mp + bamboo[ic].dc + bamboo[ic].mp;
ret = min(ret, cost);
}
}
}
cout << ret << "\n";
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
struct Bamboo {
int mp;
int da;
int db;
int dc;
};
int main() {
int n, a, b, c;
cin >> n >> a >> b >> c;
vector<int> l(n);
for (int i = 0; i < n; ++i)
cin >> l[i];
vector<Bamboo> bamboo;
for (int i = 0; i < (1 << n); ++i) {
int length = 0;
int mp = -10;
for (int j = 0; j < n; ++j) {
if ((i >> j) & 1) {
length += l[j];
mp += 10;
}
}
mp = max(mp, 0);
int da = abs(a - length);
int db = abs(b - length);
int dc = abs(c - length);
bamboo.emplace_back(Bamboo{mp, da, db, dc});
}
const int m = 1 << n;
int ret = 1000000000;
for (int ia = 1; ia < m; ++ia) {
for (int ib = 1; ib < m; ++ib) {
if (ia & ib)
continue;
for (int ic = 1; ic < m; ++ic) {
if ((ia & ic) || (ib & ic))
continue;
int cost = bamboo[ia].da + bamboo[ia].mp + bamboo[ib].db +
bamboo[ib].mp + bamboo[ic].dc + bamboo[ic].mp;
ret = min(ret, cost);
}
}
}
cout << ret << "\n";
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 924,295 | 924,296 | u661686644 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int INF = 1 << 30;
int N, A[3], L[8];
int main() {
cin >> N;
for (int i = 0; i < 3; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> L[i];
vector<int> dp(1 << N, INF);
dp[0] = 0;
for (int i = 0; i < 3; i++) {
vector<int> dp2(1 << N, INF);
for (int j = 0; j < 1 << N; j++) {
for (int k = 0; k < 1 << N; k++) {
if (j & k)
continue;
int cost = (__builtin_popcount(k) - 1) * 10;
int sum = 0;
for (int l = 0; l < N; l++) {
if ((k >> l) & 1)
sum += L[l];
}
cost += abs(A[i] - sum);
dp2[j | k] = min(dp2[j | k], dp[j] + cost);
}
}
dp.swap(dp2);
}
cout << *min_element(begin(dp), end(dp)) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int INF = 1 << 30;
int N, A[3], L[8];
int main() {
cin >> N;
for (int i = 0; i < 3; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> L[i];
vector<int> dp(1 << N, INF);
dp[0] = 0;
for (int i = 0; i < 3; i++) {
vector<int> dp2(1 << N, INF);
for (int j = 0; j < 1 << N; j++) {
for (int k = 1; k < 1 << N; k++) {
if (j & k)
continue;
int cost = (__builtin_popcount(k) - 1) * 10;
int sum = 0;
for (int l = 0; l < N; l++) {
if ((k >> l) & 1)
sum += L[l];
}
cost += abs(A[i] - sum);
dp2[j | k] = min(dp2[j | k], dp[j] + cost);
}
}
dp.swap(dp2);
}
cout << *min_element(begin(dp), end(dp)) << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 924,297 | 924,298 | u524343822 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<int64_t> s(a);
for (int i = 0; i < a; i++)
cin >> s.at(i);
vector<int64_t> t(b);
for (int i = 0; i < b; i++)
cin >> t.at(i);
for (int _ = 0; _ < q; _++) {
int64_t x;
cin >> x;
int64_t sl = -1, sr = -1, tl = -1, tr = -1;
auto bs = lower_bound(s.begin(), s.end(), x);
if (bs != s.begin())
sl = x - *(bs - 1);
if (bs != s.end())
sr = *bs - x;
auto bt = lower_bound(t.begin(), t.end(), x);
if (bt != t.begin())
tl = x - *(bt - 1);
if (bs != t.end())
tr = *bt - x;
int64_t u = max({sl, sr, tl, tr});
sl = (sl == -1 ? u * 3 : sl);
sr = (sr == -1 ? u * 3 : sr);
tl = (tl == -1 ? u * 3 : tl);
tr = (tr == -1 ? u * 3 : tr);
cout << min({max(sl, tl), sr + tl + min(sr, tl), sl + tr + min(sl, tr),
max(sr, tr)})
<< endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<int64_t> s(a);
for (int i = 0; i < a; i++)
cin >> s.at(i);
vector<int64_t> t(b);
for (int i = 0; i < b; i++)
cin >> t.at(i);
for (int _ = 0; _ < q; _++) {
int64_t x;
cin >> x;
int64_t sl = -1, sr = -1, tl = -1, tr = -1;
auto bs = lower_bound(s.begin(), s.end(), x);
if (bs != s.begin())
sl = x - *(bs - 1);
if (bs != s.end())
sr = *bs - x;
auto bt = lower_bound(t.begin(), t.end(), x);
if (bt != t.begin())
tl = x - *(bt - 1);
if (bt != t.end())
tr = *bt - x;
int64_t u = max({sl, sr, tl, tr});
sl = (sl == -1 ? u * 3 : sl);
sr = (sr == -1 ? u * 3 : sr);
tl = (tl == -1 ? u * 3 : tl);
tr = (tr == -1 ? u * 3 : tr);
cout << min({max(sl, tl), sr + tl + min(sr, tl), sl + tr + min(sl, tr),
max(sr, tr)})
<< endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 924,299 | 924,300 | u145855676 | cpp |
p03112 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define pb push_back
#define mod 1000000007
//#define mod 998244353
int A, B, Q;
int s[100005];
int t[100005];
int x[100005];
signed main() {
scanf("%lld %lld %lld", &A, &B, &Q);
rep(i, A) scanf("%lld", &s[i]);
rep(i, B) scanf("%lld", &t[i]);
rep(i, Q) {
scanf("%lld", &x[i]);
int si2 = lower_bound(s, s + A, x[i]) - s; //右にある神社のイテレータ
int si1 = si2 - 1; //左にある神社のイテレータ
int s1, s2;
if (si1 < 0)
s1 = -LLINF; //左に神社がない
else
s1 = s[si1];
if (si2 >= A)
s2 = LLINF; //右に神社がない
else
s2 = s[si2];
int ti2 = lower_bound(t, t + B, x[i]) - t; //右にある寺のイテレータ
int ti1 = ti2 - 1; //左にある寺のイテレータ
int t1, t2;
if (ti1 < 0)
t1 = -LLINF; //左に寺がない
else
t1 = t[ti1];
if (ti2 >= A)
t2 = LLINF; //右に寺がない
else
t2 = t[ti2];
// printf("[%lld %lld %lld %lld]\n",t1,t2,s1,s2);
int ans = LLINF;
ans = min(ans, x[i] - min(t1, s1)); //ずっと左に行く
ans = min(ans, max(t2, s2) - x[i]); //ずっと右に行く
ans = min(ans, x[i] - t1 + s2 - t1); //寺は左、神社は右(1)
ans = min(ans, s2 - x[i] + s2 - t1); //寺は左、神社は右(2)
ans = min(ans, x[i] - s1 + t2 - s1); //寺は右、神社は左(1)
ans = min(ans, t2 - x[i] + t2 - s1); //寺は右、神社は左(2)
printf("%lld\n", ans);
}
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define pb push_back
#define mod 1000000007
//#define mod 998244353
int A, B, Q;
int s[100005];
int t[100005];
int x[100005];
signed main() {
scanf("%lld %lld %lld", &A, &B, &Q);
rep(i, A) scanf("%lld", &s[i]);
rep(i, B) scanf("%lld", &t[i]);
rep(i, Q) {
scanf("%lld", &x[i]);
int si2 = lower_bound(s, s + A, x[i]) - s; //右にある神社のイテレータ
int si1 = si2 - 1; //左にある神社のイテレータ
int s1, s2;
if (si1 < 0)
s1 = -LLINF; //左に神社がない
else
s1 = s[si1];
if (si2 >= A)
s2 = LLINF; //右に神社がない
else
s2 = s[si2];
int ti2 = lower_bound(t, t + B, x[i]) - t; //右にある寺のイテレータ
int ti1 = ti2 - 1; //左にある寺のイテレータ
int t1, t2;
if (ti1 < 0)
t1 = -LLINF; //左に寺がない
else
t1 = t[ti1];
if (ti2 >= B)
t2 = LLINF; //右に寺がない
else
t2 = t[ti2];
// printf("[%lld %lld %lld %lld]\n",t1,t2,s1,s2);
int ans = LLINF;
ans = min(ans, x[i] - min(t1, s1)); //ずっと左に行く
ans = min(ans, max(t2, s2) - x[i]); //ずっと右に行く
ans = min(ans, x[i] - t1 + s2 - t1); //寺は左、神社は右(1)
ans = min(ans, s2 - x[i] + s2 - t1); //寺は左、神社は右(2)
ans = min(ans, x[i] - s1 + t2 - s1); //寺は右、神社は左(1)
ans = min(ans, t2 - x[i] + t2 - s1); //寺は右、神社は左(2)
printf("%lld\n", ans);
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 924,321 | 924,322 | u857644621 | cpp |
p03112 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); i++)
#define all(i, n) (i), (i + n)
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, -1, 0, 1};
int dx8[8] = {1, 0, -1, 1, -1, 1, 0, -1};
int dy8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
typedef pair<int, int> P;
typedef pair<string, int> SP;
typedef long long ll;
const int INF = 1e9;
const ll LLINF = 1e18;
const int MAX_V = 1e6 + 1;
const ll mod = 1000000007;
// --------------------------------------
int a, b, q;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> a >> b >> q;
vector<ll> s(a);
vector<ll> t(b);
REP(i, a) cin >> s[i];
REP(i, b) cin >> t[i];
REP(i, q) {
ll x;
cin >> x;
auto its = lower_bound(s.begin(), s.end(), x);
auto itt = lower_bound(t.begin(), t.end(), x);
ll ss = its == s.begin() ? *its : *(its - 1);
ll ts = itt == t.begin() ? *itt : *(itt - 1);
ll se = its == s.end() ? *(its - 1) : *its;
ll te = itt == t.end() ? *(itt - 1) : *itt;
ll d1 = min(abs(x - ss), abs(x - ts)) + abs(ss - ts);
ll d2 = min(abs(x - ss), abs(x - te)) + abs(ss - te);
ll d3 = min(abs(x - se), abs(x - te)) + abs(ss - te);
ll d4 = min(abs(x - se), abs(x - ts)) + abs(ss - ts);
cout << min({d1, d2, d3, d4}) << endl;
}
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); i++)
#define all(i, n) (i), (i + n)
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, -1, 0, 1};
int dx8[8] = {1, 0, -1, 1, -1, 1, 0, -1};
int dy8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
typedef pair<int, int> P;
typedef pair<string, int> SP;
typedef long long ll;
const int INF = 1e9;
const ll LLINF = 1e18;
const int MAX_V = 1e6 + 1;
const ll mod = 1000000007;
// --------------------------------------
int a, b, q;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> a >> b >> q;
vector<ll> s(a);
vector<ll> t(b);
REP(i, a) cin >> s[i];
REP(i, b) cin >> t[i];
REP(i, q) {
ll x;
cin >> x;
auto its = lower_bound(s.begin(), s.end(), x);
auto itt = lower_bound(t.begin(), t.end(), x);
ll ss = its == s.begin() ? *its : *(its - 1);
ll ts = itt == t.begin() ? *itt : *(itt - 1);
ll se = its == s.end() ? *(its - 1) : *its;
ll te = itt == t.end() ? *(itt - 1) : *itt;
ll d1 = min(abs(x - ss), abs(x - ts)) + abs(ss - ts);
ll d2 = min(abs(x - ss), abs(x - te)) + abs(ss - te);
ll d3 = min(abs(x - se), abs(x - te)) + abs(se - te);
ll d4 = min(abs(x - se), abs(x - ts)) + abs(se - ts);
cout << min({d1, d2, d3, d4}) << endl;
}
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,323 | 924,324 | u502772848 | cpp |
p03112 | /*
ABC119-D
問題
A社の神社とB軒の寺がある。
西からi社目の神社はsiメートル、i軒目の寺はtiメートルの地点
があります。
以下Q個の問いに答える。
問i:道路のxiメートルの地点から出発して自由に移動したとき、
神社1社と寺1軒に訪れるのに必要な最小の移動距離は何メートルか。
制約
1<=A,B<=10^5
1<=Q<=10^5
1<=si,ti,xi<=10^10
方針
単純にxiに一番近い神社と寺に行くのが最短距離なのはわかる。
ただし、パターンとしては以下があるので、全パターン試す。
・最初に前方最寄りの神社に行き、前方最寄りの寺にいく
・最初に前方最寄りの神社に行き、後方最寄りの寺にいく
・最初に後方最寄りの神社に行き、前方最寄りの寺にいく
・最初に後方最寄りの神社に行き、後方最寄りの寺にいく
・最初に前方最寄りの寺に行き、前方最寄りの神社にいく
・最初に前方最寄りの寺に行き、後方最寄りの神社にいく
・最初に後方最寄りの寺に行き、前方最寄りの神社にいく
・最初に後方最寄りの寺に行き、後方最寄りの神社にいく
最寄りを調べるためには以下の二分探索を用いる(O(logN))
lower_bound
・探索したい値以上が現れる最初の位置のイテレータ
v ={1,2,3,4,5} x = 3だったら、index:2の位置のイテレータ
upper_bound
・探索したい値より大きい値が現れる最初の位置のイテレータ
v ={1,2,3,4,5} x = 3だったら、index:3の位置のイテレータ
・前方のindex(自分自身を含む)
upper_bound(v.begin(), v.end(), x) - v.begin() - 1
・前方のindex(自分自身を含まない)
lower_bound(v.begin(), v.end(), x) - v.begin() - 1
・後方のindex(自分自身を含む)
lower_bound(v.begin(), v.end(), x) - v.begin()
・後方のindex(自分自身を含まない)
upper_bound(v.begin(), v.end(), x) - v.begin()
*/
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL << 60;
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;
}
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
int main() {
int A, B, Q;
cin >> A >> B >> Q;
vector<ll> s(A), t(B), x(Q);
rep(i, A) cin >> s[i];
rep(i, B) cin >> t[i];
sort(s.begin(), s.end());
sort(t.begin(), t.end());
rep(i, Q) cin >> x[i];
rep(i, Q) {
ll ng = -1;
ll ok = s.size();
while (abs(ok - ng) > 1) {
ll mid = (ok + ng) / 2;
auto f = [&](ll mid) { return s[mid] > x[i]; };
if (f(mid))
ok = mid;
else
ng = mid;
}
int s_right = min(ok, (ll)(s.size() - 1));
ng = -1;
ok = t.size();
while (abs(ok - ng) > 1) {
ll mid = (ok + ng) / 2;
auto f = [&](ll mid) { return t[mid] > x[i]; };
if (f(mid))
ok = mid;
else
ng = mid;
}
int t_right = min(ok, (ll)(t.size() - 1));
ll s_distances[2];
s_distances[0] = s[max(0, s_right - 1)];
s_distances[1] = s[s_right];
ll t_distances[2];
t_distances[0] = t[max(0, s_right - 1)];
t_distances[1] = t[t_right];
ll ans = INF;
for (int j = 0; j < 2; j++) {
ans = min(ans, abs(x[i] - s_distances[j]) +
abs(s_distances[j] - t_distances[j]));
ans = min(ans, abs(x[i] - s_distances[j]) +
abs(s_distances[j] - t_distances[(j + 1) % 2]));
}
for (int j = 0; j < 2; j++) {
ans = min(ans, abs(x[i] - t_distances[j]) +
abs(t_distances[j] - s_distances[j]));
ans = min(ans, abs(x[i] - t_distances[j]) +
abs(t_distances[j] - s_distances[(j + 1) % 2]));
}
// coutを遅いので、クエリが多い場合はprintfを使用
printf("%lld\n", ans);
}
} | /*
ABC119-D
問題
A社の神社とB軒の寺がある。
西からi社目の神社はsiメートル、i軒目の寺はtiメートルの地点
があります。
以下Q個の問いに答える。
問i:道路のxiメートルの地点から出発して自由に移動したとき、
神社1社と寺1軒に訪れるのに必要な最小の移動距離は何メートルか。
制約
1<=A,B<=10^5
1<=Q<=10^5
1<=si,ti,xi<=10^10
方針
単純にxiに一番近い神社と寺に行くのが最短距離なのはわかる。
ただし、パターンとしては以下があるので、全パターン試す。
・最初に前方最寄りの神社に行き、前方最寄りの寺にいく
・最初に前方最寄りの神社に行き、後方最寄りの寺にいく
・最初に後方最寄りの神社に行き、前方最寄りの寺にいく
・最初に後方最寄りの神社に行き、後方最寄りの寺にいく
・最初に前方最寄りの寺に行き、前方最寄りの神社にいく
・最初に前方最寄りの寺に行き、後方最寄りの神社にいく
・最初に後方最寄りの寺に行き、前方最寄りの神社にいく
・最初に後方最寄りの寺に行き、後方最寄りの神社にいく
最寄りを調べるためには以下の二分探索を用いる(O(logN))
lower_bound
・探索したい値以上が現れる最初の位置のイテレータ
v ={1,2,3,4,5} x = 3だったら、index:2の位置のイテレータ
upper_bound
・探索したい値より大きい値が現れる最初の位置のイテレータ
v ={1,2,3,4,5} x = 3だったら、index:3の位置のイテレータ
・前方のindex(自分自身を含む)
upper_bound(v.begin(), v.end(), x) - v.begin() - 1
・前方のindex(自分自身を含まない)
lower_bound(v.begin(), v.end(), x) - v.begin() - 1
・後方のindex(自分自身を含む)
lower_bound(v.begin(), v.end(), x) - v.begin()
・後方のindex(自分自身を含まない)
upper_bound(v.begin(), v.end(), x) - v.begin()
*/
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL << 60;
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;
}
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
int main() {
int A, B, Q;
cin >> A >> B >> Q;
vector<ll> s(A), t(B), x(Q);
rep(i, A) cin >> s[i];
rep(i, B) cin >> t[i];
sort(s.begin(), s.end());
sort(t.begin(), t.end());
rep(i, Q) cin >> x[i];
rep(i, Q) {
ll ng = -1;
ll ok = s.size();
while (abs(ok - ng) > 1) {
ll mid = (ok + ng) / 2;
auto f = [&](ll mid) { return s[mid] > x[i]; };
if (f(mid))
ok = mid;
else
ng = mid;
}
int s_right = min(ok, (ll)(s.size() - 1));
ng = -1;
ok = t.size();
while (abs(ok - ng) > 1) {
ll mid = (ok + ng) / 2;
auto f = [&](ll mid) { return t[mid] > x[i]; };
if (f(mid))
ok = mid;
else
ng = mid;
}
int t_right = min(ok, (ll)(t.size() - 1));
ll s_distances[2];
s_distances[0] = s[max(0, s_right - 1)];
s_distances[1] = s[s_right];
ll t_distances[2];
t_distances[0] = t[max(0, t_right - 1)];
t_distances[1] = t[t_right];
ll ans = INF;
for (int j = 0; j < 2; j++) {
ans = min(ans, abs(x[i] - s_distances[j]) +
abs(s_distances[j] - t_distances[j]));
ans = min(ans, abs(x[i] - s_distances[j]) +
abs(s_distances[j] - t_distances[(j + 1) % 2]));
}
for (int j = 0; j < 2; j++) {
ans = min(ans, abs(x[i] - t_distances[j]) +
abs(t_distances[j] - s_distances[j]));
ans = min(ans, abs(x[i] - t_distances[j]) +
abs(t_distances[j] - s_distances[(j + 1) % 2]));
}
// coutを遅いので、クエリが多い場合はprintfを使用
printf("%lld\n", ans);
}
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,327 | 924,328 | u622045059 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
const ll INF = 1LL << 58;
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<ll> s(a + 2), t(b + 2);
rep(i, a) cin >> s[i + 1];
rep(i, b) cin >> t[i + 1];
s[0] = t[0] = -INF;
s[a + 1] = t[a + 1] = INF;
sort(s.begin(), s.end());
sort(t.begin(), t.end());
vector<ll> p(q);
rep(i, q) {
ll x;
cin >> x;
ll ans = INF;
ll al = lower_bound(s.begin(), s.end(), x) - s.begin();
ll bl = lower_bound(t.begin(), t.end(), x) - t.begin();
ll af = upper_bound(s.begin(), s.end(), x) - s.begin() - 1;
ll bf = upper_bound(t.begin(), t.end(), x) - t.begin() - 1;
ans = min(ans, abs(s[af] - x) + abs(s[af] - t[bf]));
ans = min(ans, abs(s[af] - x) + abs(s[af] - t[bl]));
ans = min(ans, abs(s[al] - x) + abs(s[al] - t[bl]));
ans = min(ans, abs(s[al] - x) + abs(s[al] - t[bf]));
ans = min(ans, abs(t[bf] - x) + abs(s[af] - t[bf]));
ans = min(ans, abs(t[bf] - x) + abs(s[al] - t[bf]));
ans = min(ans, abs(t[bl] - x) + abs(s[af] - t[bl]));
ans = min(ans, abs(t[bl] - x) + abs(s[al] - t[bl]));
p[i] = ans;
}
rep(i, q) cout << p[i] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
const ll INF = 1LL << 58;
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<ll> s(a + 2), t(b + 2);
rep(i, a) cin >> s[i + 1];
rep(i, b) cin >> t[i + 1];
s[0] = t[0] = -INF;
s[a + 1] = t[b + 1] = INF;
sort(s.begin(), s.end());
sort(t.begin(), t.end());
vector<ll> p(q);
rep(i, q) {
ll x;
cin >> x;
ll ans = INF;
ll al = lower_bound(s.begin(), s.end(), x) - s.begin();
ll bl = lower_bound(t.begin(), t.end(), x) - t.begin();
ll af = upper_bound(s.begin(), s.end(), x) - s.begin() - 1;
ll bf = upper_bound(t.begin(), t.end(), x) - t.begin() - 1;
ans = min(ans, abs(s[af] - x) + abs(s[af] - t[bf]));
ans = min(ans, abs(s[af] - x) + abs(s[af] - t[bl]));
ans = min(ans, abs(s[al] - x) + abs(s[al] - t[bl]));
ans = min(ans, abs(s[al] - x) + abs(s[al] - t[bf]));
ans = min(ans, abs(t[bf] - x) + abs(s[af] - t[bf]));
ans = min(ans, abs(t[bf] - x) + abs(s[al] - t[bf]));
ans = min(ans, abs(t[bl] - x) + abs(s[af] - t[bl]));
ans = min(ans, abs(t[bl] - x) + abs(s[al] - t[bl]));
p[i] = ans;
}
rep(i, q) cout << p[i] << endl;
return 0;
} | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 924,344 | 924,345 | u818349438 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
const ll INF = 1 << 30;
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<ll> s(a + 2), t(b + 2);
rep(i, a) cin >> s[i + 1];
rep(i, b) cin >> t[i + 1];
s[0] = t[0] = -INF;
s[a + 2] = t[a + 2] = INF;
sort(s.begin(), s.end());
sort(t.begin(), t.end());
vector<ll> p(q);
rep(i, q) {
ll x;
cin >> x;
ll ans = INF;
ll al = lower_bound(s.begin(), s.end(), x) - s.begin();
ll bl = lower_bound(t.begin(), t.end(), x) - t.begin();
ll af = upper_bound(s.begin(), s.end(), x) - s.begin() - 1;
ll bf = upper_bound(t.begin(), t.end(), x) - t.begin() - 1;
ans = min(ans, abs(s[af] - x) + abs(s[af] - t[bf]));
ans = min(ans, abs(s[af] - x) + abs(s[af] - t[bl]));
ans = min(ans, abs(s[al] - x) + abs(s[al] - t[bl]));
ans = min(ans, abs(s[al] - x) + abs(s[al] - t[bf]));
ans = min(ans, abs(t[bf] - x) + abs(s[af] - t[bf]));
ans = min(ans, abs(t[bf] - x) + abs(s[al] - t[bf]));
ans = min(ans, abs(t[bl] - x) + abs(s[af] - t[bl]));
ans = min(ans, abs(t[bl] - x) + abs(s[al] - t[bl]));
p[i] = ans;
}
rep(i, q) cout << p[i] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
const ll INF = 1LL << 58;
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<ll> s(a + 2), t(b + 2);
rep(i, a) cin >> s[i + 1];
rep(i, b) cin >> t[i + 1];
s[0] = t[0] = -INF;
s[a + 1] = t[b + 1] = INF;
sort(s.begin(), s.end());
sort(t.begin(), t.end());
vector<ll> p(q);
rep(i, q) {
ll x;
cin >> x;
ll ans = INF;
ll al = lower_bound(s.begin(), s.end(), x) - s.begin();
ll bl = lower_bound(t.begin(), t.end(), x) - t.begin();
ll af = upper_bound(s.begin(), s.end(), x) - s.begin() - 1;
ll bf = upper_bound(t.begin(), t.end(), x) - t.begin() - 1;
ans = min(ans, abs(s[af] - x) + abs(s[af] - t[bf]));
ans = min(ans, abs(s[af] - x) + abs(s[af] - t[bl]));
ans = min(ans, abs(s[al] - x) + abs(s[al] - t[bl]));
ans = min(ans, abs(s[al] - x) + abs(s[al] - t[bf]));
ans = min(ans, abs(t[bf] - x) + abs(s[af] - t[bf]));
ans = min(ans, abs(t[bf] - x) + abs(s[al] - t[bf]));
ans = min(ans, abs(t[bl] - x) + abs(s[af] - t[bl]));
ans = min(ans, abs(t[bl] - x) + abs(s[al] - t[bl]));
p[i] = ans;
}
rep(i, q) cout << p[i] << endl;
return 0;
} | [
"literal.number.type.widen.change",
"literal.number.change",
"expression.operation.binary.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"identifier.change"
] | 924,346 | 924,345 | u818349438 | cpp |
p03112 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
const ll INF = (ll)1e10 + 1;
int main() {
ll a, b, q;
cin >> a >> b >> q;
vector<ll> s(a), t(b);
rep(i, a) cin >> s[i];
rep(i, b) cin >> t[i];
rep(i, q) {
ll x;
cin >> x;
auto itrsl = lower_bound(rall(s), x, greater<ll>());
auto itrsr = lower_bound(all(s), x);
auto itrtl = lower_bound(rall(t), x, greater<ll>());
auto itrtr = lower_bound(all(t), x);
ll sl, sr, tl, tr;
sl = max(x - *itrsl, (distance(s.rend(), itrsl) == 0) * INF);
sr = max(*itrsr - x, (distance(s.end(), itrsr) == 0) * INF);
tl = max(x - *itrtl, (distance(t.rend(), itrtl) == 0) * INF);
tr = max(*itrtr - x, (distance(t.end(), itrtr) == 0) * INF);
cout << min({max(sl, tl), max(sr, tr),
min(sl, sr) + min(tl, tr) + min({sl, sr, tl, tr})})
<< endl;
}
return 0;
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
const ll INF = (ll)2e10;
int main() {
ll a, b, q;
cin >> a >> b >> q;
vector<ll> s(a), t(b);
rep(i, a) cin >> s[i];
rep(i, b) cin >> t[i];
rep(i, q) {
ll x;
cin >> x;
auto itrsl = lower_bound(rall(s), x, greater<ll>());
auto itrsr = lower_bound(all(s), x);
auto itrtl = lower_bound(rall(t), x, greater<ll>());
auto itrtr = lower_bound(all(t), x);
ll sl, sr, tl, tr;
sl = max(x - *itrsl, (distance(s.rend(), itrsl) == 0) * INF);
sr = max(*itrsr - x, (distance(s.end(), itrsr) == 0) * INF);
tl = max(x - *itrtl, (distance(t.rend(), itrtl) == 0) * INF);
tr = max(*itrtr - x, (distance(t.end(), itrtr) == 0) * INF);
cout << min({max(sl, tl), max(sr, tr),
min(sl, sr) + min(tl, tr) + min({sl, sr, tl, tr})})
<< endl;
}
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 924,351 | 924,352 | u930561195 | cpp |
p03112 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define COUT(x) cout << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
#define pb push_back
#define ld long double
const long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
using Graph = vector<VE>;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
// assert(n < MOD);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} com(10);
struct Sieve {
int n;
vector<int> f, primes;
// n以下の素数を列挙する
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
// xが素数かどうか判定する
bool isPrime(int x) { return f[x] == x; }
// 素因数を全列挙
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
// ランレングス圧縮
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
class UnionFind {
public:
vector<ll> par; // 各元の親を表す配列
vector<ll> siz; // 素集合のサイズを表す配列(1 で初期化)
// Constructor
UnionFind(ll sz_) : par(sz_), siz(sz_, 1) {
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
void init(ll sz_) {
par.resize(sz_);
siz.resize(sz_, 1);
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
// Member Function
// Find
ll root(ll x) { // 根の検索
while (par[x] != x) {
x = par[x] = par[par[x]]; // x の親の親を x の親とする
}
return x;
}
// Union(Unite, Merge)
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
// merge technique（データ構造をマージするテク．小を大にくっつける）
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { // 連結判定
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
mint POW(mint n, int p) {
if (p == 0)
return 1;
if (p % 2 == 0) {
mint t = POW(n, p / 2);
return t * t;
}
return n * POW(n, p - 1);
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
struct edge {
ll to, cost;
};
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(15);
int a, b, q;
cin >> a >> b >> q;
VE s;
s.push_back(-INF);
rep(i, a) {
int tmp;
cin >> tmp;
s.push_back(tmp);
}
s.push_back(INF);
VE t;
t.push_back(-INF);
rep(i, b) {
int tmp;
cin >> tmp;
t.push_back(tmp);
}
t.push_back(INF);
rep(i, q) {
int x;
cin >> x;
int sa = abs(x - *(upper_bound(ALL(s), x) - 1));
int sb = abs(x - *lower_bound(ALL(s), x));
int ta = abs(x - *(upper_bound(ALL(t), x) - 1));
int tb = abs(x - *lower_bound(ALL(t), x));
cout << min({max(sa, ta), min(sa, sb) + min(ta, tb) + min({sa, sb, ta, tb}),
max(ta, tb)})
<< endl;
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define COUT(x) cout << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
#define pb push_back
#define ld long double
const long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
using Graph = vector<VE>;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
// assert(n < MOD);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} com(10);
struct Sieve {
int n;
vector<int> f, primes;
// n以下の素数を列挙する
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
// xが素数かどうか判定する
bool isPrime(int x) { return f[x] == x; }
// 素因数を全列挙
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
// ランレングス圧縮
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
class UnionFind {
public:
vector<ll> par; // 各元の親を表す配列
vector<ll> siz; // 素集合のサイズを表す配列(1 で初期化)
// Constructor
UnionFind(ll sz_) : par(sz_), siz(sz_, 1) {
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
void init(ll sz_) {
par.resize(sz_);
siz.resize(sz_, 1);
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
// Member Function
// Find
ll root(ll x) { // 根の検索
while (par[x] != x) {
x = par[x] = par[par[x]]; // x の親の親を x の親とする
}
return x;
}
// Union(Unite, Merge)
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
// merge technique（データ構造をマージするテク．小を大にくっつける）
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { // 連結判定
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
mint POW(mint n, int p) {
if (p == 0)
return 1;
if (p % 2 == 0) {
mint t = POW(n, p / 2);
return t * t;
}
return n * POW(n, p - 1);
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
struct edge {
ll to, cost;
};
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(15);
int a, b, q;
cin >> a >> b >> q;
VE s;
s.push_back(-INF);
rep(i, a) {
int tmp;
cin >> tmp;
s.push_back(tmp);
}
s.push_back(INF);
VE t;
t.push_back(-INF);
rep(i, b) {
int tmp;
cin >> tmp;
t.push_back(tmp);
}
t.push_back(INF);
rep(i, q) {
int x;
cin >> x;
int sa = abs(x - *(upper_bound(ALL(s), x) - 1));
int sb = abs(x - *lower_bound(ALL(s), x));
int ta = abs(x - *(upper_bound(ALL(t), x) - 1));
int tb = abs(x - *lower_bound(ALL(t), x));
cout << min({max(sa, ta), min(sa, sb) + min(ta, tb) + min({sa, sb, ta, tb}),
max(sb, tb)})
<< endl;
}
return 0;
} | [
"identifier.change",
"io.output.change"
] | 924,359 | 924,360 | u809967037 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define PER(i, a, b) for (ll i = (a); i >= (b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
#define ALL(a) (a).begin(), (a).end()
const ll INF = 1e18 + 18;
const ll MAX = 200000;
const ll MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
static const long double pi = 3.141592653589793;
int main() {
ll A, B, Q;
cin >> A >> B >> Q;
vector<ll> S(A), T(B);
rep(i, A) { cin >> S[i]; }
rep(i, B) { cin >> T[i]; }
rep(i, Q) {
ll X;
cin >> X;
auto itrS = lower_bound(ALL(S), X);
auto itrT = lower_bound(ALL(T), X);
ll D, DD, C, CC;
if (*itrS == X) {
D = X;
DD = X;
} else if (itrS == S.begin()) {
D = -1 * INF;
DD = S[0];
} else if (itrS == S.end()) {
D = S[A - 1];
DD = INF;
} else {
DD = *itrS;
itrS--;
D = *itrS;
}
if (*itrT == X) {
C = X;
CC = X;
} else if (itrT == T.begin()) {
C = -1 * INF;
CC = T[0];
} else if (itrT == T.end()) {
C = T[A - 1];
CC = INF;
} else {
CC = *itrT;
itrT--;
C = *itrT;
}
// cout<<D<<" "<<C<<" "<<" "<<CC<<" "<<DD<<endl;
vector<ll> W(6);
W[0] = (CC + X - 2 * D);
W[1] = (2 * CC - X - D);
W[2] = (DD + X - 2 * C);
W[3] = (2 * DD - X - C);
W[4] = X - min(C, D);
W[5] = max(CC, DD) - X;
sort(ALL(W));
cout << W[0] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define PER(i, a, b) for (ll i = (a); i >= (b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
#define ALL(a) (a).begin(), (a).end()
const ll INF = 1e18 + 18;
const ll MAX = 200000;
const ll MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
static const long double pi = 3.141592653589793;
int main() {
ll A, B, Q;
cin >> A >> B >> Q;
vector<ll> S(A), T(B);
rep(i, A) { cin >> S[i]; }
rep(i, B) { cin >> T[i]; }
rep(i, Q) {
ll X;
cin >> X;
auto itrS = lower_bound(ALL(S), X);
auto itrT = lower_bound(ALL(T), X);
ll D, DD, C, CC;
if (*itrS == X) {
D = X;
DD = X;
} else if (itrS == S.begin()) {
D = -1 * INF;
DD = S[0];
} else if (itrS == S.end()) {
D = S[A - 1];
DD = INF;
} else {
DD = *itrS;
itrS--;
D = *itrS;
}
if (*itrT == X) {
C = X;
CC = X;
} else if (itrT == T.begin()) {
C = -1 * INF;
CC = T[0];
} else if (itrT == T.end()) {
C = T[B - 1];
CC = INF;
} else {
CC = *itrT;
itrT--;
C = *itrT;
}
// cout<<D<<" "<<C<<" "<<" "<<CC<<" "<<DD<<endl;
vector<ll> W(6);
W[0] = (CC + X - 2 * D);
W[1] = (2 * CC - X - D);
W[2] = (DD + X - 2 * C);
W[3] = (2 * DD - X - C);
W[4] = X - min(C, D);
W[5] = max(CC, DD) - X;
sort(ALL(W));
cout << W[0] << endl;
}
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 924,372 | 924,373 | u196629968 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int A, B, Q;
cin >> A >> B >> Q;
vector<ll> s(A + 1), t(B + 1), x(Q);
s[0] = t[0] = -1e18;
for (int i = 1; i <= A; i++)
cin >> s[i];
for (int i = 1; i <= B; i++)
cin >> t[i];
for (int i = 0; i < Q; i++)
cin >> x[i];
s.push_back(1e18);
t.push_back(1e18);
for (int i = 0; i < Q; i++) {
ll rs = *lower_bound(s.begin(), s.end(), x[i]);
ll ls = *(lower_bound(s.begin(), s.end(), x[i]) - 1);
ll rt = *lower_bound(t.begin(), t.end(), x[i]);
ll lt = *(lower_bound(t.begin(), t.end(), x[i]) - 1);
ll lsd = x[i] - ls;
ll rsd = rs - x[i];
ll ltd = x[i] - lt;
ll rtd = rt - x[i];
ll ans = max(lsd, ltd);
ll ans2 = max(rsd, rsd);
ll ans3 = lsd + rtd + min(lsd, rtd);
ll ans4 = ltd + rsd + min(ltd, rsd);
ans = min(ans, ans2);
ans = min(ans, ans3);
ans = min(ans, ans4);
cout << ans << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int A, B, Q;
cin >> A >> B >> Q;
vector<ll> s(A + 1), t(B + 1), x(Q);
s[0] = t[0] = -1e18;
for (int i = 1; i <= A; i++)
cin >> s[i];
for (int i = 1; i <= B; i++)
cin >> t[i];
for (int i = 0; i < Q; i++)
cin >> x[i];
s.push_back(1e18);
t.push_back(1e18);
for (int i = 0; i < Q; i++) {
ll rs = *lower_bound(s.begin(), s.end(), x[i]);
ll ls = *(lower_bound(s.begin(), s.end(), x[i]) - 1);
ll rt = *lower_bound(t.begin(), t.end(), x[i]);
ll lt = *(lower_bound(t.begin(), t.end(), x[i]) - 1);
ll lsd = x[i] - ls;
ll rsd = rs - x[i];
ll ltd = x[i] - lt;
ll rtd = rt - x[i];
ll ans = max(lsd, ltd);
ll ans2 = max(rsd, rtd);
ll ans3 = lsd + rtd + min(lsd, rtd);
ll ans4 = ltd + rsd + min(ltd, rsd);
ans = min(ans, ans2);
ans = min(ans, ans3);
ans = min(ans, ans4);
cout << ans << "\n";
}
return 0;
}
| [
"identifier.change",
"call.arguments.change"
] | 924,381 | 924,382 | u756388720 | cpp |
p03112 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) \
for (auto x : (V)) \
cout << x << " " << endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<int> y4 = {1, 0, -1, 0}, y8 = {1, 1, 0, -1, -1, -1, 0, 1};
template <class T> struct edge {
int from, to;
T cost;
};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline T powerM(T a, T b) {
if (b == 0)
return 1;
T tmp = powerM(a, b / 2);
if (b % 2 == 0)
return tmp * tmp % MOD;
else
return tmp * tmp % MOD * a % MOD;
}
template <class T> inline T power(T a, T b, T m) {
if (b == 0)
return 1;
T tmp = power(a, b / 2, m);
if (b % 2 == 0)
return tmp * tmp % m;
else
return tmp * tmp % m * a % m;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
// ax+by=gcd(a,b)を解く
template <class T> inline T extgcd(T a, T b, T &x, T &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
T d = extgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
void hey() { cout << "hey" << endl; }
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<ll> s(a), t(b);
rep(i, a) cin >> s[i];
rep(i, b) cin >> t[i];
rep(qq, q) {
ll x;
cin >> x;
// 地点 x から左右に近いもの各々が神社、寺の訪れるものの候補
// 但し地点 x に丁度存在するときはややこしそう
int s1, t1, s2, t2;
if (lower_bound(all(s), x) == s.end()) {
// x 以上には神社は存在しない
s1 = lower_bound(all(s), x) - s.begin() - 1;
s2 = s1;
} else {
s2 = lower_bound(all(s), x) - s.begin(); // x 以上で一番近い神社のindex
// s2 の地点が丁度 x だったり、s2より前の地点が存在しなければs1 = s2
if (s2 == 0 || s[s2] == x)
s1 = s2;
else
s1 = s2 - 1;
}
if (lower_bound(all(t), x) == t.end()) {
t1 = lower_bound(all(t), x) - t.begin() - 1;
t2 = t1;
} else {
t2 = lower_bound(all(s), x) - t.begin(); // x 以上で一番近い寺のindex
if (t2 == 0 || t[t2] == x)
t1 = t2;
else
t1 = t2 - 1;
}
// 特殊な条件を除き、s1,s2は神社に関して、t1,t2は寺に関して、
// 各々x以下、x以上で一番近い地点のindexを表す
// とりあえず(s1,s2)*(t1,t2)を全部調べればいい
ll res = 1000000000000000;
int ss, tt;
rep(i, 2) {
rep(j, 2) {
ss = i == 0 ? s1 : s2;
tt = j == 0 ? t1 : t2;
// s[ss]とt[tt]を両方回るのに必要な移動距離は
ll buf = abs(s[ss] - t[tt]); // 神社⇔寺
buf += min(abs(x - s[ss]),
abs(x - t[tt])); // 神社または寺の近い方にたどり着く
chmin(res, buf);
}
}
cout << res << endl;
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) \
for (auto x : (V)) \
cout << x << " " << endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<int> y4 = {1, 0, -1, 0}, y8 = {1, 1, 0, -1, -1, -1, 0, 1};
template <class T> struct edge {
int from, to;
T cost;
};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline T powerM(T a, T b) {
if (b == 0)
return 1;
T tmp = powerM(a, b / 2);
if (b % 2 == 0)
return tmp * tmp % MOD;
else
return tmp * tmp % MOD * a % MOD;
}
template <class T> inline T power(T a, T b, T m) {
if (b == 0)
return 1;
T tmp = power(a, b / 2, m);
if (b % 2 == 0)
return tmp * tmp % m;
else
return tmp * tmp % m * a % m;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
// ax+by=gcd(a,b)を解く
template <class T> inline T extgcd(T a, T b, T &x, T &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
T d = extgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
void hey() { cout << "hey" << endl; }
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<ll> s(a), t(b);
rep(i, a) cin >> s[i];
rep(i, b) cin >> t[i];
rep(qq, q) {
ll x;
cin >> x;
// 地点 x から左右に近いもの各々が神社、寺の訪れるものの候補
// 但し地点 x に丁度存在するときはややこしそう
int s1, t1, s2, t2;
if (lower_bound(all(s), x) == s.end()) {
// x 以上には神社は存在しない
s1 = lower_bound(all(s), x) - s.begin() - 1;
s2 = s1;
} else {
s2 = lower_bound(all(s), x) - s.begin(); // x 以上で一番近い神社のindex
// s2 の地点が丁度 x だったり、s2より前の地点が存在しなければs1 = s2
if (s2 == 0 || s[s2] == x)
s1 = s2;
else
s1 = s2 - 1;
}
if (lower_bound(all(t), x) == t.end()) {
t1 = lower_bound(all(t), x) - t.begin() - 1;
t2 = t1;
} else {
t2 = lower_bound(all(t), x) - t.begin(); // x 以上で一番近い寺のindex
if (t2 == 0 || t[t2] == x)
t1 = t2;
else
t1 = t2 - 1;
}
// 特殊な条件を除き、s1,s2は神社に関して、t1,t2は寺に関して、
// 各々x以下、x以上で一番近い地点のindexを表す
// とりあえず(s1,s2)*(t1,t2)を全部調べればいい
ll res = 1000000000000000;
int ss, tt;
rep(i, 2) {
rep(j, 2) {
ss = i == 0 ? s1 : s2;
tt = j == 0 ? t1 : t2;
// s[ss]とt[tt]を両方回るのに必要な移動距離は
ll buf = abs(s[ss] - t[tt]); // 神社⇔寺
buf += min(abs(x - s[ss]),
abs(x - t[tt])); // 神社または寺の近い方にたどり着く
chmin(res, buf);
}
}
cout << res << endl;
}
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,394 | 924,395 | u195132800 | cpp |
p03112 | // ref: https://drken1215.hatenablog.com/entry/2019/02/24/230900
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
using namespace std;
//---
template <typename T> inline void print(const T &rhs) {
std::cout << " = " << rhs << std::endl;
}
template <typename T> inline void print(const std::vector<T> &rhs) {
std::cout << " = [ ";
for (uint i = 0; i < rhs.size(); ++i) {
std::cout << rhs[i] << ' ';
}
std::cout << "]" << std::endl;
}
template <typename T>
inline void print(const std::vector<std::vector<T>> &rhs) {
std::cout << " = " << std::endl;
std::cout << "[[ ";
for (uint p = 0; p < rhs.size(); ++p) {
if (p != 0) {
std::cout << " [ ";
}
for (uint q = 0; q < rhs[p].size(); ++q) {
std::cout << rhs[p][q] << ' ';
}
if (p != rhs.size() - 1) {
std::cout << "]" << std::endl;
}
}
std::cout << "]]" << std::endl;
}
template <typename TL, typename TR>
inline void print(const std::vector<std::pair<TR, TL>> &rhs) {
std::cout << " = [";
uint i = 0;
for (; i < rhs.size() - 1; ++i) {
std::cout << "[f: " << rhs[i].first << ", s: " << rhs[i].second << "], ";
}
std::cout << "[f: " << rhs[i].first << ", s: " << rhs[i].second << "]]"
<< endl;
}
#define printn(var) \
{ \
printf("%s", #var); \
print(var); \
}
#define printn_all(var) \
{ \
printf("%s(%d): ", __func__, __LINE__); \
printf("%s", #var); \
print(var); \
}
//---
//*
int64 nearest(const vector<int64> &v, int64 dst) {
int l_idx = 0;
int r_idx = v.size() - 1;
if (dst <= v[l_idx]) {
return v[l_idx];
}
if (dst >= v[r_idx]) {
return v[r_idx];
}
while (r_idx - l_idx > 1) { // binary search
int n_idx = (l_idx + r_idx) / 2;
if (dst < v[n_idx]) {
r_idx = n_idx;
} else {
l_idx = n_idx;
}
}
return (abs(v[l_idx] - dst) < abs(v[r_idx] - dst)
? v[l_idx]
: v[r_idx]); // return neatest index with value.
}
//*/
/*
pair<int,int> arg_nearest(const vector<int64>& v, int64 dst){
int l_idx = 0;
int r_idx = v.size() - 1;
if(dst <= v[l_idx]){ return make_pair(l_idx, l_idx); }
if(dst >= v[r_idx]){ return make_pair(r_idx, r_idx); }
while(r_idx - l_idx > 1){ // binary search
int n_idx = (l_idx + r_idx)/2;
if(dst < v[n_idx]){ r_idx = n_idx;
} else { l_idx = n_idx; }
}
return make_pair(l_idx, r_idx);
}
//*/
/*
template<typename T>
T nearest_down(const vector<T>& v, const T& value){
uint idx = std::upper_bound(v.begin(), v.end(), value) - v.begin();
return v[ (idx!=0 ? idx-1:0) ];
}
template<typename T>
T nearest_up (const vector<T>& v, const T& value){
uint idx = std::lower_bound(v.begin(), v.end(), value) - v.begin();
return v[ (idx!=v.size() ? idx:v.size()-1) ];
}
template<typename T>
T nearest(const vector<T>& v, const T& value){
T val1 = nearest_down(v, value);
T val2 = nearest_up (v, value);
return (abs(val1-value)<abs(val2-value) ? val1 : val2);
}
*/
template <typename T> uint argnearest_down(const vector<T> &v, const T &value) {
uint idx = upper_bound(v.begin(), v.end(), value) - v.begin();
return (idx != 0 ? idx - 1 : 0);
}
template <typename T> uint argnearest_up(const vector<T> &v, const T &value) {
uint idx = lower_bound(v.begin(), v.end(), value) - v.begin();
return (idx != v.size() ? idx : v.size() - 1);
}
int main() {
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
int A, B, Q;
cin >> A >> B >> Q;
vector<int64> vS(A);
for (int i = 0; i < A; ++i) {
cin >> vS[i];
} // sort(vS.begin(), vS.end());
vector<int64> vT(B);
for (int i = 0; i < B; ++i) {
cin >> vT[i];
} // sort(vT.begin(), vT.end());
vector<int64> vX(Q);
for (int i = 0; i < Q; ++i) {
cin >> vX[i];
}
for (int i = 0; i < Q; ++i) {
int idxL, idxR;
int64 val1, val2;
int64 tmp1 = 0ll, tmp2 = 0ll;
idxL = argnearest_down(vS, vX[i]);
idxR = argnearest_up(vS, vX[i]);
val1 = nearest(vT, vS[idxL]);
val2 = nearest(vT, vS[idxR]);
tmp1 += abs(vS[idxL] - vX[i]);
tmp1 += abs(val1 - vS[idxL]);
tmp2 += abs(vS[idxR] - vX[i]);
tmp2 += abs(val2 - vS[idxR]);
tmp1 = min(tmp1, tmp2);
int64 tmp3 = 0ll, tmp4 = 0ll;
idxL = argnearest_down(vS, vX[i]);
idxR = argnearest_up(vS, vX[i]);
val1 = nearest(vS, vT[idxL]);
val2 = nearest(vS, vT[idxR]);
tmp3 += abs(vT[idxL] - vX[i]);
tmp3 += abs(val1 - vT[idxL]);
tmp4 += abs(vT[idxR] - vX[i]);
tmp4 += abs(val2 - vT[idxR]);
tmp3 = min(tmp3, tmp4);
cout << min(tmp1, tmp3) << endl;
}
return 0;
}
| // ref: https://drken1215.hatenablog.com/entry/2019/02/24/230900
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
using namespace std;
//---
template <typename T> inline void print(const T &rhs) {
std::cout << " = " << rhs << std::endl;
}
template <typename T> inline void print(const std::vector<T> &rhs) {
std::cout << " = [ ";
for (uint i = 0; i < rhs.size(); ++i) {
std::cout << rhs[i] << ' ';
}
std::cout << "]" << std::endl;
}
template <typename T>
inline void print(const std::vector<std::vector<T>> &rhs) {
std::cout << " = " << std::endl;
std::cout << "[[ ";
for (uint p = 0; p < rhs.size(); ++p) {
if (p != 0) {
std::cout << " [ ";
}
for (uint q = 0; q < rhs[p].size(); ++q) {
std::cout << rhs[p][q] << ' ';
}
if (p != rhs.size() - 1) {
std::cout << "]" << std::endl;
}
}
std::cout << "]]" << std::endl;
}
template <typename TL, typename TR>
inline void print(const std::vector<std::pair<TR, TL>> &rhs) {
std::cout << " = [";
uint i = 0;
for (; i < rhs.size() - 1; ++i) {
std::cout << "[f: " << rhs[i].first << ", s: " << rhs[i].second << "], ";
}
std::cout << "[f: " << rhs[i].first << ", s: " << rhs[i].second << "]]"
<< endl;
}
#define printn(var) \
{ \
printf("%s", #var); \
print(var); \
}
#define printn_all(var) \
{ \
printf("%s(%d): ", __func__, __LINE__); \
printf("%s", #var); \
print(var); \
}
//---
//*
int64 nearest(const vector<int64> &v, int64 dst) {
int l_idx = 0;
int r_idx = v.size() - 1;
if (dst <= v[l_idx]) {
return v[l_idx];
}
if (dst >= v[r_idx]) {
return v[r_idx];
}
while (r_idx - l_idx > 1) { // binary search
int n_idx = (l_idx + r_idx) / 2;
if (dst < v[n_idx]) {
r_idx = n_idx;
} else {
l_idx = n_idx;
}
}
return (abs(v[l_idx] - dst) < abs(v[r_idx] - dst)
? v[l_idx]
: v[r_idx]); // return neatest index with value.
}
//*/
/*
pair<int,int> arg_nearest(const vector<int64>& v, int64 dst){
int l_idx = 0;
int r_idx = v.size() - 1;
if(dst <= v[l_idx]){ return make_pair(l_idx, l_idx); }
if(dst >= v[r_idx]){ return make_pair(r_idx, r_idx); }
while(r_idx - l_idx > 1){ // binary search
int n_idx = (l_idx + r_idx)/2;
if(dst < v[n_idx]){ r_idx = n_idx;
} else { l_idx = n_idx; }
}
return make_pair(l_idx, r_idx);
}
//*/
/*
template<typename T>
T nearest_down(const vector<T>& v, const T& value){
uint idx = std::upper_bound(v.begin(), v.end(), value) - v.begin();
return v[ (idx!=0 ? idx-1:0) ];
}
template<typename T>
T nearest_up (const vector<T>& v, const T& value){
uint idx = std::lower_bound(v.begin(), v.end(), value) - v.begin();
return v[ (idx!=v.size() ? idx:v.size()-1) ];
}
template<typename T>
T nearest(const vector<T>& v, const T& value){
T val1 = nearest_down(v, value);
T val2 = nearest_up (v, value);
return (abs(val1-value)<abs(val2-value) ? val1 : val2);
}
*/
template <typename T> uint argnearest_down(const vector<T> &v, const T &value) {
uint idx = upper_bound(v.begin(), v.end(), value) - v.begin();
return (idx != 0 ? idx - 1 : 0);
}
template <typename T> uint argnearest_up(const vector<T> &v, const T &value) {
uint idx = lower_bound(v.begin(), v.end(), value) - v.begin();
return (idx != v.size() ? idx : v.size() - 1);
}
int main() {
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
int A, B, Q;
cin >> A >> B >> Q;
vector<int64> vS(A);
for (int i = 0; i < A; ++i) {
cin >> vS[i];
} // sort(vS.begin(), vS.end());
vector<int64> vT(B);
for (int i = 0; i < B; ++i) {
cin >> vT[i];
} // sort(vT.begin(), vT.end());
vector<int64> vX(Q);
for (int i = 0; i < Q; ++i) {
cin >> vX[i];
}
for (int i = 0; i < Q; ++i) {
int idxL, idxR;
int64 val1, val2;
int64 tmp1 = 0ll, tmp2 = 0ll;
idxL = argnearest_down(vS, vX[i]);
idxR = argnearest_up(vS, vX[i]);
val1 = nearest(vT, vS[idxL]);
val2 = nearest(vT, vS[idxR]);
tmp1 += abs(vS[idxL] - vX[i]);
tmp1 += abs(val1 - vS[idxL]);
tmp2 += abs(vS[idxR] - vX[i]);
tmp2 += abs(val2 - vS[idxR]);
tmp1 = min(tmp1, tmp2);
int64 tmp3 = 0ll, tmp4 = 0ll;
idxL = argnearest_down(vT, vX[i]);
idxR = argnearest_up(vT, vX[i]);
val1 = nearest(vS, vT[idxL]);
val2 = nearest(vS, vT[idxR]);
tmp3 += abs(vT[idxL] - vX[i]);
tmp3 += abs(val1 - vT[idxL]);
tmp4 += abs(vT[idxR] - vX[i]);
tmp4 += abs(val2 - vT[idxR]);
tmp3 = min(tmp3, tmp4);
cout << min(tmp1, tmp3) << endl;
}
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 924,408 | 924,409 | u456420540 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
typedef long long ll;
const ll INFLL = 1e18;
int main() {
ll A, B, Q;
cin >> A >> B >> Q;
vector<ll> s(A + 2), t(B + 2);
s[0] = t[0] = -INFLL;
s[A + 1] = t[B + 1] = INFLL;
rep(i, A) cin >> s[i];
rep(i, B) cin >> t[i];
rep(i, Q) {
ll x;
cin >> x;
ll ans = INFLL;
int si = lower_bound(all(s), x) - s.begin();
int ti = lower_bound(all(t), x) - t.begin();
for (int j = si - 1; j <= si; j++) {
for (int k = ti - 1; k <= ti; k++) {
ll S = s[j];
ll T = t[k];
chmin(ans, abs(S - x) + abs(S - T));
chmin(ans, abs(T - x) + abs(T - S));
}
}
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
typedef long long ll;
const ll INFLL = 1e18;
int main() {
ll A, B, Q;
cin >> A >> B >> Q;
vector<ll> s(A + 2), t(B + 2);
s[0] = t[0] = -INFLL;
s[A + 1] = t[B + 1] = INFLL;
rep1(i, A + 1) cin >> s[i];
rep1(i, B + 1) cin >> t[i];
rep(i, Q) {
ll x;
cin >> x;
ll ans = INFLL;
int si = lower_bound(all(s), x) - s.begin();
int ti = lower_bound(all(t), x) - t.begin();
for (int j = si - 1; j <= si; j++) {
for (int k = ti - 1; k <= ti; k++) {
ll S = s[j];
ll T = t[k];
chmin(ans, abs(S - x) + abs(S - T));
chmin(ans, abs(T - x) + abs(T - S));
}
}
cout << ans << endl;
}
} | [
"identifier.change",
"call.function.change"
] | 924,412 | 924,413 | u106297876 | cpp |
p03112 | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++i)
#define irep1(i, a, n) for (int i = a; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; --i)
#define allrep(X, x) for (auto &&X : x)
#define all(x) begin(x), end(x)
#ifdef LOCAL
#include "../../Lib/cout_container.hpp"
#define debug(x) cout << #x " => " << (x) << endl
#else
#define debug(x) 0
#endif
using lint = long long;
constexpr int INF = 1 << 28;
constexpr lint INFL = 1LL << 60;
constexpr int MOD = (int)1e9 + 7;
constexpr double EPS = 1e-9;
using namespace std;
namespace {
struct INIT {
INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} INIT;
} // namespace
int main(void) {
int a, b, q;
cin >> a >> b >> q;
vector<lint> s(a), t(b), x(q);
rep(i, a) cin >> s[i];
rep(i, b) cin >> t[i];
rep(i, q) cin >> x[i];
vector<pair<lint, lint>> slr(a), tlr(b);
rep(i, a) {
int idx = lower_bound(all(t), s[i]) - t.begin();
if (idx < a)
slr[i].second = t[idx] - s[i];
else
slr[i].second = INFL;
if (idx)
slr[i].first = s[i] - t[--idx];
else
slr[i].first = INFL;
}
rep(i, b) {
int idx = lower_bound(all(s), t[i]) - s.begin();
if (idx < b)
tlr[i].second = s[idx] - t[i];
else
tlr[i].second = INFL;
if (idx)
tlr[i].first = t[i] - s[--idx];
else
tlr[i].first = INFL;
}
vector<lint> ans(q);
rep(i, q) {
lint mini = LLONG_MAX, sum;
int tidx = lower_bound(all(t), x[i]) - t.begin();
if (tidx < b) {
sum = t[tidx] - x[i] + min(tlr[tidx].first, tlr[tidx].second);
mini = min(mini, sum);
}
if (tidx) {
--tidx;
sum = x[i] - t[tidx] + min(tlr[tidx].first, tlr[tidx].second);
mini = min(mini, sum);
}
int sidx = lower_bound(all(s), x[i]) - s.begin();
if (sidx < a) {
sum = s[sidx] - x[i] + min(slr[sidx].first, slr[sidx].second);
mini = min(mini, sum);
}
if (sidx) {
--sidx;
sum = x[i] - s[sidx] + min(slr[sidx].first, slr[sidx].second);
mini = min(mini, sum);
}
ans[i] = mini;
}
allrep(x, ans) cout << x << "\n";
return 0;
} | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++i)
#define irep1(i, a, n) for (int i = a; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; --i)
#define allrep(X, x) for (auto &&X : x)
#define all(x) begin(x), end(x)
#ifdef LOCAL
#include "../../Lib/cout_container.hpp"
#define debug(x) cout << #x " => " << (x) << endl
#else
#define debug(x) 0
#endif
using lint = long long;
constexpr int INF = 1 << 28;
constexpr lint INFL = 1LL << 60;
constexpr int MOD = (int)1e9 + 7;
constexpr double EPS = 1e-9;
using namespace std;
namespace {
struct INIT {
INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} INIT;
} // namespace
int main(void) {
int a, b, q;
cin >> a >> b >> q;
vector<lint> s(a), t(b), x(q);
rep(i, a) cin >> s[i];
rep(i, b) cin >> t[i];
rep(i, q) cin >> x[i];
vector<pair<lint, lint>> slr(a), tlr(b);
rep(i, a) {
int idx = lower_bound(all(t), s[i]) - t.begin();
if (idx < b)
slr[i].second = t[idx] - s[i];
else
slr[i].second = INFL;
if (idx)
slr[i].first = s[i] - t[--idx];
else
slr[i].first = INFL;
}
rep(i, b) {
int idx = lower_bound(all(s), t[i]) - s.begin();
if (idx < a)
tlr[i].second = s[idx] - t[i];
else
tlr[i].second = INFL;
if (idx)
tlr[i].first = t[i] - s[--idx];
else
tlr[i].first = INFL;
}
vector<lint> ans(q);
rep(i, q) {
lint mini = LLONG_MAX, sum;
int tidx = lower_bound(all(t), x[i]) - t.begin();
if (tidx < b) {
sum = t[tidx] - x[i] + min(tlr[tidx].first, tlr[tidx].second);
mini = min(mini, sum);
}
if (tidx) {
--tidx;
sum = x[i] - t[tidx] + min(tlr[tidx].first, tlr[tidx].second);
mini = min(mini, sum);
}
int sidx = lower_bound(all(s), x[i]) - s.begin();
if (sidx < a) {
sum = s[sidx] - x[i] + min(slr[sidx].first, slr[sidx].second);
mini = min(mini, sum);
}
if (sidx) {
--sidx;
sum = x[i] - s[sidx] + min(slr[sidx].first, slr[sidx].second);
mini = min(mini, sum);
}
ans[i] = mini;
}
allrep(x, ans) cout << x << "\n";
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 924,416 | 924,417 | u020746846 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define lb(v, i) lower_bound(v.begin(), v.end(), i) - v.begin()
#define ub(v, i) upper_bound(v.begin(), v.end(), i) - v.begin()
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<long long>;
using vvi = vector<vector<long long>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const int inf = 1000000009;
void chmin(auto &a, auto b) {
if (b < a)
a = b;
}
void chmax(auto &a, auto b) {
if (a < b)
a = b;
}
int main() {
ll a, b, c;
cin >> a >> b >> c;
vi s(a), t(b);
rep(i, a) cin >> s[i];
rep(i, b) cin >> t[i];
rep(i, c) {
ll k;
cin >> k;
ll ans = inf;
ll sf = lb(s, k), se = ub(s, k) - 1, tf = lb(t, k), te = ub(t, k) - 1;
if (sf < a) {
if (tf < b)
chmin(ans, max(s[sf], t[tf]) - k);
if (te >= 0)
chmin(ans, min(s[sf] - k, k - t[te]) + s[sf] - t[te]);
}
if (se >= 0) {
if (te >= 0)
chmin(ans, k - min(s[se], t[te]));
if (tf < b)
chmin(ans, min(t[tf] - k, k - s[se]) + t[tf] - s[se]);
}
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define lb(v, i) lower_bound(v.begin(), v.end(), i) - v.begin()
#define ub(v, i) upper_bound(v.begin(), v.end(), i) - v.begin()
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<long long>;
using vvi = vector<vector<long long>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const ll inf = 1000000000009;
void chmin(auto &a, auto b) {
if (b < a)
a = b;
}
void chmax(auto &a, auto b) {
if (a < b)
a = b;
}
int main() {
ll a, b, c;
cin >> a >> b >> c;
vi s(a), t(b);
rep(i, a) cin >> s[i];
rep(i, b) cin >> t[i];
rep(i, c) {
ll k;
cin >> k;
ll ans = inf;
ll sf = lb(s, k), se = ub(s, k) - 1, tf = lb(t, k), te = ub(t, k) - 1;
if (sf < a) {
if (tf < b)
chmin(ans, max(s[sf], t[tf]) - k);
if (te >= 0)
chmin(ans, min(s[sf] - k, k - t[te]) + s[sf] - t[te]);
}
if (se >= 0) {
if (te >= 0)
chmin(ans, k - min(s[se], t[te]));
if (tf < b)
chmin(ans, min(t[tf] - k, k - s[se]) + t[tf] - s[se]);
}
cout << ans << endl;
}
}
| [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 924,418 | 924,419 | u422633119 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define lb(v, i) lower_bound(v.begin(), v.end(), i) - v.begin()
#define ub(v, i) upper_bound(v.begin(), v.end(), i) - v.begin()
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<long long>;
using vvi = vector<vector<long long>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const int inf = 1000000009;
void chmin(auto &a, auto b) {
if (b < a)
a = b;
}
void chmax(auto &a, auto b) {
if (a < b)
a = b;
}
int main() {
int a, b, c;
cin >> a >> b >> c;
vi s(a), t(b);
rep(i, a) cin >> s[i];
rep(i, b) cin >> t[i];
rep(i, c) {
ll k;
cin >> k;
ll ans = inf;
int sf = lb(s, k), se = ub(s, k) - 1, tf = lb(t, k), te = ub(t, k) - 1;
if (sf < a) {
if (tf < b)
chmin(ans, max(s[sf], t[tf]) - k);
if (te >= 0)
chmin(ans, min(s[sf] - k, k - t[te]) + s[sf] - t[te]);
}
if (se >= 0) {
if (te >= 0)
chmin(ans, k - min(s[se], t[te]));
if (tf < b)
chmin(ans, min(t[tf] - k, k - s[se]) + t[tf] - s[se]);
}
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define lb(v, i) lower_bound(v.begin(), v.end(), i) - v.begin()
#define ub(v, i) upper_bound(v.begin(), v.end(), i) - v.begin()
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<long long>;
using vvi = vector<vector<long long>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const ll inf = 1000000000009;
void chmin(auto &a, auto b) {
if (b < a)
a = b;
}
void chmax(auto &a, auto b) {
if (a < b)
a = b;
}
int main() {
ll a, b, c;
cin >> a >> b >> c;
vi s(a), t(b);
rep(i, a) cin >> s[i];
rep(i, b) cin >> t[i];
rep(i, c) {
ll k;
cin >> k;
ll ans = inf;
ll sf = lb(s, k), se = ub(s, k) - 1, tf = lb(t, k), te = ub(t, k) - 1;
if (sf < a) {
if (tf < b)
chmin(ans, max(s[sf], t[tf]) - k);
if (te >= 0)
chmin(ans, min(s[sf] - k, k - t[te]) + s[sf] - t[te]);
}
if (se >= 0) {
if (te >= 0)
chmin(ans, k - min(s[se], t[te]));
if (tf < b)
chmin(ans, min(t[tf] - k, k - s[se]) + t[tf] - s[se]);
}
cout << ans << endl;
}
}
| [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 924,420 | 924,419 | u422633119 | cpp |
p03112 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int a, b, q;
cin >> a >> b >> q;
ll s[100005], t[100005];
rep(i, a) cin >> s[i];
rep(i, b) cin >> t[i];
rep(i, q) {
ll x;
cin >> x;
int s_r = upper_bound(s, s + a, x) - s;
int t_r = upper_bound(t, t + a, x) - t;
int s_l = s_r - 1;
int t_l = t_r - 1;
ll ans = 1e18;
if (s_l >= 0 && t_l >= 0)
ans = min(ans, max(x - s[s_l], x - t[t_l]));
if (s_r < a && t_r < b)
ans = min(ans, max(s[s_r] - x, t[t_r] - x));
if (s_l >= 0 && t_r < b)
ans = min(ans, x - s[s_l] + t[t_r] - x + min(x - s[s_l], t[t_r] - x));
if (s_r < a && t_l >= 0)
ans = min(ans, s[s_r] - x + x - t[t_l] + min(s[s_r] - x, x - t[t_l]));
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int a, b, q;
cin >> a >> b >> q;
ll s[100005], t[100005];
rep(i, a) cin >> s[i];
rep(i, b) cin >> t[i];
rep(i, q) {
ll x;
cin >> x;
int s_r = upper_bound(s, s + a, x) - s;
int t_r = upper_bound(t, t + b, x) - t;
int s_l = s_r - 1;
int t_l = t_r - 1;
ll ans = 1e18;
if (s_l >= 0 && t_l >= 0)
ans = min(ans, max(x - s[s_l], x - t[t_l]));
if (s_r < a && t_r < b)
ans = min(ans, max(s[s_r] - x, t[t_r] - x));
if (s_l >= 0 && t_r < b)
ans = min(ans, x - s[s_l] + t[t_r] - x + min(x - s[s_l], t[t_r] - x));
if (s_r < a && t_l >= 0)
ans = min(ans, s[s_r] - x + x - t[t_l] + min(s[s_r] - x, x - t[t_l]));
cout << ans << endl;
}
return 0;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,421 | 924,422 | u620735210 | cpp |
p03112 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int a, b, q;
cin >> a >> b >> q;
ll s[100005], t[100005];
rep(i, a) cin >> s[i];
rep(i, b) cin >> t[i];
rep(i, q) {
ll x;
cin >> x;
int s_r = upper_bound(s, s + a, x) - s;
int t_r = upper_bound(t, t + a, x) - t;
int s_l = s_r - 1;
int t_l = t_r - 1;
ll ans = 1e18;
if (s_l >= 0 && t_l >= 0)
ans = min(ans, max(x - s[s_l], x - t[t_l]));
if (s_r < a && t_r < a)
ans = min(ans, max(s[s_r] - x, t[t_r] - x));
if (s_l >= 0 && t_r < a)
ans = min(ans, x - s[s_l] + t[t_r] - x + min(x - s[s_l], t[t_r] - x));
if (s_r < a && t_l >= 0)
ans = min(ans, s[s_r] - x + x - t[t_l] + min(s[s_r] - x, x - t[t_l]));
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int a, b, q;
cin >> a >> b >> q;
ll s[100005], t[100005];
rep(i, a) cin >> s[i];
rep(i, b) cin >> t[i];
rep(i, q) {
ll x;
cin >> x;
int s_r = upper_bound(s, s + a, x) - s;
int t_r = upper_bound(t, t + b, x) - t;
int s_l = s_r - 1;
int t_l = t_r - 1;
ll ans = 1e18;
if (s_l >= 0 && t_l >= 0)
ans = min(ans, max(x - s[s_l], x - t[t_l]));
if (s_r < a && t_r < b)
ans = min(ans, max(s[s_r] - x, t[t_r] - x));
if (s_l >= 0 && t_r < b)
ans = min(ans, x - s[s_l] + t[t_r] - x + min(x - s[s_l], t[t_r] - x));
if (s_r < a && t_l >= 0)
ans = min(ans, s[s_r] - x + x - t[t_l] + min(s[s_r] - x, x - t[t_l]));
cout << ans << endl;
}
return 0;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 924,423 | 924,422 | u620735210 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 7;
const ll inf = 1e18;
int a, b, q;
ll s[N], t[N], x;
int binary(ll *p, int m) {
int l = 1, r = m, ans;
while (l <= r) {
int mid = (l + r) >> 1;
if (p[mid] <= x)
l = mid + 1;
else
r = mid - 1;
}
return l;
}
int main() {
scanf("%d%d%d", &a, &b, &q);
int j, k;
for (int i = 1; i <= a; i++)
scanf("%lld", &s[i]);
for (int i = 1; i <= b; i++)
scanf("%lld", &t[i]);
s[0] = -1 * inf, s[a + 1] = inf;
t[0] = -1 * inf, t[b + 1] = inf;
for (int i = 1; i <= q; i++) {
ll ans = 0;
scanf("%lld", &x);
j = binary(s, a);
k = binary(t, b);
ans = min(max(s[j], t[k]) - x, x - min(s[j - 1], t[k - 1]));
ans = min(ans, min(2 * t[k] - s[j - 1] - x, t[k] - 2 * s[j - 1] + x));
ans = min(ans, min(2 * s[j] - t[k - 1] - x, s[j] - 2 * t[k - 1] + x));
printf("%d\n", ans);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 7;
const ll inf = 1e17;
int a, b, q;
ll s[N], t[N], x;
int binary(ll *p, int m) {
int l = 1, r = m;
while (l <= r) {
int mid = (l + r) >> 1;
if (p[mid] <= x)
l = mid + 1;
else
r = mid - 1;
}
return l;
}
int main() {
scanf("%d%d%d", &a, &b, &q);
int j, k;
for (int i = 1; i <= a; i++)
scanf("%lld", &s[i]);
for (int i = 1; i <= b; i++)
scanf("%lld", &t[i]);
s[0] = -1 * inf, s[a + 1] = inf;
t[0] = -1 * inf, t[b + 1] = inf;
for (int i = 1; i <= q; i++) {
ll ans = 0;
scanf("%lld", &x);
j = binary(s, a);
k = binary(t, b);
ans = min(max(s[j], t[k]) - x, x - min(s[j - 1], t[k - 1]));
ans = min(ans, min(2 * t[k] - s[j - 1] - x, t[k] - 2 * s[j - 1] + x));
ans = min(ans, min(2 * s[j] - t[k - 1] - x, s[j] - 2 * t[k - 1] + x));
printf("%lld\n", ans);
}
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.remove",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 924,435 | 924,436 | u946679103 | cpp |
p03112 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
int a, b, q;
cin >> a >> b >> q;
vector<ll> s;
vector<ll> t;
vector<ll> x;
s.push_back(-999999999999);
rep(i, a) {
int num;
cin >> num;
s.push_back(num);
}
s.push_back(999999999999);
t.push_back(-999999999999);
rep(i, b) {
int num;
cin >> num;
t.push_back(num);
}
t.push_back(999999999999);
rep(i, q) {
int num;
cin >> num;
x.push_back(num);
}
ll ans = 0;
ll splace[2];
ll tplace[2];
rep(i, q) {
splace[1] = s[lower_bound(s.begin(), s.end(), x[i]) - s.begin()];
splace[0] = s[lower_bound(s.begin(), s.end(), x[i]) - s.begin() - 1];
tplace[1] = t[lower_bound(t.begin(), t.end(), x[i]) - t.begin()];
tplace[0] = t[lower_bound(t.begin(), t.end(), x[i]) - t.begin() - 1];
ll num1 = 0, num2 = 0, num3 = 0;
num1 = max(abs(splace[1] - x[i]), abs(tplace[1] - x[i]));
num2 = max(abs(splace[0] - x[i]), abs(tplace[0] - x[i]));
ll mn1 = 0, mn2 = 0;
if (abs(splace[1] - x[i]) > abs(tplace[0] - x[i])) {
mn1 = abs(tplace[0] - x[i]);
} else {
mn1 = abs(splace[1] - x[i]);
}
if (abs(splace[0] - x[i]) > abs(tplace[1] - x[i])) {
mn2 = abs(tplace[1] - x[i]);
} else {
mn2 = abs(splace[0] - x[i]);
}
num3 = min(mn1 + splace[1] - tplace[0], mn2 + tplace[1] - splace[0]);
num2 = min(num1, num2);
ans = min(num2, num3);
cout << ans << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
int a, b, q;
cin >> a >> b >> q;
vector<ll> s;
vector<ll> t;
vector<ll> x;
s.push_back(-999999999999);
rep(i, a) {
ll num;
cin >> num;
s.push_back(num);
}
s.push_back(999999999999);
t.push_back(-999999999999);
rep(i, b) {
ll num;
cin >> num;
t.push_back(num);
}
t.push_back(999999999999);
rep(i, q) {
ll num;
cin >> num;
x.push_back(num);
}
ll ans = 0;
ll splace[2];
ll tplace[2];
rep(i, q) {
splace[1] = s[lower_bound(s.begin(), s.end(), x[i]) - s.begin()];
splace[0] = s[lower_bound(s.begin(), s.end(), x[i]) - s.begin() - 1];
tplace[1] = t[lower_bound(t.begin(), t.end(), x[i]) - t.begin()];
tplace[0] = t[lower_bound(t.begin(), t.end(), x[i]) - t.begin() - 1];
ll num1 = 0, num2 = 0, num3 = 0;
num1 = max(abs(splace[1] - x[i]), abs(tplace[1] - x[i]));
num2 = max(abs(splace[0] - x[i]), abs(tplace[0] - x[i]));
ll mn1 = 0, mn2 = 0;
if (abs(splace[1] - x[i]) > abs(tplace[0] - x[i])) {
mn1 = abs(tplace[0] - x[i]);
} else {
mn1 = abs(splace[1] - x[i]);
}
if (abs(splace[0] - x[i]) > abs(tplace[1] - x[i])) {
mn2 = abs(tplace[1] - x[i]);
} else {
mn2 = abs(splace[0] - x[i]);
}
num3 = min(mn1 + splace[1] - tplace[0], mn2 + tplace[1] - splace[0]);
num2 = min(num1, num2);
ans = min(num2, num3);
cout << ans << endl;
}
return 0;
}
| [
"variable_declaration.type.change"
] | 924,443 | 924,444 | u905170328 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
#define Mod 1000000007
ll solve(vector<ll> &s, ll x) {
auto p = lower_bound(s.begin(), s.end(), x);
ll ans = 1e15;
if (p < s.end())
ans = min(ans, abs(x - *p));
if (p > s.begin()) {
ans = min(ans, abs(x - *(p - 1)));
}
return ans;
}
int main() {
int i, j;
ll a, b, q;
cin >> a >> b >> q;
vector<ll> s(a);
vector<ll> t(b);
for (i = 0; i < a; i++)
cin >> s[i];
for (i = 0; i < b; i++)
cin >> t[i];
for (i = 0; i < q; i++) {
ll x;
cin >> x;
ll ans = 1e15;
auto p = lower_bound(s.begin(), s.end(), x);
if (p < s.end())
ans = min(ans, abs(x - *p) + solve(t, *p));
if (p - s.begin() > 0) {
ans = min(ans, abs(x - *(p - 1))) + solve(t, *(p - 1));
}
p = lower_bound(t.begin(), t.end(), x);
if (p < t.end())
ans = min(ans, abs(x - *p) + solve(s, *p));
if (p - t.begin() > 0) {
ans = min(ans, abs(x - *(p - 1)) + solve(s, *(p - 1)));
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
#define Mod 1000000007
ll solve(vector<ll> &s, ll x) {
auto p = lower_bound(s.begin(), s.end(), x);
ll ans = 1e15;
if (p < s.end())
ans = min(ans, abs(x - *p));
if (p > s.begin()) {
ans = min(ans, abs(x - *(p - 1)));
}
return ans;
}
int main() {
ll i, j;
ll a, b, q;
cin >> a >> b >> q;
vector<ll> s(a);
vector<ll> t(b);
for (i = 0; i < a; i++)
cin >> s[i];
for (i = 0; i < b; i++)
cin >> t[i];
for (i = 0; i < q; i++) {
ll x;
cin >> x;
ll ans = 1e15;
auto p = lower_bound(s.begin(), s.end(), x);
if (p < s.end())
ans = min(ans, abs(x - *p) + solve(t, *p));
if (p - s.begin() > 0) {
ans = min(ans, abs(x - *(p - 1)) + solve(t, *(p - 1)));
}
p = lower_bound(t.begin(), t.end(), x);
if (p < t.end())
ans = min(ans, abs(x - *p) + solve(s, *p));
if (p - t.begin() > 0) {
ans = min(ans, abs(x - *(p - 1)) + solve(s, *(p - 1)));
}
cout << ans << endl;
}
return 0;
} | [
"variable_declaration.type.change",
"call.arguments.change"
] | 924,447 | 924,448 | u586567203 | cpp |
p03112 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
long long n, m, q;
long long a[100005], b[100005], c;
int main() {
// freopen("input.txt", "r", stdin);
scanf("%lld%lld%lld", &n, &m, &q);
for (long long i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
a[0] = -4e18;
a[n + 1] = 4e18;
for (long long i = 1; i <= m; i++) {
scanf("%lld", &b[i]);
}
b[0] = -4e18;
b[m + 1] = 4e18;
for (long long i = 1; i <= q; i++) {
long long mn = 9e18;
scanf("%lld", &c);
long long t1 = lower_bound(a, a + n + 2, c) - a;
long long t2 = lower_bound(b, b + m + 2, c) - b;
for (long long ii = t1 - 1; ii <= t1; ii++)
for (long long jj = t2 - 1; jj <= t2; jj++) {
mn = min(mn, abs(c - a[ii]) + abs(b[jj] - a[ii]));
mn = min(mn, abs(c - b[jj]) + abs(a[ii] - b[jj]));
}
printf("%lld\n", mn);
}
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
long long n, m, q;
long long a[100005], b[100005], c;
int main() {
// freopen("input.txt", "r", stdin);
scanf("%lld%lld%lld", &n, &m, &q);
for (long long i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
a[0] = -2e18;
a[n + 1] = 2e18;
for (long long i = 1; i <= m; i++) {
scanf("%lld", &b[i]);
}
b[0] = -2e18;
b[m + 1] = 2e18;
for (long long i = 1; i <= q; i++) {
long long mn = 9e18;
scanf("%lld", &c);
long long t1 = lower_bound(a, a + n + 2, c) - a;
long long t2 = lower_bound(b, b + m + 2, c) - b;
for (long long ii = t1 - 1; ii <= t1; ii++)
for (long long jj = t2 - 1; jj <= t2; jj++) {
mn = min(mn, abs(c - a[ii]) + abs(b[jj] - a[ii]));
mn = min(mn, abs(c - b[jj]) + abs(a[ii] - b[jj]));
}
printf("%lld\n", mn);
}
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 924,451 | 924,452 | u307227472 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define REPR(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define FORE(x, xs) for (const auto &x : xs)
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
const int MAX = 1e5 + 10;
const ll INF = 1e12;
int A, B, Q;
ll S[MAX], T[MAX], X[MAX];
void solve() {
set<ll> SS, TT;
SS.insert(-INF);
SS.insert(INF);
REP(i, A) SS.insert(S[i]);
TT.insert(-INF);
TT.insert(INF);
REP(i, B) TT.insert(T[i]);
REP(q, Q) {
ll x = X[q];
auto its = SS.upper_bound(x);
ll s2 = *its;
ll s1 = *(--its);
auto itt = TT.upper_bound(x);
ll t2 = *itt;
ll t1 = *(--itt);
ll ans = min(max(x - s1, x - t1), max(s2 - x, t2 - x));
ans = min(ans, min(x + t2 - 2 * s1, 2 * t2 - x - s1));
ans = min(ans, min(x + s2 - 2 * t1, 2 * t2 - x - t1));
cout << ans << endl;
}
}
int main() {
cin >> A >> B >> Q;
REP(i, A) cin >> S[i];
REP(i, B) cin >> T[i];
REP(i, Q) cin >> X[i];
solve();
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define REPR(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define FORE(x, xs) for (const auto &x : xs)
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
const int MAX = 1e5 + 10;
const ll INF = 1e12;
int A, B, Q;
ll S[MAX], T[MAX], X[MAX];
void solve() {
set<ll> SS, TT;
SS.insert(-INF);
SS.insert(INF);
REP(i, A) SS.insert(S[i]);
TT.insert(-INF);
TT.insert(INF);
REP(i, B) TT.insert(T[i]);
REP(q, Q) {
ll x = X[q];
auto its = SS.upper_bound(x);
ll s2 = *its;
ll s1 = *(--its);
auto itt = TT.upper_bound(x);
ll t2 = *itt;
ll t1 = *(--itt);
ll ans = min(max(x - s1, x - t1), max(s2 - x, t2 - x));
ans = min(ans, min(x + t2 - 2 * s1, 2 * t2 - x - s1));
ans = min(ans, min(x + s2 - 2 * t1, 2 * s2 - x - t1));
cout << ans << endl;
}
}
int main() {
cin >> A >> B >> Q;
REP(i, A) cin >> S[i];
REP(i, B) cin >> T[i];
REP(i, Q) cin >> X[i];
solve();
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,457 | 924,458 | u957084285 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int binary_search(ll x, int left, int right, vector<ll> &u) {
int center = left + (right - left) / 2;
if (right - left <= 1 || u[center] == x)
return center;
else if (u[center] < x)
return binary_search(x, center, right, u);
else
return binary_search(x, left, center, u);
}
ll min(ll a, ll b) {
if (a > b)
return b;
else
return a;
}
ll abso(ll a) {
if (a < 0)
return -a;
else
return a;
}
int main() {
int a, b;
int q;
cin >> a >> b >> q;
vector<ll> s(a + 2);
vector<ll> t(b + 2);
for (int i = 1; i <= a; i++)
cin >> s[i];
for (int i = 1; i <= b; i++)
cin >> t[i];
s[0] = -20000000000;
t[0] = -20000000000;
s[a + 1] = 30000000000;
t[b + 1] = 30000000000;
for (int i = 0; i < q; i++) {
ll x;
cin >> x;
int xa = binary_search(x, 0, a + 2, s);
int xb = binary_search(x, 0, b + 2, t);
ll min1 = min(abso(x - s[xa]) + abso(s[xa] - t[xb]),
abso(x - t[xb]) + abso(t[xb] - s[xa]));
ll min2 = min(abso(x - s[xa]) + abso(s[xa] - t[xb + 1]),
abso(x - t[xb + 1]) + abso(t[xb + 1] - s[xa]));
ll min3 = min(abso(x - s[xa + 1]) + abso(s[xa + 1] - t[xb]),
abso(x - t[xb]) + abso(t[xb] - s[xa + 1]));
ll min4 = min(abso(x - s[xa + 1]) + abso(s[xa + 1] - t[xb + 1]),
abso(x - s[xa + 1]) + abso(s[xa + 1] - t[xb + 1]));
cout << min(min(min1, min2), min(min3, min4)) << endl;
// cout << s[xa] << " " << x << " " << s[xa + 1] << endl;
// cout << t[xb] << " " << x << " " << t[xb + 1] << endl;
// cout <<min1 << " " << min2 << " " << min3 << " " << min4 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int binary_search(ll x, int left, int right, vector<ll> &u) {
int center = left + (right - left) / 2;
if (right - left <= 1 || u[center] == x)
return center;
else if (u[center] < x)
return binary_search(x, center, right, u);
else
return binary_search(x, left, center, u);
}
ll min(ll a, ll b) {
if (a > b)
return b;
else
return a;
}
ll abso(ll a) {
if (a < 0)
return -a;
else
return a;
}
int main() {
int a, b;
int q;
cin >> a >> b >> q;
vector<ll> s(a + 2);
vector<ll> t(b + 2);
for (int i = 1; i <= a; i++)
cin >> s[i];
for (int i = 1; i <= b; i++)
cin >> t[i];
s[0] = -20000000000;
t[0] = -20000000000;
s[a + 1] = 30000000000;
t[b + 1] = 30000000000;
for (int i = 0; i < q; i++) {
ll x;
cin >> x;
int xa = binary_search(x, 0, a + 2, s);
int xb = binary_search(x, 0, b + 2, t);
ll min1 = min(abso(x - s[xa]) + abso(s[xa] - t[xb]),
abso(x - t[xb]) + abso(t[xb] - s[xa]));
ll min2 = min(abso(x - s[xa]) + abso(s[xa] - t[xb + 1]),
abso(x - t[xb + 1]) + abso(t[xb + 1] - s[xa]));
ll min3 = min(abso(x - s[xa + 1]) + abso(s[xa + 1] - t[xb]),
abso(x - t[xb]) + abso(t[xb] - s[xa + 1]));
ll min4 = min(abso(x - s[xa + 1]) + abso(s[xa + 1] - t[xb + 1]),
abso(x - t[xb + 1]) + abso(t[xb + 1] - s[xa + 1]));
cout << min(min(min1, min2), min(min3, min4)) << endl;
// cout << s[xa] << " " << x << " " << s[xa + 1] << endl;
// cout << t[xb] << " " << x << " " << t[xb + 1] << endl;
// cout <<min1 << " " << min2 << " " << min3 << " " << min4 << endl;
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 924,459 | 924,460 | u788717734 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* attention
long longのシフト演算には気をつけよう
タイポした時のデバッグが死ぬほどきつくなるので変数名は最低3字くらい使った方がいいかも
sizeは(int)とキャストしよう
ごちゃごちゃ場合分けを考える前に全探索は考えましたか？
*/
const ll inf = 1LL << 58;
int main() {
int A, B, Q;
cin >> A >> B >> Q;
vector<ll> s(A + 2), t(B + 2);
for (int i = 1; i <= A; i++)
cin >> s[i];
for (int i = 1; i <= B; i++)
cin >> t[i];
s[0] = t[0] = -inf;
s[A + 1] = t[B + 1] = inf;
vector<ll> ans(Q);
ll a, b, c, d;
for (int i = 0; i < Q; i++) {
ll x;
cin >> x;
auto itr1 = lower_bound(s.begin(), s.end(), x);
ll sRight = *itr1;
itr1--;
ll sLeft = *itr1;
auto itr2 = lower_bound(t.begin(), t.end(), x);
ll tRight = *itr2;
itr2--;
ll tLeft = *itr2;
a = max(sRight, tRight);
b = x - min(sLeft, tLeft);
c = min(2 * (sRight - x) + x - tLeft, sRight - x + 2 * (x - tLeft));
d = min(2 * (tRight - x) + x - sLeft, tRight - x + 2 * (x - sLeft));
ans[i] = min(min(a, b), min(c, d));
}
for (int i = 0; i < Q; i++)
cout << ans[i] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* attention
long longのシフト演算には気をつけよう
タイポした時のデバッグが死ぬほどきつくなるので変数名は最低3字くらい使った方がいいかも
sizeは(int)とキャストしよう
ごちゃごちゃ場合分けを考える前に全探索は考えましたか？
*/
const ll inf = 1LL << 58;
int main() {
int A, B, Q;
cin >> A >> B >> Q;
vector<ll> s(A + 2), t(B + 2);
for (int i = 1; i <= A; i++)
cin >> s[i];
for (int i = 1; i <= B; i++)
cin >> t[i];
s[0] = t[0] = -inf;
s[A + 1] = t[B + 1] = inf;
vector<ll> ans(Q);
ll a, b, c, d;
for (int i = 0; i < Q; i++) {
ll x;
cin >> x;
auto itr1 = lower_bound(s.begin(), s.end(), x);
ll sRight = *itr1;
itr1--;
ll sLeft = *itr1;
auto itr2 = lower_bound(t.begin(), t.end(), x);
ll tRight = *itr2;
itr2--;
ll tLeft = *itr2;
a = max(sRight, tRight) - x;
b = x - min(sLeft, tLeft);
c = min(2 * (sRight - x) + x - tLeft, sRight - x + 2 * (x - tLeft));
d = min(2 * (tRight - x) + x - sLeft, tRight - x + 2 * (x - sLeft));
ans[i] = min(min(a, b), min(c, d));
}
for (int i = 0; i < Q; i++)
cout << ans[i] << endl;
} | [
"assignment.change"
] | 924,470 | 924,471 | u052332717 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int A, B, Q;
cin >> A >> B >> Q;
ll const INF = 1e12;
ll const MINUSINF = -1e12;
ll s[A + 2], t[B + 2];
s[0] = MINUSINF;
s[A + 1] = INF;
t[0] = MINUSINF;
t[A + 1] = INF;
for (ll i = 1; i <= A; i++)
cin >> s[i];
for (ll i = 1; i <= B; i++)
cin >> t[i];
for (ll i = 0; i < Q; i++) {
ll x;
cin >> x;
// cout << x << endl;
ll *e_s = upper_bound(s, s + A + 1, x);
ll *w_s = e_s - 1;
ll *e_t = upper_bound(t, t + B + 1, x);
ll *w_t = e_t - 1;
ll ans = min(ans, abs(*e_s - x) + abs(*e_s - *e_t)); // es->et
ans = min(ans, abs(*e_s - x) + abs(*e_s - *w_t)); // es->wt
ans = min(ans, abs(*e_t - x) + abs(*e_t - *e_s)); // et->es
ans = min(ans, abs(*e_t - x) + abs(*e_t - *w_s)); // et->ws
ans = min(ans, abs(*w_s - x) + abs(*w_s - *e_t)); // ws->et
ans = min(ans, abs(*w_s - x) + abs(*w_s - *w_t)); // ws->wt
ans = min(ans, abs(*w_t - x) + abs(*w_t - *e_s)); // wt->es
ans = min(ans, abs(*w_t - x) + abs(*w_t - *w_s)); // wt->ws
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int A, B, Q;
cin >> A >> B >> Q;
ll const INF = 1e12;
ll const MINUSINF = -1e12;
ll s[A + 2], t[B + 2];
s[0] = MINUSINF;
s[A + 1] = INF;
t[0] = MINUSINF;
t[A + 1] = INF;
for (ll i = 1; i <= A; i++)
cin >> s[i];
for (ll i = 1; i <= B; i++)
cin >> t[i];
for (ll i = 0; i < Q; i++) {
ll x;
cin >> x;
// cout << x << endl;
ll *e_s = upper_bound(s, s + A + 1, x);
ll *w_s = e_s - 1;
ll *e_t = upper_bound(t, t + B + 1, x);
ll *w_t = e_t - 1;
ll ans = abs(*e_s - x) + abs(*e_s - *e_t); // es->et
ans = min(ans, abs(*e_s - x) + abs(*e_s - *w_t)); // es->wt
ans = min(ans, abs(*e_t - x) + abs(*e_t - *e_s)); // et->es
ans = min(ans, abs(*e_t - x) + abs(*e_t - *w_s)); // et->ws
ans = min(ans, abs(*w_s - x) + abs(*w_s - *e_t)); // ws->et
ans = min(ans, abs(*w_s - x) + abs(*w_s - *w_t)); // ws->wt
ans = min(ans, abs(*w_t - x) + abs(*w_t - *e_s)); // wt->es
ans = min(ans, abs(*w_t - x) + abs(*w_t - *w_s)); // wt->ws
cout << ans << endl;
}
return 0;
} | [
"call.remove",
"call.arguments.change"
] | 924,476 | 924,477 | u998251394 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
const ll MINUSINF = -1e11;
const ll INF = 1e11;
int A, B;
int Q;
cin >> A >> B;
cin >> Q;
ll s[A + 2], t[B + 2];
s[0] = MINUSINF;
s[A + 1] = INF;
t[0] = MINUSINF;
t[A + 1] = INF;
for (int i = 1; i <= A; i++)
cin >> s[i];
for (int i = 1; i <= B; i++)
cin >> t[i];
for (int i = 0; i < Q; i++) {
ll x;
cin >> x;
ll *lA, *rA;
rA = upper_bound(s, s + A + 2, x);
lA = rA - 1;
ll *lB, *rB;
rB = upper_bound(t, t + B + 2, x);
lB = rB - 1;
ll ans = 0;
ans = abs(x - *lA) + abs(*lA - *lB); // lA -> lB
ans = min(ans, abs(x - *lA) + abs(*lA - *rB)); // lA -> rB
ans = min(ans, abs(x - *rA) + abs(*rA - *lB)); // rA -> lB
ans = min(ans, abs(x - *rA) + abs(*rA - *rB)); // rA -> rB
ans = min(ans, abs(x - *lB) + abs(*lB - *lA)); // lB -> lA
ans = min(ans, abs(x - *lB) + abs(*lB - *rA)); // lB -> rA
ans = min(ans, abs(x - *rB) + abs(*rB - *lA)); // rB -> lA
ans = min(ans, abs(x - *rB) + abs(*rB - *rA)); // rB -> rA
printf("%lld\n", ans);
// cout << ans << endl;
// cout << "x: " << x << ", lA: " << *lA << ", rA: " << *rA << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
const ll MINUSINF = -1e11;
const ll INF = 1e11;
int A, B;
int Q;
cin >> A >> B;
cin >> Q;
ll s[A + 2], t[B + 2];
s[0] = MINUSINF;
s[A + 1] = INF;
t[0] = MINUSINF;
t[A + 1] = INF;
for (int i = 1; i <= A; i++)
cin >> s[i];
for (int i = 1; i <= B; i++)
cin >> t[i];
for (int i = 0; i < Q; i++) {
ll x;
cin >> x;
ll *lA, *rA;
rA = upper_bound(s, s + A + 1, x);
lA = rA - 1;
ll *lB, *rB;
rB = upper_bound(t, t + B + 1, x);
lB = rB - 1;
ll ans = 0;
ans = abs(x - *lA) + abs(*lA - *lB); // lA -> lB
ans = min(ans, abs(x - *lA) + abs(*lA - *rB)); // lA -> rB
ans = min(ans, abs(x - *rA) + abs(*rA - *lB)); // rA -> lB
ans = min(ans, abs(x - *rA) + abs(*rA - *rB)); // rA -> rB
ans = min(ans, abs(x - *lB) + abs(*lB - *lA)); // lB -> lA
ans = min(ans, abs(x - *lB) + abs(*lB - *rA)); // lB -> rA
ans = min(ans, abs(x - *rB) + abs(*rB - *lA)); // rB -> lA
ans = min(ans, abs(x - *rB) + abs(*rB - *rA)); // rB -> rA
printf("%lld\n", ans);
// cout << ans << endl;
// cout << "x: " << x << ", lA: " << *lA << ", rA: " << *rA << endl;
}
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,478 | 924,479 | u998251394 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.