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 |
|---|---|---|---|---|---|---|---|
p02996 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
const long long INF = 1LL << 60;
ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
map<int, int> mp;
rep(i, n) {
int A, B;
cin >> A >> B;
mp[B] += A;
}
int sum = 0;
bool ans = true;
for (auto i : mp) {
sum += i.second;
if (mp[i.first] < sum)
ans = false;
}
cout << (ans ? "No" : "Yes") << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
const long long INF = 1LL << 60;
ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
map<int, int> mp;
rep(i, n) {
int A, B;
cin >> A >> B;
mp[B] += A;
}
int sum = 0;
bool ans = true;
for (auto i : mp) {
sum += i.second;
if (i.first < sum)
ans = false;
}
cout << (ans ? "Yes" : "No") << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 806,760 | 806,761 | u848518411 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
using P = pair<int, int>;
using lP = pair<ll, ll>;
using fP = pair<double, double>;
int main() {
int n;
cin >> n;
vector<P> job(n);
rep(i, n) {
int a, b;
cin >> a >> b;
if (a > b) {
cout << "NNo" << endl;
return 0;
}
job[i] = P(b, a);
}
sort(job.begin(), job.end());
int time = 0;
bool ok = true;
rep(i, n) {
time += job[i].second;
if (job[i].first < time) {
ok = false;
}
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
using P = pair<int, int>;
using lP = pair<ll, ll>;
using fP = pair<double, double>;
int main() {
int n;
cin >> n;
vector<P> job(n);
rep(i, n) {
int a, b;
cin >> a >> b;
if (a > b) {
cout << "No" << endl;
return 0;
}
job[i] = P(b, a);
}
sort(job.begin(), job.end());
int time = 0;
bool ok = true;
rep(i, n) {
time += job[i].second;
if (job[i].first < time) {
ok = false;
}
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 806,762 | 806,763 | u395287054 | cpp |
p02996 | /*
* Author : Sadi
* Fri 24/07/2020
* 17:44:08.69
*/
#include <bits/stdc++.h>
using namespace std;
#define watch(x) \
; \
cout << "\n" << #x << " is: " << x << "\n";
#define all(a) (a).begin(), (a).end()
#define fi first
#define se second
template <class A, class B>
ostream &operator<<(ostream &output, const pair<A, B> &p) {
output << "(" << p.first << ", " << p.second << ")";
return output;
}
template <class A> ostream &operator<<(ostream &output, const vector<A> &a) {
output << "[";
for (auto it = a.begin(); it != a.end(); ++it) {
if (it != a.begin()) {
output << ", ";
}
output << *it;
}
output << "]";
return output;
}
using lld = long long;
using pii = pair<int, int>;
using pll = pair<lld, lld>;
// const int inf = 1e9;
// const int mod = 1e9 + 7;
// const double PI = acos(-1.0);
// const int mx = 1e5 + 5;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE
int n;
cin >> n;
vector<pair<int, int>> v(n);
for (int i = 0; i < n; ++i) {
int need, deadline;
cin >> need >> deadline;
v[i] = make_pair(need, deadline);
}
sort(v.begin(), v.end(), [](pii p, pii q) {
if (p.se < q.se) {
return true;
} else {
return false;
}
});
// cout << v << endl;
long long time = 0;
for (int i = 0; i < n; ++i) {
if (time + v[i].fi <= v[i].se) {
time += v[i].fi;
} else {
cout << "NO" << '\n';
return 0;
}
}
cout << "YES" << '\n';
return 0;
}
| /*
* Author : Sadi
* Fri 24/07/2020
* 17:44:08.69
*/
#include <bits/stdc++.h>
using namespace std;
#define watch(x) \
; \
cout << "\n" << #x << " is: " << x << "\n";
#define all(a) (a).begin(), (a).end()
#define fi first
#define se second
template <class A, class B>
ostream &operator<<(ostream &output, const pair<A, B> &p) {
output << "(" << p.first << ", " << p.second << ")";
return output;
}
template <class A> ostream &operator<<(ostream &output, const vector<A> &a) {
output << "[";
for (auto it = a.begin(); it != a.end(); ++it) {
if (it != a.begin()) {
output << ", ";
}
output << *it;
}
output << "]";
return output;
}
using lld = long long;
using pii = pair<int, int>;
using pll = pair<lld, lld>;
// const int inf = 1e9;
// const int mod = 1e9 + 7;
// const double PI = acos(-1.0);
// const int mx = 1e5 + 5;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE
int n;
cin >> n;
vector<pair<int, int>> v(n);
for (int i = 0; i < n; ++i) {
int need, deadline;
cin >> need >> deadline;
v[i] = make_pair(need, deadline);
}
sort(v.begin(), v.end(), [](pii p, pii q) {
if (p.se < q.se) {
return true;
} else {
return false;
}
});
// cout << v << endl;
long long time = 0;
for (int i = 0; i < n; ++i) {
if (time + v[i].fi <= v[i].se) {
time += v[i].fi;
} else {
cout << "No" << '\n';
return 0;
}
}
cout << "Yes" << '\n';
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 806,782 | 806,783 | u055538052 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int INF = 1e9 + 7;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
vector<P> AB(N);
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
AB[i].first = B;
AB[i].second = A;
}
sort(AB.begin(), AB.end());
int cnt = 0;
for (int i = 0; i < N; i++) {
cnt += AB[i].second;
if (cnt > AB[i].first) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int INF = 1e9 + 7;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
vector<P> AB(N);
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
AB[i].first = B;
AB[i].second = A;
}
sort(AB.begin(), AB.end());
int cnt = 0;
for (int i = 0; i < N; i++) {
cnt += AB[i].second;
if (cnt > AB[i].first) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 806,784 | 806,785 | u237390401 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
struct Data {
int A;
int B;
};
int main() {
int N;
std::cin >> N;
std::vector<Data> data(N);
for (int i = 0; i < N; i++) {
std::cin >> data[i].A >> data[i].B;
}
std:
sort(data.begin(), data.end(), [](auto const &lhs, auto const &rhs) {
return lhs.B > rhs.B; // 左の方が大きい...というイメージ。
});
int res = data[0].B;
for (int i = 0; i < N; i++) {
res = std::min(res, data[i].B);
res = res - data[i].A;
// printf("A=%d, B=%d, res=%d\n", data[i].A, data[i].B, res);
if (res <= 0) {
printf("No\n");
return 0;
}
}
printf("Yes\n");
return 0;
} | #include <algorithm>
#include <iostream>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
struct Data {
int A;
int B;
};
int main() {
int N;
std::cin >> N;
std::vector<Data> data(N);
for (int i = 0; i < N; i++) {
std::cin >> data[i].A >> data[i].B;
}
std:
sort(data.begin(), data.end(), [](auto const &lhs, auto const &rhs) {
return lhs.B > rhs.B; // 左の方が大きい...というイメージ。
});
int res = data[0].B;
for (int i = 0; i < N; i++) {
res = std::min(res, data[i].B);
res = res - data[i].A;
// printf("A=%d, B=%d, res=%d\n", data[i].A, data[i].B, res);
if (res < 0) {
printf("No\n");
return 0;
}
}
printf("Yes\n");
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 806,788 | 806,789 | u382721013 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
struct Data {
int A;
int B;
};
int main() {
int N;
std::cin >> N;
std::vector<Data> data(N);
for (int i = 0; i < N; i++) {
std::cin >> data[i].A >> data[i].B;
}
std:
sort(data.begin(), data.end(), [](auto const &lhs, auto const &rhs) {
return lhs.B > rhs.B; // 左の方が大きい...というイメージ。
});
int res = data[0].B;
for (int i = 0; i < N; i++) {
res = std::min(res, data[0].B);
res = res - data[i].A;
// printf("A=%d, B=%d, res=%d\n", data[i].A, data[i].B, res);
if (res < 0) {
printf("No\n");
return 0;
}
}
printf("Yes\n");
return 0;
} | #include <algorithm>
#include <iostream>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
struct Data {
int A;
int B;
};
int main() {
int N;
std::cin >> N;
std::vector<Data> data(N);
for (int i = 0; i < N; i++) {
std::cin >> data[i].A >> data[i].B;
}
std:
sort(data.begin(), data.end(), [](auto const &lhs, auto const &rhs) {
return lhs.B > rhs.B; // 左の方が大きい...というイメージ。
});
int res = data[0].B;
for (int i = 0; i < N; i++) {
res = std::min(res, data[i].B);
res = res - data[i].A;
// printf("A=%d, B=%d, res=%d\n", data[i].A, data[i].B, res);
if (res < 0) {
printf("No\n");
return 0;
}
}
printf("Yes\n");
return 0;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 806,790 | 806,789 | u382721013 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pb push_back
const int N = 200005;
int main() {
// ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
scanf("%d", &n);
multiset<pair<int, int>> st;
bool no = false;
for (int i = 0; i < n; i++) {
int x, y;
scanf("%d %d", &x, &y);
if (y - x < 0) {
no = true;
}
st.insert({y, y - x});
}
if (no) {
printf("No");
} else {
int lst = 0;
auto it = st.begin();
while (it != st.end()) {
int l = it->se, r = it->fi;
if (l >= lst) {
lst += r - l;
} else {
return printf("No"), 0;
}
it++;
}
}
printf("Yes");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pb push_back
const int N = 200005;
int main() {
// ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
scanf("%d", &n);
multiset<pair<int, int>> st;
bool no = false;
for (int i = 0; i < n; i++) {
int x, y;
scanf("%d %d", &x, &y);
if (y - x < 0) {
no = true;
}
st.insert({y, y - x});
}
if (no) {
printf("No");
} else {
int lst = 0;
auto it = st.begin();
while (it != st.end()) {
int l = it->se, r = it->fi;
if (l >= lst) {
lst += r - l;
} else {
return printf("No"), 0;
}
it++;
}
printf("Yes");
}
return 0;
}
| [] | 806,797 | 806,798 | u183294751 | cpp |
p02996 | #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;
cin >> n;
vector<pair<ll, ll>> c;
ll ma = 0;
ll a, b;
rep(i, n) {
cin >> a >> b;
c.pb(make_pair(b, a));
}
sort(all(c));
ll ca = 0;
for (auto p : c) {
ca += p.se;
if (ca > p.fi) {
ma++;
break;
}
}
if (ma == 1) {
cout << "Yes" << endl;
} else {
cout << "No" << 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;
cin >> n;
vector<pair<ll, ll>> c;
ll ma = 0;
ll a, b;
rep(i, n) {
cin >> a >> b;
c.pb(make_pair(b, a));
}
sort(all(c));
ll ca = 0;
for (auto p : c) {
ca += p.se;
// cout << p.fi << " " << p.se <<" " << ca<< endl;
if (ca > p.fi) {
ma++;
break;
}
}
if (ma != 1) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 806,801 | 806,802 | u722640678 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
// 配列の作成
vector<pair<int64_t, int64_t>> dat(N);
for (int64_t i = 0; i < N; i++) {
cin >> dat[i].second >> dat[i].first;
}
sort(dat.begin(), dat.end());
// 0がB,1がA 昇順
int64_t t;
for (int64_t i = 0; i < N; i++) {
t += dat[i].second;
if (dat[i].first < t) {
cout << "No" << endl;
break;
}
if (i == N - 1) {
cout << "Yes" << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
// 配列の作成
vector<pair<int64_t, int64_t>> dat(N);
for (int64_t i = 0; i < N; i++) {
cin >> dat[i].second >> dat[i].first;
}
sort(dat.begin(), dat.end());
// 0がB,1がA 昇順
int64_t t = 0;
for (int64_t i = 0; i < N; i++) {
t += dat[i].second;
if (dat[i].first < t) {
cout << "No" << endl;
break;
}
if (i == N - 1) {
cout << "Yes" << endl;
}
}
} | [
"variable_declaration.value.change"
] | 806,807 | 806,808 | u831603488 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
// 配列の作成
vector<pair<int64_t, int64_t>> dat(N);
for (int64_t i = 0; i < N; i++) {
cin >> dat[i].second >> dat[i].first;
}
sort(dat.begin(), dat.end());
// 0がB,1がA 昇順
int64_t t;
for (int64_t i = 0; i < N; i++) {
t += dat[i].second;
if (dat[i].first < t) {
cout << "No" << endl;
break;
}
if (i = N - 1) {
cout << "Yes" << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
// 配列の作成
vector<pair<int64_t, int64_t>> dat(N);
for (int64_t i = 0; i < N; i++) {
cin >> dat[i].second >> dat[i].first;
}
sort(dat.begin(), dat.end());
// 0がB,1がA 昇順
int64_t t = 0;
for (int64_t i = 0; i < N; i++) {
t += dat[i].second;
if (dat[i].first < t) {
cout << "No" << endl;
break;
}
if (i == N - 1) {
cout << "Yes" << endl;
}
}
} | [
"variable_declaration.value.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 806,809 | 806,808 | u831603488 | cpp |
p02996 | // Author- VMAX
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_multiset \
tree<long long, null_type, less_equal<long long>, rb_tree_tag, \
tree_order_statistics_node_update>
#define ordered_set \
tree<long long, null_type, less<long long>, rb_tree_tag, \
tree_order_statistics_node_update>
using namespace std;
#define ll long long int
#define YES \
cout << "YES" \
<< "\n";
#define NO \
cout << "NO" \
<< "\n";
#define ld long double
#define yes \
cout << "yes" \
<< "\n";
#define no \
cout << "no" \
<< "\n";
#define No \
cout << "No" \
<< "\n";
#define Yes \
cout << "Yes" \
<< "\n";
#define f(i, a) for (i = 0; i < a; i++)
#define fo(i, a) for (i = 1; i <= a; i++)
#define fa(i, a) for (auto i : a)
#define r(i, a) for (auto i = a.rbegin(); i != a.rend(); i++)
#define en cout << "\n";
#define ull unsigned long long int
#define o(x) cout << x << "\n";
#define o1(x) cout << x << " ";
#define pb push_back
#define F first
#define in insert
#define mp make_pair
#define S second
#define pre(n) cout << fixed << setprecision(n);
#define gcd(a, b) __gcd(a, b)
#define bs binary_search
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define test \
ll t; \
cin >> t; \
while (t-- > 0)
const ll Mod = 998244353;
#define mod 1000000007
#define pi 3.14159265358979323846
#define all(x) x.begin(), x.end()
#define re return 0;
// *#######################################################################################*
/*
bool isp(ll n)
{
ll i;
for(i=2;i*i<=n;i++)
{
if(n%i==0)
{
return false;
}
}
}
*/
long long lcm(long long a, long long b) { //最小公倍数を求める
return a * b / gcd(a, b);
}
int main()
{
fast
ll n;
cin >> n;
vector<pair<ll, ll>> v(n);
ll i, x, y;
f(i, n) {
cin >> x >> y;
v[i] = mp(y, x);
}
sort(all(v));
ll f = 1, s = 0;
f(i, n) {
s += v[i].S;
if (s > v[i].F) {
f = 0;
break;
}
}
if (f == 0) {
NO re
}
YES
re
}
| // Author- VMAX
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_multiset \
tree<long long, null_type, less_equal<long long>, rb_tree_tag, \
tree_order_statistics_node_update>
#define ordered_set \
tree<long long, null_type, less<long long>, rb_tree_tag, \
tree_order_statistics_node_update>
using namespace std;
#define ll long long int
#define YES \
cout << "YES" \
<< "\n";
#define NO \
cout << "NO" \
<< "\n";
#define ld long double
#define yes \
cout << "yes" \
<< "\n";
#define no \
cout << "no" \
<< "\n";
#define No \
cout << "No" \
<< "\n";
#define Yes \
cout << "Yes" \
<< "\n";
#define f(i, a) for (i = 0; i < a; i++)
#define fo(i, a) for (i = 1; i <= a; i++)
#define fa(i, a) for (auto i : a)
#define r(i, a) for (auto i = a.rbegin(); i != a.rend(); i++)
#define en cout << "\n";
#define ull unsigned long long int
#define o(x) cout << x << "\n";
#define o1(x) cout << x << " ";
#define pb push_back
#define F first
#define in insert
#define mp make_pair
#define S second
#define pre(n) cout << fixed << setprecision(n);
#define gcd(a, b) __gcd(a, b)
#define bs binary_search
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define test \
ll t; \
cin >> t; \
while (t-- > 0)
const ll Mod = 998244353;
#define mod 1000000007
#define pi 3.14159265358979323846
#define all(x) x.begin(), x.end()
#define re return 0;
// *#######################################################################################*
/*
bool isp(ll n)
{
ll i;
for(i=2;i*i<=n;i++)
{
if(n%i==0)
{
return false;
}
}
}
*/
long long lcm(long long a, long long b) { //最小公倍数を求める
return a * b / gcd(a, b);
}
int main()
{
fast
ll n;
cin >> n;
vector<pair<ll, ll>> v(n);
ll i, x, y;
f(i, n) {
cin >> x >> y;
v[i] = mp(y, x);
}
sort(all(v));
ll f = 1, s = 0;
f(i, n) {
s += v[i].S;
if (s > v[i].F) {
f = 0;
break;
}
}
if (f == 0) {
No re
}
Yes
re
}
| [
"variable_declaration.type.change"
] | 806,814 | 806,815 | u251432619 | cpp |
p02996 | #include <bits/stdc++.h>
#define int long long
#define INF 1ll << 60
using namespace std;
bool cmd(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N;
cin >> N;
vector<pair<int, int>> vet(N);
int a, b;
for (int i = 0; i < N; i++) {
cin >> a >> b;
vet[i] = make_pair(a, b);
}
sort(vet.begin(), vet.end(), cmd);
int aux = 0;
for (int i = 0; i < N; i++) {
if (vet[i].second - aux > vet[i].first) {
aux += vet[i].first;
aux--;
} else {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define int long long
#define INF 1ll << 60
using namespace std;
bool cmd(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N;
cin >> N;
vector<pair<int, int>> vet(N);
int a, b;
for (int i = 0; i < N; i++) {
cin >> a >> b;
vet[i] = make_pair(a, b);
}
sort(vet.begin(), vet.end(), cmd);
int aux = 0;
for (int i = 0; i < N; i++) {
if (vet[i].second - aux >= vet[i].first) {
aux += vet[i].first;
} else {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.unary.arithmetic.remove"
] | 806,823 | 806,824 | u018679195 | cpp |
p02996 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
const long long maxn = 1e6;
struct Node {
int ai, bi;
} node[maxn];
bool cmp(Node a, Node b) {
if (a.bi == b.bi)
return a.ai < b.ai;
return a.bi < b.bi;
}
int main(void) {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d %d", &node[i].ai, &node[i].bi);
sort(node + 1, node + 1 + n, cmp);
int ans = 0;
for (int i = 1; i <= n; i++) {
if ((ans + node[i].ai) <= node[i].bi)
ans += node[i].ai;
else {
puts("NO");
return 0;
}
}
puts("Yes");
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
const long long maxn = 1e6;
struct Node {
int ai, bi;
} node[maxn];
bool cmp(Node a, Node b) {
if (a.bi == b.bi)
return a.ai < b.ai;
return a.bi < b.bi;
}
int main(void) {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d %d", &node[i].ai, &node[i].bi);
sort(node + 1, node + 1 + n, cmp);
int ans = 0;
for (int i = 1; i <= n; i++) {
if ((ans + node[i].ai) <= node[i].bi)
ans += node[i].ai;
else {
puts("No");
return 0;
}
}
puts("Yes");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 806,825 | 806,826 | u089230684 | cpp |
p02996 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
const long long maxn = 1e6;
struct Node {
int ai, bi;
} node[maxn];
bool cmp(Node a, Node b) {
if (a.bi == b.bi)
return a.ai < b.ai;
return a.bi < b.bi;
}
int main(void) {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d %d", &node[i].ai, &node[i].bi);
sort(node + 1, node + 1 + n, cmp);
int ans = 0;
for (int i = 1; i <= n; i++) {
if ((ans + node[i].ai) <= node[i].bi)
ans += node[i].ai;
else {
puts("NO");
return 0;
}
}
puts("Yes");
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
const long long maxn = 1e6;
struct Node {
int ai, bi;
} node[maxn];
bool cmp(Node a, Node b) {
if (a.bi == b.bi)
return a.ai < b.ai;
return a.bi < b.bi;
}
int main(void) {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d %d", &node[i].ai, &node[i].bi);
sort(node + 1, node + 1 + n, cmp);
// int ans = 0;
// for(int i = 1;i<=n;i++)
// {
// if((ans + node[i].ai) <= node[i].bi) ans += node[i].ai;
// else{
// puts("NO");
// return 0;
// }
// }
// puts("Yes");
int ans = 0;
for (int i = 1; i <= n; i++) {
if (ans + node[i].ai <= node[i].bi)
ans += node[i].ai;
else {
puts("No");
return 0;
}
}
// printf("Yes\n");
puts("Yes");
return 0;
} | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 806,825 | 806,827 | u089230684 | cpp |
p02996 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (ll i = a; i < b; i++)
ll gcd(ll, ll);
ll lcm(ll, ll);
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
map<int, int> ab;
rep(i, 0, n) {
cin >> a[i] >> b[i];
ab[b[i]] += a[i];
}
ll limit = 0, time = 0;
sort(b.begin(), b.end());
limit = b[1];
time += ab[b[1]];
if (time > limit) {
cout << "No" << endl;
return 0;
}
rep(i, 1, n) {
if (b[i] != b[i - 1]) {
limit = b[i];
time += ab[b[i]];
if (time > limit) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
} | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (ll i = a; i < b; i++)
ll gcd(ll, ll);
ll lcm(ll, ll);
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
map<int, int> ab;
rep(i, 0, n) {
cin >> a[i] >> b[i];
ab[b[i]] += a[i];
}
ll limit = 0, time = 0;
sort(b.begin(), b.end());
limit = b[0];
time += ab[b[0]];
if (time > limit) {
cout << "No" << endl;
return 0;
}
rep(i, 1, n) {
if (b[i] != b[i - 1]) {
limit = b[i];
time += ab[b[i]];
if (time > limit) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 806,846 | 806,847 | u870074807 | cpp |
p02996 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
#define NIL -1
#define FI first
#define SE second
#define MP make_pair
#define PB push_back
#define SZ(x) (int)x.size()
#define SP(x) setprecision((int)x)
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;
typedef vector<int> vint;
typedef vector<vint> vvint;
typedef vector<string> vstr;
typedef pair<int, int> pii;
const int INF = 1e9;
const ll LINF = 1e18;
const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } //最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } //最小公倍数
//-------------------------------------------------
//
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
//-------------------------------------------------
// メモ
/*
*/
//-------------------------------------------------
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
vector<pair<ll, ll>> vec(n);
REP(i, n) {
ll a, b;
cin >> a >> b;
vec[i] = MP(b, a);
}
sort(ALL(vec));
ll sum = 0;
REP(i, n) {
sum += vec[i].SE;
if (sum >= vec[i].FI) {
no();
return 0;
}
}
yes();
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
#define NIL -1
#define FI first
#define SE second
#define MP make_pair
#define PB push_back
#define SZ(x) (int)x.size()
#define SP(x) setprecision((int)x)
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;
typedef vector<int> vint;
typedef vector<vint> vvint;
typedef vector<string> vstr;
typedef pair<int, int> pii;
const int INF = 1e9;
const ll LINF = 1e18;
const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } //最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } //最小公倍数
//-------------------------------------------------
//
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
//-------------------------------------------------
// メモ
/*
*/
//-------------------------------------------------
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<pair<ll, ll>> vec(n);
REP(i, n) {
ll a, b;
cin >> a >> b;
vec[i] = MP(b, a);
}
sort(ALL(vec));
ll sum = 0;
REP(i, n) {
sum += vec[i].SE;
if (sum > vec[i].FI) {
no();
return 0;
}
}
yes();
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 806,860 | 806,861 | u852449189 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
int main() {
// freopen("aa_input.txt", "r", stdin);
int n;
cin >> n;
vector<pair<int, int>> v;
int a, b;
for (int i = 0; i < n; i++) {
cin >> a >> b;
v.push_back({a, b});
}
sort(v.begin(), v.end(), sortbysec);
ll sum = 0;
bool ok = true;
for (auto it : v) {
sum += it.first;
if (sum > it.second) {
ok = false;
break;
}
}
if (ok)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
/*
riaadmorshed@gmail.com
*/ | #include <algorithm>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
int main() {
// freopen("aa_input.txt", "r", stdin);
int n;
cin >> n;
vector<pair<int, int>> v;
int a, b;
for (int i = 0; i < n; i++) {
cin >> a >> b;
v.push_back({a, b});
}
sort(v.begin(), v.end(), sortbysec);
int sum = 0;
bool ok = true;
for (auto it : v) {
sum += it.first;
if (sum > it.second) {
ok = false;
break;
}
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
/*
riaadmorshed@gmail.com
*/ | [
"variable_declaration.type.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 806,874 | 806,875 | u819054341 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int n;
vector<pair<int, int>> tasks;
int main() {
int i = 0;
cin >> n;
while (i < n) {
int a, b;
cin >> a, b;
tasks.emplace_back(b, a);
i++;
}
sort(tasks.begin(), tasks.end());
int aa = 0;
int bb = 0;
int yy = 0;
for (auto v : tasks) {
aa += v.second;
if (aa > v.first) {
yy++;
break;
}
}
if (yy != 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n;
vector<pair<int, int>> tasks;
int main() {
int i = 0;
cin >> n;
while (i < n) {
int a, b;
cin >> a >> b;
tasks.emplace_back(b, a);
i++;
}
sort(tasks.begin(), tasks.end());
int aa = 0;
int bb = 0;
int yy = 0;
for (auto v : tasks) {
aa += v.second;
if (aa > v.first) {
yy++;
break;
}
}
if (yy != 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
} | [] | 806,876 | 806,877 | u437779154 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<P> table(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
table.at(i) = make_pair(b, a);
}
sort(table.begin(), table.end());
int sum = 0;
bool ok = true;
for (int i = 0; i < n; i++) {
sum += table.at(i).first;
if (sum > table.at(i).second) {
ok = false;
break;
}
}
cout << (ok ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<P> table(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
table.at(i) = make_pair(b, a);
}
sort(table.begin(), table.end());
int sum = 0;
bool ok = true;
for (int i = 0; i < n; i++) {
sum += table.at(i).second;
if (sum > table.at(i).first) {
ok = false;
break;
}
}
cout << (ok ? "Yes" : "No") << endl;
} | [
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 806,878 | 806,879 | u331498629 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) for (int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ((n) ? "Yes" : "No") << '\n';
#define CFYN(n) cout << ((n) ? "YES" : "NO") << '\n';
#define OUT(n) cout << (n) << '\n';
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
int main(void) {
IOS int n;
cin >> n;
vector<pii> ab(n);
REP(i, n) cin >> ab[i].second >> ab[i].first;
sort(ALL(ab));
int now = 0;
bool ok = true;
REP(i, n) {
now = ab[i].second;
if (now > ab[i].first) {
ok = false;
break;
}
}
ATYN(ok)
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) for (int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ((n) ? "Yes" : "No") << '\n';
#define CFYN(n) cout << ((n) ? "YES" : "NO") << '\n';
#define OUT(n) cout << (n) << '\n';
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
int main(void) {
IOS int n;
cin >> n;
vector<pii> ab(n);
REP(i, n) cin >> ab[i].second >> ab[i].first;
sort(ALL(ab));
int now = 0;
bool ok = true;
REP(i, n) {
now += ab[i].second;
if (now > ab[i].first) {
ok = false;
break;
}
}
ATYN(ok)
return 0;
} | [
"assignment.value.change"
] | 806,880 | 806,881 | u330661451 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define PriP \
priority_queue<P<int, int>, vector<P<int, int>>, greater<P<int, int>>>
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define all(a) (a).begin(), (a).end()
int low(V<int> &a, int b) {
auto c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> &a, int b) {
auto c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
for (int i = 3; i <= sqrt(a) + 1; i += 2) {
if (a % i == 0)
return false;
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
if (a < b)
return 0;
if (b == 0)
return 1;
int c = 1;
for (int i = a; i > a - b; i--) {
c *= i;
c %= INF;
}
return c;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^{-1} mod を計算する
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
int lcm(int a, int b) {
int c = modinv(gcm(a, b), INF);
return ((a * c) % INF) * (b % INF) % INF;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
// テーブルを作る前処理
//先にCOMinit()で前処理をする
// ABC145D
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
bool naka(int a, int b, V<V<char>> c) {
return (a >= 0 && b >= 0 && a < c.sz && b < c[0].sz);
}
V<P<int, int>> mawari8 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0},
{-1, -1}, {1, 1}, {1, -1}, {-1, -1}};
int inf = 1000000000000000007;
/*
signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}*/
V<P<int, int>> mawari4 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
//最短経路の表 a(全部INFで初期化)
//縦横 x,y
//迷路 f
//スタートsx,sy
//ゴールgx,gy
//文字はgから使おうね
/*int bfs_haba(){
Q<P<int,int>> b;
a[sx][sy]=0;
b.push({sx,sy});
while(!b.empty()){
P<int,int> c=b.front();
b.pop();
if(c.fi==gx&&c.se==gy){
break;
}
fo(i,4){
int d=c.fi+mawari4[i].fi;
int e=c.se+mawari4[i].se;
if(0<=d&&0<=e&&d<x&&e<y&&f[d][e]!='#'&&a[d][e]==INF){
b.push({d,e});
a[d][e]=1+a[c.fi][c.se];
}
}
}
return a[gx][gy];
}*/
V<int> onajibubun(string a) {
V<int> b(a.sz);
for (int i = 1, j = 0; i < a.sz; i++) {
if (i + b[i - j] < j + b[j])
b[i] = b[i - j];
else {
int c = max<int>(0, j + b[j] - i);
while (i + c < a.sz && a[c] == a[i + c])
c++;
b[i] = c;
j = i;
}
}
b[0] = a.sz;
return b;
}
//各頂点ごとにどこに辺が出てるかの表がc
//各頂点ごとの色を表すV<int>(頂点数max)のcolorを用意する
// aはどこ塗るか、bは何で塗るかなので、(0,1,c)でよぶとおけ
V<int> color(205);
bool nibu_hantei(int a, int b, V<V<int>> c) {
color[a] = b;
fo(i, c[a].sz) {
if (b == color[c[a][i]])
return false;
if (color[c[a][i]] == 0 && !nibu_hantei(c[a][i], -b, c))
return false;
}
return true;
}
// aは頂点数
// nibu_hanteiの上にcolorを用意する
//各頂点ごとにどこに辺が出てるかの表がc
bool renketujanai_nibu_hantei(int a, V<V<int>> c) {
fo(i, a) {
if (color[i] == 0) {
if (!nibu_hantei(i, 1, c))
return false;
}
}
return true;
}
struct segmin {
vector<int> seg;
int b;
segmin(V<int> a) {
b = 1;
while (b < a.sz)
b *= 2;
seg = vector<int>(2 * b - 1, inf);
fo(i, a.sz) { seg[i + b - 1] = a[i]; }
for (int i = b - 2; i >= 0; i--) {
seg[i] = min(seg[2 * i + 1], seg[2 * i + 2]);
}
}
void update(int i, int a) {
i += b - 1;
seg[i] = a;
while (i) {
i = (i - 1) / 2;
seg[i] = min(seg[2 * i + 1], seg[2 * i + 2]);
}
}
//最初呼び出すときは要求区間x,y+1(yは添え字+1)とa=0,l=0,r=INFで
// l,rは探すところ
int getmin(int x, int y, int a, int l, int r) {
if (r == INF)
r = b;
if (r <= x || y <= l)
return INF;
if (x <= l && r <= y)
return seg[a];
int a1 = getmin(x, y, 2 * a + 1, l, (l + r) / 2);
int a2 = getmin(x, y, 2 * a + 2, (l + r) / 2, r);
return min(a1, a2);
}
};
struct segadd {
vector<int> seg;
int b;
segadd(V<int> a) {
b = 1;
while (b < a.sz)
b *= 2;
seg = vector<int>(2 * b - 1, 0);
fo(i, a.sz) { seg[i + b - 1] = a[i]; }
for (int i = b - 2; i >= 0; i--) {
seg[i] = seg[2 * i + 1] + seg[2 * i + 2];
}
}
void update(int i, int a) {
i += b - 1;
seg[i] = a;
while (i) {
i = (i - 1) / 2;
seg[i] = seg[2 * i + 1] + seg[2 * i + 2];
}
}
//最初呼び出すときは要求区間x,y+1(yは添え字+1)とa=0,l=0,r=INFで
// l,rは探すところ
int getadd(int x, int y, int a, int l, int r) {
if (r == INF)
r = b;
if (r <= x || y <= l)
return 0;
if (x <= l && r <= y)
return seg[a];
int a1 = getadd(x, y, 2 * a + 1, l, (l + r) / 2);
int a2 = getadd(x, y, 2 * a + 2, (l + r) / 2, r);
return a1 + a2;
}
};
V<P<int, int>> factorize(int n) {
V<P<int, int>> res;
for (int i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
int pow_kai(int a, int b) {
int c = 1;
while (b > 0) { // bit全部捨てるまで
if (b % 2) { //一番右のbitが1
c = c * a;
}
a = a * a;
b >>= 1; //全体右に1つシフト
}
return c;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int n;
V<P<int, int>> a(n);
signed main() {
cin >> n;
fo(i, n) {
int b, c;
cin >> b >> c;
a.emplace_back(c, b);
}
Sort(a);
int d = 0;
fo(i, n) {
d += a[i].se;
if (d > a[i].se) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define PriP \
priority_queue<P<int, int>, vector<P<int, int>>, greater<P<int, int>>>
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define all(a) (a).begin(), (a).end()
int low(V<int> &a, int b) {
auto c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> &a, int b) {
auto c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
for (int i = 3; i <= sqrt(a) + 1; i += 2) {
if (a % i == 0)
return false;
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
if (a < b)
return 0;
if (b == 0)
return 1;
int c = 1;
for (int i = a; i > a - b; i--) {
c *= i;
c %= INF;
}
return c;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^{-1} mod を計算する
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
int lcm(int a, int b) {
int c = modinv(gcm(a, b), INF);
return ((a * c) % INF) * (b % INF) % INF;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
// テーブルを作る前処理
//先にCOMinit()で前処理をする
// ABC145D
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
bool naka(int a, int b, V<V<char>> c) {
return (a >= 0 && b >= 0 && a < c.sz && b < c[0].sz);
}
V<P<int, int>> mawari8 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0},
{-1, -1}, {1, 1}, {1, -1}, {-1, -1}};
int inf = 1000000000000000007;
/*
signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}*/
V<P<int, int>> mawari4 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
//最短経路の表 a(全部INFで初期化)
//縦横 x,y
//迷路 f
//スタートsx,sy
//ゴールgx,gy
//文字はgから使おうね
/*int bfs_haba(){
Q<P<int,int>> b;
a[sx][sy]=0;
b.push({sx,sy});
while(!b.empty()){
P<int,int> c=b.front();
b.pop();
if(c.fi==gx&&c.se==gy){
break;
}
fo(i,4){
int d=c.fi+mawari4[i].fi;
int e=c.se+mawari4[i].se;
if(0<=d&&0<=e&&d<x&&e<y&&f[d][e]!='#'&&a[d][e]==INF){
b.push({d,e});
a[d][e]=1+a[c.fi][c.se];
}
}
}
return a[gx][gy];
}*/
V<int> onajibubun(string a) {
V<int> b(a.sz);
for (int i = 1, j = 0; i < a.sz; i++) {
if (i + b[i - j] < j + b[j])
b[i] = b[i - j];
else {
int c = max<int>(0, j + b[j] - i);
while (i + c < a.sz && a[c] == a[i + c])
c++;
b[i] = c;
j = i;
}
}
b[0] = a.sz;
return b;
}
//各頂点ごとにどこに辺が出てるかの表がc
//各頂点ごとの色を表すV<int>(頂点数max)のcolorを用意する
// aはどこ塗るか、bは何で塗るかなので、(0,1,c)でよぶとおけ
V<int> color(205);
bool nibu_hantei(int a, int b, V<V<int>> c) {
color[a] = b;
fo(i, c[a].sz) {
if (b == color[c[a][i]])
return false;
if (color[c[a][i]] == 0 && !nibu_hantei(c[a][i], -b, c))
return false;
}
return true;
}
// aは頂点数
// nibu_hanteiの上にcolorを用意する
//各頂点ごとにどこに辺が出てるかの表がc
bool renketujanai_nibu_hantei(int a, V<V<int>> c) {
fo(i, a) {
if (color[i] == 0) {
if (!nibu_hantei(i, 1, c))
return false;
}
}
return true;
}
struct segmin {
vector<int> seg;
int b;
segmin(V<int> a) {
b = 1;
while (b < a.sz)
b *= 2;
seg = vector<int>(2 * b - 1, inf);
fo(i, a.sz) { seg[i + b - 1] = a[i]; }
for (int i = b - 2; i >= 0; i--) {
seg[i] = min(seg[2 * i + 1], seg[2 * i + 2]);
}
}
void update(int i, int a) {
i += b - 1;
seg[i] = a;
while (i) {
i = (i - 1) / 2;
seg[i] = min(seg[2 * i + 1], seg[2 * i + 2]);
}
}
//最初呼び出すときは要求区間x,y+1(yは添え字+1)とa=0,l=0,r=INFで
// l,rは探すところ
int getmin(int x, int y, int a, int l, int r) {
if (r == INF)
r = b;
if (r <= x || y <= l)
return INF;
if (x <= l && r <= y)
return seg[a];
int a1 = getmin(x, y, 2 * a + 1, l, (l + r) / 2);
int a2 = getmin(x, y, 2 * a + 2, (l + r) / 2, r);
return min(a1, a2);
}
};
struct segadd {
vector<int> seg;
int b;
segadd(V<int> a) {
b = 1;
while (b < a.sz)
b *= 2;
seg = vector<int>(2 * b - 1, 0);
fo(i, a.sz) { seg[i + b - 1] = a[i]; }
for (int i = b - 2; i >= 0; i--) {
seg[i] = seg[2 * i + 1] + seg[2 * i + 2];
}
}
void update(int i, int a) {
i += b - 1;
seg[i] = a;
while (i) {
i = (i - 1) / 2;
seg[i] = seg[2 * i + 1] + seg[2 * i + 2];
}
}
//最初呼び出すときは要求区間x,y+1(yは添え字+1)とa=0,l=0,r=INFで
// l,rは探すところ
int getadd(int x, int y, int a, int l, int r) {
if (r == INF)
r = b;
if (r <= x || y <= l)
return 0;
if (x <= l && r <= y)
return seg[a];
int a1 = getadd(x, y, 2 * a + 1, l, (l + r) / 2);
int a2 = getadd(x, y, 2 * a + 2, (l + r) / 2, r);
return a1 + a2;
}
};
V<P<int, int>> factorize(int n) {
V<P<int, int>> res;
for (int i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
int pow_kai(int a, int b) {
int c = 1;
while (b > 0) { // bit全部捨てるまで
if (b % 2) { //一番右のbitが1
c = c * a;
}
a = a * a;
b >>= 1; //全体右に1つシフト
}
return c;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int n;
V<P<int, int>> a;
signed main() {
cin >> n;
fo(i, n) {
int b, c;
cin >> b >> c;
a.emplace_back(c, b);
}
Sort(a);
int d = 0;
fo(i, n) {
d += a[i].se;
if (d > a[i].fi) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 806,885 | 806,886 | u790461875 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define MEMSET(v, h) memset((v), h, sizeof(v))
typedef long long ll;
using namespace std;
int main(void) {
int N, Ain, Bin, daycount = 0;
bool cannotFinish = false;
vector<pair<int, int>> task;
rep(i, N) {
cin >> Bin >> Ain;
task.emplace_back(Ain, Bin);
}
sort(all(task));
rep(i, N) {
daycount += task[i].second;
if (daycount > task[i].first) {
cannotFinish = true;
break;
}
}
cout << (cannotFinish ? "No" : "Yes") << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define MEMSET(v, h) memset((v), h, sizeof(v))
typedef long long ll;
using namespace std;
int main(void) {
int N, Ain, Bin, daycount = 0;
bool cannotFinish = false;
vector<pair<int, int>> task;
cin >> N;
rep(i, N) {
cin >> Bin >> Ain;
task.emplace_back(Ain, Bin);
}
sort(all(task));
rep(i, N) {
daycount += task[i].second;
if (daycount > task[i].first) {
cannotFinish = true;
break;
}
}
cout << (cannotFinish ? "No" : "Yes") << endl;
return 0;
}
| [] | 806,887 | 806,888 | u563743611 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
typedef pair<long long, long long> P;
#define int long long
#define override_rep(i, l, r, mes, ...) mes
#define rep1(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = l; i < r; i++)
#define rep(...) override_rep(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
template <typename T, typename U>
istream &operator>>(istream &in, pair<T, U> &p) {
in >> p.first >> p.second;
return in;
}
signed main(signed argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
const int MOD = 1000000007;
int n;
cin >> n;
vector<P> ab(n);
rep(i, n) cin >> ab[i].second >> ab[i].first;
sort(ab.begin(), ab.end(), greater<>());
int memo = LLONG_MAX;
rep(i, n) {
memo = min(memo, ab[i].first);
memo -= ab[i].first;
}
if (memo < 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<long long, long long> P;
#define int long long
#define override_rep(i, l, r, mes, ...) mes
#define rep1(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = l; i < r; i++)
#define rep(...) override_rep(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
template <typename T, typename U>
istream &operator>>(istream &in, pair<T, U> &p) {
in >> p.first >> p.second;
return in;
}
signed main(signed argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
const int MOD = 1000000007;
int n;
cin >> n;
vector<P> ab(n);
rep(i, n) cin >> ab[i].second >> ab[i].first;
sort(ab.begin(), ab.end(), greater<>());
int memo = LLONG_MAX;
rep(i, n) {
memo = min(memo, ab[i].first);
memo -= ab[i].second;
}
if (memo < 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| [
"assignment.value.change"
] | 806,891 | 806,892 | u073057072 | cpp |
p02996 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
vector<pair<ll, ll>> v(n);
for (ll i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
v[i].first = b[i];
v[i].second = a[i];
}
sort(v.begin(), v.end());
ll c = 0;
bool f = true;
for (ll i = 0; i < n; ++i) {
c += v[i].second;
if (c > v[i].first) {
f = false;
break;
}
}
if (f) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
vector<pair<ll, ll>> v(n);
for (ll i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
v[i].first = b[i];
v[i].second = a[i];
}
sort(v.begin(), v.end());
ll c = 0;
bool f = true;
for (ll i = 0; i < n; ++i) {
c += v[i].second;
if (v[i].first < c) {
f = false;
break;
}
}
if (f) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 806,901 | 806,902 | u022688266 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = INT64_MAX;
const long long int Mod = 1000000007;
using ll = long long int;
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define rep(i, N) for (ll i = 0; i < N; i++)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
template <class T> bool chmax(T &former, const T &b) {
if (former < b) {
former = b;
return true;
}
return false;
}
template <class T> bool chmin(T &former, const T &b) {
if (b < former) {
former = b;
return true;
}
return false;
}
template <class T> T sqar(T x) { return x * x; } // sqrt(x)は平方根;
#define Sort(v) \
std::sort(v.begin(), v.end(), \
std::greater<decltype(v[0])>()) //降順でVをソート
template <class T> inline void princ(T x) { cout << x << " "; };
template <class T> inline void print(T x) { cout << x << "\n"; };
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
///////////////////////////////////////////////////////////////////////////////////
ll n;
vector<PLL> v;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(30);
cin >> n;
ll in, in2;
rep(i, n) {
cin >> in >> in2;
v.pb(mp(in2, in));
}
sort(all(v));
ll tmp = -1;
bool flg = true;
rep(i, v.size()) {
tmp += v[i].second;
if (tmp > v[i].first) {
flg = false;
break;
}
}
Yes(flg);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = INT64_MAX;
const long long int Mod = 1000000007;
using ll = long long int;
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define rep(i, N) for (ll i = 0; i < N; i++)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
template <class T> bool chmax(T &former, const T &b) {
if (former < b) {
former = b;
return true;
}
return false;
}
template <class T> bool chmin(T &former, const T &b) {
if (b < former) {
former = b;
return true;
}
return false;
}
template <class T> T sqar(T x) { return x * x; } // sqrt(x)は平方根;
#define Sort(v) \
std::sort(v.begin(), v.end(), \
std::greater<decltype(v[0])>()) //降順でVをソート
template <class T> inline void princ(T x) { cout << x << " "; };
template <class T> inline void print(T x) { cout << x << "\n"; };
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
///////////////////////////////////////////////////////////////////////////////////
ll n;
vector<PLL> v;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(30);
cin >> n;
ll in, in2;
rep(i, n) {
cin >> in >> in2;
v.pb(mp(in2, in));
}
sort(all(v));
ll tmp = 0;
bool flg = true;
rep(i, v.size()) {
tmp += v[i].second;
if (tmp > v[i].first) {
flg = false;
break;
}
}
Yes(flg);
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 806,903 | 806,904 | u896014917 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int N;
cin >> N;
vector<pair<int, int>> AB;
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
AB.emplace_back(b, a); //締め切り、所要時間
}
sort(AB.begin(), AB.end());
bool judge = true;
ll time = 0;
for (int i = 0; i < N; i++) {
time += AB[i].first;
if (AB[i].first < time) {
judge = false;
break;
}
}
if (judge) {
cout << "Yes";
} else {
cout << "No";
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int N;
cin >> N;
vector<pair<int, int>> AB;
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
AB.emplace_back(b, a); //締め切り、所要時間
}
sort(AB.begin(), AB.end());
bool judge = true;
ll time = 0;
for (int i = 0; i < N; i++) {
time += AB[i].second;
if (AB[i].first < time) {
judge = false;
break;
}
}
if (judge) {
cout << "Yes";
} else {
cout << "No";
}
}
| [
"assignment.value.change"
] | 806,905 | 806,906 | u574687269 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int N;
cin >> N;
vector<pair<int, int>> AB;
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
AB.emplace_back(b, a); //締め切り、所要時間
}
sort(AB.begin(), AB.end());
bool judge = true;
ll time = 0;
for (int i = 0; i < N; i++) {
time += AB[i].first;
if (AB[i].second < time) {
judge = false;
break;
}
}
if (judge) {
cout << "Yes";
} else {
cout << "No";
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int N;
cin >> N;
vector<pair<int, int>> AB;
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
AB.emplace_back(b, a); //締め切り、所要時間
}
sort(AB.begin(), AB.end());
bool judge = true;
ll time = 0;
for (int i = 0; i < N; i++) {
time += AB[i].second;
if (AB[i].first < time) {
judge = false;
break;
}
}
if (judge) {
cout << "Yes";
} else {
cout << "No";
}
}
| [
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 806,907 | 806,906 | u574687269 | cpp |
p02996 | #include <bits/stdc++.h>
#define reg register
#define ll long long
#define ull unsigned long long
#define db double
#define pi pair<int, int>
#define pl pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vpi vector<pi>
#define vpl vector<pl>
#define pb push_back
#define er erase
#define SZ(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define mkp make_pair
#define dmin(x, y) ((x) < (y) ? (x) : (y))
#define dmax(x, y) ((x) > (y) ? (x) : (y))
#define checkmax(x, y) ((x) < (y) ? ((x) = (y)) : (x))
#define checkmin(x, y) ((x) > (y) ? ((x) = (y)) : (x))
#define ms(data_name) memset(data_name, 0, sizeof(data_name))
#define msn(data_name, num) memset(data_name, num, sizeof(data_name))
#define For(i, j) for (reg int(i) = 1; (i) <= (j); ++(i))
#define For0(i, j) for (reg int(i) = 0; (i) < (j); ++(i))
#define Forx(i, j, k) for (reg int(i) = (j); (i) <= (k); ++(i))
#define Forstep(i, j, k, st) for (reg int(i) = (j); (i) <= (k); (i) += (st))
#define fOR(i, j) for (reg int(i) = (j); (i) >= 1; (i)--)
#define fOR0(i, j) for (reg int(i) = (j)-1; (i) >= 0; (i)--)
#define fORx(i, j, k) for (reg int(i) = (k); (i) >= (j); (i)--)
#define tour(i, u) for (reg int(i) = head[(u)]; (i) != -1; (i) = nxt[(i)])
using namespace std;
char ch, B[1 << 20], *S = B, *T = B;
#define getc() \
(S == T && (T = (S = B) + fread(B, 1, 1 << 20, stdin), S == T) ? 0 : *S++)
#define isd(c) (c >= '0' && c <= '9')
int rdint() {
int aa, bb;
while (ch = getc(), !isd(ch) && ch != '-')
;
ch == '-' ? aa = bb = 0 : (aa = ch - '0', bb = 1);
while (ch = getc(), isd(ch))
aa = aa * 10 + ch - '0';
return bb ? aa : -aa;
}
ll rdll() {
ll aa, bb;
while (ch = getc(), !isd(ch) && ch != '-')
;
ch == '-' ? aa = bb = 0 : (aa = ch - '0', bb = 1);
while (ch = getc(), isd(ch))
aa = aa * 10 + ch - '0';
return bb ? aa : -aa;
}
const int MAXN = 2e5 + 10;
struct Node {
int beg, end;
bool operator<(const Node &rhs) const {
return end == rhs.end ? beg < rhs.beg : end < rhs.end;
}
} a[MAXN];
int n;
inline void work() {
n = rdint();
For(i, n) {
a[i].beg = rdint();
a[i].end = rdint();
}
sort(a + 1, a + n + 1);
int now = 0;
For(i, n) {
if (now + a[i].beg <= a[i].end) {
now += a[i].beg;
} else {
printf("NO\n");
return;
}
}
printf("YES\n");
}
int main() {
// freopen("input.txt", "r", stdin);
work();
return 0;
}
| #include <bits/stdc++.h>
#define reg register
#define ll long long
#define ull unsigned long long
#define db double
#define pi pair<int, int>
#define pl pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vpi vector<pi>
#define vpl vector<pl>
#define pb push_back
#define er erase
#define SZ(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define mkp make_pair
#define dmin(x, y) ((x) < (y) ? (x) : (y))
#define dmax(x, y) ((x) > (y) ? (x) : (y))
#define checkmax(x, y) ((x) < (y) ? ((x) = (y)) : (x))
#define checkmin(x, y) ((x) > (y) ? ((x) = (y)) : (x))
#define ms(data_name) memset(data_name, 0, sizeof(data_name))
#define msn(data_name, num) memset(data_name, num, sizeof(data_name))
#define For(i, j) for (reg int(i) = 1; (i) <= (j); ++(i))
#define For0(i, j) for (reg int(i) = 0; (i) < (j); ++(i))
#define Forx(i, j, k) for (reg int(i) = (j); (i) <= (k); ++(i))
#define Forstep(i, j, k, st) for (reg int(i) = (j); (i) <= (k); (i) += (st))
#define fOR(i, j) for (reg int(i) = (j); (i) >= 1; (i)--)
#define fOR0(i, j) for (reg int(i) = (j)-1; (i) >= 0; (i)--)
#define fORx(i, j, k) for (reg int(i) = (k); (i) >= (j); (i)--)
#define tour(i, u) for (reg int(i) = head[(u)]; (i) != -1; (i) = nxt[(i)])
using namespace std;
char ch, B[1 << 20], *S = B, *T = B;
#define getc() \
(S == T && (T = (S = B) + fread(B, 1, 1 << 20, stdin), S == T) ? 0 : *S++)
#define isd(c) (c >= '0' && c <= '9')
int rdint() {
int aa, bb;
while (ch = getc(), !isd(ch) && ch != '-')
;
ch == '-' ? aa = bb = 0 : (aa = ch - '0', bb = 1);
while (ch = getc(), isd(ch))
aa = aa * 10 + ch - '0';
return bb ? aa : -aa;
}
ll rdll() {
ll aa, bb;
while (ch = getc(), !isd(ch) && ch != '-')
;
ch == '-' ? aa = bb = 0 : (aa = ch - '0', bb = 1);
while (ch = getc(), isd(ch))
aa = aa * 10 + ch - '0';
return bb ? aa : -aa;
}
const int MAXN = 2e5 + 10;
struct Node {
int beg, end;
bool operator<(const Node &rhs) const {
return end == rhs.end ? beg < rhs.beg : end < rhs.end;
}
} a[MAXN];
int n;
inline void work() {
n = rdint();
For(i, n) {
a[i].beg = rdint();
a[i].end = rdint();
}
sort(a + 1, a + n + 1);
int now = 0;
For(i, n) {
if (now + a[i].beg <= a[i].end) {
now += a[i].beg;
} else {
printf("No\n");
return;
}
}
printf("Yes\n");
}
int main() {
// freopen("input.txt", "r", stdin);
work();
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 806,910 | 806,911 | u972930477 | cpp |
p02996 | #include <bits/stdc++.h>
#define reg register
#define ll long long
#define ull unsigned long long
#define db double
#define pi pair<int, int>
#define pl pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vpi vector<pi>
#define vpl vector<pl>
#define pb push_back
#define er erase
#define SZ(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define mkp make_pair
#define dmin(x, y) ((x) < (y) ? (x) : (y))
#define dmax(x, y) ((x) > (y) ? (x) : (y))
#define checkmax(x, y) ((x) < (y) ? ((x) = (y)) : (x))
#define checkmin(x, y) ((x) > (y) ? ((x) = (y)) : (x))
#define ms(data_name) memset(data_name, 0, sizeof(data_name))
#define msn(data_name, num) memset(data_name, num, sizeof(data_name))
#define For(i, j) for (reg int(i) = 1; (i) <= (j); ++(i))
#define For0(i, j) for (reg int(i) = 0; (i) < (j); ++(i))
#define Forx(i, j, k) for (reg int(i) = (j); (i) <= (k); ++(i))
#define Forstep(i, j, k, st) for (reg int(i) = (j); (i) <= (k); (i) += (st))
#define fOR(i, j) for (reg int(i) = (j); (i) >= 1; (i)--)
#define fOR0(i, j) for (reg int(i) = (j)-1; (i) >= 0; (i)--)
#define fORx(i, j, k) for (reg int(i) = (k); (i) >= (j); (i)--)
#define tour(i, u) for (reg int(i) = head[(u)]; (i) != -1; (i) = nxt[(i)])
using namespace std;
char ch, B[1 << 20], *S = B, *T = B;
#define getc() \
(S == T && (T = (S = B) + fread(B, 1, 1 << 20, stdin), S == T) ? 0 : *S++)
#define isd(c) (c >= '0' && c <= '9')
int rdint() {
int aa, bb;
while (ch = getc(), !isd(ch) && ch != '-')
;
ch == '-' ? aa = bb = 0 : (aa = ch - '0', bb = 1);
while (ch = getc(), isd(ch))
aa = aa * 10 + ch - '0';
return bb ? aa : -aa;
}
ll rdll() {
ll aa, bb;
while (ch = getc(), !isd(ch) && ch != '-')
;
ch == '-' ? aa = bb = 0 : (aa = ch - '0', bb = 1);
while (ch = getc(), isd(ch))
aa = aa * 10 + ch - '0';
return bb ? aa : -aa;
}
const int MAXN = 2e5 + 10;
struct Node {
int beg, end;
bool operator<(const Node &rhs) const {
return end == rhs.end ? beg < rhs.beg : end < rhs.end;
}
} a[MAXN];
int n;
inline void work() {
n = rdint();
For(i, n) {
a[i].beg = rdint();
a[i].end = rdint();
}
sort(a + 1, a + n + 1);
int now = 0;
For(i, n) {
if (now + a[i].beg <= a[i].end) {
now += a[i].beg;
} else {
printf("NO\n");
}
}
printf("YES\n");
}
int main() {
// freopen("input.txt", "r", stdin);
work();
return 0;
}
| #include <bits/stdc++.h>
#define reg register
#define ll long long
#define ull unsigned long long
#define db double
#define pi pair<int, int>
#define pl pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vpi vector<pi>
#define vpl vector<pl>
#define pb push_back
#define er erase
#define SZ(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define mkp make_pair
#define dmin(x, y) ((x) < (y) ? (x) : (y))
#define dmax(x, y) ((x) > (y) ? (x) : (y))
#define checkmax(x, y) ((x) < (y) ? ((x) = (y)) : (x))
#define checkmin(x, y) ((x) > (y) ? ((x) = (y)) : (x))
#define ms(data_name) memset(data_name, 0, sizeof(data_name))
#define msn(data_name, num) memset(data_name, num, sizeof(data_name))
#define For(i, j) for (reg int(i) = 1; (i) <= (j); ++(i))
#define For0(i, j) for (reg int(i) = 0; (i) < (j); ++(i))
#define Forx(i, j, k) for (reg int(i) = (j); (i) <= (k); ++(i))
#define Forstep(i, j, k, st) for (reg int(i) = (j); (i) <= (k); (i) += (st))
#define fOR(i, j) for (reg int(i) = (j); (i) >= 1; (i)--)
#define fOR0(i, j) for (reg int(i) = (j)-1; (i) >= 0; (i)--)
#define fORx(i, j, k) for (reg int(i) = (k); (i) >= (j); (i)--)
#define tour(i, u) for (reg int(i) = head[(u)]; (i) != -1; (i) = nxt[(i)])
using namespace std;
char ch, B[1 << 20], *S = B, *T = B;
#define getc() \
(S == T && (T = (S = B) + fread(B, 1, 1 << 20, stdin), S == T) ? 0 : *S++)
#define isd(c) (c >= '0' && c <= '9')
int rdint() {
int aa, bb;
while (ch = getc(), !isd(ch) && ch != '-')
;
ch == '-' ? aa = bb = 0 : (aa = ch - '0', bb = 1);
while (ch = getc(), isd(ch))
aa = aa * 10 + ch - '0';
return bb ? aa : -aa;
}
ll rdll() {
ll aa, bb;
while (ch = getc(), !isd(ch) && ch != '-')
;
ch == '-' ? aa = bb = 0 : (aa = ch - '0', bb = 1);
while (ch = getc(), isd(ch))
aa = aa * 10 + ch - '0';
return bb ? aa : -aa;
}
const int MAXN = 2e5 + 10;
struct Node {
int beg, end;
bool operator<(const Node &rhs) const {
return end == rhs.end ? beg < rhs.beg : end < rhs.end;
}
} a[MAXN];
int n;
inline void work() {
n = rdint();
For(i, n) {
a[i].beg = rdint();
a[i].end = rdint();
}
sort(a + 1, a + n + 1);
int now = 0;
For(i, n) {
if (now + a[i].beg <= a[i].end) {
now += a[i].beg;
} else {
printf("No\n");
return;
}
}
printf("Yes\n");
}
int main() {
// freopen("input.txt", "r", stdin);
work();
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change",
"control_flow.return.add"
] | 806,912 | 806,911 | u972930477 | cpp |
p02996 | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;
bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
return f.second > s.second;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll nCr(ll n, ll r) {
if (r == 0 || r == n) {
return 1;
} else if (r == 1) {
return n;
}
return (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
ll nPr(ll n, ll r) {
r = n - r;
ll ret = 1;
for (ll i = n; i >= r + 1; i--)
ret *= i;
return ret;
}
//-----------------------ここから-----------
int main(void) {
int n;
cin >> n;
vector<pair<int, int>> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i].second >> l[i].first;
}
sort(l.begin(), l.end());
int now = 0;
for (int i = 0; i < n; i++) {
if (now + l[i].second > l[i].first) {
cout << "NO" << endl;
return 0;
} else {
now += l[i].second;
}
}
cout << "YES" << endl;
} | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;
bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
return f.second > s.second;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll nCr(ll n, ll r) {
if (r == 0 || r == n) {
return 1;
} else if (r == 1) {
return n;
}
return (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
ll nPr(ll n, ll r) {
r = n - r;
ll ret = 1;
for (ll i = n; i >= r + 1; i--)
ret *= i;
return ret;
}
//-----------------------ここから-----------
int main(void) {
int n;
cin >> n;
vector<pair<int, int>> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i].second >> l[i].first;
}
sort(l.begin(), l.end());
int now = 0;
for (int i = 0; i < n; i++) {
if (now + l[i].second > l[i].first) {
cout << "No" << endl;
return 0;
} else {
now += l[i].second;
}
}
cout << "Yes" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 806,940 | 806,941 | u845000384 | cpp |
p02996 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = int(n); i < i##_len; ++i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<pair<int, int>> w(N);
REP(i, N) cin >> w[i].second >> w[i].first;
sort(All(w));
ll t = 0;
REP(i, N) {
t += w[i].second;
if (t > w[i].first) {
cout << "No" << endl;
return 0;
}
}
cout << "No" << endl;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = int(n); i < i##_len; ++i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<pair<int, int>> w(N);
REP(i, N) cin >> w[i].second >> w[i].first;
sort(All(w));
ll t = 0;
REP(i, N) {
t += w[i].second;
if (t > w[i].first) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 806,942 | 806,943 | u203033720 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define traverse(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
typedef long long ll;
int main() {
// freopen("in.txt","r",stdin);
ll time = 0;
int n;
cin >> n;
multimap<int, int> jobs;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
jobs.insert({y, x});
}
map<int, int>::iterator it = jobs.begin();
while (it != jobs.end()) {
time += it->second;
if (time > it->first)
break;
it++;
}
if (it == jobs.end()) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define traverse(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
typedef long long ll;
int main() {
// freopen("in.txt","r",stdin);
ll time = 0;
int n;
cin >> n;
multimap<int, int> jobs;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
jobs.insert({y, x});
}
map<int, int>::iterator it = jobs.begin();
while (it != jobs.end()) {
time += it->second;
if (time > it->first)
break;
it++;
}
if (it == jobs.end()) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 806,950 | 806,951 | u887563701 | cpp |
p02996 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> p(n);
rep(i, n) cin >> p[i].second >> p[i].first;
sort(p.begin(), p.end());
ll s = 0;
rep(i, n) {
s += p[i].first;
if (s > p[i].second) {
puts("No");
return 0;
}
}
puts("Yes");
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> p(n);
rep(i, n) cin >> p[i].second >> p[i].first;
sort(p.begin(), p.end());
ll s = 0;
rep(i, n) {
s += p[i].second;
if (s > p[i].first) {
puts("No");
return 0;
}
}
puts("Yes");
} | [
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 806,959 | 806,960 | u147556624 | cpp |
p02996 | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
using namespace std;
int n;
pair<int, int> a[200100];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
a[i].first = y;
a[i].second = x;
}
sort(a, a + n);
ll T = 0;
for (int i = 0; i < n; i++) {
if (a[i].second + T > a[i].first)
return cout << "NO", 0;
T += (ll)a[i].second;
}
cout << "YES";
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
#define ll long long
using namespace std;
int n;
pair<int, int> a[200100];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
a[i].first = y;
a[i].second = x;
}
sort(a, a + n);
ll T = 0;
for (int i = 0; i < n; i++) {
if (a[i].second + T > a[i].first)
return cout << "No", 0;
T += (ll)a[i].second;
}
cout << "Yes";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"function.return_value.change",
"expression.operation.binary.change",
"io.output.change"
] | 806,961 | 806,962 | u365917065 | cpp |
p02996 | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
using namespace std;
int n;
pair<int, int> a[200100];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
a[i].first = y;
a[i].second = x;
}
sort(a, a + n);
int T = 0;
for (int i = 0; i < n; i++) {
if (a[i].second + T > a[i].first)
return cout << "NO", 0;
T += a[i].second;
}
cout << "YES";
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
#define ll long long
using namespace std;
int n;
pair<int, int> a[200100];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
a[i].first = y;
a[i].second = x;
}
sort(a, a + n);
ll T = 0;
for (int i = 0; i < n; i++) {
if (a[i].second + T > a[i].first)
return cout << "No", 0;
T += (ll)a[i].second;
}
cout << "Yes";
return 0;
}
| [
"variable_declaration.type.change",
"literal.string.change",
"literal.string.case.change",
"function.return_value.change",
"expression.operation.binary.change",
"io.output.change"
] | 806,963 | 806,962 | u365917065 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> P;
typedef map<int, int> mp;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
ll work = 0;
bool f = true;
vector<P> vp(n);
rep(i, n) {
int a, b;
cin >> a >> b;
vp.emplace_back(b, a);
}
sort(all(vp));
rep(i, n) {
work += vp[i].second;
if (work > vp[i].first) {
f = false;
break;
}
}
cout << (f ? "Yes" : "No") << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> P;
typedef map<int, int> mp;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
ll work = 0;
bool f = true;
vector<P> vp;
rep(i, n) {
int a, b;
cin >> a >> b;
vp.emplace_back(b, a);
}
sort(all(vp));
rep(i, n) {
work += vp[i].second;
if (work > vp[i].first) {
f = false;
break;
}
}
cout << (f ? "Yes" : "No") << endl;
return 0;
}
| [] | 806,966 | 806,967 | u358859892 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> P;
typedef map<int, int> mp;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int work = 0;
bool f = true;
vector<P> vp(n);
rep(i, n) {
int a, b;
cin >> a >> b;
vp.emplace_back(b, a);
}
sort(all(vp));
rep(i, n) {
work += vp[i].second;
if (work > vp[i].first) {
f = false;
break;
}
}
cout << (f ? "Yes" : "No") << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> P;
typedef map<int, int> mp;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
ll work = 0;
bool f = true;
vector<P> vp;
rep(i, n) {
int a, b;
cin >> a >> b;
vp.emplace_back(b, a);
}
sort(all(vp));
rep(i, n) {
work += vp[i].second;
if (work > vp[i].first) {
f = false;
break;
}
}
cout << (f ? "Yes" : "No") << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 806,968 | 806,967 | u358859892 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define l long long
int main() {
int n;
cin >> n;
l a, b;
vector<pair<l, l>> p;
for (int i = 0; i < n; i++) {
cin >> a >> b;
p.push_back({b, a});
}
l sum = 0;
int flag = 0;
sort(p.begin(), p.end());
for (int i = 0; i < n; i++) {
sum += p[i].second;
if (sum > p[i].first)
flag = 1;
}
if (flag == 1)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define l long long
int main() {
int n;
cin >> n;
l a, b;
vector<pair<l, l>> p;
for (int i = 0; i < n; i++) {
cin >> a >> b;
p.push_back({b, a});
}
l sum = 0;
int flag = 0;
sort(p.begin(), p.end());
for (int i = 0; i < n; i++) {
sum += p[i].second;
if (sum > p[i].first)
flag = 1;
}
if (flag == 1)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 806,975 | 806,976 | u269804852 | cpp |
p02986 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
struct edge {
int to, cost, color, id;
};
#define MAX_N 200005
vector<edge> pre_G[MAX_N];
vector<edge> G[MAX_N];
int par_[MAX_N];
int flag_netsukigi[MAX_N];
void make_netsukigi(int r) {
queue<int> que;
que.push(r);
flag_netsukigi[r] = 1;
par_[r] = -1;
while (que.size() > 0) {
int x = que.front();
que.pop();
flag_netsukigi[x] = 1;
rep(i, pre_G[x].size()) {
if (flag_netsukigi[pre_G[x][i].to] == 0) {
par_[pre_G[x][i].to] = x;
G[x].push_back(pre_G[x][i]);
que.push(pre_G[x][i].to);
}
}
}
}
#define MAXN 200005
int block_sz; // block size = sqrt(height)
int depth[MAXN]; // stores depth for each node.
int parent[MAXN]; // stores first parent for each node.
int jump_parent[MAXN]; // stores first ancestor in previous block.
vector<int> adj[MAXN];
void addEdge(int u, int v) {
adj[u].push_back(v);
adj[v].push_back(u);
}
int LCANaive(int u, int v) {
if (u == v)
return u;
if (depth[u] > depth[v])
swap(u, v);
v = parent[v];
return LCANaive(u, v);
}
// precalculating the required parameters associated with every node.
void dfs(int cur, int prev) {
// marking depth of cur node
depth[cur] = depth[prev] + 1;
// marking parent of cur node
parent[cur] = prev;
// making jump_parent of cur node
// if it is first node of the block then its jump_parent is its cur parent.
if (depth[cur] % block_sz == 0)
jump_parent[cur] = parent[cur];
// if it is not the first node of this block then its jump_parent is
// jump_parent of its parent.
else
jump_parent[cur] = jump_parent[prev];
// propogating the marking down the subtree
for (int i = 0; i < adj[cur].size(); ++i)
if (adj[cur][i] != prev)
dfs(adj[cur][i], cur);
}
// using sqrt decomposition trick
int LCASQRT(int u, int v) {
while (jump_parent[u] != jump_parent[v]) {
// maintaining depth[v] > depth[u]
if (depth[u] > depth[v])
swap(u, v);
// climb to its jump parent
v = jump_parent[v];
}
// u and v have same jump_parent
return LCANaive(u, v);
}
void preprocess(int height) {
block_sz = sqrt(height);
depth[0] = -1;
// precalclating 1) depth. 2) parent. 3) jump_parent for each node
dfs(0, 0);
}
vector<P> euler_tour;
vector<int> euler_color[MAX_N], euler_sum[MAX_N], euler_num[MAX_N];
int dist[MAX_N], place[MAX_N];
int now_dist;
int cnt;
void dfs_euler_tour(int x) {
dist[x] = now_dist;
place[x] = cnt;
rep(i, G[x].size()) {
euler_tour.push_back(P(G[x][i].cost, 1));
euler_color[G[x][i].color].push_back(cnt);
cnt++;
now_dist += G[x][i].cost;
dfs_euler_tour(G[x][i].to);
euler_tour.push_back(P(G[x][i].id, -1));
euler_color[G[x][i].color].push_back(cnt);
cnt++;
now_dist -= G[x][i].cost;
}
}
void init_euler_tour() { dfs_euler_tour(0); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
int a[n - 1], b[n - 1], c[n - 1], d[n - 1];
rep(i, n - 1) {
cin >> a[i] >> b[i] >> c[i] >> d[i];
a[i]--;
b[i]--;
addEdge(a[i], b[i]);
edge e1, e2;
e1.to = b[i];
e2.to = a[i];
e1.cost = d[i];
e2.cost = d[i];
e1.color = c[i];
e2.color = c[i];
pre_G[a[i]].push_back(e1);
pre_G[b[i]].push_back(e2);
}
make_netsukigi(0);
preprocess(MAXN);
int num = 0;
rep(i, MAX_N) {
rep(j, G[i].size()) {
G[i][j].id = num;
a[num] = i;
b[num] = G[i][j].to;
c[num] = G[i][j].color;
d[num] = G[i][j].cost;
num++;
}
}
init_euler_tour();
rep(i, MAX_N) {
int sum = 0, num = 0;
rep(j, euler_color[i].size()) {
int id = euler_color[i][j];
euler_sum[i].push_back(sum);
euler_num[i].push_back(num);
if (euler_tour[id].second == 1) {
sum += euler_tour[id].first;
num++;
} else {
sum -= euler_tour[id].first;
num--;
}
}
euler_sum[i].push_back(sum);
euler_num[i].push_back(num);
}
rep(i, q) {
int x, y, uv[3];
cin >> x >> y >> uv[0] >> uv[1];
uv[0]--;
uv[1]--;
uv[2] = LCASQRT(uv[0], uv[1]);
int duv[3] = {};
rep(j, 3) {
duv[j] = dist[uv[j]];
int ite = lower_bound(euler_color[x].begin(), euler_color[x].end(),
place[uv[j]]) -
euler_color[x].begin();
duv[j] += euler_num[x][ite] * y - euler_sum[x][ite];
}
int ans = duv[0] + duv[1] - 2 * duv[2];
cout << ans << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
struct edge {
int to, cost, color, id;
};
#define MAX_N 200005
vector<edge> pre_G[MAX_N];
vector<edge> G[MAX_N];
int par_[MAX_N];
int flag_netsukigi[MAX_N];
void make_netsukigi(int r) {
queue<int> que;
que.push(r);
flag_netsukigi[r] = 1;
par_[r] = -1;
while (que.size() > 0) {
int x = que.front();
que.pop();
flag_netsukigi[x] = 1;
rep(i, pre_G[x].size()) {
if (flag_netsukigi[pre_G[x][i].to] == 0) {
par_[pre_G[x][i].to] = x;
G[x].push_back(pre_G[x][i]);
que.push(pre_G[x][i].to);
}
}
}
}
#define MAXN 200005
int block_sz; // block size = sqrt(height)
int depth[MAXN]; // stores depth for each node.
int parent[MAXN]; // stores first parent for each node.
int jump_parent[MAXN]; // stores first ancestor in previous block.
vector<int> adj[MAXN];
void addEdge(int u, int v) {
adj[u].push_back(v);
adj[v].push_back(u);
}
int LCANaive(int u, int v) {
if (u == v)
return u;
if (depth[u] > depth[v])
swap(u, v);
v = parent[v];
return LCANaive(u, v);
}
// precalculating the required parameters associated with every node.
void dfs(int cur, int prev) {
// marking depth of cur node
depth[cur] = depth[prev] + 1;
// marking parent of cur node
parent[cur] = prev;
// making jump_parent of cur node
// if it is first node of the block then its jump_parent is its cur parent.
if (depth[cur] % block_sz == 0)
jump_parent[cur] = parent[cur];
// if it is not the first node of this block then its jump_parent is
// jump_parent of its parent.
else
jump_parent[cur] = jump_parent[prev];
// propogating the marking down the subtree
for (int i = 0; i < adj[cur].size(); ++i)
if (adj[cur][i] != prev)
dfs(adj[cur][i], cur);
}
// using sqrt decomposition trick
int LCASQRT(int u, int v) {
while (jump_parent[u] != jump_parent[v]) {
// maintaining depth[v] > depth[u]
if (depth[u] > depth[v])
swap(u, v);
// climb to its jump parent
v = jump_parent[v];
}
// u and v have same jump_parent
return LCANaive(u, v);
}
void preprocess(int height) {
block_sz = sqrt(height);
depth[0] = -1;
// precalclating 1) depth. 2) parent. 3) jump_parent for each node
dfs(0, 0);
}
vector<P> euler_tour;
vector<int> euler_color[MAX_N], euler_sum[MAX_N], euler_num[MAX_N];
int dist[MAX_N], place[MAX_N];
int now_dist;
int cnt;
void dfs_euler_tour(int x) {
dist[x] = now_dist;
place[x] = cnt;
rep(i, G[x].size()) {
euler_tour.push_back(P(G[x][i].cost, 1));
euler_color[G[x][i].color].push_back(cnt);
cnt++;
now_dist += G[x][i].cost;
dfs_euler_tour(G[x][i].to);
euler_tour.push_back(P(G[x][i].cost, -1));
euler_color[G[x][i].color].push_back(cnt);
cnt++;
now_dist -= G[x][i].cost;
}
}
void init_euler_tour() { dfs_euler_tour(0); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
int a[n - 1], b[n - 1], c[n - 1], d[n - 1];
rep(i, n - 1) {
cin >> a[i] >> b[i] >> c[i] >> d[i];
a[i]--;
b[i]--;
addEdge(a[i], b[i]);
edge e1, e2;
e1.to = b[i];
e2.to = a[i];
e1.cost = d[i];
e2.cost = d[i];
e1.color = c[i];
e2.color = c[i];
pre_G[a[i]].push_back(e1);
pre_G[b[i]].push_back(e2);
}
make_netsukigi(0);
preprocess(MAXN);
int num = 0;
rep(i, MAX_N) {
rep(j, G[i].size()) {
G[i][j].id = num;
a[num] = i;
b[num] = G[i][j].to;
c[num] = G[i][j].color;
d[num] = G[i][j].cost;
num++;
}
}
init_euler_tour();
rep(i, MAX_N) {
int sum = 0, num = 0;
rep(j, euler_color[i].size()) {
int id = euler_color[i][j];
euler_sum[i].push_back(sum);
euler_num[i].push_back(num);
if (euler_tour[id].second == 1) {
sum += euler_tour[id].first;
num++;
} else {
sum -= euler_tour[id].first;
num--;
}
}
euler_sum[i].push_back(sum);
euler_num[i].push_back(num);
}
rep(i, q) {
int x, y, uv[3];
/*
x = i / 25 + 1;
y = 10000;
uv[0] = (i / 5) % 5 + 1;
uv[1] = i % 5 + 1;
*/
cin >> x >> y >> uv[0] >> uv[1];
uv[0]--;
uv[1]--;
uv[2] = LCASQRT(uv[0], uv[1]);
int duv[3] = {};
rep(j, 3) {
duv[j] = dist[uv[j]];
int ite = lower_bound(euler_color[x].begin(), euler_color[x].end(),
place[uv[j]]) -
euler_color[x].begin();
duv[j] += euler_num[x][ite] * y - euler_sum[x][ite];
}
int ans = duv[0] + duv[1] - 2 * duv[2];
// cout << x << ' ' << y << ' ' << uv[0] << ' ' << uv[1] << ' ' << ans <<
// endl; cout << duv[0] << ' ' << duv[1] << ' ' << duv[2] << endl;
cout << ans << endl;
}
return 0;
}
| [
"call.arguments.change"
] | 807,018 | 807,019 | u791593901 | cpp |
p02986 | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fir first
#define sec second
#define Mp make_pair
const int MAXN = 1e5 + 5;
const int MAXM = 1e5 + 5;
const int LB = 20 + 5;
struct Edge {
int next, to, c, w;
} e[MAXN << 1];
int head[MAXN], etot = 0;
inline void add(int u, int v, int c, int w) {
e[++etot] = (Edge){head[u], v, c, w};
head[u] = etot;
}
int lb[MAXN];
int dep[MAXN], fa[MAXN][LB];
void lca_init(int u, int pre) {
for (int i = 1; i <= lb[dep[u]]; ++i)
fa[u][i] = fa[fa[u][i - 1]][i - 1];
for (int i = head[u]; i; i = e[i].next) {
int v = e[i].to;
if (v == pre)
continue;
dep[v] = dep[u] + 1;
fa[v][0] = u;
lca_init(v, u);
}
}
int lca(int u, int v) {
if (dep[u] < dep[v])
swap(u, v);
for (int i = lb[dep[u]]; dep[u] > dep[v]; --i)
if (dep[fa[u][i]] >= dep[v])
u = fa[u][i];
if (u == v)
return u;
for (int i = lb[dep[u]]; fa[u][0] != fa[v][0]; --i)
if (fa[u][i] != fa[v][i])
u = fa[u][i], v = fa[v][i];
return fa[u][0];
}
struct Query {
int x, y, u, v;
ll ans;
} q[MAXM];
vector<pii> id[MAXN];
ll sum[MAXN];
int cnt[MAXN];
void dfs(int u, int pre, ll dis) {
for (int i = 0; i < (int)id[u].size(); ++i) {
Query &now = q[id[u][i].fir];
int k = id[u][i].sec;
int x = now.x;
ll y = now.y;
now.ans += (dis - sum[x] + cnt[x] * y) * k;
}
for (int i = head[u]; i; i = e[i].next) {
int v = e[i].to, c = e[i].c, w = e[i].w;
if (v == pre)
continue;
sum[c] += w;
++cnt[c];
dfs(v, u, dis + w);
sum[c] -= w;
--cnt[c];
}
}
int main(void) {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i < n; ++i) {
int u, v, c, w;
scanf("%d%d%d%d", &u, &v, &c, &w);
add(u, v, c, w);
add(v, u, c, w);
}
for (int i = 2; i <= n; ++i)
lb[i] = lb[i >> 1] + 1;
dep[0] = -1;
lca_init(1, 0);
for (int i = 1; i <= m; ++i) {
int x, y, u, v;
scanf("%d%d%d%d", &x, &y, &u, &v);
q[i] = (Query){x, y, u, v, 0};
id[u].push_back(Mp(i, 1));
id[v].push_back(Mp(i, 1));
id[lca(u, v)].push_back(Mp(i, -1));
}
dfs(1, 0, 0);
for (int i = 1; i <= m; ++i)
printf("%lld\n", q[i].ans);
return 0;
} | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fir first
#define sec second
#define Mp make_pair
const int MAXN = 1e5 + 5;
const int MAXM = 1e5 + 5;
const int LB = 20 + 5;
struct Edge {
int next, to, c, w;
} e[MAXN << 1];
int head[MAXN], etot = 0;
inline void add(int u, int v, int c, int w) {
e[++etot] = (Edge){head[u], v, c, w};
head[u] = etot;
}
int lb[MAXN];
int dep[MAXN], fa[MAXN][LB];
void lca_init(int u, int pre) {
for (int i = 1; i <= lb[dep[u]]; ++i)
fa[u][i] = fa[fa[u][i - 1]][i - 1];
for (int i = head[u]; i; i = e[i].next) {
int v = e[i].to;
if (v == pre)
continue;
dep[v] = dep[u] + 1;
fa[v][0] = u;
lca_init(v, u);
}
}
int lca(int u, int v) {
if (dep[u] < dep[v])
swap(u, v);
for (int i = lb[dep[u]]; dep[u] > dep[v]; --i)
if (dep[fa[u][i]] >= dep[v])
u = fa[u][i];
if (u == v)
return u;
for (int i = lb[dep[u]]; fa[u][0] != fa[v][0]; --i)
if (fa[u][i] != fa[v][i])
u = fa[u][i], v = fa[v][i];
return fa[u][0];
}
struct Query {
int x, y, u, v;
ll ans;
} q[MAXM];
vector<pii> id[MAXN];
ll sum[MAXN];
int cnt[MAXN];
void dfs(int u, int pre, ll dis) {
for (int i = 0; i < (int)id[u].size(); ++i) {
Query &now = q[id[u][i].fir];
int k = id[u][i].sec;
int x = now.x;
ll y = now.y;
now.ans += (dis - sum[x] + cnt[x] * y) * k;
}
for (int i = head[u]; i; i = e[i].next) {
int v = e[i].to, c = e[i].c, w = e[i].w;
if (v == pre)
continue;
sum[c] += w;
++cnt[c];
dfs(v, u, dis + w);
sum[c] -= w;
--cnt[c];
}
}
int main(void) {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i < n; ++i) {
int u, v, c, w;
scanf("%d%d%d%d", &u, &v, &c, &w);
add(u, v, c, w);
add(v, u, c, w);
}
for (int i = 2; i <= n; ++i)
lb[i] = lb[i >> 1] + 1;
dep[0] = -1;
lca_init(1, 0);
for (int i = 1; i <= m; ++i) {
int x, y, u, v;
scanf("%d%d%d%d", &x, &y, &u, &v);
q[i] = (Query){x, y, u, v, 0};
id[u].push_back(Mp(i, 1));
id[v].push_back(Mp(i, 1));
id[lca(u, v)].push_back(Mp(i, -2));
}
dfs(1, 0, 0);
for (int i = 1; i <= m; ++i)
printf("%lld\n", q[i].ans);
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 807,051 | 807,052 | u042689916 | cpp |
p02986 | /*----------------by syr----------------*/
/*
iii ii
rBQBBBBBBE BBR iBBBBQBBL XBBBBBBQBBBBB
iBBQJ 7BBB BBsSBBr BBQ i cBBB
rBBU iBBw BBBQi HBBi KBBi
BBH BB5 iBBB isL wBB5
GBB iBBi 6BB iBBB
BBQ BQB BBD QBBi
BBB BQB iQBi 1BBv
sBBg wBBB QBB iBBB
7BBBBBBBBBi BBR wBBBBBBBBBBBBB
irvi ii ii i i iii
i5U
BBB
BB7
1BB
iPBBBBBKBBR JBR1 rQBO BR UBQP iBBQi
7BBBGs7sXBBBi QBBr gBBE rBB BB2BB7HBZQBB
QBBi sBQ BBB iBBB SQBBR BBBB cBQ
gBQ BBg BBB KBBi MBBH BBB BBs
iBBv iBBi QBBBL BBR pBB iBB
pBB BBB iBBBB iBB BBL KBB
MBB BBBR BBB JBBi DBR iBQ BBL
GBB 7BBBB2 PBBH BBBi BQr DBB iBB
BQBXwgBBP BB7 1BBB BBQ7 1BB BBc BBB
2BBBBw BB EBBS QBBi HBa iBB BB7
*/
#include <bits/stdc++.h>
using namespace std;
#define PH push
#define MP make_pair
#define PB push_back
#define fst first
#define snd second
#define FOR(i, x, y) for (int i = (x); i < (y); ++i)
#define REP(i, x, y) for (int i = (x); i <= (y); ++i)
#define x0 x0123456789
#define y0 y0123456789
#define x1 x1234567890
#define y1 y1234567890
#define x2 x2345678901
#define y2 y2345678901
typedef double db;
typedef long long ll;
typedef long double ldb;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9 + 7;
const int maxn = 1e5 + 5;
const int logn = 20;
class Edge {
public:
int u, v, c, w;
} ed[maxn];
class Query {
public:
int u, v, x, y;
} qry[maxn];
int n, q;
ll sum;
int dep[maxn];
ll totw[maxn], cnt[maxn], ans[maxn];
int par[maxn][logn];
vector<int> g[maxn];
vector<pii> qq[maxn];
void dfs(int u, int p) {
// printf("u = %d p = %d\n", u, p);
if (~p)
dep[u] = dep[p] + 1;
par[u][0] = p;
FOR(i, 0, g[u].size()) {
Edge e = ed[g[u][i]];
int v = (e.u == u) ? (e.v) : (e.u);
// printf("u = %d v = %d\n", u, v);
if (v == p)
continue;
dfs(v, u);
}
return;
}
void precalc() {
dfs(0, -1);
FOR(i, 1, logn) FOR(u, 0, n) {
if (~par[u][i - 1])
par[u][i] = par[par[u][i - 1]][i - 1];
else
par[u][i] = -1;
}
return;
}
int lca(int u, int v) {
if (dep[u] < dep[v])
swap(u, v);
int d = dep[u] - dep[v];
// printf("%d %d dep = %d %d\n", u, v, dep[u], dep[v]);
FOR(i, 0, logn) if (d & (1 << i)) u = par[u][i];
if (u == v)
return u;
// printf("u = %d v = %d\n", u, v);
for (int i = logn - 1; i >= 0; --i) {
if (~par[u][i] && par[u][i] == par[v][i])
u = par[u][i], v = par[v][i];
}
return par[u][0];
}
void calc(int u, int p) {
FOR(i, 0, g[u].size()) {
Edge e = ed[g[u][i]];
int v = (e.u == u) ? (e.v) : (e.u);
if (v == p)
continue;
++cnt[e.c];
totw[e.c] += e.w;
sum += e.w;
calc(v, u);
--cnt[e.c];
totw[e.c] -= e.w;
sum -= e.w;
}
FOR(i, 0, qq[u].size()) {
int tp = qq[u][i].fst, id = qq[u][i].snd;
// printf("id = %d sum = %d totw = %d cnt = %d\n", id, sum, totw[qry[id].x],
// cnt[qry[id].x]);
ans[id] += tp * (sum - totw[qry[id].x] + cnt[qry[id].x] * qry[id].y);
}
return;
}
int main() {
scanf("%d%d", &n, &q);
FOR(i, 1, n) {
scanf("%d%d%d%d", &ed[i].u, &ed[i].v, &ed[i].c, &ed[i].w);
--ed[i].u;
--ed[i].v;
g[ed[i].u].PB(i);
g[ed[i].v].PB(i);
}
precalc();
FOR(i, 0, q) {
scanf("%d%d%d%d", &qry[i].x, &qry[i].y, &qry[i].u, &qry[i].v);
--qry[i].u;
--qry[i].v;
int r = lca(qry[i].u, qry[i].v);
// printf("r = %d\n", r);
qq[qry[i].u].PB(MP(1, i));
qq[qry[i].v].PB(MP(1, i));
qq[r].PB(MP(-2, i));
}
calc(0, -1);
FOR(i, 0, q) printf("%lld\n", ans[i]);
return 0;
}
/*
5 4
1 2 1 10
1 3 2 20
2 4 2 10
2 5 1 10
1 100 5 1
2 200 4 3
3 300 4 1
2 100 4 1
*/ | /*----------------by syr----------------*/
/*
iii ii
rBQBBBBBBE BBR iBBBBQBBL XBBBBBBQBBBBB
iBBQJ 7BBB BBsSBBr BBQ i cBBB
rBBU iBBw BBBQi HBBi KBBi
BBH BB5 iBBB isL wBB5
GBB iBBi 6BB iBBB
BBQ BQB BBD QBBi
BBB BQB iQBi 1BBv
sBBg wBBB QBB iBBB
7BBBBBBBBBi BBR wBBBBBBBBBBBBB
irvi ii ii i i iii
i5U
BBB
BB7
1BB
iPBBBBBKBBR JBR1 rQBO BR UBQP iBBQi
7BBBGs7sXBBBi QBBr gBBE rBB BB2BB7HBZQBB
QBBi sBQ BBB iBBB SQBBR BBBB cBQ
gBQ BBg BBB KBBi MBBH BBB BBs
iBBv iBBi QBBBL BBR pBB iBB
pBB BBB iBBBB iBB BBL KBB
MBB BBBR BBB JBBi DBR iBQ BBL
GBB 7BBBB2 PBBH BBBi BQr DBB iBB
BQBXwgBBP BB7 1BBB BBQ7 1BB BBc BBB
2BBBBw BB EBBS QBBi HBa iBB BB7
*/
#include <bits/stdc++.h>
using namespace std;
#define PH push
#define MP make_pair
#define PB push_back
#define fst first
#define snd second
#define FOR(i, x, y) for (int i = (x); i < (y); ++i)
#define REP(i, x, y) for (int i = (x); i <= (y); ++i)
#define x0 x0123456789
#define y0 y0123456789
#define x1 x1234567890
#define y1 y1234567890
#define x2 x2345678901
#define y2 y2345678901
typedef double db;
typedef long long ll;
typedef long double ldb;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9 + 7;
const int maxn = 1e5 + 5;
const int logn = 20;
class Edge {
public:
int u, v, c, w;
} ed[maxn];
class Query {
public:
int u, v, x, y;
} qry[maxn];
int n, q;
ll sum;
int dep[maxn];
ll totw[maxn], cnt[maxn], ans[maxn];
int par[maxn][logn];
vector<int> g[maxn];
vector<pii> qq[maxn];
void dfs(int u, int p) {
// printf("u = %d p = %d\n", u, p);
if (~p)
dep[u] = dep[p] + 1;
par[u][0] = p;
FOR(i, 0, g[u].size()) {
Edge e = ed[g[u][i]];
int v = ((e.u == u) ? (e.v) : (e.u));
// printf("u = %d v = %d\n", u, v);
if (v == p)
continue;
dfs(v, u);
}
return;
}
void precalc() {
dfs(0, -1);
FOR(i, 1, logn) FOR(u, 0, n) {
if (~par[u][i - 1])
par[u][i] = par[par[u][i - 1]][i - 1];
else
par[u][i] = -1;
}
return;
}
int lca(int u, int v) {
if (dep[u] < dep[v])
swap(u, v);
int d = dep[u] - dep[v];
// printf("%d %d dep = %d %d\n", u, v, dep[u], dep[v]);
FOR(i, 0, logn) if (d & (1 << i)) u = par[u][i];
if (u == v)
return u;
// printf("u = %d v = %d\n", u, v);
for (int i = logn - 1; i >= 0; --i) {
if (~par[u][i] && par[u][i] != par[v][i])
u = par[u][i], v = par[v][i];
}
return par[u][0];
}
void calc(int u, int p) {
FOR(i, 0, g[u].size()) {
Edge e = ed[g[u][i]];
int v = ((e.u == u) ? (e.v) : (e.u));
if (v == p)
continue;
++cnt[e.c];
totw[e.c] += e.w;
sum += e.w;
calc(v, u);
--cnt[e.c];
totw[e.c] -= e.w;
sum -= e.w;
}
FOR(i, 0, qq[u].size()) {
int tp = qq[u][i].fst, id = qq[u][i].snd;
// printf("id = %d sum = %d totw = %d cnt = %d\n", id, sum, totw[qry[id].x],
// cnt[qry[id].x]);
ans[id] += tp * (sum - totw[qry[id].x] + cnt[qry[id].x] * qry[id].y);
}
return;
}
int main() {
scanf("%d%d", &n, &q);
FOR(i, 1, n) {
scanf("%d%d%d%d", &ed[i].u, &ed[i].v, &ed[i].c, &ed[i].w);
--ed[i].u;
--ed[i].v;
g[ed[i].u].PB(i);
g[ed[i].v].PB(i);
}
precalc();
FOR(i, 0, q) {
scanf("%d%d%d%d", &qry[i].x, &qry[i].y, &qry[i].u, &qry[i].v);
--qry[i].u;
--qry[i].v;
int r = lca(qry[i].u, qry[i].v);
// printf("r = %d\n", r);
qq[qry[i].u].PB(MP(1, i));
qq[qry[i].v].PB(MP(1, i));
qq[r].PB(MP(-2, i));
}
calc(0, -1);
FOR(i, 0, q) printf("%lld\n", ans[i]);
return 0;
}
/*
5 4
1 2 1 10
1 3 2 20
2 4 2 10
2 5 1 10
1 100 5 1
2 200 4 3
3 300 4 1
2 100 4 1
*/ | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 807,059 | 807,060 | u904221771 | cpp |
p02986 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define REP(i, n) for (ll i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
using namespace std;
const ll MAX_LOG_V = 40;
struct edge {
ll from, to, cost, color;
};
vector<edge> G[100010];
ll par[MAX_LOG_V][100010], depth[100010], dist[100010];
vector<pair<ll, ll>> tour(200020);
ll used[200020];
ll num[100010];
ll id = 0;
vector<pair<ll, ll>> sum[100010];
vector<pair<ll, ll>> number[100010];
vector<pair<ll, ll>> tour_data[100010];
// LCA
void dfs(ll v, ll p, ll dpt, ll dis) {
par[0][v] = p, depth[v] = dpt, dist[v] = dis;
for (auto i : G[v]) {
if (i.to != p)
dfs(i.to, v, dpt + 1, dis + i.cost);
}
}
void init(ll V) {
dfs(0, -1, 0, 0);
for (ll k = 0; k + 1 < MAX_LOG_V - 1; k++) {
for (ll v = 0; v < V; v++) {
if (par[k][v] < 0)
par[k + 1][v] = -1;
else
par[k + 1][v] = par[k][par[k][v]];
}
}
}
ll lca(ll u, ll v) {
if (depth[u] > depth[v])
swap(u, v);
for (ll k = 0; k < MAX_LOG_V; k++) {
if ((depth[v] - depth[u]) >> k & 1) {
v = par[k][v];
}
}
if (u == v)
return u;
for (ll k = MAX_LOG_V - 1; k >= 0; k--) {
if (par[k][v] != par[k][u]) {
u = par[k][u];
v = par[k][v];
}
}
return par[0][u];
}
// Euler-tour
void dfs2(edge &e, ll &id) {
tour[id++] = make_pair(e.cost, e.color);
num[e.to] = id - 1;
if (sum[e.color].size() == 1) {
sum[e.color].push_back(make_pair(id, e.cost));
number[e.color].push_back(make_pair(id, 1));
} else {
sum[e.color].push_back(make_pair(id, sum[e.color].back().second + e.cost));
number[e.color].push_back(make_pair(id, number[e.color].back().second + 1));
}
used[e.from]++;
for (edge &i : G[e.to]) {
if (!used[i.to]) {
dfs2(i, id);
}
}
tour[id++] = make_pair(-e.cost, e.color);
if (sum[e.color].size() == 1) {
sum[e.color].push_back(make_pair(id, -e.cost));
number[e.color].push_back(make_pair(id, -1));
} else {
sum[e.color].push_back(make_pair(id, sum[e.color].back().second - e.cost));
number[e.color].push_back(make_pair(id, number[e.color].back().second - 1));
}
}
ll get_color(ll x) { return tour[num[x]].second; }
ll func(ll color, ll new_d, ll v) {
ll l = 0, r = sum[color].size();
if (r == 1) {
return dist[v];
}
while (l + 1 != r) {
ll m = (l + r) / 2;
// cout << m << '\n';
if (sum[color][m].first <= v)
l = m;
else
r = m;
}
// assert(l < sum[color].size());
ll N = number[color][l].second;
ll S = sum[color][l].second;
// cout << color << ',' << v << ',' << S << ',' << N << '\n';
// cout << v << ',' << dist[v] << ',' << S << ',' << N << '\n';
return dist[v] - S + N * new_d;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, q;
cin >> n >> q;
for (ll i = 0; i < n - 1; i++) {
ll a, b, c, d;
cin >> a >> b >> c >> d;
a--, b--;
edge e1, e2;
e1.from = a, e1.to = b, e1.cost = d, e1.color = c;
e2.from = b, e2.to = a, e2.cost = d, e2.color = c;
G[a].push_back(e1);
G[b].push_back(e2);
}
init(n);
// making Euler-tour
for (ll i = 0; i < n; i++) {
sum[i].push_back(make_pair(0, 0));
number[i].push_back(make_pair(0, 0));
}
for (edge &e : G[0])
dfs2(e, id);
// for(ll i = 0;i < id;i++)cout << tour[i].first << ' ' << tour[i].second <<
// '\n'; for(ll i = 0;i < n;i++){
// cout << i << ":";
// for(auto j : sum[i])cout << "(" << j.first << ',' << j.second << ")";
// cout << '\n';
//}
for (ll t = 0; t < q; t++) {
ll x, y, u, v;
cin >> x >> y >> u >> v;
u--, v--;
// cout << sum[x].size() << '\n';
cout << func(x, y, u) + func(x, y, v) - 2 * func(x, y, lca(u, v)) << '\n';
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define REP(i, n) for (ll i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
using namespace std;
const ll MAX_LOG_V = 40;
struct edge {
ll from, to, cost, color;
};
vector<edge> G[100010];
ll par[MAX_LOG_V][100010], depth[100010], dist[100010];
vector<pair<ll, ll>> tour(200020);
ll used[200020];
ll num[100010];
ll id = 0;
vector<pair<ll, ll>> sum[100010];
vector<pair<ll, ll>> number[100010];
vector<pair<ll, ll>> tour_data[100010];
// LCA
void dfs(ll v, ll p, ll dpt, ll dis) {
par[0][v] = p, depth[v] = dpt, dist[v] = dis;
for (auto i : G[v]) {
if (i.to != p)
dfs(i.to, v, dpt + 1, dis + i.cost);
}
}
void init(ll V) {
dfs(0, -1, 0, 0);
for (ll k = 0; k + 1 < MAX_LOG_V - 1; k++) {
for (ll v = 0; v < V; v++) {
if (par[k][v] < 0)
par[k + 1][v] = -1;
else
par[k + 1][v] = par[k][par[k][v]];
}
}
}
ll lca(ll u, ll v) {
if (depth[u] > depth[v])
swap(u, v);
for (ll k = 0; k < MAX_LOG_V; k++) {
if ((depth[v] - depth[u]) >> k & 1) {
v = par[k][v];
}
}
if (u == v)
return u;
for (ll k = MAX_LOG_V - 1; k >= 0; k--) {
if (par[k][v] != par[k][u]) {
u = par[k][u];
v = par[k][v];
}
}
return par[0][u];
}
// Euler-tour
void dfs2(edge &e, ll &id) {
tour[id++] = make_pair(e.cost, e.color);
num[e.to] = id;
if (sum[e.color].size() == 1) {
sum[e.color].push_back(make_pair(id, e.cost));
number[e.color].push_back(make_pair(id, 1));
} else {
sum[e.color].push_back(make_pair(id, sum[e.color].back().second + e.cost));
number[e.color].push_back(make_pair(id, number[e.color].back().second + 1));
}
used[e.from]++;
for (edge &i : G[e.to]) {
if (!used[i.to]) {
dfs2(i, id);
}
}
tour[id++] = make_pair(-e.cost, e.color);
if (sum[e.color].size() == 1) {
sum[e.color].push_back(make_pair(id, -e.cost));
number[e.color].push_back(make_pair(id, -1));
} else {
sum[e.color].push_back(make_pair(id, sum[e.color].back().second - e.cost));
number[e.color].push_back(make_pair(id, number[e.color].back().second - 1));
}
}
ll get_color(ll x) { return tour[num[x]].second; }
ll func(ll color, ll new_d, ll v) {
ll l = 0, r = sum[color].size();
if (r == 1) {
return dist[v];
}
while (l + 1 != r) {
ll m = (l + r) / 2;
// cout << m << '\n';
if (sum[color][m].first <= num[v])
l = m;
else
r = m;
}
// assert(l < sum[color].size());
ll N = number[color][l].second;
ll S = sum[color][l].second;
// cout << color << ',' << v << ',' << S << ',' << N << '\n';
// cout << v << ',' << num[v] << ',' << dist[v] << ',' << S << ',' << N <<
// '\n';
return dist[v] - S + N * new_d;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, q;
cin >> n >> q;
for (ll i = 0; i < n - 1; i++) {
ll a, b, c, d;
cin >> a >> b >> c >> d;
a--, b--;
edge e1, e2;
e1.from = a, e1.to = b, e1.cost = d, e1.color = c;
e2.from = b, e2.to = a, e2.cost = d, e2.color = c;
G[a].push_back(e1);
G[b].push_back(e2);
}
init(n);
// making Euler-tour
for (ll i = 0; i < n; i++) {
sum[i].push_back(make_pair(0, 0));
number[i].push_back(make_pair(0, 0));
}
for (edge &e : G[0])
dfs2(e, id);
// for(ll i = 0;i < id;i++)cout << tour[i].first << ' ' << tour[i].second <<
// '\n'; for(ll i = 0;i < n;i++){
// cout << i << ":";
// for(auto j : sum[i])cout << "(" << j.first << ',' << j.second << ")";
// cout << '\n';
//}
for (ll t = 0; t < q; t++) {
ll x, y, u, v;
cin >> x >> y >> u >> v;
u--, v--;
// cout << sum[x].size() << '\n';
cout << func(x, y, u) + func(x, y, v) - 2 * func(x, y, lca(u, v)) << '\n';
}
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 807,065 | 807,066 | u426397594 | cpp |
p02986 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define P pair
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define V vector
#define RE return
#define ALL(a) a.begin(), a.end()
#define MP make_pair
#define PB push_back
#define PF push_front
#define FILL(a, b) memset(a, b, sizeof(a))
using namespace std;
struct node {
int x, y, z;
};
int f[100005][20], n, h[100005], ans[100005], c[100005], co[100005], de[100005];
V<node> v[100005], q[100005];
void get(int p) {
h[p] = h[f[p][0]] + 1;
for (auto u : v[p]) {
if (u.x != f[p][0]) {
f[u.x][0] = p;
de[u.x] = de[p] + u.z;
get(u.x);
}
}
}
int lca(int x, int y) {
if (h[x] > h[y])
swap(x, y);
int t = h[y] - h[x];
FOR(i, 0, 17) {
if (t & (1 << i))
y = f[y][i];
}
if (x == y)
RE x;
for (int i = 17; i >= 1; i--) {
if (f[x][i] != f[y][i]) {
x = f[x][i];
y = f[y][i];
}
}
RE f[x][0];
}
void dfs(int p) {
for (auto u : q[p]) {
if (u.x > 0) {
ans[u.x] += de[p] + c[u.y] * u.z - co[u.y];
} else {
ans[-u.x] -= 2 * (de[p] + c[u.y] * u.z - co[u.y]);
}
}
for (auto u : v[p]) {
if (u.x == f[p][0])
continue;
c[u.y]++;
co[u.y] += u.z;
dfs(u.x);
c[u.y]--;
co[u.y] -= u.z;
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int x, y, c, d, m;
cin >> n >> m;
FOR(i, 2, n) {
cin >> x >> y >> c >> d;
v[x].PB({y, c, d});
v[y].PB({x, c, d});
}
get(1);
FOR(i, 1, 17) FOR(j, 1, n) f[j][i] = f[f[j][i - 1]][i - 1];
FOR(i, 1, m) {
cin >> c >> d >> x >> y;
q[x].PB({i, c, d});
q[y].PB({i, c, d});
q[lca(c, d)].PB({-i, c, d});
}
dfs(1);
FOR(i, 1, m) cout << ans[i] << '\n';
RE 0;
}
| #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define P pair
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define V vector
#define RE return
#define ALL(a) a.begin(), a.end()
#define MP make_pair
#define PB push_back
#define PF push_front
#define FILL(a, b) memset(a, b, sizeof(a))
using namespace std;
struct node {
int x, y, z;
};
int f[100005][20], n, h[100005], ans[100005], c[100005], co[100005], de[100005];
V<node> v[100005], q[100005];
void get(int p) {
h[p] = h[f[p][0]] + 1;
for (auto u : v[p]) {
if (u.x != f[p][0]) {
f[u.x][0] = p;
de[u.x] = de[p] + u.z;
get(u.x);
}
}
}
int lca(int x, int y) {
if (h[x] > h[y])
swap(x, y);
int t = h[y] - h[x];
FOR(i, 0, 17) {
if (t & (1 << i))
y = f[y][i];
}
if (x == y)
RE x;
for (int i = 17; i >= 0; i--) {
if (f[x][i] != f[y][i]) {
x = f[x][i];
y = f[y][i];
}
}
RE f[x][0];
}
void dfs(int p) {
for (auto u : q[p]) {
if (u.x > 0) {
ans[u.x] += de[p] + c[u.y] * u.z - co[u.y];
} else {
ans[-u.x] -= 2 * (de[p] + c[u.y] * u.z - co[u.y]);
}
}
for (auto u : v[p]) {
if (u.x == f[p][0])
continue;
c[u.y]++;
co[u.y] += u.z;
dfs(u.x);
c[u.y]--;
co[u.y] -= u.z;
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int x, y, c, d, m;
cin >> n >> m;
FOR(i, 2, n) {
cin >> x >> y >> c >> d;
v[x].PB({y, c, d});
v[y].PB({x, c, d});
}
get(1);
FOR(i, 1, 17) FOR(j, 1, n) f[j][i] = f[f[j][i - 1]][i - 1];
FOR(i, 1, m) {
cin >> c >> d >> x >> y;
q[x].PB({i, c, d});
q[y].PB({i, c, d});
q[lca(x, y)].PB({-i, c, d});
}
dfs(1);
FOR(i, 1, m) cout << ans[i] << '\n';
RE 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 807,075 | 807,074 | u751741878 | cpp |
p02986 | #include <bits/stdc++.h>
using namespace std;
#define y1 y11
#define fi first
#define se second
#define pi acos(-1.0)
#define LL long long
//#define mp make_pair
#define pb emplace_back
#define ls rt << 1, l, m
#define rs rt << 1 | 1, m + 1, r
#define ULL unsigned LL
#define pll pair<LL, LL>
#define pli pair<LL, int>
#define pii pair<int, int>
#define piii pair<pii, int>
#define pdd pair<double, double>
#define mem(a, b) memset(a, b, sizeof(a))
#define debug(x) cerr << #x << " = " << x << "\n";
#define add(x) (x > MOD ? x - MOD : (x < 0 ? x + MOD : x))
#define fio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
// head
const int N = 1 + 5;
vector<tuple<int, int, int>> g[N];
vector<tuple<int, int, int, int>> vc[N];
int n, m, a, b, c, d, x, y, u, v;
int anc[N][18], deep[N], len[N], ans[N];
int cur_cnt[N], cur_sum[N];
void dfs(int u, int o) {
deep[u] = deep[o] + 1;
anc[u][0] = o;
for (int i = 1; i < 18; ++i)
anc[u][i] = anc[anc[u][i - 1]][i - 1];
for (auto t : g[u]) {
int v = get<0>(t), w = get<2>(t);
if (v != o) {
len[v] = len[u] + w;
dfs(v, u);
}
}
}
void DFS(int u, int o) {
for (int i = 0; i < vc[u].size(); ++i) {
auto t = vc[u][i];
int id = get<0>(t), c = get<1>(t), w = get<2>(t), f = get<3>(t);
ans[id] -= f * cur_sum[c];
ans[id] += f * cur_cnt[c] * w;
}
for (auto t : g[u]) {
int v = get<0>(t), c = get<1>(t), w = get<2>(t);
if (v != o) {
cur_cnt[c]++;
cur_sum[c] += w;
DFS(v, u);
cur_cnt[c]--;
cur_sum[c] -= w;
}
}
}
inline int lca(int u, int v) {
if (deep[u] < deep[v])
swap(u, v);
for (int i = 17; i >= 0; --i)
if (deep[anc[u][i]] >= deep[v])
u = anc[u][i];
if (u == v)
return u;
for (int i = 17; i >= 0; --i)
if (anc[u][i] != anc[v][i])
u = anc[u][i], v = anc[v][i];
return anc[u][0];
}
int main() {
// freopen("input.in", "rt", stdin);
scanf("%d %d", &n, &m);
for (int i = 1; i < n; ++i)
scanf("%d %d %d %d", &a, &b, &c, &d), g[a].pb(b, c, d), g[b].pb(a, c, d);
dfs(1, 1);
for (int i = 1; i <= m; ++i) {
scanf("%d %d %d %d", &x, &y, &u, &v);
int a = lca(u, v);
ans[i] = len[u] + len[v] - 2 * len[a];
vc[u].pb(i, x, y, 1);
vc[v].pb(i, x, y, 1);
vc[a].pb(i, x, y, -2);
}
DFS(1, 1);
for (int i = 1; i <= m; ++i)
printf("%d\n", ans[i]);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define y1 y11
#define fi first
#define se second
#define pi acos(-1.0)
#define LL long long
//#define mp make_pair
#define pb emplace_back
#define ls rt << 1, l, m
#define rs rt << 1 | 1, m + 1, r
#define ULL unsigned LL
#define pll pair<LL, LL>
#define pli pair<LL, int>
#define pii pair<int, int>
#define piii pair<pii, int>
#define pdd pair<double, double>
#define mem(a, b) memset(a, b, sizeof(a))
#define debug(x) cerr << #x << " = " << x << "\n";
#define add(x) (x > MOD ? x - MOD : (x < 0 ? x + MOD : x))
#define fio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
// head
const int N = 1e5 + 5;
vector<tuple<int, int, int>> g[N];
vector<tuple<int, int, int, int>> vc[N];
int n, m, a, b, c, d, x, y, u, v;
int anc[N][18], deep[N], len[N], ans[N];
int cur_cnt[N], cur_sum[N];
void dfs(int u, int o) {
deep[u] = deep[o] + 1;
anc[u][0] = o;
for (int i = 1; i < 18; ++i)
anc[u][i] = anc[anc[u][i - 1]][i - 1];
for (auto t : g[u]) {
int v = get<0>(t), w = get<2>(t);
if (v != o) {
len[v] = len[u] + w;
dfs(v, u);
}
}
}
void DFS(int u, int o) {
for (int i = 0; i < vc[u].size(); ++i) {
auto t = vc[u][i];
int id = get<0>(t), c = get<1>(t), w = get<2>(t), f = get<3>(t);
ans[id] -= f * cur_sum[c];
ans[id] += f * cur_cnt[c] * w;
}
for (auto t : g[u]) {
int v = get<0>(t), c = get<1>(t), w = get<2>(t);
if (v != o) {
cur_cnt[c]++;
cur_sum[c] += w;
DFS(v, u);
cur_cnt[c]--;
cur_sum[c] -= w;
}
}
}
inline int lca(int u, int v) {
if (deep[u] < deep[v])
swap(u, v);
for (int i = 17; i >= 0; --i)
if (deep[anc[u][i]] >= deep[v])
u = anc[u][i];
if (u == v)
return u;
for (int i = 17; i >= 0; --i)
if (anc[u][i] != anc[v][i])
u = anc[u][i], v = anc[v][i];
return anc[u][0];
}
int main() {
// freopen("input.in", "rt", stdin);
scanf("%d %d", &n, &m);
for (int i = 1; i < n; ++i)
scanf("%d %d %d %d", &a, &b, &c, &d), g[a].pb(b, c, d), g[b].pb(a, c, d);
dfs(1, 1);
for (int i = 1; i <= m; ++i) {
scanf("%d %d %d %d", &x, &y, &u, &v);
int a = lca(u, v);
ans[i] = len[u] + len[v] - 2 * len[a];
vc[u].pb(i, x, y, 1);
vc[v].pb(i, x, y, 1);
vc[a].pb(i, x, y, -2);
}
DFS(1, 1);
for (int i = 1; i <= m; ++i)
printf("%d\n", ans[i]);
return 0;
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 807,079 | 807,080 | u645018082 | cpp |
p02986 | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cassert>
#include <functional>
typedef long long ll;
using namespace std;
#ifndef LOCAL
#define debug(x) ;
#else
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
template <typename T1, typename T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &p) {
out << "{" << p.first << ", " << p.second << "}";
return out;
}
template <typename T> ostream &operator<<(ostream &out, const vector<T> &v) {
out << '{';
for (const T &item : v)
out << item << ", ";
out << "\b\b}";
return out;
}
#endif
#define mod 1000000007 // 1e9+7(prime number)
#define INF 1000000000 // 1e9
#define LLINF 2000000000000000000LL // 2e18
#define SIZE 200010
/*Lowest Common Ancstor*/
struct LCA {
int n;
vector<vector<int>> tree, parent;
vector<int> depth;
int log2n;
LCA(int n) : n(n), tree(n), depth(n, -1) {
log2n = 0;
for (log2n = 1; (1 << log2n) < n; log2n++)
;
parent.assign(log2n, vector<int>(n, -1));
}
void add_edge(int u, int v) {
tree[u].push_back(v);
tree[v].push_back(u);
}
void dfs(int now, int p, int d) {
parent[0][now] = p;
depth[now] = d;
for (int to : tree[now])
if (to != p)
dfs(to, now, d + 1);
}
void build(int root) {
dfs(root, -1, 0);
for (int i = 0; i < log2n - 1; i++)
for (int j = 0; j < n; j++)
parent[i + 1][j] = parent[i][j] == -1 ? -1 : parent[i][parent[i][j]];
}
int query(int a, int b) {
if (depth[a] > depth[b])
swap(a, b);
for (int i = 0; i < log2n; i++)
if ((depth[b] - depth[a]) >> i & 1)
b = parent[i][b];
if (a == b)
return a;
for (int i = log2n - 1; i >= 0; i--) {
if (parent[i][a] != parent[i][b]) {
a = parent[i][a];
b = parent[i][b];
}
}
return parent[0][a];
}
};
/* Binary Indexed Tree(0-index) */
template <typename Type = int> struct BIT {
int bit_size;
vector<Type> data;
BIT(int n) {
bit_size = n;
data.assign(n + 2, 0);
}
// add x to kth value
void add(int k, Type x) {
k++;
while (k <= bit_size) {
data[k] += x;
k += k & (-k);
}
}
// sum of [0,k)
Type query(int k) {
Type rec = 0;
while (k > 0) {
rec += data[k];
k -= k & (-k);
}
return rec;
}
// sum of [a, b)
Type query(int a, int b) { return query(b) - query(a); }
};
vector<pair<int, pair<int, int>>> G[SIZE];
int idx = 0;
int in[SIZE], out[SIZE], w[SIZE];
vector<int> ce[SIZE];
void dfs(int now, int back = -1) {
in[now] = idx++;
for (auto e : G[now]) {
if (e.first == back)
continue;
dfs(e.first, now);
w[e.first] = e.second.second;
ce[e.second.first].push_back(e.first);
}
out[now] = idx++;
}
int main() {
int N, Q;
scanf("%d%d", &N, &Q);
LCA lca(N);
BIT<ll> bit(N * 2), bit2(N * 2);
for (int i = 0; i < N - 1; i++) {
int a, b, c, d;
scanf("%d%d%d%d", &a, &b, &c, &d);
a--;
b--;
c--;
G[a].push_back({b, {c, d}});
G[b].push_back({a, {c, d}});
lca.add_edge(a, b);
}
dfs(0);
lca.build(0);
for (int i = 0; i < N; i++) {
bit.add(in[i], -w[i]);
bit.add(out[i], w[i]);
}
int x[SIZE], y[SIZE], u[SIZE], v[SIZE];
ll ans[SIZE];
pair<int, int> query[SIZE];
for (int i = 0; i < Q; i++) {
scanf("%d%d%d%d", x + i, y + i, u + i, v + i);
x[i]--;
u[i]--;
v[i]--;
query[i] = {x[i], i};
}
sort(query, query + Q);
for (int i = 0; i < Q; i++) {
if (i == 0 || query[i - 1].first != query[i].first) {
for (int j : ce[query[i].first]) {
bit.add(in[j], w[j]);
bit.add(out[j], -w[j]);
bit2.add(in[j], -1);
bit2.add(out[j], 1);
}
}
int idx = query[i].second;
int g = lca.query(u[idx], v[idx]);
ll sum = bit.query(out[u[idx]], in[g]) + bit.query(out[v[idx]], in[g]);
ll count = bit2.query(out[u[idx]], in[g]) + bit2.query(out[v[idx]], in[g]);
ans[idx] = sum + count * y[i];
if (i < Q - 1 && query[i].first != query[i + 1].first) {
for (int j : ce[query[i].first]) {
bit.add(in[j], -w[j]);
bit.add(out[j], w[j]);
bit2.add(in[j], 1);
bit2.add(out[j], -1);
}
}
}
for (int i = 0; i < Q; i++) {
printf("%lld\n", ans[i]);
}
return 0;
}
| #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cassert>
#include <functional>
typedef long long ll;
using namespace std;
#ifndef LOCAL
#define debug(x) ;
#else
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
template <typename T1, typename T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &p) {
out << "{" << p.first << ", " << p.second << "}";
return out;
}
template <typename T> ostream &operator<<(ostream &out, const vector<T> &v) {
out << '{';
for (const T &item : v)
out << item << ", ";
out << "\b\b}";
return out;
}
#endif
#define mod 1000000007 // 1e9+7(prime number)
#define INF 1000000000 // 1e9
#define LLINF 2000000000000000000LL // 2e18
#define SIZE 200010
/*Lowest Common Ancstor*/
struct LCA {
int n;
vector<vector<int>> tree, parent;
vector<int> depth;
int log2n;
LCA(int n) : n(n), tree(n), depth(n, -1) {
log2n = 0;
for (log2n = 1; (1 << log2n) < n; log2n++)
;
parent.assign(log2n, vector<int>(n, -1));
}
void add_edge(int u, int v) {
tree[u].push_back(v);
tree[v].push_back(u);
}
void dfs(int now, int p, int d) {
parent[0][now] = p;
depth[now] = d;
for (int to : tree[now])
if (to != p)
dfs(to, now, d + 1);
}
void build(int root) {
dfs(root, -1, 0);
for (int i = 0; i < log2n - 1; i++)
for (int j = 0; j < n; j++)
parent[i + 1][j] = parent[i][j] == -1 ? -1 : parent[i][parent[i][j]];
}
int query(int a, int b) {
if (depth[a] > depth[b])
swap(a, b);
for (int i = 0; i < log2n; i++)
if ((depth[b] - depth[a]) >> i & 1)
b = parent[i][b];
if (a == b)
return a;
for (int i = log2n - 1; i >= 0; i--) {
if (parent[i][a] != parent[i][b]) {
a = parent[i][a];
b = parent[i][b];
}
}
return parent[0][a];
}
};
/* Binary Indexed Tree(0-index) */
template <typename Type = int> struct BIT {
int bit_size;
vector<Type> data;
BIT(int n) {
bit_size = n;
data.assign(n + 2, 0);
}
// add x to kth value
void add(int k, Type x) {
k++;
while (k <= bit_size) {
data[k] += x;
k += k & (-k);
}
}
// sum of [0,k)
Type query(int k) {
Type rec = 0;
while (k > 0) {
rec += data[k];
k -= k & (-k);
}
return rec;
}
// sum of [a, b)
Type query(int a, int b) { return query(b) - query(a); }
};
vector<pair<int, pair<int, int>>> G[SIZE];
int idx = 0;
int in[SIZE], out[SIZE], w[SIZE];
vector<int> ce[SIZE];
void dfs(int now, int back = -1) {
in[now] = idx++;
for (auto e : G[now]) {
if (e.first == back)
continue;
dfs(e.first, now);
w[e.first] = e.second.second;
ce[e.second.first].push_back(e.first);
}
out[now] = idx++;
}
int main() {
int N, Q;
scanf("%d%d", &N, &Q);
LCA lca(N);
BIT<ll> bit(N * 2), bit2(N * 2);
for (int i = 0; i < N - 1; i++) {
int a, b, c, d;
scanf("%d%d%d%d", &a, &b, &c, &d);
a--;
b--;
c--;
G[a].push_back({b, {c, d}});
G[b].push_back({a, {c, d}});
lca.add_edge(a, b);
}
dfs(0);
lca.build(0);
for (int i = 0; i < N; i++) {
bit.add(in[i], -w[i]);
bit.add(out[i], w[i]);
}
int x[SIZE], y[SIZE], u[SIZE], v[SIZE];
ll ans[SIZE];
pair<int, int> query[SIZE];
for (int i = 0; i < Q; i++) {
scanf("%d%d%d%d", x + i, y + i, u + i, v + i);
x[i]--;
u[i]--;
v[i]--;
query[i] = {x[i], i};
}
sort(query, query + Q);
for (int i = 0; i < Q; i++) {
if (i == 0 || query[i - 1].first != query[i].first) {
for (int j : ce[query[i].first]) {
bit.add(in[j], w[j]);
bit.add(out[j], -w[j]);
bit2.add(in[j], -1);
bit2.add(out[j], 1);
}
}
int idx = query[i].second;
int g = lca.query(u[idx], v[idx]);
ll sum = bit.query(out[u[idx]], out[g]) + bit.query(out[v[idx]], out[g]);
ll count =
bit2.query(out[u[idx]], out[g]) + bit2.query(out[v[idx]], out[g]);
ans[idx] = sum + count * y[idx];
if (i < Q - 1 && query[i].first != query[i + 1].first) {
for (int j : ce[query[i].first]) {
bit.add(in[j], -w[j]);
bit.add(out[j], w[j]);
bit2.add(in[j], 1);
bit2.add(out[j], -1);
}
}
}
for (int i = 0; i < Q; i++) {
printf("%lld\n", ans[i]);
}
return 0;
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 807,096 | 807,095 | u378419207 | cpp |
p02986 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
const int MV = 1e5 + 5;
const int MB = 20;
struct Edge {
int v, c, d;
Edge(int v = 0, int c = 0, int d = 0) : v(v), c(c), d(d) {}
};
vector<Edge> g[MV];
int dfn[MV * 2], pos[MV];
int n, q;
vector<int> id[MV];
vector<LL> sum[MV];
vector<LL> cnt[MV];
int ndfn = 0;
void init() {
for (int i = 0; i <= n; i++) {
id[i].push_back(0);
sum[i].push_back(0);
cnt[i].push_back(0);
}
ndfn = 0;
}
LL dis[MV];
void dfs(int u, int fa, int c, int d, LL nd) {
// cout<<u<<" "<<c<<endl;
dfn[++ndfn] = u;
pos[u] = ndfn;
id[c].push_back(ndfn);
sum[c].push_back(sum[c].back() + d);
cnt[c].push_back(cnt[c].back() + 1);
dis[u] = nd;
// cout<<u<<endl;
for (Edge e : g[u]) {
int v = e.v;
if (v == fa)
continue;
dfs(v, u, e.c, e.d, nd + e.d);
}
id[c].push_back(++ndfn);
sum[c].push_back(sum[c].back() - d);
cnt[c].push_back(cnt[c].back() - 1);
}
int fa[MV][MB], dep[MV];
void dfs_fa(int u, int f, int depth) {
dep[u] = depth;
for (Edge e : g[u]) {
int v = e.v;
if (v == f)
continue;
if (fa[v][0] == -1) {
fa[v][0] = u;
dfs_fa(v, u, depth + 1);
}
}
}
void init_lca(int root) {
memset(fa, -1, sizeof(fa));
dfs_fa(root, 0, 0);
for (int j = 1; j < MB; j++)
for (int i = 0; i < n; i++)
fa[i][j] = fa[fa[i][j - 1]][j - 1];
}
int lca(int a, int b) {
if (dep[a] > dep[b])
swap(a, b);
int k = dep[b] - dep[a];
for (int i = 0; (1 << i) <= k; i++)
if (k & (1 << i))
b = fa[b][i];
if (a == b)
return a;
for (int i = MB - 1; i >= 0; i--) {
if (fa[a][i] != fa[b][i]) {
a = fa[a][i];
b = fa[b][i];
}
}
return fa[a][0];
}
inline LL getsum(int u, int c, int d) {
int p = upper_bound(id[c].begin(), id[c].end(), pos[u]) - id[c].begin() - 1;
// cout<<p<<endl;
LL ans = dis[u] - sum[c][p] + cnt[c][p] * d;
// cout<<u<<" "<<dis[u]<<" "<<sum[c][p]<<" "<<cnt[c][p]<<" "<<ans<<endl;
return ans;
}
int main() {
// freopen("F_in.txt","r",stdin);
scanf("%d%d", &n, &q);
int u, v, c, d;
for (int i = 1; i < n; i++) {
scanf("%d%d%d%d", &u, &v, &c, &d);
g[u].emplace_back(v, c, d);
g[v].emplace_back(u, c, d);
}
init();
dfs(1, 0, 0, 0, 0);
// for(int i=1;i<=n;i++)
// cout<<dis[i]<<" ";
// cout<<endl;
// for(int i=1;i<=n;i++)
// cout<<pos[i]<<" ";
// cout<<endl;
// for(int i=0;i<=n-1;i++)
// {
// cout<<"id "<<i<<":";
// for(int j:id[i])
// cout<<" "<<j;
// cout<<endl;
// }
init_lca(1);
while (q--) {
scanf("%d%d%d%d", &c, &d, &u, &v);
int l = lca(u, v);
// cout<<l<<endl;
printf("%lld\n", getsum(u, c, d) + getsum(v, c, d) - 2 * getsum(l, c, d));
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
const int MV = 1e5 + 5;
const int MB = 20;
struct Edge {
int v, c, d;
Edge(int v = 0, int c = 0, int d = 0) : v(v), c(c), d(d) {}
};
vector<Edge> g[MV];
int dfn[MV * 2], pos[MV];
int n, q;
vector<int> id[MV];
vector<LL> sum[MV];
vector<LL> cnt[MV];
int ndfn = 0;
void init() {
for (int i = 0; i <= n; i++) {
id[i].push_back(0);
sum[i].push_back(0);
cnt[i].push_back(0);
}
ndfn = 0;
}
LL dis[MV];
void dfs(int u, int fa, int c, int d, LL nd) {
// cout<<u<<" "<<c<<endl;
dfn[++ndfn] = u;
pos[u] = ndfn;
id[c].push_back(ndfn);
sum[c].push_back(sum[c].back() + d);
cnt[c].push_back(cnt[c].back() + 1);
dis[u] = nd;
// cout<<u<<endl;
for (Edge e : g[u]) {
int v = e.v;
if (v == fa)
continue;
dfs(v, u, e.c, e.d, nd + e.d);
}
id[c].push_back(++ndfn);
sum[c].push_back(sum[c].back() - d);
cnt[c].push_back(cnt[c].back() - 1);
}
int fa[MV][MB], dep[MV];
void dfs_fa(int u, int f, int depth) {
dep[u] = depth;
for (Edge e : g[u]) {
int v = e.v;
if (v == f)
continue;
if (fa[v][0] == -1) {
fa[v][0] = u;
dfs_fa(v, u, depth + 1);
}
}
}
void init_lca(int root) {
memset(fa, -1, sizeof(fa));
dfs_fa(root, 0, 0);
for (int j = 1; j < MB; j++)
for (int i = 1; i <= n; i++)
fa[i][j] = fa[fa[i][j - 1]][j - 1];
}
int lca(int a, int b) {
if (dep[a] > dep[b])
swap(a, b);
int k = dep[b] - dep[a];
for (int i = 0; (1 << i) <= k; i++)
if (k & (1 << i))
b = fa[b][i];
if (a == b)
return a;
for (int i = MB - 1; i >= 0; i--) {
if (fa[a][i] != fa[b][i]) {
a = fa[a][i];
b = fa[b][i];
}
}
return fa[a][0];
}
inline LL getsum(int u, int c, int d) {
int p = upper_bound(id[c].begin(), id[c].end(), pos[u]) - id[c].begin() - 1;
// cout<<p<<endl;
LL ans = dis[u] - sum[c][p] + cnt[c][p] * d;
// cout<<u<<" "<<dis[u]<<" "<<sum[c][p]<<" "<<cnt[c][p]<<" "<<ans<<endl;
return ans;
}
int main() {
// freopen("F_in.txt","r",stdin);
scanf("%d%d", &n, &q);
int u, v, c, d;
for (int i = 1; i < n; i++) {
scanf("%d%d%d%d", &u, &v, &c, &d);
g[u].emplace_back(v, c, d);
g[v].emplace_back(u, c, d);
}
init();
dfs(1, 0, 0, 0, 0);
// for(int i=1;i<=n;i++)
// cout<<dis[i]<<" ";
// cout<<endl;
// for(int i=1;i<=n;i++)
// cout<<pos[i]<<" ";
// cout<<endl;
// for(int i=0;i<=n-1;i++)
// {
// cout<<"id "<<i<<":";
// for(int j:id[i])
// cout<<" "<<j;
// cout<<endl;
// cout<<"sum "<<i<<":";
// for(int j:sum[i])
// cout<<" "<<j;
// cout<<endl;
// cout<<"cnt "<<i<<":";
// for(int j:cnt[i])
// cout<<" "<<j;
// cout<<endl;
// }
init_lca(1);
while (q--) {
scanf("%d%d%d%d", &c, &d, &u, &v);
int l = lca(u, v);
// cout<<l<<endl;
printf("%lld\n", getsum(u, c, d) + getsum(v, c, d) - 2 * getsum(l, c, d));
}
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"
] | 807,099 | 807,100 | u138879272 | cpp |
p02986 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET \
int ___T; \
scanf("%d", &___T); \
for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
_W(x.F);
putchar(' ');
_W(x.S);
}
template <class T> void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin())
putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
#ifdef HOME
#define DEBUG(...) \
{ \
printf("# "); \
printf(__VA_ARGS__); \
puts(""); \
}
#else
#define DEBUG(...)
#endif
int MOD = 1e9 + 7;
void ADD(LL &x, LL v) {
x = (x + v) % MOD;
if (x < 0)
x += MOD;
}
/*}}}*/
const int SIZE = 1e6 + 10;
// 0-based
#define MAX_LV 19
VI e[SIZE];
VI len[SIZE];
VI col[SIZE];
int jump[MAX_LV + 1][SIZE], lv[SIZE];
void __init(int x, int lt) {
jump[0][x] = lt;
REP(i, SZ(e[x])) {
int y = e[x][i];
if (y != lt) {
lv[y] = lv[x] + 1;
__init(y, x);
}
}
}
int adv(int x, int v) {
for (int i = 0; (1 << i) <= v; i++) {
if ((v >> i) & 1)
x = jump[i][x];
}
return x;
}
int lca(int x, int y) {
if (lv[x] > lv[y])
x = adv(x, lv[x] - lv[y]);
else
y = adv(y, lv[y] - lv[x]);
if (x == y)
return x;
for (int i = MAX_LV; i >= 0; i--)
if (jump[i][x] != jump[i][y]) {
x = jump[i][x];
y = jump[i][y];
}
return jump[0][x];
}
int dis(int x, int y) {
int z = lca(x, y);
return lv[x] + lv[y] - lv[z] * 2;
}
void build(int root, int N) {
__init(root, root);
REPP(i, 1, MAX_LV + 1) {
REP(x, N)
jump[i][x] = jump[i - 1][jump[i - 1][x]];
}
}
struct Qdata {
int id, x, y, cc;
Qdata(int id, int x, int y, int cc) : id(id), x(x), y(y), cc(cc) {}
};
vector<Qdata> qq[SIZE];
LL an[SIZE];
int cnt[SIZE], cv[SIZE];
void dfs(int x, int lt, int v) {
for (auto me : qq[x]) {
an[me.id] += v - cv[me.x] + cnt[me.x] * me.y;
}
REP(i, SZ(e[x])) {
int y = e[x][i];
if (y == lt)
continue;
cnt[col[x][i]]++;
cv[col[x][i]] += len[x][i];
dfs(y, x, v + len[x][i]);
cnt[col[x][i]]--;
cv[col[x][i]] -= len[x][i];
}
}
int main() {
int N, Q;
R(N, Q);
REPP(i, 1, N) {
int a, b, c, d;
R(a, b, c, d);
a--;
b--;
e[a].PB(b);
col[a].PB(c);
len[a].PB(d);
e[b].PB(a);
col[b].PB(c);
len[b].PB(d);
}
build(0, N);
FOR(i, 1, Q) {
int x, y, u, v;
R(x, y, u, v);
u--;
v--;
int z = lca(u, v);
qq[u].PB(Qdata(i, x, y, 1));
qq[v].PB(Qdata(i, x, y, 1));
qq[z].PB(Qdata(i, x, y, -2));
}
dfs(0, 0, 0);
FOR(i, 1, Q) W(an[i]);
return 0;
}
| /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET \
int ___T; \
scanf("%d", &___T); \
for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
_W(x.F);
putchar(' ');
_W(x.S);
}
template <class T> void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin())
putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
#ifdef HOME
#define DEBUG(...) \
{ \
printf("# "); \
printf(__VA_ARGS__); \
puts(""); \
}
#else
#define DEBUG(...)
#endif
int MOD = 1e9 + 7;
void ADD(LL &x, LL v) {
x = (x + v) % MOD;
if (x < 0)
x += MOD;
}
/*}}}*/
const int SIZE = 1e6 + 10;
// 0-based
#define MAX_LV 19
VI e[SIZE];
VI len[SIZE];
VI col[SIZE];
int jump[MAX_LV + 1][SIZE], lv[SIZE];
void __init(int x, int lt) {
jump[0][x] = lt;
REP(i, SZ(e[x])) {
int y = e[x][i];
if (y != lt) {
lv[y] = lv[x] + 1;
__init(y, x);
}
}
}
int adv(int x, int v) {
for (int i = 0; (1 << i) <= v; i++) {
if ((v >> i) & 1)
x = jump[i][x];
}
return x;
}
int lca(int x, int y) {
if (lv[x] > lv[y])
x = adv(x, lv[x] - lv[y]);
else
y = adv(y, lv[y] - lv[x]);
if (x == y)
return x;
for (int i = MAX_LV; i >= 0; i--)
if (jump[i][x] != jump[i][y]) {
x = jump[i][x];
y = jump[i][y];
}
return jump[0][x];
}
int dis(int x, int y) {
int z = lca(x, y);
return lv[x] + lv[y] - lv[z] * 2;
}
void build(int root, int N) {
__init(root, root);
REPP(i, 1, MAX_LV + 1) {
REP(x, N)
jump[i][x] = jump[i - 1][jump[i - 1][x]];
}
}
struct Qdata {
int id, x, y, cc;
Qdata(int id, int x, int y, int cc) : id(id), x(x), y(y), cc(cc) {}
};
vector<Qdata> qq[SIZE];
LL an[SIZE];
int cnt[SIZE], cv[SIZE];
void dfs(int x, int lt, int v) {
for (auto me : qq[x]) {
an[me.id] += (v - cv[me.x] + cnt[me.x] * me.y) * me.cc;
}
REP(i, SZ(e[x])) {
int y = e[x][i];
if (y == lt)
continue;
cnt[col[x][i]]++;
cv[col[x][i]] += len[x][i];
dfs(y, x, v + len[x][i]);
cnt[col[x][i]]--;
cv[col[x][i]] -= len[x][i];
}
}
int main() {
int N, Q;
R(N, Q);
REPP(i, 1, N) {
int a, b, c, d;
R(a, b, c, d);
a--;
b--;
e[a].PB(b);
col[a].PB(c);
len[a].PB(d);
e[b].PB(a);
col[b].PB(c);
len[b].PB(d);
}
build(0, N);
FOR(i, 1, Q) {
int x, y, u, v;
R(x, y, u, v);
u--;
v--;
int z = lca(u, v);
qq[u].PB(Qdata(i, x, y, 1));
qq[v].PB(Qdata(i, x, y, 1));
qq[z].PB(Qdata(i, x, y, -2));
}
dfs(0, 0, 0);
FOR(i, 1, Q) W(an[i]);
return 0;
}
| [
"assignment.change"
] | 807,103 | 807,104 | u284124505 | cpp |
p02986 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define vv(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vll vector<ll>
typedef long long int ll;
typedef long double ld;
using namespace std;
//-------------------------------------------------------------------
const int MAX_V = 100001;
vvi G = vv(MAX_V, 0, 0, int);
struct edge {
ll to, color, cost;
};
vector<vector<edge>> T(100001);
int root;
int parent[30][MAX_V];
vector<int> depth(MAX_V);
void dfs(int v, int p, int d) {
parent[0][v] = p, depth[v] = d;
for (int i = 0; i < G[v].size(); i++)
if (G[v][i] != p)
dfs(G[v][i], v, d + 1);
}
void init(int V) {
dfs(root, -1, 0);
for (int k = 0; k + 1 < 30; k++) {
for (int v = 0; v < V; v++) {
if (parent[k][v] < 0)
parent[k + 1][v] = -1;
else
parent[k + 1][v] = parent[k][parent[k][v]];
}
}
}
int lca(int u, int v) {
if (depth[u] > depth[v])
swap(u, v);
for (int k = 0; k < 30; k++)
if ((depth[v] - depth[u]) >> k & 1)
v = parent[k][v];
if (u == v)
return u;
for (int k = 30 - 1; k >= 0; k--) {
if (parent[k][u] != parent[k][v]) {
u = parent[k][u];
v = parent[k][v];
}
}
return parent[0][u];
}
//-------------------------------------------------------------------
vector<ll> c_count(100001, 0), d_count(100001, 0);
std::vector<ll> D(100001, 0);
vvl ans = vv(100001, 10, 0, ll);
vvl que = vv(0, 4, 0, ll);
void fs(ll now, ll from, ll d) {
D[now] = d;
auto itr = lower_bound(que.begin(), que.end(), vll{now, 0, 0, 0});
auto ed = upper_bound(que.begin(), que.end(), vll{now + 1, 0, 0, 0});
for (; itr != ed; itr++) {
vll t = *itr;
// std::cout << t[0] << " " << t[1] << '\n';
ans[t[2]][t[3] * 3] = c_count[t[1]];
ans[t[2]][t[3] * 3 + 1] = d_count[t[1]];
ans[t[2]][t[3] * 3 + 2] = D[now];
}
for (int i = 0; i < T[now].size(); i++) {
if (T[now][i].to == from)
continue;
c_count[T[now][i].color]++;
d_count[T[now][i].color] += T[now][i].cost;
fs(T[now][i].to, now, d + T[now][i].cost);
c_count[T[now][i].color]--;
d_count[T[now][i].color] -= T[now][i].cost;
}
}
int main(int argc, char const *argv[]) {
ll n, q;
std::cin >> n >> q;
ll a, b, c, d;
for (int i = 0; i < n - 1; i++) {
std::cin >> a >> b >> c >> d;
G[a].push_back(b);
G[b].push_back(a);
T[a].push_back(edge{b, c, d});
T[b].push_back(edge{a, c, d});
}
root = 1;
init(n + 1);
for (int i = 0; i < q; i++) {
std::cin >> c >> d >> a >> b;
ans[i][9] = d;
que.push_back(vll{a, c, i, 0});
que.push_back(vll{b, c, i, 1});
que.push_back(vll{lca(a, b), c, i, 2});
}
sort(que.begin(), que.end());
fs(root, -1, 0);
for (int i = 0; i < q; i++) {
ll a_cost = ans[i][2] + ans[i][0] * ans[i][9] - ans[i][1];
ll b_cost = ans[i][5] + ans[i][3] * ans[i][9] - ans[i][4];
ll c_cost = ans[i][8] + ans[i][6] * ans[i][9] - ans[i][7];
std::cout << a_cost + b_cost - c_cost << '\n';
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define vv(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vll vector<ll>
typedef long long int ll;
typedef long double ld;
using namespace std;
//-------------------------------------------------------------------
const int MAX_V = 100001;
vvi G = vv(MAX_V, 0, 0, int);
struct edge {
ll to, color, cost;
};
vector<vector<edge>> T(100001);
int root;
int parent[30][MAX_V];
vector<int> depth(MAX_V);
void dfs(int v, int p, int d) {
parent[0][v] = p, depth[v] = d;
for (int i = 0; i < G[v].size(); i++)
if (G[v][i] != p)
dfs(G[v][i], v, d + 1);
}
void init(int V) {
dfs(root, -1, 0);
for (int k = 0; k + 1 < 30; k++) {
for (int v = 0; v < V; v++) {
if (parent[k][v] < 0)
parent[k + 1][v] = -1;
else
parent[k + 1][v] = parent[k][parent[k][v]];
}
}
}
int lca(int u, int v) {
if (depth[u] > depth[v])
swap(u, v);
for (int k = 0; k < 30; k++)
if ((depth[v] - depth[u]) >> k & 1)
v = parent[k][v];
if (u == v)
return u;
for (int k = 30 - 1; k >= 0; k--) {
if (parent[k][u] != parent[k][v]) {
u = parent[k][u];
v = parent[k][v];
}
}
return parent[0][u];
}
//-------------------------------------------------------------------
vector<ll> c_count(100001, 0), d_count(100001, 0);
std::vector<ll> D(100001, 0);
vvl ans = vv(100001, 10, 0, ll);
vvl que = vv(0, 4, 0, ll);
void fs(ll now, ll from, ll d) {
D[now] = d;
auto itr = lower_bound(que.begin(), que.end(), vll{now, 0, 0, 0});
auto ed = upper_bound(que.begin(), que.end(), vll{now + 1, 0, 0, 0});
for (; itr != ed; itr++) {
vll t = *itr;
// std::cout << t[0] << " " << t[1] << '\n';
ans[t[2]][t[3] * 3] = c_count[t[1]];
ans[t[2]][t[3] * 3 + 1] = d_count[t[1]];
ans[t[2]][t[3] * 3 + 2] = D[now];
}
for (int i = 0; i < T[now].size(); i++) {
if (T[now][i].to == from)
continue;
c_count[T[now][i].color]++;
d_count[T[now][i].color] += T[now][i].cost;
fs(T[now][i].to, now, d + T[now][i].cost);
c_count[T[now][i].color]--;
d_count[T[now][i].color] -= T[now][i].cost;
}
}
int main(int argc, char const *argv[]) {
ll n, q;
std::cin >> n >> q;
ll a, b, c, d;
for (int i = 0; i < n - 1; i++) {
std::cin >> a >> b >> c >> d;
G[a].push_back(b);
G[b].push_back(a);
T[a].push_back(edge{b, c, d});
T[b].push_back(edge{a, c, d});
}
root = 1;
init(n + 1);
for (int i = 0; i < q; i++) {
std::cin >> c >> d >> a >> b;
ans[i][9] = d;
que.push_back(vll{a, c, i, 0});
que.push_back(vll{b, c, i, 1});
que.push_back(vll{lca(a, b), c, i, 2});
}
sort(que.begin(), que.end());
fs(root, -1, 0);
for (int i = 0; i < q; i++) {
ll a_cost = ans[i][2] + ans[i][0] * ans[i][9] - ans[i][1];
ll b_cost = ans[i][5] + ans[i][3] * ans[i][9] - ans[i][4];
ll c_cost = ans[i][8] + ans[i][6] * ans[i][9] - ans[i][7];
std::cout << a_cost + b_cost - 2 * c_cost << '\n';
}
return 0;
}
| [
"expression.operation.binary.add"
] | 807,119 | 807,120 | u816587940 | cpp |
p02986 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// BEGIN CUT HERE
class EulerTourForEdge {
private:
vector<int> ds, us, dep;
int pos;
void dfs(int v, int p, int d) {
dep[v] = d;
for (int u : G[v]) {
if (u == p)
continue;
ds[u] = pos++;
dfs(u, v, d + 1);
us[u] = pos++;
}
}
public:
vector<vector<int>> G;
EulerTourForEdge() {}
EulerTourForEdge(int n) : ds(n), us(n), dep(n), G(n) {}
void add_edge(int u, int v) {
G[u].emplace_back(v);
G[v].emplace_back(u);
}
void build(int r = 0) {
pos = 0;
dfs(r, -1, 0);
}
int child(int u, int v) { return dep[u] < dep[v] ? v : u; }
template <typename T, typename F> T query(int v, F f) { return f(0, us[v]); }
template <typename T, typename F> T query(int u, int v, F f) {
if (dep[u] < dep[v])
swap(u, v);
return query<T>(u, f) - query<T>(v, f);
}
template <typename T, typename G> void update(int v, T x, G g) {
g(ds[v], +x);
g(us[v], -x);
}
};
// END CUT HERE
template <typename T> struct BIT {
int n;
vector<T> bit;
// 1-indexed
BIT() : n(-1) {}
BIT(int n_, T d) : n(n_), bit(n_ + 1, d) {}
T sum(int i) {
T s = bit[0];
for (int x = i; x > 0; x -= (x & -x))
s += bit[x];
return s;
}
void add(int i, T a) {
if (i == 0)
return;
for (int x = i; x <= n; x += (x & -x))
bit[x] += a;
}
int lower_bound(int w) {
if (w <= 0)
return 0;
int x = 0, r = 1;
while (r < n)
r <<= 1;
for (int k = r; k > 0; k >>= 1) {
if (x + k <= n && bit[x + k] < w) {
w -= bit[x + k];
x += k;
}
}
return x + 1;
}
T sum0(int i) { return sum(i + 1); }
void add0(int i, T a) { add(i + 1, a); }
T query(int l, int r) { return sum(r - 1) - sum(l - 1); }
T query0(int l, int r) { return sum(r) - sum(l); }
};
struct LowestCommonAncestor {
int n, h;
vector<vector<int>> G, par;
vector<int> dep;
LowestCommonAncestor() {}
LowestCommonAncestor(int n) : n(n), G(n), dep(n) {
h = 1;
while ((1 << h) <= n)
h++;
par.assign(h, vector<int>(n, -1));
}
void add_edge(int u, int v) {
G[u].emplace_back(v);
G[v].emplace_back(u);
}
void dfs(int v, int p, int d) {
par[0][v] = p;
dep[v] = d;
for (int u : G[v])
if (u != p)
dfs(u, v, d + 1);
}
void build(int r = 0) {
dfs(r, -1, 0);
for (int k = 0; k + 1 < h; k++) {
for (int v = 0; v < n; v++) {
if (par[k][v] < 0)
par[k + 1][v] = -1;
else
par[k + 1][v] = par[k][par[k][v]];
}
}
}
int lca(int u, int v) {
if (dep[u] > dep[v])
swap(u, v);
for (int k = 0; k < h; k++) {
if ((dep[v] - dep[u]) >> k & 1) {
v = par[k][v];
}
}
if (u == v)
return u;
for (int k = h - 1; k >= 0; k--) {
if (par[k][u] != par[k][v]) {
u = par[k][u];
v = par[k][v];
}
}
return par[0][u];
}
int distance(int u, int v) { return dep[u] + dep[v] - dep[lca(u, v)] * 2; }
};
template <typename T> struct SegmentTree {
using F = function<T(T, T)>;
int n;
F f;
T ti;
vector<T> dat;
SegmentTree(){};
SegmentTree(F f, T ti) : f(f), ti(ti) {}
void init(int n_) {
n = 1;
while (n < n_)
n <<= 1;
dat.assign(n << 1, ti);
}
void build(const vector<T> &v) {
int n_ = v.size();
init(n_);
for (int i = 0; i < n_; i++)
dat[n + i] = v[i];
for (int i = n - 1; i; i--)
dat[i] = f(dat[(i << 1) | 0], dat[(i << 1) | 1]);
}
void set_val(int k, T x) {
dat[k += n] = x;
while (k >>= 1)
dat[k] = f(dat[(k << 1) | 0], dat[(k << 1) | 1]);
}
T query(int a, int b) {
T vl = ti, vr = ti;
for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {
if (l & 1)
vl = f(vl, dat[l++]);
if (r & 1)
vr = f(dat[--r], vr);
}
return f(vl, vr);
}
template <typename C>
int find(int st, C &check, T &acc, int k, int l, int r) {
if (l + 1 == r) {
acc = f(acc, dat[k]);
return check(acc) ? k - n : -1;
}
int m = (l + r) >> 1;
if (m <= st)
return find(st, check, acc, (k << 1) | 1, m, r);
if (st <= l && !check(f(acc, dat[k]))) {
acc = f(acc, dat[k]);
return -1;
}
int vl = find(st, check, acc, (k << 1) | 0, l, m);
if (~vl)
return vl;
return find(st, check, acc, (k << 1) | 1, m, r);
}
template <typename C> int find(int st, C &check) {
T acc = ti;
return find(st, check, acc, 1, 0, n);
}
};
// INSERT ABOVE HERE
signed AOJ_GRL_5_D() {
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin >> n;
EulerTourForEdge et(n);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int c;
cin >> c;
et.add_edge(i, c);
}
}
et.build();
BIT<int> bit(n * 2 + 100, 0);
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int t;
cin >> t;
if (t == 0) {
int v, w;
cin >> v >> w;
auto g = [&](int k, int d) { bit.add0(k, d); };
et.update(v, w, g);
}
if (t == 1) {
int u;
cin >> u;
auto f = [&](int l, int r) { return bit.query0(l, r); };
cout << et.query<int>(u, f) << "\n";
}
}
cout << flush;
return 0;
}
/*
verified on 2019/07/08
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_5_D&lang=jp
*/
signed ABC133_F() {
cin.tie(0);
ios::sync_with_stdio(0);
int n, q;
cin >> n >> q;
vector<int> as(n), bs(n), cs(n), ds(n);
vector<int> xs(q), ys(q), us(q), vs(q);
vector<vector<int>> C(n), D(n);
EulerTourForEdge et(n);
LowestCommonAncestor lca(n);
for (int i = 1; i < n; i++) {
cin >> as[i] >> bs[i] >> cs[i] >> ds[i];
as[i]--;
bs[i]--;
et.add_edge(as[i], bs[i]);
lca.add_edge(as[i], bs[i]);
C[cs[i]].emplace_back(i);
}
et.build();
lca.build();
for (int i = 0; i < q; i++) {
cin >> xs[i] >> ys[i] >> us[i] >> vs[i];
us[i]--;
vs[i]--;
D[xs[i]].emplace_back(i);
}
auto f = [&](int a, int b) { return a + b; };
int ti = 0;
SegmentTree<int> cnt(f, ti);
SegmentTree<int> sum(f, ti);
cnt.build(vector<int>(n, 0));
sum.build(vector<int>(n, 0));
for (int i = 1; i < n; i++) {
int ch = et.child(as[i], bs[i]);
auto g = [&](int v, int d) { sum.set_val(v, d); };
et.update(ch, ds[i], g);
}
vector<int> ans(q, 0);
for (int i = 0; i < q; i++) {
int r = lca.lca(us[i], vs[i]);
auto f = [&](int l, int r) { return sum.query(l, r); };
ans[i] += et.query<int>(r, us[i], f);
ans[i] += et.query<int>(r, vs[i], f);
}
sum.build(vector<int>(n, 0));
for (int t = 1; t < n; t++) {
for (int i : C[t]) {
int ch = et.child(as[i], bs[i]);
auto g1 = [&](int v, int d) { cnt.set_val(v, d); };
auto g2 = [&](int v, int d) { sum.set_val(v, d); };
et.update(ch, 1, g1);
et.update(ch, ds[i], g2);
}
for (int i : D[t]) {
int res = 0, num = 0;
int r = lca.lca(us[i], vs[i]);
auto f1 = [&](int l, int r) { return cnt.query(l, r); };
auto f2 = [&](int l, int r) { return sum.query(l, r); };
num += et.query<int>(r, us[i], f1);
num += et.query<int>(r, vs[i], f1);
res += et.query<int>(r, us[i], f2);
res += et.query<int>(r, vs[i], f2);
ans[i] += num * ys[i];
ans[i] -= res;
}
for (int i : C[t]) {
int ch = et.child(as[i], bs[i]);
auto g1 = [&](int v, int d) { cnt.set_val(v, d); };
auto g2 = [&](int v, int d) { sum.set_val(v, d); };
et.update(ch, 0, g1);
et.update(ch, 0, g2);
}
}
for (int i = 0; i < q; i++)
cout << ans[i] << "\n";
cout << flush;
return 0;
}
/*
verified on 2019/07/08
https://atcoder.jp/contests/abc133/tasks/abc133_f
*/
signed main() {
// AOJ_GRL_5_D();
ABC133_F();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// BEGIN CUT HERE
class EulerTourForEdge {
private:
vector<int> ds, us, dep;
int pos;
void dfs(int v, int p, int d) {
dep[v] = d;
for (int u : G[v]) {
if (u == p)
continue;
ds[u] = pos++;
dfs(u, v, d + 1);
us[u] = pos++;
}
}
public:
vector<vector<int>> G;
EulerTourForEdge() {}
EulerTourForEdge(int n) : ds(n), us(n), dep(n), G(n) {}
void add_edge(int u, int v) {
G[u].emplace_back(v);
G[v].emplace_back(u);
}
void build(int r = 0) {
pos = 0;
dfs(r, -1, 0);
}
int child(int u, int v) { return dep[u] < dep[v] ? v : u; }
template <typename T, typename F> T query(int v, F f) { return f(0, us[v]); }
template <typename T, typename F> T query(int u, int v, F f) {
if (dep[u] < dep[v])
swap(u, v);
return query<T>(u, f) - query<T>(v, f);
}
template <typename T, typename G> void update(int v, T x, G g) {
g(ds[v], +x);
g(us[v], -x);
}
};
// END CUT HERE
template <typename T> struct BIT {
int n;
vector<T> bit;
// 1-indexed
BIT() : n(-1) {}
BIT(int n_, T d) : n(n_), bit(n_ + 1, d) {}
T sum(int i) {
T s = bit[0];
for (int x = i; x > 0; x -= (x & -x))
s += bit[x];
return s;
}
void add(int i, T a) {
if (i == 0)
return;
for (int x = i; x <= n; x += (x & -x))
bit[x] += a;
}
int lower_bound(int w) {
if (w <= 0)
return 0;
int x = 0, r = 1;
while (r < n)
r <<= 1;
for (int k = r; k > 0; k >>= 1) {
if (x + k <= n && bit[x + k] < w) {
w -= bit[x + k];
x += k;
}
}
return x + 1;
}
T sum0(int i) { return sum(i + 1); }
void add0(int i, T a) { add(i + 1, a); }
T query(int l, int r) { return sum(r - 1) - sum(l - 1); }
T query0(int l, int r) { return sum(r) - sum(l); }
};
struct LowestCommonAncestor {
int n, h;
vector<vector<int>> G, par;
vector<int> dep;
LowestCommonAncestor() {}
LowestCommonAncestor(int n) : n(n), G(n), dep(n) {
h = 1;
while ((1 << h) <= n)
h++;
par.assign(h, vector<int>(n, -1));
}
void add_edge(int u, int v) {
G[u].emplace_back(v);
G[v].emplace_back(u);
}
void dfs(int v, int p, int d) {
par[0][v] = p;
dep[v] = d;
for (int u : G[v])
if (u != p)
dfs(u, v, d + 1);
}
void build(int r = 0) {
dfs(r, -1, 0);
for (int k = 0; k + 1 < h; k++) {
for (int v = 0; v < n; v++) {
if (par[k][v] < 0)
par[k + 1][v] = -1;
else
par[k + 1][v] = par[k][par[k][v]];
}
}
}
int lca(int u, int v) {
if (dep[u] > dep[v])
swap(u, v);
for (int k = 0; k < h; k++) {
if ((dep[v] - dep[u]) >> k & 1) {
v = par[k][v];
}
}
if (u == v)
return u;
for (int k = h - 1; k >= 0; k--) {
if (par[k][u] != par[k][v]) {
u = par[k][u];
v = par[k][v];
}
}
return par[0][u];
}
int distance(int u, int v) { return dep[u] + dep[v] - dep[lca(u, v)] * 2; }
};
template <typename T> struct SegmentTree {
using F = function<T(T, T)>;
int n;
F f;
T ti;
vector<T> dat;
SegmentTree(){};
SegmentTree(F f, T ti) : f(f), ti(ti) {}
void init(int n_) {
n = 1;
while (n < n_)
n <<= 1;
dat.assign(n << 1, ti);
}
void build(const vector<T> &v) {
int n_ = v.size();
init(n_);
for (int i = 0; i < n_; i++)
dat[n + i] = v[i];
for (int i = n - 1; i; i--)
dat[i] = f(dat[(i << 1) | 0], dat[(i << 1) | 1]);
}
void set_val(int k, T x) {
dat[k += n] = x;
while (k >>= 1)
dat[k] = f(dat[(k << 1) | 0], dat[(k << 1) | 1]);
}
T query(int a, int b) {
T vl = ti, vr = ti;
for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {
if (l & 1)
vl = f(vl, dat[l++]);
if (r & 1)
vr = f(dat[--r], vr);
}
return f(vl, vr);
}
template <typename C>
int find(int st, C &check, T &acc, int k, int l, int r) {
if (l + 1 == r) {
acc = f(acc, dat[k]);
return check(acc) ? k - n : -1;
}
int m = (l + r) >> 1;
if (m <= st)
return find(st, check, acc, (k << 1) | 1, m, r);
if (st <= l && !check(f(acc, dat[k]))) {
acc = f(acc, dat[k]);
return -1;
}
int vl = find(st, check, acc, (k << 1) | 0, l, m);
if (~vl)
return vl;
return find(st, check, acc, (k << 1) | 1, m, r);
}
template <typename C> int find(int st, C &check) {
T acc = ti;
return find(st, check, acc, 1, 0, n);
}
};
// INSERT ABOVE HERE
signed AOJ_GRL_5_D() {
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin >> n;
EulerTourForEdge et(n);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int c;
cin >> c;
et.add_edge(i, c);
}
}
et.build();
BIT<int> bit(n * 2 + 100, 0);
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int t;
cin >> t;
if (t == 0) {
int v, w;
cin >> v >> w;
auto g = [&](int k, int d) { bit.add0(k, d); };
et.update(v, w, g);
}
if (t == 1) {
int u;
cin >> u;
auto f = [&](int l, int r) { return bit.query0(l, r); };
cout << et.query<int>(u, f) << "\n";
}
}
cout << flush;
return 0;
}
/*
verified on 2019/07/08
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_5_D&lang=jp
*/
signed ABC133_F() {
cin.tie(0);
ios::sync_with_stdio(0);
int n, q;
cin >> n >> q;
vector<int> as(n), bs(n), cs(n), ds(n);
vector<int> xs(q), ys(q), us(q), vs(q);
vector<vector<int>> C(n), D(n);
EulerTourForEdge et(n);
LowestCommonAncestor lca(n);
for (int i = 1; i < n; i++) {
cin >> as[i] >> bs[i] >> cs[i] >> ds[i];
as[i]--;
bs[i]--;
et.add_edge(as[i], bs[i]);
lca.add_edge(as[i], bs[i]);
C[cs[i]].emplace_back(i);
}
et.build();
lca.build();
for (int i = 0; i < q; i++) {
cin >> xs[i] >> ys[i] >> us[i] >> vs[i];
us[i]--;
vs[i]--;
D[xs[i]].emplace_back(i);
}
auto f = [&](int a, int b) { return a + b; };
int ti = 0;
SegmentTree<int> cnt(f, ti);
SegmentTree<int> sum(f, ti);
cnt.build(vector<int>(n * 2, 0));
sum.build(vector<int>(n * 2, 0));
for (int i = 1; i < n; i++) {
int ch = et.child(as[i], bs[i]);
auto g = [&](int v, int d) { sum.set_val(v, d); };
et.update(ch, ds[i], g);
}
vector<int> ans(q, 0);
for (int i = 0; i < q; i++) {
int r = lca.lca(us[i], vs[i]);
auto f = [&](int l, int r) { return sum.query(l, r); };
ans[i] += et.query<int>(r, us[i], f);
ans[i] += et.query<int>(r, vs[i], f);
}
sum.build(vector<int>(n * 2, 0));
for (int t = 1; t < n; t++) {
for (int i : C[t]) {
int ch = et.child(as[i], bs[i]);
auto g1 = [&](int v, int d) { cnt.set_val(v, d); };
auto g2 = [&](int v, int d) { sum.set_val(v, d); };
et.update(ch, 1, g1);
et.update(ch, ds[i], g2);
}
for (int i : D[t]) {
int res = 0, num = 0;
int r = lca.lca(us[i], vs[i]);
auto f1 = [&](int l, int r) { return cnt.query(l, r); };
auto f2 = [&](int l, int r) { return sum.query(l, r); };
num += et.query<int>(r, us[i], f1);
num += et.query<int>(r, vs[i], f1);
res += et.query<int>(r, us[i], f2);
res += et.query<int>(r, vs[i], f2);
ans[i] += num * ys[i];
ans[i] -= res;
}
for (int i : C[t]) {
int ch = et.child(as[i], bs[i]);
auto g1 = [&](int v, int d) { cnt.set_val(v, d); };
auto g2 = [&](int v, int d) { sum.set_val(v, d); };
et.update(ch, 0, g1);
et.update(ch, 0, g2);
}
}
for (int i = 0; i < q; i++)
cout << ans[i] << "\n";
cout << flush;
return 0;
}
/*
verified on 2019/07/08
https://atcoder.jp/contests/abc133/tasks/abc133_f
*/
signed main() {
// AOJ_GRL_5_D();
ABC133_F();
return 0;
}
| [
"expression.operation.binary.add"
] | 807,129 | 807,130 | u687214625 | cpp |
p02986 | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
using namespace std;
const int maxn = 2e5 + 15;
int n, Q, a, b, c, d, cnt, head[maxn];
struct edge {
int to, nxt, col, len;
} e[maxn << 1];
pii p[maxn];
inline void add(int u, int v, int c, int d) {
e[++cnt] = (edge){v, head[u], c, d};
head[u] = cnt;
}
int fa[maxn], sz[maxn], son[maxn], dep[maxn];
void dfs1(int x, int pa, int depth) {
dep[x] = depth;
fa[x] = pa;
int num = 0;
for (int i = head[x]; i > 0; i = e[i].nxt) {
int v = e[i].to;
if (v == pa)
continue;
dfs1(v, x, depth + 1);
sz[x] += sz[v];
p[v] = pii(e[i].col, e[i].len);
if (sz[v] > num)
num = sz[v], son[x] = v;
}
sz[x]++;
}
int id[maxn], top[maxn], rk[maxn], tot;
void dfs2(int x, int t) {
top[x] = t;
id[x] = ++tot;
rk[tot] = x;
if (!son[x])
return;
dfs2(son[x], t);
for (int i = head[x]; i > 0; i = e[i].nxt) {
int v = e[i].to;
if (v == son[x] || v == fa[x])
continue;
dfs2(v, v);
}
}
struct tree {
int l, r, num, sum;
} T[maxn * 160];
int root[maxn], k, x, y, u, v;
void build(int l, int r, int &x, int y, int c, int d) {
T[++k] = T[y];
T[k].num++;
T[k].sum += d;
x = k;
if (l == r)
return;
int mid = (l + r) >> 1;
if (c > mid)
build(mid + 1, r, T[x].r, T[y].r, c, d);
else
build(l, mid, T[x].l, T[y].l, c, d);
}
void query(int l, int r, int L, int R, int ql, int qr, int &num, int &sum) {
if (l > R || r < L)
return;
if (l >= L && r <= R) {
num += T[qr].num - T[ql].num;
sum += T[qr].sum - T[ql].sum;
return;
}
int mid = (l + r) >> 1;
query(l, mid, L, R, T[ql].l, T[qr].l, num, sum);
query(mid + 1, r, L, R, T[ql].r, T[qr].r, num, sum);
}
int solve(int u, int v, int x, int y) {
int res = 0, num = 0, sum = 0;
while (top[u] != top[v]) {
if (dep[top[u]] < dep[top[v]])
swap(u, v);
query(0, n, x, x, root[id[top[u]] - 1], root[id[u]], num, sum);
res += T[root[id[u]]].sum - T[root[id[top[u]] - 1]].sum;
u = fa[top[u]];
}
if (dep[u] > dep[v])
swap(u, v);
query(0, n, x, x, root[id[u] - 1], root[id[v]], num, sum);
res += T[root[id[v]]].sum - T[root[id[u] - 1]].sum;
return res - sum + num * y;
}
int main() {
scanf("%d %d", &n, &Q);
for (int i = 1; i < n; ++i) {
scanf("%d %d %d %d", &a, &b, &c, &d);
add(a, b, c, d);
add(b, a, c, d);
}
dfs1(1, 0, 1);
dfs2(1, 1);
for (int i = 1; i <= n; ++i)
build(0, n, root[i], root[i - 1], p[rk[i]].fi, p[rk[i]].se);
while (Q--) {
scanf("%d %d %d %d", &x, &y, &u, &v);
printf("%d\n", solve(u, v, x, y));
}
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
using namespace std;
const int maxn = 2e5 + 15;
int n, Q, a, b, c, d, cnt, head[maxn];
struct edge {
int to, nxt, col, len;
} e[maxn << 1];
pii p[maxn];
inline void add(int u, int v, int c, int d) {
e[++cnt] = (edge){v, head[u], c, d};
head[u] = cnt;
}
int fa[maxn], sz[maxn], son[maxn], dep[maxn];
void dfs1(int x, int pa, int depth) {
dep[x] = depth;
fa[x] = pa;
int num = 0;
for (int i = head[x]; i > 0; i = e[i].nxt) {
int v = e[i].to;
if (v == pa)
continue;
dfs1(v, x, depth + 1);
sz[x] += sz[v];
p[v] = pii(e[i].col, e[i].len);
if (sz[v] > num)
num = sz[v], son[x] = v;
}
sz[x]++;
}
int id[maxn], top[maxn], rk[maxn], tot;
void dfs2(int x, int t) {
top[x] = t;
id[x] = ++tot;
rk[tot] = x;
if (!son[x])
return;
dfs2(son[x], t);
for (int i = head[x]; i > 0; i = e[i].nxt) {
int v = e[i].to;
if (v == son[x] || v == fa[x])
continue;
dfs2(v, v);
}
}
struct tree {
int l, r, num, sum;
} T[maxn * 160];
int root[maxn], k, x, y, u, v;
void build(int l, int r, int &x, int y, int c, int d) {
T[++k] = T[y];
T[k].num++;
T[k].sum += d;
x = k;
if (l == r)
return;
int mid = (l + r) >> 1;
if (c > mid)
build(mid + 1, r, T[x].r, T[y].r, c, d);
else
build(l, mid, T[x].l, T[y].l, c, d);
}
void query(int l, int r, int L, int R, int ql, int qr, int &num, int &sum) {
if (l > R || r < L)
return;
if (l >= L && r <= R) {
num += T[qr].num - T[ql].num;
sum += T[qr].sum - T[ql].sum;
return;
}
int mid = (l + r) >> 1;
query(l, mid, L, R, T[ql].l, T[qr].l, num, sum);
query(mid + 1, r, L, R, T[ql].r, T[qr].r, num, sum);
}
int solve(int u, int v, int x, int y) {
int res = 0, num = 0, sum = 0;
while (top[u] != top[v]) {
if (dep[top[u]] < dep[top[v]])
swap(u, v);
query(0, n, x, x, root[id[top[u]] - 1], root[id[u]], num, sum);
res += T[root[id[u]]].sum - T[root[id[top[u]] - 1]].sum;
u = fa[top[u]];
}
if (id[u] > id[v])
swap(u, v);
query(0, n, x, x, root[id[u]], root[id[v]], num, sum);
res += T[root[id[v]]].sum - T[root[id[u]]].sum;
return res - sum + num * y;
}
int main() {
scanf("%d %d", &n, &Q);
for (int i = 1; i < n; ++i) {
scanf("%d %d %d %d", &a, &b, &c, &d);
add(a, b, c, d);
add(b, a, c, d);
}
dfs1(1, 0, 1);
dfs2(1, 1);
for (int i = 1; i <= n; ++i)
build(0, n, root[i], root[i - 1], p[rk[i]].fi, p[rk[i]].se);
while (Q--) {
scanf("%d %d %d %d", &x, &y, &u, &v);
printf("%d\n", solve(u, v, x, y));
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 807,157 | 807,158 | u593546783 | cpp |
p02986 | #include <bits/stdc++.h>
using namespace std;
#define SZ(a) (int)(a.size())
#define PB push_back
#define LL long long
#define X first
#define Y second
const int MAX = 100005;
const int MAGIC = 100000;
vector<vector<pair<int, pair<int, int>>>> g(MAX);
int timer;
int cnt[MAX];
int tin[MAX];
int tout[MAX];
int D[MAX];
int dp[MAX][18];
pair<int, int> d[400][MAX];
int idx[MAX];
vector<vector<pair<pair<int, int>, int>>> edges(MAX);
bool isIn(int u, int v) { return tin[u] >= tin[v] && tout[u] <= tout[v]; }
int lca(int u, int v) {
if (isIn(u, v))
return v;
if (isIn(v, u))
return u;
for (int i = 17; i >= 0; i--) {
if (!isIn(dp[u][i], v)) {
u = dp[u][i];
}
}
return dp[u][0];
}
void dfs(int u, int p = -1) {
tin[u] = timer++;
for (auto v : g[u]) {
if (v.X == p)
continue;
D[v.X] = D[u] + v.Y.X;
dp[v.X][0] = u;
for (int i = 1; i <= 17; i++)
dp[v.X][i] = dp[dp[v.X][i - 1]][i - 1];
dfs(v.X, u);
}
tout[u] = timer++;
}
void dfs2(int u, int i, int idx, int par = -1) {
for (auto v : g[u]) {
if (v.X == par)
continue;
d[idx][v.X] = {d[idx][u].X + (v.Y.Y == i),
d[idx][u].Y + (v.Y.Y == i) * v.Y.X};
dfs2(v.X, i, idx, u);
}
}
int main() {
int n, q;
cin >> n >> q;
for (int i = 1; i < n; i++) {
int u, v, c, d;
cin >> u >> v >> c >> d;
u--;
v--;
g[u].PB({v, {d, c}});
g[v].PB({u, {d, c}});
edges[c].PB({{u, v}, d});
}
dfs(0);
memset(idx, -1, sizeof idx);
int ptr = 0;
for (int i = 1; i < n; i++)
if (SZ(edges[i]) >= MAGIC) {
idx[i] = ptr++;
dfs2(0, i, idx[i]);
}
while (q--) {
int x, y, u, v;
cin >> x >> y >> u >> v;
u--;
v--;
int LCA = lca(u, v);
if (idx[x] == -1) // small
{
int ans = D[u] + D[v] - 2 * D[LCA];
for (auto e : edges[x]) {
if (isIn(e.X.X, LCA) && isIn(e.X.Y, LCA) &&
(isIn(u, e.X.X) && isIn(u, e.X.Y) ||
isIn(v, e.X.X) && isIn(v, e.X.Y))) {
ans -= e.Y;
ans += y;
}
}
cout << ans << endl;
} else {
int ans = D[u] + D[v] - 2 * D[LCA];
// cerr << ans << endl;
ans -= d[idx[x]][u].Y + d[idx[x]][v].Y - 2 * d[idx[x]][LCA].Y;
// cerr << ans << endl;
ans += y * (d[idx[x]][u].X + d[idx[x]][v].X - 2 * d[idx[x]][LCA].X);
cout << ans << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define SZ(a) (int)(a.size())
#define PB push_back
#define LL long long
#define X first
#define Y second
const int MAX = 100005;
const int MAGIC = 350;
vector<vector<pair<int, pair<int, int>>>> g(MAX);
int timer;
int cnt[MAX];
int tin[MAX];
int tout[MAX];
int D[MAX];
int dp[MAX][18];
pair<int, int> d[400][MAX];
int idx[MAX];
vector<vector<pair<pair<int, int>, int>>> edges(MAX);
bool isIn(int u, int v) { return tin[u] >= tin[v] && tout[u] <= tout[v]; }
int lca(int u, int v) {
if (isIn(u, v))
return v;
if (isIn(v, u))
return u;
for (int i = 17; i >= 0; i--) {
if (!isIn(v, dp[u][i])) {
u = dp[u][i];
}
}
return dp[u][0];
}
void dfs(int u, int p = -1) {
tin[u] = timer++;
for (auto v : g[u]) {
if (v.X == p)
continue;
D[v.X] = D[u] + v.Y.X;
dp[v.X][0] = u;
for (int i = 1; i <= 17; i++)
dp[v.X][i] = dp[dp[v.X][i - 1]][i - 1];
dfs(v.X, u);
}
tout[u] = timer++;
}
void dfs2(int u, int i, int idx, int par = -1) {
for (auto v : g[u]) {
if (v.X == par)
continue;
d[idx][v.X] = {d[idx][u].X + (v.Y.Y == i),
d[idx][u].Y + (v.Y.Y == i) * v.Y.X};
dfs2(v.X, i, idx, u);
}
}
int main() {
int n, q;
cin >> n >> q;
for (int i = 1; i < n; i++) {
int u, v, c, d;
cin >> u >> v >> c >> d;
u--;
v--;
g[u].PB({v, {d, c}});
g[v].PB({u, {d, c}});
edges[c].PB({{u, v}, d});
}
dfs(0);
memset(idx, -1, sizeof idx);
int ptr = 0;
for (int i = 1; i < n; i++)
if (SZ(edges[i]) >= MAGIC) {
idx[i] = ptr++;
dfs2(0, i, idx[i]);
}
while (q--) {
int x, y, u, v;
cin >> x >> y >> u >> v;
u--;
v--;
int LCA = lca(u, v);
if (idx[x] == -1) // small
{
int ans = D[u] + D[v] - 2 * D[LCA];
for (auto e : edges[x]) {
if (isIn(e.X.X, LCA) && isIn(e.X.Y, LCA) &&
(isIn(u, e.X.X) && isIn(u, e.X.Y) ||
isIn(v, e.X.X) && isIn(v, e.X.Y))) {
ans -= e.Y;
ans += y;
}
}
cout << ans << endl;
} else {
int ans = D[u] + D[v] - 2 * D[LCA];
// cerr << ans << endl;
ans -= d[idx[x]][u].Y + d[idx[x]][v].Y - 2 * d[idx[x]][LCA].Y;
// cerr << ans << endl;
ans += y * (d[idx[x]][u].X + d[idx[x]][v].X - 2 * d[idx[x]][LCA].X);
cout << ans << endl;
}
}
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.add",
"call.arguments.change"
] | 807,182 | 807,183 | u804093140 | cpp |
p02986 | #include <bits/stdc++.h>
using namespace std;
#define SZ(a) (int)(a.size())
#define PB push_back
#define LL long long
#define X first
#define Y second
const int MAX = 100005;
const int MAGIC = 350;
vector<vector<pair<int, pair<int, int>>>> g(MAX);
int timer;
int cnt[MAX];
int tin[MAX];
int tout[MAX];
int D[MAX];
int dp[MAX][18];
pair<int, int> d[400][MAX];
int idx[MAX];
vector<vector<pair<pair<int, int>, int>>> edges(MAX);
bool isIn(int u, int v) { return tin[u] >= tin[v] && tout[u] <= tout[v]; }
int lca(int u, int v) {
if (isIn(u, v))
return v;
if (isIn(v, u))
return u;
for (int i = 17; i >= 0; i--) {
if (!isIn(dp[u][i], v)) {
u = dp[u][i];
}
}
return dp[u][0];
}
void dfs(int u, int p = -1) {
tin[u] = timer++;
for (auto v : g[u]) {
if (v.X == p)
continue;
D[v.X] = D[u] + v.Y.X;
dp[v.X][0] = u;
for (int i = 1; i <= 17; i++)
dp[v.X][i] = dp[dp[v.X][i - 1]][i - 1];
dfs(v.X, u);
}
tout[u] = timer++;
}
void dfs2(int u, int i, int idx, int par = -1) {
for (auto v : g[u]) {
if (v.X == par)
continue;
d[idx][v.X] = {d[idx][u].X + (v.Y.Y == i),
d[idx][u].Y + (v.Y.Y == i) * v.Y.X};
dfs2(v.X, i, idx, u);
}
}
int main() {
int n, q;
cin >> n >> q;
for (int i = 1; i < n; i++) {
int u, v, c, d;
cin >> u >> v >> c >> d;
u--;
v--;
g[u].PB({v, {d, c}});
g[v].PB({u, {d, c}});
edges[c].PB({{u, v}, d});
}
dfs(0);
memset(idx, -1, sizeof idx);
int ptr = 0;
for (int i = 1; i < n; i++)
if (SZ(edges[i]) >= MAGIC) {
idx[i] = ptr++;
dfs2(0, i, idx[i]);
}
while (q--) {
int x, y, u, v;
cin >> x >> y >> u >> v;
u--;
v--;
int LCA = lca(u, v);
if (idx[x] == -1) // small
{
int ans = D[u] + D[v] - 2 * D[LCA];
for (auto e : edges[x]) {
if (isIn(e.X.X, LCA) && isIn(e.X.Y, LCA) &&
(isIn(u, e.X.X) && isIn(u, e.X.Y) ||
isIn(v, e.X.X) && isIn(v, e.X.Y))) {
ans -= e.Y;
ans += y;
}
}
cout << ans << endl;
} else {
int ans = D[u] + D[v] - 2 * D[LCA];
// cerr << ans << endl;
ans -= d[idx[x]][u].Y + d[idx[x]][v].Y - 2 * d[idx[x]][LCA].Y;
// cerr << ans << endl;
ans += y * (d[idx[x]][u].X + d[idx[x]][v].X - 2 * d[idx[x]][LCA].X);
cout << ans << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define SZ(a) (int)(a.size())
#define PB push_back
#define LL long long
#define X first
#define Y second
const int MAX = 100005;
const int MAGIC = 350;
vector<vector<pair<int, pair<int, int>>>> g(MAX);
int timer;
int cnt[MAX];
int tin[MAX];
int tout[MAX];
int D[MAX];
int dp[MAX][18];
pair<int, int> d[400][MAX];
int idx[MAX];
vector<vector<pair<pair<int, int>, int>>> edges(MAX);
bool isIn(int u, int v) { return tin[u] >= tin[v] && tout[u] <= tout[v]; }
int lca(int u, int v) {
if (isIn(u, v))
return v;
if (isIn(v, u))
return u;
for (int i = 17; i >= 0; i--) {
if (!isIn(v, dp[u][i])) {
u = dp[u][i];
}
}
return dp[u][0];
}
void dfs(int u, int p = -1) {
tin[u] = timer++;
for (auto v : g[u]) {
if (v.X == p)
continue;
D[v.X] = D[u] + v.Y.X;
dp[v.X][0] = u;
for (int i = 1; i <= 17; i++)
dp[v.X][i] = dp[dp[v.X][i - 1]][i - 1];
dfs(v.X, u);
}
tout[u] = timer++;
}
void dfs2(int u, int i, int idx, int par = -1) {
for (auto v : g[u]) {
if (v.X == par)
continue;
d[idx][v.X] = {d[idx][u].X + (v.Y.Y == i),
d[idx][u].Y + (v.Y.Y == i) * v.Y.X};
dfs2(v.X, i, idx, u);
}
}
int main() {
int n, q;
cin >> n >> q;
for (int i = 1; i < n; i++) {
int u, v, c, d;
cin >> u >> v >> c >> d;
u--;
v--;
g[u].PB({v, {d, c}});
g[v].PB({u, {d, c}});
edges[c].PB({{u, v}, d});
}
dfs(0);
memset(idx, -1, sizeof idx);
int ptr = 0;
for (int i = 1; i < n; i++)
if (SZ(edges[i]) >= MAGIC) {
idx[i] = ptr++;
dfs2(0, i, idx[i]);
}
while (q--) {
int x, y, u, v;
cin >> x >> y >> u >> v;
u--;
v--;
int LCA = lca(u, v);
if (idx[x] == -1) // small
{
int ans = D[u] + D[v] - 2 * D[LCA];
for (auto e : edges[x]) {
if (isIn(e.X.X, LCA) && isIn(e.X.Y, LCA) &&
(isIn(u, e.X.X) && isIn(u, e.X.Y) ||
isIn(v, e.X.X) && isIn(v, e.X.Y))) {
ans -= e.Y;
ans += y;
}
}
cout << ans << endl;
} else {
int ans = D[u] + D[v] - 2 * D[LCA];
// cerr << ans << endl;
ans -= d[idx[x]][u].Y + d[idx[x]][v].Y - 2 * d[idx[x]][LCA].Y;
// cerr << ans << endl;
ans += y * (d[idx[x]][u].X + d[idx[x]][v].X - 2 * d[idx[x]][LCA].X);
cout << ans << endl;
}
}
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.add",
"call.arguments.change"
] | 807,184 | 807,183 | u804093140 | cpp |
p02986 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
#define MOD (ll)(1e9 + 7)
ll N, Q;
vector<pair<ll, pll>> abv[101010];
ll d[101010];
ll P[101010][40];
ll e[101010][2];
vector<pair<ll, pll>> Cdb[101010];
ll len[202020];
ll Fa[101010];
ll i, j, k, ans;
void Init(ll a, ll p, ll &q) {
P[a][0] = p;
d[a] = d[p] + 1;
ll i = 0;
fornum(i, 0, abv[a].size()) {
if (abv[a][i].first == p)
continue;
ll bb = abv[a][i].second.first;
e[abv[a][i].first][0] = ++q;
Cdb[bb].push_back({q,
{Cdb[bb][Cdb[bb].size() - 1].second.first + 1,
Cdb[bb][Cdb[bb].size() - 1].second.second +
abv[a][i].second.second}});
// printf("%lld:%lld %lld %lld\n", bb,q, Cdb[bb][Cdb[bb].size() -
// 1].second.first, Cdb[bb][Cdb[bb].size() - 1].second.second);
len[q] = len[q - 1] + abv[a][i].second.second;
Init(abv[a][i].first, a, q);
e[abv[a][i].first][1] = ++q;
Cdb[bb].push_back({q,
{Cdb[bb][Cdb[bb].size() - 1].second.first - 1,
Cdb[bb][Cdb[bb].size() - 1].second.second -
abv[a][i].second.second}});
len[q] = len[q - 1] - abv[a][i].second.second;
}
}
ll par(ll a, ll n) {
ll i = 0;
while (n) {
if (n & 1)
a = P[a][i];
i++;
n >>= 1;
}
return a;
}
ll cpar(ll a, ll b) {
if (d[a] < d[b])
b = par(b, d[b] - d[a]);
else
a = par(a, d[a] - d[b]);
if (a == b)
return a;
for (ll i = 29; i >= 0; i--) {
ll pa = par(a, 1 << i);
ll pb = par(b, 1 << i);
if (pa != pb) {
a = pa;
b = pb;
}
}
return P[a][0];
}
ll clen(ll a, ll x, ll y) {
ll l = 0, r = Cdb[x].size() - 1;
while (l < r) {
ll c = (l + r + 1) / 2;
if (Cdb[x][c].first <= e[a][0]) {
l = c;
} else {
r = c - 1;
}
}
// printf("%lld,%lld,%llda\n", x, a, l);
return len[e[a][0]] + Cdb[x][l].second.first * y - Cdb[x][l].second.second;
}
ll solve(ll x, ll y, ll u, ll v) {
return clen(u, x, y) + clen(v, x, y) - 2 * clen(par(u, v), x, y);
}
int main() {
scanf("%lld%lld", &N, &Q);
fornum(i, 1, N) {
ll a, b, c, d;
scanf("%lld%lld%lld%lld", &a, &b, &c, &d);
abv[a].push_back({b, {c, d}});
abv[b].push_back({a, {c, d}});
}
fornum(i, 0, 101010) { Cdb[i].push_back({0, {0, 0}}); }
Init(1, 0, i = 0);
// fornum(i,0,N){
// printf("%lld:%lldb\n", e[i + 1][0], e[i + 1][1]);
//}
fornum(i, 1, 30) {
fornum(j, 0, N) { P[j + 1][i] = P[P[j + 1][i - 1]][i - 1]; }
}
while (Q--) {
ll x, y, u, v;
scanf("%lld%lld%lld%lld", &x, &y, &u, &v);
// printf("%lld ", cpar(u, v));
printf("%lld\n", solve(x, y, u, v));
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
#define MOD (ll)(1e9 + 7)
ll N, Q;
vector<pair<ll, pll>> abv[101010];
ll d[101010];
ll P[101010][40];
ll e[101010][2];
vector<pair<ll, pll>> Cdb[101010];
ll len[202020];
ll Fa[101010];
ll i, j, k, ans;
void Init(ll a, ll p, ll &q) {
P[a][0] = p;
d[a] = d[p] + 1;
ll i = 0;
fornum(i, 0, abv[a].size()) {
if (abv[a][i].first == p)
continue;
ll bb = abv[a][i].second.first;
e[abv[a][i].first][0] = ++q;
Cdb[bb].push_back({q,
{Cdb[bb][Cdb[bb].size() - 1].second.first + 1,
Cdb[bb][Cdb[bb].size() - 1].second.second +
abv[a][i].second.second}});
// printf("%lld:%lld %lld %lld\n", bb,q, Cdb[bb][Cdb[bb].size() -
// 1].second.first, Cdb[bb][Cdb[bb].size() - 1].second.second);
len[q] = len[q - 1] + abv[a][i].second.second;
Init(abv[a][i].first, a, q);
e[abv[a][i].first][1] = ++q;
Cdb[bb].push_back({q,
{Cdb[bb][Cdb[bb].size() - 1].second.first - 1,
Cdb[bb][Cdb[bb].size() - 1].second.second -
abv[a][i].second.second}});
len[q] = len[q - 1] - abv[a][i].second.second;
}
}
ll par(ll a, ll n) {
ll i = 0;
while (n) {
if (n & 1)
a = P[a][i];
i++;
n >>= 1;
}
return a;
}
ll cpar(ll a, ll b) {
if (d[a] < d[b])
b = par(b, d[b] - d[a]);
else
a = par(a, d[a] - d[b]);
if (a == b)
return a;
for (ll i = 29; i >= 0; i--) {
ll pa = par(a, 1 << i);
ll pb = par(b, 1 << i);
if (pa != pb) {
a = pa;
b = pb;
}
}
return P[a][0];
}
ll clen(ll a, ll x, ll y) {
ll l = 0, r = Cdb[x].size() - 1;
while (l < r) {
ll c = (l + r + 1) / 2;
if (Cdb[x][c].first <= e[a][0]) {
l = c;
} else {
r = c - 1;
}
}
// printf("%lld,%lld,%llda\n", x, a, l);
return len[e[a][0]] + Cdb[x][l].second.first * y - Cdb[x][l].second.second;
}
ll solve(ll x, ll y, ll u, ll v) {
return clen(u, x, y) + clen(v, x, y) - 2 * clen(cpar(u, v), x, y);
}
int main() {
scanf("%lld%lld", &N, &Q);
fornum(i, 1, N) {
ll a, b, c, d;
scanf("%lld%lld%lld%lld", &a, &b, &c, &d);
abv[a].push_back({b, {c, d}});
abv[b].push_back({a, {c, d}});
}
fornum(i, 0, 101010) { Cdb[i].push_back({0, {0, 0}}); }
Init(1, 0, i = 0);
// fornum(i,0,N){
// printf("%lld:%lldb\n", e[i + 1][0], e[i + 1][1]);
//}
fornum(i, 1, 30) {
fornum(j, 0, N) { P[j + 1][i] = P[P[j + 1][i - 1]][i - 1]; }
}
while (Q--) {
ll x, y, u, v;
scanf("%lld%lld%lld%lld", &x, &y, &u, &v);
// printf("%lld ", cpar(u, v));
printf("%lld\n", solve(x, y, u, v));
}
return 0;
} | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 807,197 | 807,198 | u259396003 | cpp |
p02986 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
#define MOD (ll)(1e9 + 7)
ll N, Q;
vector<pair<ll, pll>> abv[101010];
ll d[101010];
ll P[101010][40];
ll e[101010][2];
vector<pair<ll, pll>> Cdb[101010];
ll len[202020];
ll Fa[101010];
ll i, j, k, ans;
void Init(ll a, ll p, ll &q) {
P[a][0] = p;
d[a] = d[p] + 1;
ll i = 0;
fornum(i, 0, abv[a].size()) {
if (abv[a][i].first == p)
continue;
ll bb = abv[a][i].second.first;
e[abv[a][i].first][0] = ++q;
Cdb[bb].push_back({q,
{Cdb[bb][Cdb[bb].size() - 1].second.first + 1,
Cdb[bb][Cdb[bb].size() - 1].second.second +
abv[a][i].second.second}});
// printf("%lld:%lld %lld %lld\n", bb,q, Cdb[bb][Cdb[bb].size() -
// 1].second.first, Cdb[bb][Cdb[bb].size() - 1].second.second);
len[q] = len[q - 1] + abv[a][i].second.second;
Init(abv[a][i].first, a, q);
e[abv[a][i].first][1] = ++q;
Cdb[bb].push_back({q,
{Cdb[bb][Cdb[bb].size() - 1].second.first - 1,
Cdb[bb][Cdb[bb].size() - 1].second.second -
abv[a][i].second.second}});
len[q] = len[q - 1] - abv[a][i].second.second;
}
}
ll par(ll a, ll n) {
ll i = 0;
while (n) {
if (n & 1)
a = P[a][i];
i++;
n >>= 1;
}
return a;
}
ll cpar(ll a, ll b) {
if (d[a] < d[b])
b = par(b, d[b] - d[a]);
else
a = par(a, d[a] - d[b]);
if (a == b)
return a;
for (ll i = 29; i >= 0; i--) {
ll pa = par(a, 1 << i);
ll pb = par(b, 1 << i);
if (pa != pb) {
a = pa;
b = pb;
}
}
return P[a][0];
}
ll clen(ll a, ll x, ll y) {
ll l = 0, r = Cdb[x].size() - 1;
while (l < r) {
ll c = (l + r + 1) / 2;
if (Cdb[x][c].first <= e[a][0]) {
l = c;
} else {
r = c - 1;
}
}
// printf("%lld,%lld,%llda\n", x, a, l);
return len[e[a][0]] + Cdb[x][l].second.first * y - Cdb[x][l].second.second;
}
ll solve(ll x, ll y, ll u, ll v) {
return clen(u, x, y) + clen(v, x, y) - 2 * clen(par(u, v), x, y);
}
int main() {
scanf("%lld%lld", &N, &Q);
fornum(i, 1, N) {
ll a, b, c, d;
scanf("%lld%lld%lld%lld", &a, &b, &c, &d);
abv[a].push_back({b, {c, d}});
abv[b].push_back({a, {c, d}});
}
fornum(i, 0, 101010) { Cdb[i].push_back({0, {0, 0}}); }
Init(1, 0, i = 0);
// fornum(i,0,N){
// printf("%lld:%lldb\n", e[i + 1][0], e[i + 1][1]);
//}
fornum(i, 1, 30) {
fornum(j, 0, N) { P[j][i] = P[P[j][i - 1]][i - 1]; }
}
while (Q--) {
ll x, y, u, v;
scanf("%lld%lld%lld%lld", &x, &y, &u, &v);
// printf("%lld ", cpar(u, v));
printf("%lld\n", solve(x, y, u, v));
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
#define MOD (ll)(1e9 + 7)
ll N, Q;
vector<pair<ll, pll>> abv[101010];
ll d[101010];
ll P[101010][40];
ll e[101010][2];
vector<pair<ll, pll>> Cdb[101010];
ll len[202020];
ll Fa[101010];
ll i, j, k, ans;
void Init(ll a, ll p, ll &q) {
P[a][0] = p;
d[a] = d[p] + 1;
ll i = 0;
fornum(i, 0, abv[a].size()) {
if (abv[a][i].first == p)
continue;
ll bb = abv[a][i].second.first;
e[abv[a][i].first][0] = ++q;
Cdb[bb].push_back({q,
{Cdb[bb][Cdb[bb].size() - 1].second.first + 1,
Cdb[bb][Cdb[bb].size() - 1].second.second +
abv[a][i].second.second}});
// printf("%lld:%lld %lld %lld\n", bb,q, Cdb[bb][Cdb[bb].size() -
// 1].second.first, Cdb[bb][Cdb[bb].size() - 1].second.second);
len[q] = len[q - 1] + abv[a][i].second.second;
Init(abv[a][i].first, a, q);
e[abv[a][i].first][1] = ++q;
Cdb[bb].push_back({q,
{Cdb[bb][Cdb[bb].size() - 1].second.first - 1,
Cdb[bb][Cdb[bb].size() - 1].second.second -
abv[a][i].second.second}});
len[q] = len[q - 1] - abv[a][i].second.second;
}
}
ll par(ll a, ll n) {
ll i = 0;
while (n) {
if (n & 1)
a = P[a][i];
i++;
n >>= 1;
}
return a;
}
ll cpar(ll a, ll b) {
if (d[a] < d[b])
b = par(b, d[b] - d[a]);
else
a = par(a, d[a] - d[b]);
if (a == b)
return a;
for (ll i = 29; i >= 0; i--) {
ll pa = par(a, 1 << i);
ll pb = par(b, 1 << i);
if (pa != pb) {
a = pa;
b = pb;
}
}
return P[a][0];
}
ll clen(ll a, ll x, ll y) {
ll l = 0, r = Cdb[x].size() - 1;
while (l < r) {
ll c = (l + r + 1) / 2;
if (Cdb[x][c].first <= e[a][0]) {
l = c;
} else {
r = c - 1;
}
}
// printf("%lld,%lld,%llda\n", x, a, l);
return len[e[a][0]] + Cdb[x][l].second.first * y - Cdb[x][l].second.second;
}
ll solve(ll x, ll y, ll u, ll v) {
return clen(u, x, y) + clen(v, x, y) - 2 * clen(cpar(u, v), x, y);
}
int main() {
scanf("%lld%lld", &N, &Q);
fornum(i, 1, N) {
ll a, b, c, d;
scanf("%lld%lld%lld%lld", &a, &b, &c, &d);
abv[a].push_back({b, {c, d}});
abv[b].push_back({a, {c, d}});
}
fornum(i, 0, 101010) { Cdb[i].push_back({0, {0, 0}}); }
Init(1, 0, i = 0);
// fornum(i,0,N){
// printf("%lld:%lldb\n", e[i + 1][0], e[i + 1][1]);
//}
fornum(i, 1, 30) {
fornum(j, 0, N) { P[j + 1][i] = P[P[j + 1][i - 1]][i - 1]; }
}
while (Q--) {
ll x, y, u, v;
scanf("%lld%lld%lld%lld", &x, &y, &u, &v);
// printf("%lld ", cpar(u, v));
printf("%lld\n", solve(x, y, u, v));
}
return 0;
} | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"assignment.change"
] | 807,199 | 807,198 | u259396003 | cpp |
p02986 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int lg = 21;
int n, q;
int d[100100];
int up[100100][22];
int col[100100];
ll cost[100100];
ll ans[100100];
int cnt[100100];
ll col_dist[100100];
vector<int> adj[100100];
vector<ll> weight[100100];
vector<int> color[100100];
vector<int> query[100100];
int lca(int u, int v) {
if (d[u] > d[v])
swap(u, v);
int delta = d[v] - d[u];
for (int i = 0; i <= lg; i++) {
if (delta & (1 << i)) {
v = up[v][i];
}
}
if (u == v)
return u;
for (int i = lg; i >= 0; i--) {
if (up[u][i] != up[v][i]) {
u = up[u][i];
v = up[v][i];
}
}
return up[u][0];
}
void dfs(int v, int p, int depth) {
d[v] = depth;
up[v][0] = p;
for (int i = 0; i < (int)adj[v].size(); i++) {
if (adj[v][i] == p)
continue;
dfs(adj[v][i], v, depth + 1);
}
}
void solve(int v, int p, ll dist) {
for (int idx : query[v]) {
ll mul = 1;
if (idx < 0) {
mul = -2;
idx = -idx;
}
ans[idx] += mul * (cnt[col[idx]] * cost[idx] - col_dist[col[idx]] + dist);
}
for (int i = 0; i < (int)adj[v].size(); i++) {
if (adj[v][i] == p)
continue;
cnt[color[v][i]]++;
col_dist[color[v][i]] += weight[v][i];
solve(adj[v][i], v, dist + weight[v][i]);
cnt[color[v][i]]--;
col_dist[color[v][i]] -= weight[v][i];
}
}
int main() {
scanf("%d %d", &n, &q);
for (int i = 0; i < n - 1; i++) {
int u, v, c;
ll w;
scanf("%d %d %d %lld", &u, &v, &c, &w);
adj[u].push_back(v);
adj[v].push_back(u);
color[u].push_back(c);
color[v].push_back(c);
weight[u].push_back(w);
weight[v].push_back(w);
}
dfs(1, 0, 0);
for (int j = 1; j <= lg; j++) {
for (int i = 1; i <= n; i++) {
up[i][j] = up[up[i - 1][j - 1]][j - 1];
}
}
for (int i = 0; i < q; i++) {
int u, v;
scanf("%d %lld %d %d", &col[i], &cost[i], &u, &v);
query[u].push_back(i);
query[v].push_back(i);
query[lca(u, v)].push_back(-i);
}
solve(1, 0, 0);
for (int i = 0; i < q; i++) {
printf("%lld\n", ans[i]);
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int lg = 21;
int n, q;
int d[100100];
int up[100100][22];
int col[100100];
ll cost[100100];
ll ans[100100];
int cnt[100100];
ll col_dist[100100];
vector<int> adj[100100];
vector<ll> weight[100100];
vector<int> color[100100];
vector<int> query[100100];
int lca(int u, int v) {
if (d[u] > d[v])
swap(u, v);
int delta = d[v] - d[u];
for (int i = 0; i <= lg; i++) {
if (delta & (1 << i)) {
v = up[v][i];
}
}
if (u == v)
return u;
for (int i = lg; i >= 0; i--) {
if (up[u][i] != up[v][i]) {
u = up[u][i];
v = up[v][i];
}
}
return up[u][0];
}
void dfs(int v, int p, int depth) {
d[v] = depth;
up[v][0] = p;
for (int i = 0; i < (int)adj[v].size(); i++) {
if (adj[v][i] == p)
continue;
dfs(adj[v][i], v, depth + 1);
}
}
void solve(int v, int p, ll dist) {
for (int idx : query[v]) {
ll mul = 1;
if (idx < 0) {
mul = -2;
idx = -idx;
}
ans[idx] += mul * (cnt[col[idx]] * cost[idx] - col_dist[col[idx]] + dist);
}
for (int i = 0; i < (int)adj[v].size(); i++) {
if (adj[v][i] == p)
continue;
cnt[color[v][i]]++;
col_dist[color[v][i]] += weight[v][i];
solve(adj[v][i], v, dist + weight[v][i]);
cnt[color[v][i]]--;
col_dist[color[v][i]] -= weight[v][i];
}
}
int main() {
scanf("%d %d", &n, &q);
for (int i = 0; i < n - 1; i++) {
int u, v, c;
ll w;
scanf("%d %d %d %lld", &u, &v, &c, &w);
adj[u].push_back(v);
adj[v].push_back(u);
color[u].push_back(c);
color[v].push_back(c);
weight[u].push_back(w);
weight[v].push_back(w);
}
dfs(1, 0, 0);
for (int j = 1; j <= lg; j++) {
for (int i = 1; i <= n; i++) {
up[i][j] = up[up[i][j - 1]][j - 1];
}
}
for (int i = 1; i <= q; i++) {
int u, v;
scanf("%d %lld %d %d", &col[i], &cost[i], &u, &v);
query[u].push_back(i);
query[v].push_back(i);
query[lca(u, v)].push_back(-i);
// printf("LCA %d\n", lca(u, v));
}
solve(1, 0, 0);
for (int i = 1; i <= q; i++) {
printf("%lld\n", ans[i]);
}
} | [
"expression.operation.binary.remove",
"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"
] | 807,200 | 807,201 | u313597494 | cpp |
p02996 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<pair<int, int>> v;
cin >> n;
for (int x, y, i = 0; i < n; i++) {
cin >> x >> y;
v.push_back({y, x});
}
sort(v.begin(), v.end());
int cur = 0;
for (int i = 0; i < n; i++) {
cur += v[i].second;
if (cur > v[i].first) {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<pair<int, int>> v;
cin >> n;
for (int x, y, i = 0; i < n; i++) {
cin >> x >> y;
v.push_back({y, x});
}
sort(v.begin(), v.end());
int cur = 0;
for (int i = 0; i < n; i++) {
cur += v[i].second;
if (cur > v[i].first) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,236 | 807,237 | u025394570 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<pair<long long, long long>> ba(n);
for (int i = 0; i < n; i++) {
long long a, b;
cin >> a >> b;
ba.at(i).first = b;
ba.at(i).second = a;
}
sort(ba.begin(), ba.end());
long long sum = 0;
for (int i = 0; i < n; i++) {
sum += ba.at(i).second;
if (ba.at(i).first > sum) {
cout << "No";
return 0;
}
}
cout << "Yes";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<pair<long long, long long>> ba(n);
for (int i = 0; i < n; i++) {
long long a, b;
cin >> a >> b;
ba.at(i).first = b;
ba.at(i).second = a;
}
sort(ba.begin(), ba.end());
long long sum = 0;
for (int i = 0; i < n; i++) {
sum += ba.at(i).second;
if (ba.at(i).first < sum) {
cout << "No";
return 0;
}
}
cout << "Yes";
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 807,240 | 807,239 | u431602218 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
int main() {
int N;
cin >> N;
vector<ll> A(N), B(N);
vector<P> BA(N);
REP(i, N) {
cin >> A[i] >> B[i];
BA.push_back(P(B[i], A[i]));
}
// ll sum = 0;
// ll limit_mx = 0;
// REP(i, N) {
// sum += A[i];
// limit_mx = max(limit_mx, B[i]);
// }
// if (limit_mx < sum) {
// cout << "No" << endl;
// return 0;
// }
sort(ALL(BA));
ll t = 0;
bool ok = true;
REP(i, N) {
t += BA[i].second;
if (BA[i].first < t)
ok = false;
}
cout << (ok ? "Yes" : "No") << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
int main() {
int N;
cin >> N;
vector<ll> A(N), B(N);
vector<P> BA;
REP(i, N) {
cin >> A[i] >> B[i];
BA.push_back(P(B[i], A[i]));
}
// ll sum = 0;
// ll limit_mx = 0;
// REP(i, N) {
// sum += A[i];
// limit_mx = max(limit_mx, B[i]);
// }
// if (limit_mx < sum) {
// cout << "No" << endl;
// return 0;
// }
sort(ALL(BA));
ll t = 0;
bool ok = true;
REP(i, N) {
t += BA[i].second;
if (BA[i].first < t)
ok = false;
}
cout << (ok ? "Yes" : "No") << endl;
return 0;
} | [] | 807,246 | 807,247 | u722397179 | cpp |
p02996 | #include <algorithm> //sort,reverse
#include <deque> //double_ended queue
#include <iostream>
#include <queue> //queue,priority queue
#include <string>
#include <utility> //pair
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
pair<long long int, long long int> work[n];
for (int i = 0; i < n; i++) {
cin >> work[i].second >> work[i].first;
}
sort(work, work + n);
long long int time = 0;
for (int i = 0; i < n; i++) {
time = time + work[i].second;
if (time > work[i].first + 1) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <algorithm> //sort,reverse
#include <deque> //double_ended queue
#include <iostream>
#include <queue> //queue,priority queue
#include <string>
#include <utility> //pair
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
pair<long long int, long long int> work[n];
for (int i = 0; i < n; i++) {
cin >> work[i].second >> work[i].first;
}
sort(work, work + n);
long long int time = 0;
for (int i = 0; i < n; i++) {
time = time + work[i].second;
if (time > work[i].first) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 807,264 | 807,265 | u992779443 | cpp |
p02996 | // Code by Nguyen Huu Lam
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MaxN = 1 + 1e5;
LL n, t;
pair<LL, LL> a[MaxN];
void InOut() {
#define TASK "ABC"
freopen(TASK ".inp", "r", stdin);
freopen(TASK ".out", "w", stdout);
}
int main() {
// InOut();
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i].second >> a[i].first;
sort(a, a + n);
for (int i = 0; i < n; ++i) {
t += a[i].second;
if (t > a[i].first) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
} | // Code by Nguyen Huu Lam
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MaxN = 1 + 2e5;
LL n, t;
pair<LL, LL> a[MaxN];
void InOut() {
#define TASK "ABC"
freopen(TASK ".inp", "r", stdin);
freopen(TASK ".out", "w", stdout);
}
int main() {
// InOut();
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i].second >> a[i].first;
sort(a, a + n);
for (int i = 0; i < n; ++i) {
t += a[i].second;
if (t > a[i].first) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,268 | 807,267 | u165945806 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<int, int>> p(N);
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
p.at(i) = make_pair(b, a); // b, a の順でペアにする
}
sort(p.begin(), p.end());
int time = 0;
int ss = 0;
int y = 0;
for (int i = 0; i < N; i++) {
int a, b;
tie(a, b) = p.at(i);
time += a;
ss += b;
if (time < ss) {
break;
y = 1;
}
}
if (y) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<int, int>> p(N);
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
p.at(i) = make_pair(b, a); // b, a の順でペアにする
}
sort(p.begin(), p.end());
int time = 0;
int ss = 0;
int y = 0;
for (int i = 0; i < N; i++) {
int a, b;
tie(a, b) = p.at(i);
time = a;
ss += b;
if (time < ss) {
y = 1;
break;
}
}
if (y) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| [
"assignment.value.change"
] | 807,271 | 807,272 | u103850114 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPRl(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < (int)n; i++)
#define FORl(i, m, n) for (ll i = m; i < (ll)n; i++)
#define ALL(v) v.begin(), v.end()
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
multimap<ll, ll> w;
REPl(i, n) {
ll a, b;
cin >> a >> b;
w.emplace(b, a);
}
ll t = 0;
bool ans = true;
for (auto ww = w.begin(); ww != w.end(); ++ww) {
if (ww->first < t) {
ans = false;
break;
}
t += ww->second;
}
cout << (ans ? "Yes" : "No") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPRl(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < (int)n; i++)
#define FORl(i, m, n) for (ll i = m; i < (ll)n; i++)
#define ALL(v) v.begin(), v.end()
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
multimap<ll, ll> w;
REPl(i, n) {
ll a, b;
cin >> a >> b;
w.emplace(b, a);
}
ll t = 0;
bool ans = true;
for (auto ww = w.begin(); ww != w.end(); ++ww) {
if (ww->first - ww->second < t) {
ans = false;
break;
}
t += ww->second;
}
cout << (ans ? "Yes" : "No") << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 807,273 | 807,274 | u882037708 | cpp |
p02996 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vsort(v) sort(v.begin(), v.end())
#define rv(v) reverse(v.begin(), v.end())
#define ll long long
using vll = vector<ll>;
using Graph = vii;
const ll MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<pair<ll, ll>> j(n);
rep(i, n) {
ll a, b;
cin >> a >> b;
j[i] = make_pair(b, a);
}
vsort(j);
ll t = 0;
bool flag = true;
rep(i, n) {
t += j[i].second;
if (t < j[i].first) {
flag = false;
break;
}
}
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vsort(v) sort(v.begin(), v.end())
#define rv(v) reverse(v.begin(), v.end())
#define ll long long
using vll = vector<ll>;
using Graph = vii;
const ll MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<pair<ll, ll>> j(n);
rep(i, n) {
ll a, b;
cin >> a >> b;
j[i] = make_pair(b, a);
}
vsort(j);
ll t = 0;
bool flag = true;
rep(i, n) {
t += j[i].second;
if (t > j[i].first) {
flag = false;
break;
}
}
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 807,292 | 807,293 | u654115433 | cpp |
p02996 | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define pi pair<int, int>
#define pl pair<long long, long long>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define en cout << endl //セミコロンつけろ
//#define MM 1000000000
//#define MOD MM+7
typedef long long ll;
const int MM = 1e9;
const int MOD = MM + 7;
const long double PI = acos(-1);
const long long INF = 1e15;
int dx[8] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[8] = {0, -1, 0, 1, -1, 1, 1, -1};
// 'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
template <typename T> T GCD(T u, T v) { return v ? GCD(v, u % v) : u; }
template <typename T> T LCM(T x, T y) {
T gc = GCD(x, y);
return x * y / gc;
}
struct edge {
ll to, cost;
};
/*
const int COM_MAX = 500500;
long long fac[COM_MAX],finv[COM_MAX],inv[COM_MAX];
void init(){
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i = 2; i < COM_MAX; i++){
fac[i] = fac[i-1]*i%MOD;
inv[i] = MOD - inv[MOD%i]*(MOD/i)%MOD;
finv[i] = finv[i-1]*inv[i]%MOD;
}
}
long long COM(int n,int k){
if(n < k || n < 0 || k < 0) return 0;
return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;
}
*/
int main() {
int N;
cin >> N;
ll time = 0;
vector<pair<ll, ll>> p(N);
for (int i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
p[i] = {b, a};
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
time += p[i].second;
if (time > p[i].first) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define pi pair<int, int>
#define pl pair<long long, long long>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define en cout << endl //セミコロンつけろ
//#define MM 1000000000
//#define MOD MM+7
typedef long long ll;
const int MM = 1e9;
const int MOD = MM + 7;
const long double PI = acos(-1);
const long long INF = 1e15;
int dx[8] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[8] = {0, -1, 0, 1, -1, 1, 1, -1};
// 'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
template <typename T> T GCD(T u, T v) { return v ? GCD(v, u % v) : u; }
template <typename T> T LCM(T x, T y) {
T gc = GCD(x, y);
return x * y / gc;
}
struct edge {
ll to, cost;
};
/*
const int COM_MAX = 500500;
long long fac[COM_MAX],finv[COM_MAX],inv[COM_MAX];
void init(){
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i = 2; i < COM_MAX; i++){
fac[i] = fac[i-1]*i%MOD;
inv[i] = MOD - inv[MOD%i]*(MOD/i)%MOD;
finv[i] = finv[i-1]*inv[i]%MOD;
}
}
long long COM(int n,int k){
if(n < k || n < 0 || k < 0) return 0;
return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;
}
*/
int main() {
int N;
cin >> N;
ll time = 0;
vector<pair<ll, ll>> p(N);
for (int i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
p[i] = {b, a};
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
time += p[i].second;
if (time > p[i].first) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 807,296 | 807,297 | u342051078 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int mod = 1e9 + 7;
const long long INF = 1LL << 60;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<pair<int, int>> task;
rep(i, N) {
int a, b;
cin >> a >> b;
task.emplace_back(a, b);
}
sort(task.begin(), task.end());
int sum = 0;
bool flag = true;
//ソート済みだから
for (auto v : task) {
sum += v.second;
if (sum > v.first) {
flag = false;
break;
}
}
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int mod = 1e9 + 7;
const long long INF = 1LL << 60;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<pair<int, int>> task;
rep(i, N) {
int a, b;
cin >> a >> b;
task.emplace_back(b, a);
}
sort(task.begin(), task.end());
int sum = 0;
bool flag = true;
//ソート済みだから
for (auto v : task) {
sum += v.second;
if (sum > v.first) {
flag = false;
break;
}
}
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"call.arguments.change",
"call.arguments.add"
] | 807,298 | 807,299 | u747087681 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
map<int, ll> mp;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
mp[b] += a;
}
int lo = 0;
for (auto p : mp) {
int deadline = p.first;
ll len = p.second;
if (len < deadline - lo) {
cout << "No";
return 0;
}
lo += len;
}
cout << "Yes";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
map<int, ll> mp;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
mp[b] += a;
}
int lo = 0;
for (auto p : mp) {
int deadline = p.first;
ll len = p.second;
if (len > deadline - lo) {
cout << "No";
return 0;
}
lo += len;
}
cout << "Yes";
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 807,322 | 807,323 | u774417629 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int main() {
// 締め切りが早い順に片付ける以外の方法はない
int N;
cin >> N;
int timeSpent = 0;
string ans = "Yes";
unordered_map<int, vector<int>> dic; // {残り日数: [所要時間, 所要時間, ...]}
set<int> deadlines;
for (int i = 0; i < N; ++i) {
int A, B; // timeframe, deadline
cin >> A >> B;
dic[B].push_back(A);
deadlines.insert(B);
}
for (auto deadline : deadlines) {
for (auto timeframe : dic.at(deadline)) {
timeSpent += timeframe;
if (deadline < timeframe) {
ans = "No";
break;
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
// 締め切りが早い順に片付ける以外の方法はない
int N;
cin >> N;
int timeSpent = 0;
string ans = "Yes";
unordered_map<int, vector<int>> dic; // {残り日数: [所要時間, 所要時間, ...]}
set<int> deadlines;
for (int i = 0; i < N; ++i) {
int A, B; // timeframe, deadline
cin >> A >> B;
dic[B].push_back(A);
deadlines.insert(B);
}
for (auto deadline : deadlines) {
for (auto timeframe : dic.at(deadline)) {
timeSpent += timeframe;
if (deadline < timeSpent) {
ans = "No";
break;
}
}
}
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 807,326 | 807,327 | u833543158 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int main() {
// 締め切りが早い順に片付ける以外の方法はない
int N;
cin >> N;
int timeSpent = 0;
string ans = "Yes";
vector<pair<int, int>> jobs;
for (int i = 0; i < N; ++i) {
int A, B;
cin >> A >> B;
jobs.emplace_back(A, B);
}
sort(jobs.begin(), jobs.end());
for (auto job : jobs) {
timeSpent += job.second;
if (timeSpent > job.first) {
ans = "No";
break;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
// 締め切りが早い順に片付ける以外の方法はない
int N;
cin >> N;
int timeSpent = 0;
string ans = "Yes";
vector<pair<int, int>> jobs; // deadlineでソートするため(deadline, timeframe)
for (int i = 0; i < N; ++i) {
int A, B; // timeframe, deadline
cin >> A >> B;
jobs.emplace_back(B, A);
}
sort(jobs.begin(), jobs.end());
for (auto job : jobs) {
timeSpent += job.second;
if (timeSpent > job.first) {
ans = "No";
break;
}
}
cout << ans << endl;
return 0;
}
| [
"call.arguments.change",
"call.arguments.add"
] | 807,328 | 807,329 | u833543158 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<pair<int, int>> v;
int main() {
int n;
int i;
cin >> n;
for (i = 1; i <= n; i++) {
int a, b;
cin >> a >> b;
v.push_back({b, a});
}
sort(v.begin(), v.end());
int day = 0;
bool ans = 1;
for (auto p : v) {
// cout<<p.first<<" , "<<p.second<<"\n";
int deadline = p.first;
int dayTaken = p.second;
if (day <= deadline)
day += dayTaken;
else
ans = 0;
// cout<<day<<", "<<ans<<"\n";
}
if (ans)
cout << "Yes\n";
else
cout << "No\n";
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<pair<int, int>> v;
int main() {
int n;
int i;
cin >> n;
for (i = 1; i <= n; i++) {
int a, b;
cin >> a >> b;
v.push_back({b, a});
}
sort(v.begin(), v.end());
int day = 0;
bool ans = 1;
for (auto p : v) {
// cout<<p.first<<" , "<<p.second<<"\n";
int deadline = p.first;
int dayTaken = p.second;
if (day + dayTaken <= deadline)
day += dayTaken;
else
ans = 0;
// cout<<day<<", "<<ans<<"\n";
}
if (ans)
cout << "Yes\n";
else
cout << "No\n";
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 807,330 | 807,331 | u359313068 | cpp |
p02996 | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <type_traits>
#include <vector>
using namespace std;
#define INF (1ll << 60)
#define INFint (1 << 30)
#define MOD 1000000007
#define BOUND 27182818284
typedef long long ll;
typedef long long int lli;
// typedef pair<ll,ll> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
template <class T> bool umax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool umin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
// gcd
template <typename T> T gcd(T a, T b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int findGCD(int arr[], int n) {
int result = arr[0];
for (int i = 1; i < n; i++)
result = gcd(arr[i], result);
return result;
}
template <typename T> T lcm(T m, T n) {
// 引数に0がある場合は0を返す
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
int dx[5] = {1, 0, -1, 0};
int dy[5] = {0, 1, 0, -1};
// v.front() = -BOUND;
// v.back() = BOUND;
// struct edge{
// int cost, to;
//
// edge(int in_cost, int in_to){
// cost=in_cost;
// to=in_to;
// }
// bool operator<(const edge &a) const
// {
// return cost > a.cost;
// }
//};
vector<int> G[10010];
vector<int> c(10010, 0);
int num[10010];
bool used[10010];
int now_c = 0;
int dfs(int s) {
if (used[s]) {
return 0;
} else {
used[s] = true;
}
num[s] = c[now_c];
now_c++;
for (int i = 0; i < G[s].size(); i++) {
dfs(G[s][i]);
}
return 0;
}
int main() {
int N;
cin >> N;
vector<pair<lli, lli>> p(N);
rep(i, N) { cin >> p[i].second >> p[i].first; }
sort(p.begin(), p.end());
lli time = 0ll;
for (auto a : p) {
time += a.second;
if (a.first < time) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
} | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <type_traits>
#include <vector>
using namespace std;
#define INF (1ll << 60)
#define INFint (1 << 30)
#define MOD 1000000007
#define BOUND 27182818284
typedef long long ll;
typedef long long int lli;
// typedef pair<ll,ll> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
template <class T> bool umax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool umin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
// gcd
template <typename T> T gcd(T a, T b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int findGCD(int arr[], int n) {
int result = arr[0];
for (int i = 1; i < n; i++)
result = gcd(arr[i], result);
return result;
}
template <typename T> T lcm(T m, T n) {
// 引数に0がある場合は0を返す
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
int dx[5] = {1, 0, -1, 0};
int dy[5] = {0, 1, 0, -1};
// v.front() = -BOUND;
// v.back() = BOUND;
// struct edge{
// int cost, to;
//
// edge(int in_cost, int in_to){
// cost=in_cost;
// to=in_to;
// }
// bool operator<(const edge &a) const
// {
// return cost > a.cost;
// }
//};
vector<int> G[10010];
vector<int> c(10010, 0);
int num[10010];
bool used[10010];
int now_c = 0;
int dfs(int s) {
if (used[s]) {
return 0;
} else {
used[s] = true;
}
num[s] = c[now_c];
now_c++;
for (int i = 0; i < G[s].size(); i++) {
dfs(G[s][i]);
}
return 0;
}
int main() {
int N;
cin >> N;
vector<pair<lli, lli>> p(N);
rep(i, N) { cin >> p[i].second >> p[i].first; }
sort(p.begin(), p.end());
lli time = 0ll;
for (auto a : p) {
time += a.second;
if (a.first < time) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,332 | 807,333 | u991664217 | cpp |
p02996 | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
const int sz = 2e5 + 9;
int n;
pair<int, int> p[sz];
bool cmp(pair<int, int> a, pair<int, int> b) {
// if(a.x!=b.x) return a.x<b.x;
return a.y < b.y;
}
int main() {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d %d", &p[i].x, &p[i].y);
sort(p, p + n, cmp);
int curr = 0;
for (int i = 0; i < n; i++) {
curr += p[i].x;
if (curr > p[i].y) {
printf("NO");
return 0;
}
}
printf("YES");
return 0;
}
| #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
const int sz = 2e5 + 9;
int n;
pair<int, int> p[sz];
bool cmp(pair<int, int> a, pair<int, int> b) {
// if(a.x!=b.x) return a.x<b.x;
return a.y < b.y;
}
int main() {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d %d", &p[i].x, &p[i].y);
sort(p, p + n, cmp);
int curr = 0;
for (int i = 0; i < n; i++) {
curr += p[i].x;
if (curr > p[i].y) {
printf("No");
return 0;
}
}
printf("Yes");
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 807,334 | 807,335 | u353783395 | cpp |
p02996 | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
const int sz = 2e5 + 9;
int n;
pair<int, int> p[sz];
bool cmp(pair<int, int> a, pair<int, int> b) {
// if(a.x!=b.x) return a.x<b.x;
return a.y < b.y;
}
int main() {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d %d", &p[i].x, &p[i].y);
sort(p, p + n, cmp);
int curr = 0;
for (int i = 0; i < n; i++) {
curr += p[i].x;
if (curr > p[i].y) {
puts("NO");
return 0;
}
}
puts("YES");
return 0;
}
| #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
const int sz = 2e5 + 9;
int n;
pair<int, int> p[sz];
bool cmp(pair<int, int> a, pair<int, int> b) {
// if(a.x!=b.x) return a.x<b.x;
return a.y < b.y;
}
int main() {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d %d", &p[i].x, &p[i].y);
sort(p, p + n, cmp);
int curr = 0;
for (int i = 0; i < n; i++) {
curr += p[i].x;
if (curr > p[i].y) {
printf("No");
return 0;
}
}
printf("Yes");
return 0;
}
| [
"identifier.change",
"call.function.change",
"io.output.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 807,336 | 807,335 | u353783395 | cpp |
p02996 | #include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
typedef long long ll;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<pair<int, int>> V;
int a, b;
REP(i, N) {
cin >> a >> b;
V.pb({b, a});
}
sort(ALL(V));
int time = 0;
for (auto e : V) {
time += e.second;
if (time > e.first) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
typedef long long ll;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<pair<int, int>> V;
int a, b;
REP(i, N) {
cin >> a >> b;
V.pb({b, a});
}
sort(ALL(V));
int time = 0;
for (auto e : V) {
time += e.second;
if (time > e.first) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,348 | 807,349 | u067267922 | cpp |
p02996 | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef pair<int, int> P;
int main(void) {
int n;
int t;
int i;
int x, y;
int flg;
P box[200001];
cin >> n;
for (i = 0; i < n; i++) {
cin >> x >> y;
box[i].F = y;
box[i].S = x;
}
sort(box, box + n);
// for(i=0;i<n;i++) cout<<box[i].F<<" "<<box[i].S<<endl;
t = 0;
flg = 0;
for (i = 0; i < n; i++) {
x = box[i].S;
y = box[i].F;
t += x;
if (t > y) {
flg = 1;
break;
}
}
cout << ((flg) ? "NO" : "Yes") << endl;
return 0;
}
| #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef pair<int, int> P;
int main(void) {
int n;
int t;
int i;
int x, y;
int flg;
P box[200001];
cin >> n;
for (i = 0; i < n; i++) {
cin >> x >> y;
box[i].F = y;
box[i].S = x;
}
sort(box, box + n);
// for(i=0;i<n;i++) cout<<box[i].F<<" "<<box[i].S<<endl;
t = 0;
flg = 0;
for (i = 0; i < n; i++) {
x = box[i].S;
y = box[i].F;
t += x;
if (t > y) {
flg = 1;
break;
}
}
cout << ((flg) ? "No" : "Yes") << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,360 | 807,361 | u787972656 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct times {
int a;
int b;
};
int main() {
int n;
vector<times> time;
cin >> n;
for (int i = 0; i < n; i++) {
times t;
cin >> t.a >> t.b;
time.push_back(t);
}
sort(time.begin(), time.end(),
[](const times &x, const times &y) { return x.b > y.b; });
int sum = 0;
for (int i = 0; i < n; i++) {
sum += time[i].a;
if (sum > time[i].b) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct times {
int a;
int b;
};
int main() {
int n;
vector<times> time;
cin >> n;
for (int i = 0; i < n; i++) {
times t;
cin >> t.a >> t.b;
time.push_back(t);
}
sort(time.begin(), time.end(),
[](const times &x, const times &y) { return x.b < y.b; });
int sum = 0;
for (int i = 0; i < n; i++) {
sum += time[i].a;
if (sum > time[i].b) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 807,364 | 807,365 | u020230257 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct times {
int a;
int b;
};
int main() {
int n;
vector<times> time;
cin >> n;
for (int i = 0; i < n; i++) {
times t;
cin >> t.a >> t.b;
time.push_back(t);
}
sort(time.begin(), time.end(),
[](const times &x, const times &y) { return x.b > y.b; });
int sum = 0;
for (int i = 0; i < n; i++) {
sum += time[i].a;
if (sum > time[i].b) {
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
}
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct times {
int a;
int b;
};
int main() {
int n;
vector<times> time;
cin >> n;
for (int i = 0; i < n; i++) {
times t;
cin >> t.a >> t.b;
time.push_back(t);
}
sort(time.begin(), time.end(),
[](const times &x, const times &y) { return x.b < y.b; });
int sum = 0;
for (int i = 0; i < n; i++) {
sum += time[i].a;
if (sum > time[i].b) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 807,366 | 807,365 | u020230257 | cpp |
p02996 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <numeric>
#include <vector>
using namespace std;
int main() {
long long N, tmp1, tmp2;
long long A[200000], B[200000];
cin >> N;
vector<pair<long long, long long>> v(N);
for (int i = 0; i < N; i++) {
cin >> tmp1 >> tmp2;
v[i] = {tmp2, tmp1};
}
sort(v.begin(), v.end());
int t = 0;
for (int i = 0; i < N; i++) {
t += v[i].second;
if (t > v[i].first) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <numeric>
#include <vector>
using namespace std;
int main() {
long long N, tmp1, tmp2;
long long A[200000], B[200000];
cin >> N;
vector<pair<long long, long long>> v(N);
for (int i = 0; i < N; i++) {
cin >> tmp1 >> tmp2;
v[i] = {tmp2, tmp1};
}
sort(v.begin(), v.end());
int t = 0;
for (int i = 0; i < N; i++) {
t += v[i].second;
if (t > v[i].first) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,383 | 807,384 | u817999507 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
class Job {
public:
int a;
int b;
};
bool operator<(const Job &left, const Job &right) { return left.b < right.b; }
bool operator>(const Job &left, const Job &right) { return left.b > right.b; }
int main() {
int n;
cin >> n;
vector<Job> time(n);
for (int i = 0; i < n; i++)
cin >> time[i].a >> time[i].b;
sort(time.begin(), time.end());
ll sum = 0;
bool ans;
for (int i = 0; i < n; i++) {
sum += time[i].a;
if (sum > time[i].b)
ans = false;
else
ans = true;
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
class Job {
public:
int a;
int b;
};
bool operator<(const Job &left, const Job &right) { return left.b < right.b; }
bool operator>(const Job &left, const Job &right) { return left.b > right.b; }
int main() {
int n;
cin >> n;
vector<Job> time(n);
for (int i = 0; i < n; i++)
cin >> time[i].a >> time[i].b;
sort(time.begin(), time.end());
ll sum = 0;
bool ans;
for (int i = 0; i < n; i++) {
sum += time[i].a;
if (sum > time[i].b) {
ans = false;
break;
} else {
ans = true;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"control_flow.break.add"
] | 807,385 | 807,386 | u056123277 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<P> lis;
for (int i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
lis.push_back(P(b, a));
}
sort(lis.begin(), lis.end());
ll pre = 0;
for (int i = 0; i <= N; i++) {
if (pre + lis.at(i).second > lis.at(i).first) {
cout << "No" << endl;
return 0;
}
pre += lis.at(i).second;
}
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<P> lis;
for (int i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
lis.push_back(P(b, a));
}
sort(lis.begin(), lis.end());
ll pre = 0;
for (int i = 0; i < N; i++) {
if (pre + lis.at(i).second > lis.at(i).first) {
cout << "No" << endl;
return 0;
}
pre += lis.at(i).second;
}
cout << "Yes" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 807,387 | 807,388 | u525137785 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<P> lis;
for (int i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
lis.push_back(P(b, a));
}
sort(lis.begin(), lis.end());
ll pre = 0;
for (int i = 0; i <= N; i++) {
if (pre + lis.at(i).second > lis.at(i).first) {
cout << "No" << endl;
return 0;
}
pre = lis.at(i).second;
}
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<P> lis;
for (int i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
lis.push_back(P(b, a));
}
sort(lis.begin(), lis.end());
ll pre = 0;
for (int i = 0; i < N; i++) {
if (pre + lis.at(i).second > lis.at(i).first) {
cout << "No" << endl;
return 0;
}
pre += lis.at(i).second;
}
cout << "Yes" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change"
] | 807,389 | 807,388 | u525137785 | cpp |
p02996 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
// const ll RANDOM =
// chrono::high_resolution_clock::now().time_since_epoch().count();
// gp_hash_table<int, int> table;
#define ll long long int
#define vii vector<ll>
#define pb push_back
#define pii pair<ll, ll>
#define all(x) x.begin(), x.end()
#define S second
#define F first
#define ins insert
#define ld long double
#define lp(l, r) for (i = l; i <= r; ++i)
#define lpj(l, r) for (j = l; j <= r; ++j)
#define lpr(l, r) for (i = r; i >= l; --i)
#define lprj(l, r) for (j = r; j >= l; --j)
#define swap(a, b) \
{ \
auto _t = a; \
a = b, b = _t; \
}
#define flush() cout.flush()
#define popcount __builtin_popcount
// typedef __int128 bign;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
#define MD 1000000007
#define M 1000011
#define LN 14
#define fftmod 998244353
#define EPS (double)1e-10
ll md = MD;
ll inf = 1e18;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline ll exp(ll a, ll b) {
ll r = 1LL;
while (b > 0) {
if (b & 1) {
r = r * (a % md);
r = (r + md) % md;
}
b /= 2;
a = (a % md) * (a % md);
a = (a + md) % md;
}
return (r + md) % md;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
if (a == 0)
return b;
return gcd(b, a % b);
}
inline ll poww(ll a, ll b) {
ll r = 1LL;
while (b > 0) {
if (b & 1)
r = r * a;
b /= 2;
a = a * a;
}
return (ll)r;
}
using cd = complex<double>;
const double PI = acos(-1);
inline ll rand(ll l, ll r) { return l + rng() % (r - l + 1); }
ll a[M], b[M];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// ifstream fin("input.txt");ofstream fout("outut.txt");
ll t, i, j, m, n, s, z, k, p, T;
string s1, s2;
ll q;
ll x, y;
cin >> n;
vector<pii> v;
lp(1, n) {
cin >> a[i] >> b[i];
v.pb({b[i], a[i]});
}
sort(all(v));
t = v[v.size() - 1].F;
for (i = n - 1; i >= 1; --i) {
t = min(t - v[i].S, v[i].F - v[i].S);
}
if (t >= 0)
cout << "Yes\n";
else
cout << "No\n";
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
// const ll RANDOM =
// chrono::high_resolution_clock::now().time_since_epoch().count();
// gp_hash_table<int, int> table;
#define ll long long int
#define vii vector<ll>
#define pb push_back
#define pii pair<ll, ll>
#define all(x) x.begin(), x.end()
#define S second
#define F first
#define ins insert
#define ld long double
#define lp(l, r) for (i = l; i <= r; ++i)
#define lpj(l, r) for (j = l; j <= r; ++j)
#define lpr(l, r) for (i = r; i >= l; --i)
#define lprj(l, r) for (j = r; j >= l; --j)
#define swap(a, b) \
{ \
auto _t = a; \
a = b, b = _t; \
}
#define flush() cout.flush()
#define popcount __builtin_popcount
// typedef __int128 bign;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
#define MD 1000000007
#define M 1000011
#define LN 14
#define fftmod 998244353
#define EPS (double)1e-10
ll md = MD;
ll inf = 1e18;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline ll exp(ll a, ll b) {
ll r = 1LL;
while (b > 0) {
if (b & 1) {
r = r * (a % md);
r = (r + md) % md;
}
b /= 2;
a = (a % md) * (a % md);
a = (a + md) % md;
}
return (r + md) % md;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
if (a == 0)
return b;
return gcd(b, a % b);
}
inline ll poww(ll a, ll b) {
ll r = 1LL;
while (b > 0) {
if (b & 1)
r = r * a;
b /= 2;
a = a * a;
}
return (ll)r;
}
using cd = complex<double>;
const double PI = acos(-1);
inline ll rand(ll l, ll r) { return l + rng() % (r - l + 1); }
ll a[M], b[M];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// ifstream fin("input.txt");ofstream fout("outut.txt");
ll t, i, j, m, n, s, z, k, p, T;
string s1, s2;
ll q;
ll x, y;
cin >> n;
vector<pii> v;
lp(1, n) {
cin >> a[i] >> b[i];
v.pb({b[i], a[i]});
}
sort(all(v));
t = v[v.size() - 1].F;
for (i = n - 1; i >= 0; --i) {
t = min(t - v[i].S, v[i].F - v[i].S);
}
if (t >= 0)
cout << "Yes\n";
else
cout << "No\n";
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 807,394 | 807,395 | u653136790 | cpp |
p02996 | #include "bits/stdc++.h"
using namespace std;
#define eb emplace_back
#define all(x) begin(x), end(x)
#define log(x) cout << (x) << endl
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using pi = pair<int, int>;
using vpi = vector<pi>;
using ll = long long;
int main() {
int n, a, b;
cin >> n;
vpi tasks;
rep(i, n) {
cin >> a >> b;
tasks.emplace_back(b, a);
}
sort(all(tasks));
ll t = 0;
for (auto p : tasks) {
t += p.second;
if (t > p.first) {
return log("NO"), 0;
}
}
log("YES");
}
| #include "bits/stdc++.h"
using namespace std;
#define eb emplace_back
#define all(x) begin(x), end(x)
#define log(x) cout << (x) << endl
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using pi = pair<int, int>;
using vpi = vector<pi>;
using ll = long long;
int main() {
int n, a, b;
cin >> n;
vpi tasks;
rep(i, n) {
cin >> a >> b;
tasks.emplace_back(b, a);
}
sort(all(tasks));
ll t = 0;
for (auto p : tasks) {
t += p.second;
if (t > p.first) {
return log("No"), 0;
}
}
log("Yes");
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"function.return_value.change"
] | 807,401 | 807,402 | u774380666 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
int main() {
int N;
vector<pair<ll, ll>> AB(N);
rep(i, 0, N) { cin >> AB[i].second >> AB[i].first; }
sort(AB.begin(), AB.end());
ll cntA = 0;
ll deadline = 0;
bool success = true;
rep(i, 0, N) {
cntA += AB[i].second;
deadline = AB[i].first;
if (cntA > deadline) {
success = false;
break;
}
}
if (success) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
};
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
int main() {
int N;
cin >> N;
vector<pair<ll, ll>> AB(N);
rep(i, 0, N) { cin >> AB[i].second >> AB[i].first; }
sort(AB.begin(), AB.end());
ll cntA = 0;
ll deadline = 0;
bool success = true;
rep(i, 0, N) {
cntA += AB[i].second;
deadline = AB[i].first;
if (cntA > deadline) {
success = false;
break;
}
}
if (success) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
};
| [] | 807,409 | 807,410 | u987594251 | cpp |
p02996 | #include <bits/stdc++.h>
#include <cstdio>
#define pb push_back
#define endl "\n"
#define mostrar(x, y) cout << x << " " << y << endl;
#define f first
#define s second
#define mod 1000000007
#define EPS 1e-9
using namespace std;
typedef pair<int, int> ii;
typedef pair<pair<int, int>, int> iii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
typedef long long ll;
vii datos;
/*bool criterio(ii a,ii b){
if(a.f<b.f) return true;
if(b.f>a.f) return false;
return a.s<b.s;
}*/
bool cmp(ii a, ii b) {
if (a.s < b.s)
return true;
if (a.s > b.s)
return false;
return a.f < b.f;
}
int main() {
ofstream out("output.txt");
int n, a, b;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
datos.pb({a, b});
}
sort(datos.begin(), datos.end(), cmp);
/*for(int i = 0; i<n; i++){
cout<<datos[i].f<<" "<<datos[i].s<<endl;
}*/
bool sePuede = true;
ll tiempoTotal = 0;
for (int i = 0; i < n && sePuede; i++) {
// cout<<i<<" "<<datos[i].f<<" "<<datos[i].s<<endl;
tiempoTotal += datos[i].f;
if (tiempoTotal > datos[i].s) {
sePuede = false;
// cout<<i<<endl;
}
}
if (sePuede) {
cout << "YES\n";
} else {
cout << "NO\n";
}
return 0;
} | #include <bits/stdc++.h>
#include <cstdio>
#define pb push_back
#define endl "\n"
#define mostrar(x, y) cout << x << " " << y << endl;
#define f first
#define s second
#define mod 1000000007
#define EPS 1e-9
using namespace std;
typedef pair<int, int> ii;
typedef pair<pair<int, int>, int> iii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
typedef long long ll;
vii datos;
/*bool criterio(ii a,ii b){
if(a.f<b.f) return true;
if(b.f>a.f) return false;
return a.s<b.s;
}*/
bool cmp(ii a, ii b) {
if (a.s < b.s)
return true;
if (a.s > b.s)
return false;
return a.f < b.f;
}
int main() {
ofstream out("output.txt");
int n, a, b;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
datos.pb({a, b});
}
sort(datos.begin(), datos.end(), cmp);
/*for(int i = 0; i<n; i++){
cout<<datos[i].f<<" "<<datos[i].s<<endl;
}*/
bool sePuede = true;
ll tiempoTotal = 0;
for (int i = 0; i < n && sePuede; i++) {
// cout<<i<<" "<<datos[i].f<<" "<<datos[i].s<<endl;
tiempoTotal += datos[i].f;
if (tiempoTotal > datos[i].s) {
sePuede = false;
// cout<<i<<endl;
}
}
if (sePuede) {
cout << "Yes\n";
} else {
cout << "No\n";
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,417 | 807,418 | u594272051 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++)
cin >> A[i] >> B[i];
vector<int> ord(N);
iota(ord.begin(), ord.end(), 0);
sort(ord.begin(), ord.end(), [&](int x, int y) { return B[x] < B[y]; });
bool ans = true;
int time = 0;
for (int i : ord) {
time += A[i];
if (time > B[i]) {
ans = false;
break;
}
}
if (ans)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++)
cin >> A[i] >> B[i];
vector<int> ord(N);
iota(ord.begin(), ord.end(), 0);
sort(ord.begin(), ord.end(), [&](int x, int y) { return B[x] < B[y]; });
bool ans = true;
int time = 0;
for (int i : ord) {
time += A[i];
if (time > B[i]) {
ans = false;
break;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,446 | 807,447 | u689245321 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<long, long>> p(n);
for (int i = 0; i < n; i++) {
long a, b;
cin >> a >> b;
p.push_back(make_pair(b, a));
}
sort(p.begin(), p.end());
long lapse = 0;
bool dis = true;
for (int i = 0; i < n; i++) {
lapse += p[i].second;
if (lapse > p[i].first) {
dis = false;
break;
}
}
if (dis) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<long, long>> p(n);
for (int i = 0; i < n; i++) {
long a, b;
cin >> a >> b;
p[i] = make_pair(b, a);
}
sort(p.begin(), p.end());
long lapse = 0;
bool dis = true;
for (int i = 0; i < n; i++) {
lapse += p[i].second;
if (lapse > p[i].first) {
dis = false;
break;
}
}
if (dis) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"call.arguments.change"
] | 807,465 | 807,466 | u093744128 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
const ll mod = 1e9 + 7;
ll power(ll a, ll n) {
ll ans = 1;
a = a % mod;
while (n > 0) {
if (n % 2 == 1) {
ans = (ans * a) % mod;
}
n = n / 2;
a = (a * a) % mod;
}
return ans;
}
bool comp(pair<ll, ll> &a, pair<ll, ll> &b) {
if (a.ff == b.ff) {
return a.ss < b.ss;
}
a.ff < b.ff;
}
int main() {
ll n;
cin >> n;
ll t = 0;
vector<pair<ll, ll>> p;
for (int i = 0; i < n; i++) {
ll a, b;
cin >> a >> b;
p.pb(mp(b, a));
}
sort(p.begin(), p.end(), comp);
for (int i = 0; i < n; i++) {
if (t + p[i].ss <= p[i].ff) {
t = t + p[i].ss;
} else {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
const ll mod = 1e9 + 7;
ll power(ll a, ll n) {
ll ans = 1;
a = a % mod;
while (n > 0) {
if (n % 2 == 1) {
ans = (ans * a) % mod;
}
n = n / 2;
a = (a * a) % mod;
}
return ans;
}
bool comp(pair<ll, ll> &a, pair<ll, ll> &b) {
if (a.ff == b.ff) {
return a.ss < b.ss;
}
return a.ff < b.ff;
}
int main() {
ll n;
cin >> n;
ll t = 0;
vector<pair<ll, ll>> p;
for (int i = 0; i < n; i++) {
ll a, b;
cin >> a >> b;
p.pb(mp(b, a));
}
sort(p.begin(), p.end(), comp);
for (int i = 0; i < n; i++) {
if (t + p[i].ss <= p[i].ff) {
t = t + p[i].ss;
} else {
cout << "No";
return 0;
}
// cout<<t<<endl;
}
cout << "Yes";
return 0;
}
| [
"control_flow.return.add"
] | 807,469 | 807,470 | u988882661 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
const ll mod = 1e9 + 7;
ll power(ll a, ll n) {
ll ans = 1;
a = a % mod;
while (n > 0) {
if (n % 2 == 1) {
ans = (ans * a) % mod;
}
n = n / 2;
a = (a * a) % mod;
}
return ans;
}
bool comp(pair<ll, ll> &a, pair<ll, ll> &b) {
if (a.ff == b.ff) {
return a.ss < b.ss;
}
return a.ff < b.ff;
}
int main() {
ll n;
cin >> n;
ll t = -1;
vector<pair<ll, ll>> p;
for (int i = 0; i < n; i++) {
ll a, b;
cin >> a >> b;
p.pb(mp(b, a));
}
sort(p.begin(), p.end(), comp);
for (int i = 0; i < n; i++) {
if (t + p[i].ss <= p[i].ff) {
t = t + p[i].ss;
} else {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
const ll mod = 1e9 + 7;
ll power(ll a, ll n) {
ll ans = 1;
a = a % mod;
while (n > 0) {
if (n % 2 == 1) {
ans = (ans * a) % mod;
}
n = n / 2;
a = (a * a) % mod;
}
return ans;
}
bool comp(pair<ll, ll> &a, pair<ll, ll> &b) {
if (a.ff == b.ff) {
return a.ss < b.ss;
}
return a.ff < b.ff;
}
int main() {
ll n;
cin >> n;
ll t = 0;
vector<pair<ll, ll>> p;
for (int i = 0; i < n; i++) {
ll a, b;
cin >> a >> b;
p.pb(mp(b, a));
}
sort(p.begin(), p.end(), comp);
for (int i = 0; i < n; i++) {
if (t + p[i].ss <= p[i].ff) {
t = t + p[i].ss;
} else {
cout << "No";
return 0;
}
// cout<<t<<endl;
}
cout << "Yes";
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 807,471 | 807,470 | u988882661 | cpp |
p02996 | #include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
//#endif
long long int n, a, b, sum = 0;
bool ans = true;
vector<pair<long long int, long long int>> inp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
inp.push_back(make_pair(b, a));
}
sort(inp.begin(), inp.end());
for (int i = 0; i < n; i++) {
sum = sum + inp[i].second;
if (sum > inp[i].first) {
ans = false;
break;
}
}
if (ans)
cout << "YES";
else
cout << "NO";
return 0;
} | #include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
//#endif
long long int n, a, b, sum = 0;
bool ans = true;
vector<pair<long long int, long long int>> inp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
inp.push_back(make_pair(b, a));
}
sort(inp.begin(), inp.end());
for (int i = 0; i < n; i++) {
sum = sum + inp[i].second;
if (sum > inp[i].first) {
ans = false;
break;
}
}
if (ans)
cout << "Yes";
else
cout << "No";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,475 | 807,476 | u175989198 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
struct kkk {
long long t;
long long s;
long long start;
} a[200005];
int cmp(kkk aa, kkk bb) {
/* if(aa.start==bb.start){
return aa.s<bb.s;
}
*/ return aa.s < bb.s;
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i].t >> a[i].s;
a[i].start = a[i].s - a[i].t;
if (a[i].start < 0) {
// cout<<"a[i].start<0";
cout << "-1";
return 0;
}
}
sort(a, a + n, cmp);
/* for(int i=0;i<n;i++){
cout<<a[i].t<<" "<<a[i].s<<endl;
}
cout<<endl;
*/
long long cnt = 0;
long long minn = 1000000000000000;
for (int i = 0; i < n; i++) {
cnt += a[i].t;
if (minn > a[i].s - cnt) {
minn = a[i].s - cnt;
}
if (cnt > a[i].s) {
// cout<<"cnt>a[i].s"<<a[i].s;
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
/*
50
6 2038
29 1383
17 443
24 386
33 1292
35 2051
19 2085
3 1406
32 195
3 651
38 2325
38 229
36 245
36 2319
19 471
45 1191
49 1453
42 455
24 1633
37 1426
3 2050
17 163
23 360
37 911
29 1441
39 292
18 1575
11 204
44 2383
41 1781
3 745
21 501
2 263
22 943
40 408
43 2046
31 2082
20 633
39 1084
44 1141
30 1438
27 1301
12 1953
15 261
8 1061
31 601
7 1029
33 2226
42 271
32 1279
*/ | #include <bits/stdc++.h>
using namespace std;
struct kkk {
long long t;
long long s;
long long start;
} a[200005];
int cmp(kkk aa, kkk bb) {
/* if(aa.start==bb.start){
return aa.s<bb.s;
}
*/ return aa.s < bb.s;
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i].t >> a[i].s;
a[i].start = a[i].s - a[i].t;
if (a[i].start < 0) {
// cout<<"a[i].start<0";
cout << "No";
return 0;
}
}
sort(a, a + n, cmp);
/* for(int i=0;i<n;i++){
cout<<a[i].t<<" "<<a[i].s<<endl;
}
cout<<endl;
*/
long long cnt = 0;
long long minn = 1000000000000000;
for (int i = 0; i < n; i++) {
cnt += a[i].t;
if (minn > a[i].s - cnt) {
minn = a[i].s - cnt;
}
if (cnt > a[i].s) {
// cout<<"cnt>a[i].s"<<a[i].s;
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
/*
50
6 2038
29 1383
17 443
24 386
33 1292
35 2051
19 2085
3 1406
32 195
3 651
38 2325
38 229
36 245
36 2319
19 471
45 1191
49 1453
42 455
24 1633
37 1426
3 2050
17 163
23 360
37 911
29 1441
39 292
18 1575
11 204
44 2383
41 1781
3 745
21 501
2 263
22 943
40 408
43 2046
31 2082
20 633
39 1084
44 1141
30 1438
27 1301
12 1953
15 261
8 1061
31 601
7 1029
33 2226
42 271
32 1279
*/ | [
"literal.string.change",
"io.output.change"
] | 807,477 | 807,478 | u261868146 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<pair<ll, ll>> v;
for (int i = 0; i < n; i++) {
ll l, r;
cin >> l >> r;
v.push_back(make_pair(r, l));
}
ll sum = 0;
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
// cout<<v[i].second<<" " <<v[i].first<<endl;
sum += v[i].second;
if (sum > v[i].first) {
cout << "NO" << endl;
return 0;
}
// cout<<sum<<endl;
}
cout << "YES" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<pair<ll, ll>> v;
for (int i = 0; i < n; i++) {
ll l, r;
cin >> l >> r;
v.push_back(make_pair(r, l));
}
ll sum = 0;
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
// cout<<v[i].second<<" " <<v[i].first<<endl;
sum += v[i].second;
if (sum > v[i].first) {
cout << "No" << endl;
return 0;
}
// cout<<sum<<endl;
}
cout << "Yes" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,481 | 807,482 | u432205669 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
bool com(pair<ll, ll> p1, pair<ll, ll> p2) {
if (p1.first < p2.first) {
return true;
}
if (p1.first == p2.second) {
return (p1.second <= p2.second);
}
return 0;
}
int main() {
int n;
cin >> n;
ll x, y, tot = 0;
ll cur[n + 5] = {0}, dead[n + 5] = {0};
vector<pair<ll, ll>> v;
for (int i = 1; i <= n; i++) {
cin >> x >> y;
v.push_back({x, y});
}
sort(v.begin(), v.end(), com);
for (int i = 0; i < n; i++) {
tot += v[i].first;
if (tot > v[i].second) {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
bool com(pair<ll, ll> p1, pair<ll, ll> p2) {
if (p1.second < p2.second) {
return true;
}
if (p1.second == p2.second) {
return (p1.first <= p2.first);
}
return false;
}
int main() {
int n;
cin >> n;
ll x, y, tot = 0;
ll cur[n + 5] = {0}, dead[n + 5] = {0};
vector<pair<ll, ll>> v;
for (int i = 1; i <= n; i++) {
cin >> x >> y;
v.push_back({x, y});
}
sort(v.begin(), v.end(), com);
for (int i = 0; i < n; i++) {
tot += v[i].first;
if (tot > v[i].second) {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
} | [
"control_flow.branch.if.condition.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 807,491 | 807,492 | u422827820 | cpp |
p02996 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <vector>
static const int IINF = 1 << 30;
static const long long LINF = 1LL << 60;
static const long long MOD = 1.0e+9 + 7;
template <typename T> std::vector<T> vectors(std::size_t n, T val) {
return std::vector<T>(n, val);
}
template <typename T, typename... Args>
auto vectors(std::size_t n, Args... args) {
return std::vector<decltype(vectors<T>(args...))>(n, vectors<T>(args...));
}
template <class T> inline bool chmin(T &a, const T &b) {
return (a > b) ? a = b, true : false;
}
template <class T> inline bool chmax(T &a, const T &b) {
return (a < b) ? a = b, true : false;
}
template <class T> inline void chadd(T &a, const T &b) {
a += b, a %= MOD;
// TODO minus case
}
template <class T>
std::ostream &operator<<(std::ostream &s, const std::vector<T> &v) {
if (v.empty())
return s;
s << *v.begin();
for (auto iter = v.begin() + 1; iter != v.end(); ++iter)
if (std::is_fundamental<T>::value)
s << " " << *iter;
else
s << std::endl << *iter;
return s;
}
int main() {
// Input
long long N;
std::cin >> N;
std::vector<long long> A(N); // duration
std::vector<long long> B(N); // dead line
for (int i = 0; i < N; ++i)
std::cin >> A[i] >> B[i];
// Main
// dead line が小さい順にソート
std::vector<long long> idx(N);
for (int i = 0; i < N; ++i)
idx[i] = i;
std::stable_sort(idx.begin(), idx.end(),
[&](int k, int l) { return B[k] < B[l]; });
std::vector<long long> duration(N);
std::vector<long long> deadLine(N);
for (int i = 0; i < N; ++i) {
duration[i] = A[idx[i]];
deadLine[i] = B[idx[i]];
}
// std::cout << duration << std::endl;
// std::cout << deadLine << std::endl;
std::string res = "Yes";
int t = 0;
for (int i = 0; i < N; ++i) {
t += duration[i];
if (t - 1 > deadLine[i]) {
res = "No";
break;
}
}
// Output
std::cout << res << std::endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <vector>
static const int IINF = 1 << 30;
static const long long LINF = 1LL << 60;
static const long long MOD = 1.0e+9 + 7;
template <typename T> std::vector<T> vectors(std::size_t n, T val) {
return std::vector<T>(n, val);
}
template <typename T, typename... Args>
auto vectors(std::size_t n, Args... args) {
return std::vector<decltype(vectors<T>(args...))>(n, vectors<T>(args...));
}
template <class T> inline bool chmin(T &a, const T &b) {
return (a > b) ? a = b, true : false;
}
template <class T> inline bool chmax(T &a, const T &b) {
return (a < b) ? a = b, true : false;
}
template <class T> inline void chadd(T &a, const T &b) {
a += b, a %= MOD;
// TODO minus case
}
template <class T>
std::ostream &operator<<(std::ostream &s, const std::vector<T> &v) {
if (v.empty())
return s;
s << *v.begin();
for (auto iter = v.begin() + 1; iter != v.end(); ++iter)
if (std::is_fundamental<T>::value)
s << " " << *iter;
else
s << std::endl << *iter;
return s;
}
int main() {
// Input
long long N;
std::cin >> N;
std::vector<long long> A(N); // duration
std::vector<long long> B(N); // dead line
for (int i = 0; i < N; ++i)
std::cin >> A[i] >> B[i];
// Main
// dead line が小さい順にソート
std::vector<long long> idx(N);
for (int i = 0; i < N; ++i)
idx[i] = i;
std::stable_sort(idx.begin(), idx.end(),
[&](int k, int l) { return B[k] < B[l]; });
std::vector<long long> duration(N);
std::vector<long long> deadLine(N);
for (int i = 0; i < N; ++i) {
duration[i] = A[idx[i]];
deadLine[i] = B[idx[i]];
}
// std::cout << duration << std::endl;
// std::cout << deadLine << std::endl;
std::string res = "Yes";
int t = 0;
for (int i = 0; i < N; ++i) {
t += duration[i];
if (t > deadLine[i]) {
res = "No";
break;
}
}
// Output
std::cout << res << std::endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 807,493 | 807,494 | u875972329 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
long a, b;
vector<pair<long, long>> v;
for (int i = 0; i < n; i++) {
cin >> a >> b;
v.push_back({b, a});
}
sort(v.begin(), v.end());
int flg = 0;
long t = 0;
for (long i = 0; i < n; i++) {
a = v[i].first;
b = v[i].second;
t += b;
if (t <= a) {
continue;
}
flg = 1;
break;
}
if (flg == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
long a, b;
vector<pair<long, long>> v;
for (int i = 0; i < n; i++) {
cin >> a >> b;
v.push_back({b, a});
}
sort(v.begin(), v.end());
int flg = 0;
long t = 0;
for (long i = 0; i < n; i++) {
a = v[i].first;
b = v[i].second;
t += b;
if (t <= a) {
continue;
}
flg = 1;
break;
}
if (flg == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,505 | 807,506 | u922317157 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 100;
int a[N], b[N], arr[N];
int n, t;
int32_t main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
arr[i] = i;
}
sort(arr, arr + n, [&](int i, int j) { return b[i] < b[j]; });
for (int o = 0; o < n; o++) {
int i = arr[o];
if (t + a[i] > b[i])
return cout << "NO", 0;
t += a[i];
}
return cout << "YES", 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 100;
int a[N], b[N], arr[N];
int n, t;
int32_t main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
arr[i] = i;
}
sort(arr, arr + n, [&](int i, int j) { return b[i] < b[j]; });
for (int o = 0; o < n; o++) {
int i = arr[o];
if (t + a[i] > b[i])
return cout << "No", 0;
t += a[i];
}
return cout << "Yes", 0;
} | [
"literal.string.change",
"literal.string.case.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 807,520 | 807,521 | u649712004 | cpp |
p02996 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> p(n);
rep(i, n) cin >> p[i].second >> p[i].first;
sort(p.begin(), p.end());
long long t = 0;
rep(i, n) {
t += p[i].second;
if (t > p[i].first) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << 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;
cin >> n;
vector<pair<int, int>> p(n);
rep(i, n) cin >> p[i].second >> p[i].first;
sort(p.begin(), p.end());
long long t = 0;
rep(i, n) {
t += p[i].second;
if (t > p[i].first) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,530 | 807,531 | u367177642 | cpp |
p02996 | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
// DP法
template <class T>
inline bool chmin(T &a, T b) // change minimum
{
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b) // change max
{
if (a < b) {
a = b;
return true;
}
return false;
}
typedef long long ll; // 64bit型
using namespace std;
// const long long INF = 1LL << 60; //無限大の値
int INF = 1000000;
int main() {
int N;
cin >> N;
vector<pair<int, int>> tasks(N);
REP(i, N) { cin >> tasks[i].second >> tasks[i].first; }
sort(tasks.begin(), tasks.end());
ll ans = 0;
REP(i, N) {
ans += tasks[i].first;
if (ans > tasks[i].second) {
puts("No");
return 0;
}
}
puts("Yes");
return 0;
}
| #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
// DP法
template <class T>
inline bool chmin(T &a, T b) // change minimum
{
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b) // change max
{
if (a < b) {
a = b;
return true;
}
return false;
}
typedef long long ll; // 64bit型
using namespace std;
// const long long INF = 1LL << 60; //無限大の値
int INF = 1000000;
int main() {
int N;
cin >> N;
vector<pair<int, int>> tasks(N);
REP(i, N) { cin >> tasks[i].second >> tasks[i].first; }
sort(tasks.begin(), tasks.end());
ll ans = 0;
REP(i, N) {
ans += tasks[i].second;
if (ans > tasks[i].first) {
puts("No");
return 0;
}
}
puts("Yes");
return 0;
}
| [
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 807,553 | 807,554 | u966508131 | cpp |
p02996 | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
// DP法
template <class T>
inline bool chmin(T &a, T b) // change minimum
{
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b) // change max
{
if (a < b) {
a = b;
return true;
}
return false;
}
typedef long long ll; // 64bit型
using namespace std;
// const long long INF = 1LL << 60; //無限大の値
int INF = 1000000;
int main() {
int N;
cin >> N;
vector<pair<int, int>> task;
REP(i, N)
cin >> task[i].second >> task[i].first;
sort(task.begin(), task.end());
ll ans = 0;
REP(i, N) {
ans += task[i].second;
if (ans > task[i].first) {
puts("No");
return 0;
}
}
puts("Yes");
return 0;
}
| #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
// DP法
template <class T>
inline bool chmin(T &a, T b) // change minimum
{
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b) // change max
{
if (a < b) {
a = b;
return true;
}
return false;
}
typedef long long ll; // 64bit型
using namespace std;
// const long long INF = 1LL << 60; //無限大の値
int INF = 1000000;
int main() {
int N;
cin >> N;
vector<pair<int, int>> task(N);
REP(i, N) { cin >> task[i].second >> task[i].first; }
sort(task.begin(), task.end());
ll ans = 0;
REP(i, N) {
ans += task[i].second;
if (ans > task[i].first) {
puts("No");
return 0;
}
}
puts("Yes");
return 0;
}
| [] | 807,555 | 807,556 | u966508131 | cpp |
p02996 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
const long long int MOD = 1000000007;
// const int MOD = 998244353;
// const long long int MOD = 998244353;
const double EPS = 1e-8;
// int N, M, K, H, W, L, R;
long long int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
vector<pair<int, int>> v;
for (auto &i : v)
cin >> i.second >> i.first;
sort(v.begin(), v.end());
int cnt = 0;
for (auto i : v) {
if (i.second + cnt > i.first) {
cout << "No\n";
return 0;
}
cnt += i.second;
}
cout << "Yes\n";
} | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
const long long int MOD = 1000000007;
// const int MOD = 998244353;
// const long long int MOD = 998244353;
const double EPS = 1e-8;
// int N, M, K, H, W, L, R;
long long int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
vector<pair<int, int>> v(N);
for (auto &i : v)
cin >> i.second >> i.first;
sort(v.begin(), v.end());
int cnt = 0;
for (auto i : v) {
if (i.second + cnt > i.first) {
cout << "No\n";
return 0;
}
cnt += i.second;
}
cout << "Yes\n";
} | [] | 807,572 | 807,573 | u468700753 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int, int> II;
typedef tuple<int, int, int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int, int> MAPII;
typedef unordered_set<int> SETI;
template <class T> using VV = vector<vector<T>>;
// minmax
template <class T> inline T SMIN(T &a, const T b) {
return a = (a > b) ? b : a;
}
template <class T> inline T SMAX(T &a, const T b) {
return a = (a < b) ? b : a;
}
// repetition
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define REPE(i, n) for (int i = 0; i <= (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FORR(x, arr) for (auto &x : arr)
#define SZ(a) int((a).size())
// collection
#define ALL(c) (c).begin(), (c).end()
// DP
#define MINUS(dp) memset(dp, -1, sizeof(dp))
#define ZERO(dp) memset(dp, 0, sizeof(dp))
// stdout
#define println(args...) fprintf(stdout, ##args), putchar('\n');
// debug cerr
template <class Iter> void __kumaerrc(Iter begin, Iter end) {
for (; begin != end; ++begin) {
cerr << *begin << ',';
}
cerr << endl;
}
void __kumaerr(istream_iterator<string> it) {
(void)it;
cerr << endl;
}
template <typename T, typename... Args>
void __kumaerr(istream_iterator<string> it, T a, Args... args) {
cerr << *it << "=" << a << ", ", __kumaerr(++it, args...);
}
template <typename S, typename T>
std::ostream &operator<<(std::ostream &_os, const std::pair<S, T> &_p) {
return _os << "{" << _p.first << ',' << _p.second << "}";
}
#define __KUMATRACE__ true
#ifdef __KUMATRACE__
#define dump(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
__kumaerr(_it, args); \
}
#define dumpc(ar) \
{ \
cerr << #ar << ": "; \
FORR(x, (ar)) { cerr << x << ','; } \
cerr << endl; \
}
#define dumpC(beg, end) \
{ \
cerr << "~" << #end << ": "; \
__kumaerrc(beg, end); \
}
#else
#define dump(args...)
#define dumpc(ar)
#define dumpC(beg, end)
#endif
// $ cp-batch Megalomania | diff Megalomania.out -
// $ g++ -std=c++14 -Wall -O2 -D_GLIBCXX_DEBUG -fsanitize=address
// Megalomania.cpp && ./a.out
/*
6/22/2019
5:18-
*/
const int MAX_N = 1e6 + 1;
LL A[MAX_N], B[MAX_N];
int N;
void nope() {
println("No");
exit(0);
}
void solve() {
vector<pair<LL, int>> X;
REP(i, N) X.emplace_back(B[i] /*-(A[i]-1)*/, i);
sort(ALL(X));
// dumpc(X);
LL t = 0;
REP(i, N) {
int j = X[i].second;
t = t + A[j];
// dump(j,t,A[j],B[j]);
if (t - 1 > B[j]) {
// dump(i,j,t,B[j]);
nope();
}
}
println("Yes");
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(12) << fixed;
cin >> N;
REP(i, N) cin >> A[i] >> B[i];
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int, int> II;
typedef tuple<int, int, int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int, int> MAPII;
typedef unordered_set<int> SETI;
template <class T> using VV = vector<vector<T>>;
// minmax
template <class T> inline T SMIN(T &a, const T b) {
return a = (a > b) ? b : a;
}
template <class T> inline T SMAX(T &a, const T b) {
return a = (a < b) ? b : a;
}
// repetition
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define REPE(i, n) for (int i = 0; i <= (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FORR(x, arr) for (auto &x : arr)
#define SZ(a) int((a).size())
// collection
#define ALL(c) (c).begin(), (c).end()
// DP
#define MINUS(dp) memset(dp, -1, sizeof(dp))
#define ZERO(dp) memset(dp, 0, sizeof(dp))
// stdout
#define println(args...) fprintf(stdout, ##args), putchar('\n');
// debug cerr
template <class Iter> void __kumaerrc(Iter begin, Iter end) {
for (; begin != end; ++begin) {
cerr << *begin << ',';
}
cerr << endl;
}
void __kumaerr(istream_iterator<string> it) {
(void)it;
cerr << endl;
}
template <typename T, typename... Args>
void __kumaerr(istream_iterator<string> it, T a, Args... args) {
cerr << *it << "=" << a << ", ", __kumaerr(++it, args...);
}
template <typename S, typename T>
std::ostream &operator<<(std::ostream &_os, const std::pair<S, T> &_p) {
return _os << "{" << _p.first << ',' << _p.second << "}";
}
#define __KUMATRACE__ true
#ifdef __KUMATRACE__
#define dump(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
__kumaerr(_it, args); \
}
#define dumpc(ar) \
{ \
cerr << #ar << ": "; \
FORR(x, (ar)) { cerr << x << ','; } \
cerr << endl; \
}
#define dumpC(beg, end) \
{ \
cerr << "~" << #end << ": "; \
__kumaerrc(beg, end); \
}
#else
#define dump(args...)
#define dumpc(ar)
#define dumpC(beg, end)
#endif
// $ cp-batch Megalomania | diff Megalomania.out -
// $ g++ -std=c++14 -Wall -O2 -D_GLIBCXX_DEBUG -fsanitize=address
// Megalomania.cpp && ./a.out
/*
6/22/2019
5:18-5:41 WA
5:49 AC
My original idea by sorting B[i]-A[i] is wrong.
Suppose we have optimal sequence S_k and my original algorithm gives T_k.
Suppose both S_k and T_k have the same set.
However S_k is giving `a` as next one while T_k is giving `b`.
tot + A[a] <= B[a]
tot + A[a] + A[b] <= B[b] where tot = ∑{A[i] : i∈T_k}
B[b]-A[b] <= B[a]-A[a] holds
i) B[b] <= B[a]
T_k is taking `b` next.
tot + A[b] < tot + A[a] + A[b] <= B[b] <= B[a]
`b` and `a` satisfies ∑{A[i] : i∈T_k} < B[T_k.last]
ii) B[a] < B[b]
tot + A[b] <= tot + A[a] + A[b] <= B[b]. Thus `b` is ok.
For `a` coming up next, tot + A[a] + A[b] <= B[a] is the proposition we want to
prove. B[a] - (tot + A[a] + A[b]) = (B[a] - A[a]) - tot - A[b]
>= (B[b] - A[b]) - tot - A[b]
= (B[b] - tot - A[b]) - A[b]
>= A[a] - A[b]
Thus tot + A[a] + A[b] > B[a] if A[a]-A[b]<0. Our algorithm does not give
optimal result (counter example).
Condition that we are trying to hold is ∑{A[i] : i∈S} <= B[S.back()]
This condition implies that processing smaller B[i] gives us optimal algorithm.
Suppose we sort by B[i] and process items with smaller B[i] and get sequence
T_k. Also we have one of optimal sequence S_k.
From S_k..
tot + A[a] <= B[a]
tot + A[a] + A[b] <= B[b]
From T_k..
B[b] <= B[a]
tot + B[b] <= tot + A[a] + A[b] <= B[b]. Thus `b` is ok.
Also tot + A[a] + A[b] <= B[b] <= B[a]. Thus `a` is ok, too.
This means T_k is not worse than S_k. T_k gives optimal solution.
https://img.atcoder.jp/abc131/editorial.pdf
http://drken1215.hatenablog.com/entry/2019/06/22/224800
https://twitter.com/drken1215/status/1142442953211699201
*/
const int MAX_N = 1e6 + 1;
LL A[MAX_N], B[MAX_N];
int N;
void nope() {
println("No");
exit(0);
}
void solve() {
vector<pair<LL, int>> X;
REP(i, N) X.emplace_back(B[i], i);
sort(ALL(X));
LL t = 0;
REP(i, N) {
int j = X[i].second;
t = t + A[j];
// dump(j,t,A[j],B[j]);
if (t > B[j])
nope();
}
println("Yes");
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(12) << fixed;
cin >> N;
REP(i, N) cin >> A[i] >> B[i];
solve();
return 0;
}
| [
"expression.operation.binary.remove"
] | 807,582 | 807,583 | u465317453 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.