problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02994 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> v(N);
for (int i = 0; i <= N; i++) {
v[i] = L + i;
}
int m = 100000;
int t;
for (size_t i = 0; i < N; i++) {
if (m > abs(v[i])) {
m = abs(v[i]);
t = i;
}
}
int sum = accumulate(v.begin(), v.end(), 0) - v[t];
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> v(N);
for (int i = 0; i < N; i++) {
v[i] = L + i;
}
int m = 100000;
int t;
for (size_t i = 0; i < N; i++) {
if (m > abs(v[i])) {
m = abs(v[i]);
t = i;
}
}
int sum = accumulate(v.begin(), v.end(), 0) - v[t];
cout << sum << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02994 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> v;
bool positive = false, negative = false, zero = false;
int n, l, j = 0, sum = 0;
cin >> n >> l;
for (int i = 1; i <= n; i++) {
int k = l + i - 1;
if (k > 0)
positive = true;
else if (k < 0)
negative = true;
else
zero = true;
sum += k;
v[j++] = k;
}
if ((positive && negative) || zero)
cout << sum << endl;
else if (positive) {
int min = 9999;
for (int i = 0; i < n; i++) {
if (v[i] < min)
min = v[i];
}
cout << sum - min << endl;
} else {
int max = -9999;
for (int i = 0; i < n; i++) {
if (v[i] > max)
max = v[i];
}
cout << sum - max << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> v;
bool positive = false, negative = false, zero = false;
int n, l, j = 0, sum = 0;
cin >> n >> l;
for (int i = 1; i <= n; i++) {
int k = l + i - 1;
if (k > 0)
positive = true;
else if (k < 0)
negative = true;
else
zero = true;
sum += k;
v.push_back(k);
}
if ((positive && negative) || zero)
cout << sum << endl;
else if (positive) {
int min = 9999;
for (int i = 0; i < n; i++) {
if (v[i] < min)
min = v[i];
}
cout << sum - min << endl;
} else {
int max = -9999;
for (int i = 0; i < n; i++) {
if (v[i] > max)
max = v[i];
}
cout << sum - max << endl;
}
return 0;
} | replace | 21 | 22 | 21 | 22 | -11 | |
p02994 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define test() \
int t; \
cin >> t; \
loop(test, 1, t + 1)
#define pb push_back
#define eb emplace_back
#define mkp make_pair
#define nl cout << "\n"
#define sp cout << " "
#define F first
#define S second
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<pii>
#define vll vector<pll>
#define MOD 1000000007
#define all(x) x.begin(), x.end()
template <class C> void min_self(C &a, C b) { a = min(a, b); }
template <class C> void max_self(C &a, C b) { a = max(a, b); }
void mod(ll &n, ll m = MOD) { n %= m, n += m, n %= m; }
const int MAXN = 1e5 + 5;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio();
int n, l;
cin >> n >> l;
ll sum = (n * (n + 1)) / 2;
ll total = (l - 1) * n;
ll left = l;
ll right = l + n - 1;
ll ans = 0;
if (left <= 0 && right >= 0)
ans = sum + total;
else if (left <= 0)
ans = sum + total - right;
else if (right >= 0)
ans = sum + total - left;
cout << ans, nl;
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define test() \
int t; \
cin >> t; \
loop(test, 1, t + 1)
#define pb push_back
#define eb emplace_back
#define mkp make_pair
#define nl cout << "\n"
#define sp cout << " "
#define F first
#define S second
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<pii>
#define vll vector<pll>
#define MOD 1000000007
#define all(x) x.begin(), x.end()
template <class C> void min_self(C &a, C b) { a = min(a, b); }
template <class C> void max_self(C &a, C b) { a = max(a, b); }
void mod(ll &n, ll m = MOD) { n %= m, n += m, n %= m; }
const int MAXN = 1e5 + 5;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
fastio();
int n, l;
cin >> n >> l;
ll sum = (n * (n + 1)) / 2;
ll total = (l - 1) * n;
ll left = l;
ll right = l + n - 1;
ll ans = 0;
if (left <= 0 && right >= 0)
ans = sum + total;
else if (left <= 0)
ans = sum + total - right;
else if (right >= 0)
ans = sum + total - left;
cout << ans, nl;
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
} | delete | 40 | 44 | 40 | 40 | 0 |
Time elapsed: 32ms
|
p02994 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <numeric>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i < (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)-1); i > 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using lint = long long;
using p = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int N, L;
int main() {
cin >> N >> L;
vector<int> taste(N);
rep(i, N) taste[i] = L + i;
int sum = 0;
sum = accumulate(taste.begin(), taste.end(), sum);
int m = 1e9;
int sign;
rep(i, N) {
if (abs(taste[i]) < m) {
m = abs(taste[i]);
sign = taste[i] / abs(taste[i]);
}
}
cout << sum - (sign * m) << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <numeric>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i < (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)-1); i > 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using lint = long long;
using p = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int N, L;
int main() {
cin >> N >> L;
vector<int> taste(N);
rep(i, N) taste[i] = L + i;
int sum = 0;
sum = accumulate(taste.begin(), taste.end(), sum);
int m = 1e9;
int sign;
rep(i, N) {
if (abs(taste[i]) < m) {
m = abs(taste[i]);
sign = taste[i] == 0 ? 0 : taste[i] / abs(taste[i]);
}
}
cout << sum - (sign * m) << endl;
return 0;
}
| replace | 41 | 42 | 41 | 42 | 0 | |
p02994 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define IO() \
assert(freopen("in.in", "rt", stdin)), \
assert(freopen("out.out", "wt", stdout))
#define FastIO() ios::sync_with_stdio(false);
#define debug(x) cout << __LINE__ << ": " << #x << " = " << (x) << endl
inline int readChar();
template <class T = int> inline T readInt();
template <class T> inline void writeInt(T x, char end = 0);
inline void writeChar(int x);
inline void writeWord(const char *s);
/** Read */
static const int buf_size = 4096;
inline int getChar() {
static char buf[buf_size];
static int len = 0, pos = 0;
if (pos == len)
pos = 0, len = fread(buf, 1, buf_size, stdin);
if (pos == len)
return -1;
return buf[pos++];
}
inline int readChar() {
int c = getChar();
while (c <= 32)
c = getChar();
return c;
}
template <class T> inline T readInt() {
int s = 1, c = readChar();
T x = 0;
if (c == '-')
s = -1, c = getChar();
while ('0' <= c && c <= '9')
x = x * 10 + c - '0', c = getChar();
return s == 1 ? x : -x;
}
/** Write */
static int write_pos = 0;
static char write_buf[buf_size];
inline void writeChar(int x) {
if (write_pos == buf_size)
fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
write_buf[write_pos++] = x;
}
template <class T> inline void writeInt(T x, char end) {
if (x < 0)
writeChar('-'), x = -x;
char s[24];
int n = 0;
while (x || !n)
s[n++] = '0' + x % 10, x /= 10;
while (n--)
writeChar(s[n]);
if (end)
writeChar(end);
}
inline void writeWord(const char *s) {
while (*s)
writeChar(*s++);
}
struct Flusher {
~Flusher() {
if (write_pos)
fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
}
} flusher;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int N = 1e7 + 9, M = 1e5 + 9, OO = 0x3f3f3f3f;
const double EPS = 1e-10;
int main() {
#ifndef ONLINE_JUDGE
IO();
#endif
int n = readInt(), l = readInt();
int mn = OO;
ll sum = 0;
for (int i = 0; i < n; ++i) {
int x = l + i;
sum += x;
mn = (abs(mn) > abs(x)) ? x : mn;
}
writeInt(sum - mn);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IO() \
assert(freopen("in.in", "rt", stdin)), \
assert(freopen("out.out", "wt", stdout))
#define FastIO() ios::sync_with_stdio(false);
#define debug(x) cout << __LINE__ << ": " << #x << " = " << (x) << endl
inline int readChar();
template <class T = int> inline T readInt();
template <class T> inline void writeInt(T x, char end = 0);
inline void writeChar(int x);
inline void writeWord(const char *s);
/** Read */
static const int buf_size = 4096;
inline int getChar() {
static char buf[buf_size];
static int len = 0, pos = 0;
if (pos == len)
pos = 0, len = fread(buf, 1, buf_size, stdin);
if (pos == len)
return -1;
return buf[pos++];
}
inline int readChar() {
int c = getChar();
while (c <= 32)
c = getChar();
return c;
}
template <class T> inline T readInt() {
int s = 1, c = readChar();
T x = 0;
if (c == '-')
s = -1, c = getChar();
while ('0' <= c && c <= '9')
x = x * 10 + c - '0', c = getChar();
return s == 1 ? x : -x;
}
/** Write */
static int write_pos = 0;
static char write_buf[buf_size];
inline void writeChar(int x) {
if (write_pos == buf_size)
fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
write_buf[write_pos++] = x;
}
template <class T> inline void writeInt(T x, char end) {
if (x < 0)
writeChar('-'), x = -x;
char s[24];
int n = 0;
while (x || !n)
s[n++] = '0' + x % 10, x /= 10;
while (n--)
writeChar(s[n]);
if (end)
writeChar(end);
}
inline void writeWord(const char *s) {
while (*s)
writeChar(*s++);
}
struct Flusher {
~Flusher() {
if (write_pos)
fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
}
} flusher;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int N = 1e7 + 9, M = 1e5 + 9, OO = 0x3f3f3f3f;
const double EPS = 1e-10;
int main() {
#ifdef _LOCAL_DEFINE
IO();
#endif
int n = readInt(), l = readInt();
int mn = OO;
ll sum = 0;
for (int i = 0; i < n; ++i) {
int x = l + i;
sum += x;
mn = (abs(mn) > abs(x)) ? x : mn;
}
writeInt(sum - mn);
return 0;
} | replace | 88 | 89 | 88 | 89 | -6 | d5cc937b-fdd4-4fbb-b454-194905e97da8.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02994/C++/s202288301.cpp:92: int main(): Assertion `freopen("in.in", "rt", stdin)' failed.
|
p02994 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> a(N);
for (int i = 0; i < N; i++) {
a.at(i) = L + i;
}
int ans = 0;
if (a.at(0) >= 0) {
for (int i = 1; i < N; i++) {
ans += a.at(i);
}
} else if (a.at(N) <= 0) {
for (int i = 0; i < N - 1; i++) {
ans += a.at(i);
}
} else {
for (int i = 0; i < N; i++) {
ans += a.at(i);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> a(N);
for (int i = 0; i < N; i++) {
a.at(i) = L + i;
}
int ans = 0;
if (a.at(0) >= 0) {
for (int i = 1; i < N; i++) {
ans += a.at(i);
}
} else if (a.at(N - 1) <= 0) {
for (int i = 0; i < N - 1; i++) {
ans += a.at(i);
}
} else {
for (int i = 0; i < N; i++) {
ans += a.at(i);
}
}
cout << ans << endl;
} | replace | 19 | 20 | 19 | 20 | 0 | |
p02995 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LL long long
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPA(i, n) for (int i = 1; i < (n); ++i)
#define PII pair<int, int>
#define PLI pair<long long, int>
#define PLL pair<long long, long long>
#define PDD pair<double, double>
#define MOD ((int)1e9 + 7)
#define INF ((int)1e9)
#define INFLL ((LL)1e18)
#define ALL(x) (x).begin(), (x).end()
#define ctoi(x) (x - 'a')
#define CTOI(x) (x - 'A')
#define BIT(x) (1 << (x))
using namespace std;
LL modinv(LL a) {
LL b = MOD, u = 1, v = 0;
while (b) {
LL t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= MOD;
if (u < 0)
u += MOD;
return u;
}
LL exp(LL a, LL b) {
LL res = 1;
LL sum = a;
while (b) {
if (b & 1)
res = (res * sum);
sum = (sum * sum);
b >>= 1;
}
return res;
}
double exp(double a, LL b) {
double res = 1;
double sum = a;
while (b) {
if (b & 1)
res = (res * sum);
sum = (sum * sum);
b >>= 1;
}
return res;
}
LL LCM(LL a, LL b) {
LL c = a;
LL d = b;
while (d) {
c %= d;
swap(c, d);
}
return a / c * b;
}
signed main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
LL sum = 0;
LL A, B, C, D;
cin >> A >> B >> C >> D;
sum += B / C;
sum += B / D;
sum -= B / LCM(C, D);
sum -= (A - 1) / C;
sum -= (A - 1) / D;
sum += (A - 1) / LCM(C, D);
cout << B - A + 1 - sum << endl;
return 0;
} | #include <bits/stdc++.h>
#define LL long long
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPA(i, n) for (int i = 1; i < (n); ++i)
#define PII pair<int, int>
#define PLI pair<long long, int>
#define PLL pair<long long, long long>
#define PDD pair<double, double>
#define MOD ((int)1e9 + 7)
#define INF ((int)1e9)
#define INFLL ((LL)1e18)
#define ALL(x) (x).begin(), (x).end()
#define ctoi(x) (x - 'a')
#define CTOI(x) (x - 'A')
#define BIT(x) (1 << (x))
using namespace std;
LL modinv(LL a) {
LL b = MOD, u = 1, v = 0;
while (b) {
LL t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= MOD;
if (u < 0)
u += MOD;
return u;
}
LL exp(LL a, LL b) {
LL res = 1;
LL sum = a;
while (b) {
if (b & 1)
res = (res * sum);
sum = (sum * sum);
b >>= 1;
}
return res;
}
double exp(double a, LL b) {
double res = 1;
double sum = a;
while (b) {
if (b & 1)
res = (res * sum);
sum = (sum * sum);
b >>= 1;
}
return res;
}
LL LCM(LL a, LL b) {
LL c = a;
LL d = b;
while (d) {
c %= d;
swap(c, d);
}
return a / c * b;
}
signed main() {
LL sum = 0;
LL A, B, C, D;
cin >> A >> B >> C >> D;
sum += B / C;
sum += B / D;
sum -= B / LCM(C, D);
sum -= (A - 1) / C;
sum -= (A - 1) / D;
sum += (A - 1) / LCM(C, D);
cout << B - A + 1 - sum << endl;
return 0;
} | delete | 67 | 72 | 67 | 67 | 0 | |
p02995 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
// ユークリッド互除法
long long p = min(c, d);
long long q = max(c, d);
long long r = q % p;
while (r != 0) {
r = q % p;
q = p;
p = r;
}
// long long lcm_cd = c * d / q; //cとdの最小公倍数
long long lcm_cd = c * d / gcd(a, b); // cとdの最小公倍数
long long num_m_c = b / c - (a - 1) / c; // cの倍数の数
long long num_m_d = b / d - (a - 1) / d; // dの倍数の数
long long num_m_cd = b / lcm_cd - (a - 1) / lcm_cd; // c,dの最小公倍数の数
long long ans = b - (a - 1) - (num_m_c + num_m_d - num_m_cd);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
// ユークリッド互除法
long long p = min(c, d);
long long q = max(c, d);
long long r = q % p;
while (r != 0) {
r = q % p;
q = p;
p = r;
}
// long long lcm_cd = c * d / q; //cとdの最小公倍数
long long lcm_cd = c * d / gcd(c, d); // cとdの最小公倍数
long long num_m_c = b / c - (a - 1) / c; // cの倍数の数
long long num_m_d = b / d - (a - 1) / d; // dの倍数の数
long long num_m_cd = b / lcm_cd - (a - 1) / lcm_cd; // c,dの最小公倍数の数
long long ans = b - (a - 1) - (num_m_c + num_m_d - num_m_cd);
cout << ans << endl;
} | replace | 25 | 26 | 25 | 26 | 0 | |
p02995 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define pb push_back
#define MAX 100000000
using namespace std;
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll lc = (c * d) / (__gcd(c, d)), ct1 = 0, ct2 = 0, ct3 = 0, res = b - a + 1;
for (ll i = c; i <= b; i += c) {
if (i >= a)
ct1++;
}
for (ll i = d; i <= b; i += d) {
if (i >= a)
ct2++;
}
for (ll i = lc; i <= b; i += lc) {
if (i >= a)
ct3++;
}
res -= (ct1 + ct2 - ct3);
cout << res;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define pb push_back
#define MAX 100000000
using namespace std;
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll lc = (c * d) / (__gcd(c, d)), res = b - a + 1;
a--;
res -= (b / c - a / c + b / d - a / d - b / lc + a / lc);
cout << res;
return 0;
} | replace | 13 | 28 | 13 | 16 | TLE | |
p02995 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
long long int a, b, c, d, Cmax, Cmin, Dmax, Dmin;
long long int ans;
long long int Emax, Emin;
cin >> a >> b >> c >> d;
Cmax = b / c;
Cmin = a / c;
if (a % c == 0) {
Cmin--;
}
Dmax = b / d;
Dmin = a / d;
if (a % d == 0) {
Dmin--;
}
// 公約数 E
long long int L = 0, g = 0, m, n;
if (c > d) {
m = c;
n = d;
} else {
m = d;
n = c;
}
while (m % n != 0) {
g = m % n;
m = n;
n = g;
}
L = c * d / g;
Emax = b / L;
Emin = a / L;
if (a % L == 0) {
Emin--;
}
ans = (b - a + 1) - (Cmax - Cmin) - (Dmax - Dmin) + (Emax - Emin);
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long int a, b, c, d, Cmax, Cmin, Dmax, Dmin;
long long int ans;
long long int Emax, Emin;
cin >> a >> b >> c >> d;
Cmax = b / c;
Cmin = a / c;
if (a % c == 0) {
Cmin--;
}
Dmax = b / d;
Dmin = a / d;
if (a % d == 0) {
Dmin--;
}
// 公約数 E
long long int L = 0, g = c, m, n;
if (c > d) {
m = c;
n = d;
} else {
m = d;
n = c;
}
while (m % n != 0) {
g = m % n;
m = n;
n = g;
}
L = c * d / g;
Emax = b / L;
Emin = a / L;
if (a % L == 0) {
Emin--;
}
ans = (b - a + 1) - (Cmax - Cmin) - (Dmax - Dmin) + (Emax - Emin);
cout << ans << endl;
return 0;
} | replace | 18 | 19 | 18 | 19 | 0 | |
p02995 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
long long a, b, c, d;
cin >> a >> b >> c >> d;
a--;
long long lcm = (c * d) / __gcd(c, d);
long long abc = (b / c - (a - 1) / c);
long long abd = (b / d - (a - 1) / d);
long long ablcm = (b / ablcm - (a - 1) / ablcm);
long long cnt = b - a - abc - abd + ablcm;
cout << cnt << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
long long a, b, c, d;
cin >> a >> b >> c >> d;
a--;
long long lcm = (c * d) / __gcd(c, d);
long long abc = (b / c - a / c);
long long abd = (b / d - a / d);
long long ablcm = (b / lcm - a / lcm);
long long cnt = b - a - abc - abd + ablcm;
cout << cnt << '\n';
return 0;
} | replace | 13 | 16 | 13 | 16 | 0 | |
p02995 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long h = max(c, d);
d = min(c, d);
c = h;
long long k = 1;
while ((k * c) % d != 0) {
k++;
}
k = k * c;
long long sc = a / c;
if (a % c) {
sc++;
}
long long ec = b / c;
long long sd = a / d;
if (a % d) {
sd++;
}
long long ed = b / d;
long long sk = a / k;
if (a % k) {
sk++;
}
long long ek = b / k;
long long tans = ec + ed + sk - ek - sc - sd + 1;
long long ans = b - a + 1 - tans;
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long h = max(c, d);
d = min(c, d);
c = h;
long long k = __gcd(c, d);
k = d / k;
k = k * c;
long long sc = a / c;
if (a % c) {
sc++;
}
long long ec = b / c;
long long sd = a / d;
if (a % d) {
sd++;
}
long long ed = b / d;
long long sk = a / k;
if (a % k) {
sk++;
}
long long ek = b / k;
long long tans = ec + ed + sk - ek - sc - sd + 1;
long long ans = b - a + 1 - tans;
cout << ans;
}
| replace | 9 | 13 | 9 | 11 | TLE | |
p02995 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
// 最大公約数
long long x, y, gcd = 1;
x = c;
y = d;
long long sw;
if (y < x) {
sw = x;
x = y;
y = sw;
}
vector<long long> gc(1000, 0);
// xの約数
int count = 0;
for (long long i = 1; i * i < x; i++) {
if (x % i == 0) {
count++;
gc.at(count * 2) = i;
gc.at(count * 2 + 1) = x / i;
}
}
sort(gc.begin(), gc.end(), greater<long long>());
for (long long i = 0; i < gc.size(); i++) {
if (y % gc.at(i) == 0) {
gcd = gc.at(i);
break;
}
}
long long v = (c * d) / gcd;
// 個数判定
long long da, db;
da = (a - 1) - ((a - 1) / c + (a - 1) / d - (a - 1) / v); // aの個数
db = b - (b / c + b / d - b / v); // bの個数
long long ans;
ans = db - da;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
// 最大公約数
long long x, y, gcd = 1;
x = c;
y = d;
long long sw;
if (y < x) {
sw = x;
x = y;
y = sw;
}
vector<long long> gc(1000, 1);
// xの約数
int count = 0;
for (long long i = 1; i * i < x; i++) {
if (x % i == 0) {
count++;
gc.at(count * 2) = i;
gc.at(count * 2 + 1) = x / i;
}
}
sort(gc.begin(), gc.end(), greater<long long>());
for (long long i = 0; i < gc.size(); i++) {
if (y % gc.at(i) == 0) {
gcd = gc.at(i);
break;
}
}
long long v = (c * d) / gcd;
// 個数判定
long long da, db;
da = (a - 1) - ((a - 1) / c + (a - 1) / d - (a - 1) / v); // aの個数
db = b - (b / c + b / d - b / v); // bの個数
long long ans;
ans = db - da;
cout << ans << endl;
} | replace | 19 | 20 | 19 | 20 | 0 | |
p02995 | C++ | Runtime Error | #include <bits/stdc++.h>
#define repeat(i, n) for (int(i) = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const double EPS = numeric_limits<double>::epsilon();
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; }
ll f(ll x, ll c, ll d) {
ll result = x;
result -= x / c;
result -= x / d;
result += x / lcm(c, d);
return result;
}
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll result = f(B, C, D) - f(A - 1, C, D);
cout << result << endl;
return 0;
}
| #include <bits/stdc++.h>
#define repeat(i, n) for (int(i) = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const double EPS = numeric_limits<double>::epsilon();
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; }
ll f(ll x, ll c, ll d) {
ll result = x;
result -= x / c;
result -= x / d;
result += x / lcm(c, d);
return result;
}
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll result = f(B, C, D) - f(A - 1, C, D);
cout << result << endl;
return 0;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02995 | C++ | Runtime Error |
// C - Anti-Division
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const int MOD = 1e9 + 7;
ll get_gcd(ll x, ll y) {
if (x < y) {
swap(x, y);
}
ll m = x % y;
while (m != 0) {
x = y;
y = m;
m = x % y;
}
return y;
}
ll get_lcm(ll x, ll y) { return x * y / get_gcd(x, y); }
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
ll lcm_CD = get_lcm(C, D);
ll div_C = B / C - (A - 1) / C;
ll div_D = B / D - (A - 1) / D;
ll div_CD = B / lcm_CD - (A - 1) / lcm_CD;
ll ans = B - A + 1 - (div_C + div_D - div_CD);
cout << ans << endl;
return 0;
} |
// C - Anti-Division
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const int MOD = 1e9 + 7;
ll get_gcd(ll x, ll y) {
if (x < y) {
swap(x, y);
}
ll m = x % y;
while (m != 0) {
x = y;
y = m;
m = x % y;
}
return y;
}
ll get_lcm(ll x, ll y) { return x * y / get_gcd(x, y); }
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll lcm_CD = get_lcm(C, D);
ll div_C = B / C - (A - 1) / C;
ll div_D = B / D - (A - 1) / D;
ll div_CD = B / lcm_CD - (A - 1) / lcm_CD;
ll ans = B - A + 1 - (div_C + div_D - div_CD);
cout << ans << endl;
return 0;
} | replace | 29 | 30 | 29 | 30 | 0 | |
p02995 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
using namespace std;
// typedef tree<ll, null_type, less<ll>, rb_tree_tag,
// tree_order_statistics_node_update> ordered_set;
#define ll long long
#define pb push_back
#define ppb pop_back
#define si set<ll>
#define endl '\n'
#define fr first
#define sc second
#define mii map<ll, ll>
#define msi map<string, ll>
#define mis map<ll, string>
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define sort(v) sort(all(v))
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define vs vector<string>
#define sz(x) (ll) x.size()
#define M 1000000007
#define bs binary_search
#define rev(a) reverse(all(a));
#define sp(n) setprecision(n)
#define spl " "
#define arr(a, n) rep(i, 0, n) cin >> a[i]
#define mod 998244353
#define print_vector(a) \
for (auto t : a) \
cout << t << " "; \
cout << endl;
#define print_arr(a, n) \
rep(i, 0, n) cout << a[i] << " "; \
cout << endl;
#define show(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << " "; \
cout << endl;
#define debug(x) cout << #x << " is " << x << endl;
#define time \
cout << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
#define INF 1ll << 31
#define hi cout << "hi" << endl;
const ll maxn = int(3e5) + 500;
const ll maxa = (1 << 20) + 3;
ll bpow(ll a, ll b, ll mm = M) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % mm;
a = (a * a) % mm;
b >>= 1;
}
return res;
}
void solve() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll g = __gcd(c, d);
g = (c * d) / g;
ll x = b / c;
ll y = (a - 1) / c;
ll z = x - y;
x = b / d;
y = (a - 1) / d;
ll zz = (x - y);
x = b / (g);
y = (a - 1) / (g);
ll zzz = (x - y);
// cout<<zzz<<endl;
ll ans = z + zz - zzz;
// cout<<ans<<endl;
cout << b - a + 1 - ans << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll t = 1;
// cin>>t;
while (t--)
solve();
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
using namespace std;
// typedef tree<ll, null_type, less<ll>, rb_tree_tag,
// tree_order_statistics_node_update> ordered_set;
#define ll long long
#define pb push_back
#define ppb pop_back
#define si set<ll>
#define endl '\n'
#define fr first
#define sc second
#define mii map<ll, ll>
#define msi map<string, ll>
#define mis map<ll, string>
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define sort(v) sort(all(v))
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define vs vector<string>
#define sz(x) (ll) x.size()
#define M 1000000007
#define bs binary_search
#define rev(a) reverse(all(a));
#define sp(n) setprecision(n)
#define spl " "
#define arr(a, n) rep(i, 0, n) cin >> a[i]
#define mod 998244353
#define print_vector(a) \
for (auto t : a) \
cout << t << " "; \
cout << endl;
#define print_arr(a, n) \
rep(i, 0, n) cout << a[i] << " "; \
cout << endl;
#define show(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << " "; \
cout << endl;
#define debug(x) cout << #x << " is " << x << endl;
#define time \
cout << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
#define INF 1ll << 31
#define hi cout << "hi" << endl;
const ll maxn = int(3e5) + 500;
const ll maxa = (1 << 20) + 3;
ll bpow(ll a, ll b, ll mm = M) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % mm;
a = (a * a) % mm;
b >>= 1;
}
return res;
}
void solve() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll g = __gcd(c, d);
g = (c * d) / g;
ll x = b / c;
ll y = (a - 1) / c;
ll z = x - y;
x = b / d;
y = (a - 1) / d;
ll zz = (x - y);
x = b / (g);
y = (a - 1) / (g);
ll zzz = (x - y);
// cout<<zzz<<endl;
ll ans = z + zz - zzz;
// cout<<ans<<endl;
cout << b - a + 1 - ans << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t = 1;
// cin>>t;
while (t--)
solve();
}
| delete | 87 | 91 | 87 | 87 | 0 | |
p02995 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
long a, b, c, d, cd = 0, r[1000000000000]; // cdはcとdの最小公倍数
cin >> a >> b >> c >> d;
r[0] = max(c, d) % min(c, d);
if (r[0] == 0)
cd = c * d / min(c, d);
else {
r[1] = min(c, d) % r[0];
for (int j = 0;; j++) {
if (r[j + 1] == 0) {
cd = c * d / r[j];
break;
} else {
r[j + 2] = r[j] % r[j + 1];
if (r[j + 2] == 0) {
cd = c * d / r[j + 1];
break;
}
}
}
}
cout << (b - (b / c + b / d - b / cd)) -
(a - 1 - ((a - 1) / c + (a - 1) / d - (a - 1) / cd));
return 0;
} | #include <iostream>
using namespace std;
int main() {
long a, b, c, d, cd = 0, r[1000000]; // cdはcとdの最小公倍数
cin >> a >> b >> c >> d;
r[0] = max(c, d) % min(c, d);
if (r[0] == 0)
cd = c * d / min(c, d);
else {
r[1] = min(c, d) % r[0];
for (int j = 0;; j++) {
if (r[j + 1] == 0) {
cd = c * d / r[j];
break;
} else {
r[j + 2] = r[j] % r[j + 1];
if (r[j + 2] == 0) {
cd = c * d / r[j + 1];
break;
}
}
}
}
cout << (b - (b / c + b / d - b / cd)) -
(a - 1 - ((a - 1) / c + (a - 1) / d - (a - 1) / cd));
return 0;
} | replace | 4 | 5 | 4 | 5 | -11 | |
p02995 | C++ | Time Limit Exceeded | #include <iostream>
#define ull unsigned long long
using namespace std;
ull gcd(ull x, ull y) {
ull r;
do {
r = x % y;
x = y;
y = r;
} while (r != 0);
return x;
}
ull hcd(ull x, int y, ull z) { return (x * y / z); }
int main() {
ull a, b, c, d, i, c1 = 0, g, h;
cin >> a >> b >> c >> d;
c1 += b / c - a / c;
if (a % c == 0)
c1++;
c1 += b / d - a / d;
if (a % d == 0)
c1++;
g = gcd(c, d);
h = hcd(c, d, g);
for (i = 1;; i++) {
if (h * i >= a) {
if (h * i <= b) {
c1--;
} else {
break;
}
}
}
cout << b - a - c1 + 1 << endl;
} | #include <iostream>
#define ull unsigned long long
using namespace std;
ull gcd(ull x, ull y) {
ull r;
do {
r = x % y;
x = y;
y = r;
} while (r != 0);
return x;
}
ull hcd(ull x, int y, ull z) { return (x * y / z); }
int main() {
ull a, b, c, d, i, c1 = 0, g, h;
cin >> a >> b >> c >> d;
c1 += b / c - a / c;
if (a % c == 0)
c1++;
c1 += b / d - a / d;
if (a % d == 0)
c1++;
g = gcd(c, d);
h = hcd(c, d, g);
ull l, r;
l = a / h;
r = b / h;
c1 -= r - l;
if (a % h == 0)
c1--;
cout << b - a - c1 + 1 << endl;
} | replace | 24 | 33 | 24 | 30 | TLE | |
p02995 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll findLCD(ll X, ll Y) {
ll g;
ll A = max(X, Y);
ll B = min(X, Y);
ll iniA = A;
ll iniB = B;
if (A == B)
g = A;
else {
if (A % B == 0)
g = B;
while (true) {
g = A % B;
A = B;
B = g;
if (A % B == 0)
break;
}
}
ll a = iniA / g;
ll b = iniB / g;
ll ans = a * b * g;
return ans;
}
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll whole = B - A + 1;
ll ac = A / C;
ll bc = B / C;
ll canC = bc - ac;
if (A % C == 0)
canC++;
ll ad = A / D;
ll bd = B / D;
ll canD = bd - ad;
if (A % D == 0)
canD++;
ll LCD = findLCD(C, D);
ll acd = A / LCD;
ll bcd = B / LCD;
ll canboth = bcd - acd;
if (A % LCD == 0)
canboth++;
ll ans = whole - (canC + canD - canboth);
// cout << canC << endl;
// cout << canD << endl;
// cout << canboth << endl;
// cout << whole << endl;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll findLCD(ll X, ll Y) {
ll g;
ll A = max(X, Y);
ll B = min(X, Y);
ll iniA = A;
ll iniB = B;
if (A == B)
g = A;
else {
if (A % B == 0)
g = B;
else {
while (true) {
g = A % B;
A = B;
B = g;
if (A % B == 0)
break;
}
}
}
ll a = iniA / g;
ll b = iniB / g;
ll ans = a * b * g;
return ans;
}
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll whole = B - A + 1;
ll ac = A / C;
ll bc = B / C;
ll canC = bc - ac;
if (A % C == 0)
canC++;
ll ad = A / D;
ll bd = B / D;
ll canD = bd - ad;
if (A % D == 0)
canD++;
ll LCD = findLCD(C, D);
ll acd = A / LCD;
ll bcd = B / LCD;
ll canboth = bcd - acd;
if (A % LCD == 0)
canboth++;
ll ans = whole - (canC + canD - canboth);
// cout << canC << endl;
// cout << canD << endl;
// cout << canboth << endl;
// cout << whole << endl;
cout << ans << endl;
return 0;
} | replace | 16 | 22 | 16 | 24 | 0 | |
p02995 | C++ | Runtime Error | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define null nullptr
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define mp make_pair
#define test \
int t; \
cin >> t; \
while (t--)
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
using namespace std;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
typedef pair<int, int> pii;
typedef unordered_map<int, int> mp;
const int mod = 1e9 + 7;
const int least = -1e9;
const int most = 1e9;
int lcm(int a, int b) { return ((a * b) / __gcd(a, b)); }
int32_t main() {
FAST;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int a, b;
cin >> a >> b;
int c, d;
cin >> c >> d;
int L = a - 1, R = b;
int div1 = (R / c + R / d - R / lcm(c, d));
int div2 = (L / c + L / d - L / lcm(c, d));
// cout << div1 << " " << div2 << endl;
int first = R - div1;
int secnd = L - div2;
// cout << first << " " << secnd << endl;
cout << (first - secnd) << endl;
return 0;
}
| #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define null nullptr
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define mp make_pair
#define test \
int t; \
cin >> t; \
while (t--)
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
using namespace std;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
typedef pair<int, int> pii;
typedef unordered_map<int, int> mp;
const int mod = 1e9 + 7;
const int least = -1e9;
const int most = 1e9;
int lcm(int a, int b) { return ((a * b) / __gcd(a, b)); }
int32_t main() {
FAST;
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
int a, b;
cin >> a >> b;
int c, d;
cin >> c >> d;
int L = a - 1, R = b;
int div1 = (R / c + R / d - R / lcm(c, d));
int div2 = (L / c + L / d - L / lcm(c, d));
// cout << div1 << " " << div2 << endl;
int first = R - div1;
int secnd = L - div2;
// cout << first << " " << secnd << endl;
cout << (first - secnd) << endl;
return 0;
}
| replace | 36 | 40 | 36 | 40 | 0 | |
p02995 | C++ | Time Limit Exceeded | /*
ID: arunesh2
TASK: ride
LANG: C++
*/
/* LANG can be C++11 or C++14 for those more recent releases */
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
while (a != b) {
if (a > b)
a = a - b;
else
b = b - a;
}
return a;
}
// Function to return LCM of two numbers
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
int main() {
/*ofstream fout ("ride.out");
ifstream fin ("ride.in");*/
ios::sync_with_stdio(0);
cin.tie(0);
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll c1 = a;
ll c2 = b;
while (a % c != 0)
a++;
while (b % c != 0)
b--;
ll n1 = (b - a) / c + 1;
a = c1;
b = c2;
while (a % d != 0)
a++;
while (b % d != 0)
b--;
ll n2 = (b - a) / d + 1;
ll prod = lcm(c, d);
a = c1;
b = c2;
while (a % prod != 0)
a++;
while (b % prod != 0)
b--;
ll n3 = (b - a) / prod + 1;
cout << ((c2 - c1 + 1) - (n1 + n2 - n3)) << "\n";
return 0;
} | /*
ID: arunesh2
TASK: ride
LANG: C++
*/
/* LANG can be C++11 or C++14 for those more recent releases */
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
while (a != b) {
if (a > b)
a = a - b;
else
b = b - a;
}
return a;
}
// Function to return LCM of two numbers
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
int main() {
/*ofstream fout ("ride.out");
ifstream fin ("ride.in");*/
ios::sync_with_stdio(0);
cin.tie(0);
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll c1 = a;
ll c2 = b;
ll n1 = b / c;
ll n2 = (a - 1) / c;
ll n3 = b / d;
ll n4 = (a - 1) / d;
ll n5 = lcm(c, d);
ll n6 = (b / n5) - ((a - 1) / n5);
cout << ((b - a + 1) - ((n1 - n2) + (n3 - n4) - n6)) << "\n";
return 0;
} | replace | 31 | 52 | 31 | 38 | TLE | |
p02995 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long count = 0;
for (long long i = a; a <= i && i <= b; ++i) {
if (i % c != 0 && i % d != 0) {
++count;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long ans = b - a + 1;
ans -= ((b / c) - ((a - 1) / c));
ans -= ((b / d) - ((a - 1) / d));
long long p = (d * c) / __gcd(d, c);
ans += ((b / p)) - ((a - 1) / (p));
cout << ans << endl;
} | replace | 6 | 13 | 6 | 12 | TLE | |
p02995 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
a--;
ll e = a / __gcd(a, b) * b;
ll ans = b - (b / c) - (b / d) + (b / e) - a + (a / c) + (a / d) - (a / e);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
a--;
ll e = c * d / __gcd(c, d);
ll ans = b - (b / c) - (b / d) + (b / e) - a + (a / c) + (a / d) - (a / e);
cout << ans << endl;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02995 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gd(ll x, ll y) {
if (x <= y)
return gd(y, x);
if (x % y == 0)
return y;
else
return gd(min(x, y), max(x, y) % min(x, y));
}
ll lm(ll x, ll y) { return (x * y) / gd(x, y); }
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
cout << b - a + 1 - (b / c - (a - 1) / c) - (b / d - (a - 1) / d) +
(b / lm(c, d) - (a - 1) / lm(c, d))
<< endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gd(ll x, ll y) {
if (x < y)
return gd(y, x);
if (x % y == 0)
return y;
else
return gd(min(x, y), max(x, y) % min(x, y));
}
ll lm(ll x, ll y) { return (x * y) / gd(x, y); }
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
cout << b - a + 1 - (b / c - (a - 1) / c) - (b / d - (a - 1) / d) +
(b / lm(c, d) - (a - 1) / lm(c, d))
<< endl;
} | replace | 5 | 6 | 5 | 6 | TLE | |
p02995 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <map>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const double pi = acos(-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; }
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
if (c == 1 || d == 1) {
cout << 0 << endl;
return 0;
}
ll num_of_C = 0, num_of_D = 0, num_of_lcm = 0;
ll numC;
if (a <= c)
numC = c;
else {
numC = a / c * c;
if (a % c != 0)
numC += c;
}
for (ll i = numC; i <= b; i += c) {
++num_of_C;
}
ll numD;
if (a <= d)
numD = d;
else {
numD = a / d * d;
if (a % d != 0)
numD += d;
}
for (ll i = numD; i <= b; i += d) {
++num_of_D;
}
ll num = lcm(c, d);
ll numlcm;
if (a <= num)
numlcm = num;
else {
numlcm = a / num * num;
if (a % num != 0)
numlcm += num;
}
for (ll i = numlcm; i <= b; i += num) {
++num_of_lcm;
}
cout << b - a + 1 - num_of_C - num_of_D + num_of_lcm << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <map>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const double pi = acos(-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; }
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
if (c == 1 || d == 1) {
cout << 0 << endl;
return 0;
}
ll numC = b / c - a / c;
if (a % c == 0)
numC++;
ll numD = b / d - a / d;
if (a % d == 0)
numD++;
ll numlcm = b / lcm(c, d) - a / lcm(c, d);
if (a % lcm(c, d) == 0)
numlcm++;
cout << b - a + 1 - numC - numD + numlcm << endl;
} | replace | 20 | 56 | 20 | 30 | TLE | |
p02995 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
ll a, b, c, d, r1, r2;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main() {
cin >> a >> b >> c >> d;
--a;
r1 = b - b / c - b / d + b / lcm(c, d);
r2 = a - a / c - a / a + a / lcm(c, d);
cout << r1 - r2 << endl;
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
ll a, b, c, d, r1, r2;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main() {
cin >> a >> b >> c >> d;
--a;
r1 = b - b / c - b / d + b / lcm(c, d);
r2 = a - a / c - a / d + a / lcm(c, d);
cout << r1 - r2 << endl;
return 0;
} | replace | 37 | 38 | 37 | 38 | 0 | |
p02995 | C++ | Runtime Error | #include <iostream>
using namespace std;
/* a と b の最大公約数を返す関数 */
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
long long f1(long long X1, long long C1, long long D1) {
long long G1 = GCD(C1, D1);
long long L1 = C1 / G1 * D1;
return X1 - X1 / C1 - X1 / D1 + X1 / L1;
}
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
cout << f1(B, C, D) - f1(A - 1, C, D) << endl;
}
| #include <iostream>
using namespace std;
/* a と b の最大公約数を返す関数 */
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
long long f1(long long X1, long long C1, long long D1) {
long long G1 = GCD(C1, D1);
long long L1 = C1 / G1 * D1;
return X1 - X1 / C1 - X1 / D1 + X1 / L1;
}
int main() {
long long A, B, C, D;
cin >> A >> B >> C >> D;
cout << f1(B, C, D) - f1(A - 1, C, D) << endl;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p02995 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
ll gcd(ll c, ll d) { return c ? gcd(c, d % c) : c; }
ll lcm(ll c, ll d) { return (c / gcd(c, d) * d); }
ll f(ll x, ll c, ll d) {
ll res = x;
res -= x / c;
res -= x / d;
res += x / lcm(c, d);
return res;
}
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll ans = 0;
ans = f(b, c, d) - f(a - 1, c, d);
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
ll gcd(ll c, ll d) { return d ? gcd(d, c % d) : c; }
ll lcm(ll c, ll d) { return (c / gcd(c, d) * d); }
ll f(ll x, ll c, ll d) {
ll res = x;
res -= x / c;
res -= x / d;
res += x / lcm(c, d);
return res;
}
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll ans = 0;
ans = f(b, c, d) - f(a - 1, c, d);
cout << ans << endl;
}
| replace | 5 | 6 | 5 | 6 | TLE | |
p02995 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll b, ll c) { return c ? gcd(c, b % c) : b; }
ll lcm(ll b, ll c) { return b / gcd(b, c) * c; }
ll f(ll a, ll b, ll c) {
ll ans = a;
ans -= a / b;
ans -= a / c;
ans += a / lcm(b, c);
return ans;
}
int main() {
ll A, B, C, D;
cin >> A, B, C, D;
ll ans = f(B, C, D) - f(A - 1, C, D);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll b, ll c) { return c ? gcd(c, b % c) : b; }
ll lcm(ll b, ll c) { return b / gcd(b, c) * c; }
ll f(ll a, ll b, ll c) {
ll ans = a;
ans -= a / b;
ans -= a / c;
ans += a / lcm(b, c);
return ans;
}
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll ans = f(B, C, D) - f(A - 1, C, D);
cout << ans << endl;
}
| replace | 20 | 21 | 20 | 22 | 0 | |
p02995 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b, c, d;
cin >> a >> b >> c >> d;
int g = (c * d) / __gcd(c, d);
// cout << g << endl;
int factc = (b / c) - ((a - 1) / c);
int factd = (b / d) - ((a - 1) / d);
int factcom = ((b / (g)) - ((a - 1) / (g)));
// cout << factc << factd << factcom << endl;
// factc-=factcom;
// factd-=factcom;
cout << (b - a + 1) - (factc + factd - factcom);
} | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
int32_t main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b, c, d;
cin >> a >> b >> c >> d;
int g = (c * d) / __gcd(c, d);
// cout << g << endl;
int factc = (b / c) - ((a - 1) / c);
int factd = (b / d) - ((a - 1) / d);
int factcom = ((b / (g)) - ((a - 1) / (g)));
// cout << factc << factd << factcom << endl;
// factc-=factcom;
// factd-=factcom;
cout << (b - a + 1) - (factc + factd - factcom);
} | replace | 6 | 10 | 6 | 10 | 0 | |
p02995 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long lcm(long long x, long long y) {
long long sum = x * y;
long long tmp = x;
long long i = y;
long long ret;
if (x > y) {
tmp = y;
i = x;
}
ret = i % tmp;
while (ret != 0LL) {
i = tmp;
tmp = ret;
ret = i % tmp;
}
return (sum / ret);
}
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long a_to = ((a - 1LL) / c) + ((a - 1LL) / d) - ((a - 1LL) / lcm(c, d));
long long b_to = (b / c) + (b / d) - (b / lcm(c, d));
long long ret = (b - a + 1LL) - (b_to - a_to);
cout << ret << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long lcm(long long x, long long y) {
long long sum = x * y;
long long tmp = x;
long long i = y;
long long ret;
if (x > y) {
tmp = y;
i = x;
}
ret = i % tmp;
while (ret != 0LL) {
i = tmp;
tmp = ret;
ret = i % tmp;
}
return (sum / tmp);
}
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long a_to = ((a - 1LL) / c) + ((a - 1LL) / d) - ((a - 1LL) / lcm(c, d));
long long b_to = (b / c) + (b / d) - (b / lcm(c, d));
long long ret = (b - a + 1LL) - (b_to - a_to);
cout << ret << endl;
}
| replace | 24 | 25 | 24 | 25 | -8 | |
p02995 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, C, D;
cin >> A >> B >> C >> D;
long long Cdiv = B / C - (A - 1) / C;
long long Ddiv = B / D - (A - 1) / D;
long long CDdiv;
long long minCD = min(C, D);
long long lcm;
long long gcd = 1;
long long Cs = C;
long long Ds = D;
int i = 2;
while (i < Cs + 1 && i < Ds + 1) {
while (Cs % i == 0 && Ds % i == 0) {
gcd *= i;
Cs /= i;
Ds /= i;
}
i++;
}
lcm = C * D / gcd;
CDdiv = B / lcm - (A - 1) / lcm;
cout << (B - A + 1) - (Cdiv + Ddiv - CDdiv) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, C, D;
cin >> A >> B >> C >> D;
long long Cdiv = B / C - (A - 1) / C;
long long Ddiv = B / D - (A - 1) / D;
long long CDdiv;
long long minCD = min(C, D);
long long lcm;
long long gcd = 1;
long long Cs = C;
long long Ds = D;
int i = 2;
while (i < sqrt(Cs) + 1 && i < sqrt(Ds) + 1) {
while (Cs % i == 0 && Ds % i == 0) {
gcd *= i;
Cs /= i;
Ds /= i;
}
i++;
}
lcm = C * D / gcd;
CDdiv = B / lcm - (A - 1) / lcm;
cout << (B - A + 1) - (Cdiv + Ddiv - CDdiv) << endl;
return 0;
}
| replace | 15 | 16 | 15 | 16 | TLE | |
p02995 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y)
return gcd(y, x % y);
else
return x;
}
int main(void) {
long long a, b, po = 0;
int c, d, t;
po += b / c - (a - 1) / c;
po += b / d - (a - 1) / d;
t = c * d / gcd(c, d);
po -= b / t - (a - 1) / t;
cout << b - a + 1 - po << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y)
return gcd(y, x % y);
else
return x;
}
int main(void) {
long long a, b, po = 0, c, d, t;
cin >> a >> b >> c >> d;
po += b / c - (a - 1) / c;
po += b / d - (a - 1) / d;
t = c * d / gcd(c, d);
po -= b / t - (a - 1) / t;
cout << b - a + 1 - po << endl;
return 0;
} | replace | 11 | 13 | 11 | 13 | 0 | |
p02995 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; template<typename T, typename L> using
gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>,
rb_tree_tag, tree_order_statistics_node_update>;*/
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL << (n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
{ \
cout << #v << "=" << endl; \
REP(i_debug, v.size()) { cout << v[i_debug] << ","; } \
cout << endl; \
}
#define mdebug(m) \
{ \
cout << #m << "=" << endl; \
REP(i_debug, m.size()) { \
REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; } \
cout << endl; \
} \
}
#define Return(ans) \
{ \
cout << (ans) << endl; \
return 0; \
}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i];
if (i != v.size() - 1)
cout << endl;
};
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
cout << '(' << p.first << ',' << p.second << ')';
return os;
}
template <typename T> void Out(T x) { cout << x << endl; }
template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {
if (f)
Out(y);
else
Out(n);
}
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
// int dx[4] = {1,0,-1,0};
// int dy[4] = {0,1,0,-1};
// char d[4] = {'D','R','U','L'};
const int mod = 1000000007;
// const int mod = 998244353;
// #define Add(x, y) x = (x + (y)) % mod
// #define Mult(x, y) x = (x * (y)) % mod
#include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
signed main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
A--;
int ans = B - B / C / -B / D + B / (C * D / GCD(C, D));
ans -= A - A / C / -A / D + A / (C * D / GCD(C, D));
Out(ans);
}
| #include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; template<typename T, typename L> using
gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>,
rb_tree_tag, tree_order_statistics_node_update>;*/
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL << (n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
{ \
cout << #v << "=" << endl; \
REP(i_debug, v.size()) { cout << v[i_debug] << ","; } \
cout << endl; \
}
#define mdebug(m) \
{ \
cout << #m << "=" << endl; \
REP(i_debug, m.size()) { \
REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; } \
cout << endl; \
} \
}
#define Return(ans) \
{ \
cout << (ans) << endl; \
return 0; \
}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i];
if (i != v.size() - 1)
cout << endl;
};
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
cout << '(' << p.first << ',' << p.second << ')';
return os;
}
template <typename T> void Out(T x) { cout << x << endl; }
template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {
if (f)
Out(y);
else
Out(n);
}
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
// int dx[4] = {1,0,-1,0};
// int dy[4] = {0,1,0,-1};
// char d[4] = {'D','R','U','L'};
const int mod = 1000000007;
// const int mod = 998244353;
// #define Add(x, y) x = (x + (y)) % mod
// #define Mult(x, y) x = (x * (y)) % mod
#include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
signed main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
A--;
int ans = B - B / C - B / D + B / (C * D / GCD(C, D));
ans -= A - A / C - A / D + A / (C * D / GCD(C, D));
Out(ans);
}
| replace | 115 | 117 | 115 | 117 | 0 | |
p02995 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
ll Pow(ll a, ll b, ll c) {
ll ans = 1;
a %= c;
while (b) {
if (b & 1)
ans = (ans * a) % c;
a = (a * a) % c;
b >>= 1;
}
return (ans % c);
}
bool cmp(const int &a, const int &b) { return a < b; }
ll gcd(ll x, ll y) { return x % y == 0 ? y : gcd(y, x % y); }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main() {
ll a, b, c, d;
scanf("%lld%lld%lld%lld", &a, &b, &c, &d);
ll tmp = lcm(c, d);
ll cnt = 0;
ll i, j, k;
if (a % tmp)
i = (a / tmp + 1) * tmp;
else
i = a;
if (a % c)
j = (a / c + 1) * c;
else
j = a;
if (a % d)
k = (a / d + 1) * d;
else
k = a;
for (; i <= b; i += tmp)
cnt--;
for (; j <= b; j += c)
cnt++;
for (; k <= b; k += d)
cnt++;
printf("%lld\n", b - a + 1 - cnt);
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
ll Pow(ll a, ll b, ll c) {
ll ans = 1;
a %= c;
while (b) {
if (b & 1)
ans = (ans * a) % c;
a = (a * a) % c;
b >>= 1;
}
return (ans % c);
}
bool cmp(const int &a, const int &b) { return a < b; }
ll gcd(ll x, ll y) { return x % y == 0 ? y : gcd(y, x % y); }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main() {
ll a, b, c, d;
scanf("%lld%lld%lld%lld", &a, &b, &c, &d);
ll tmp = lcm(c, d);
ll t1 = b / c - (a - 1) / c;
ll t2 = b / d - (a - 1) / d;
ll t3 = b / tmp - (a - 1) / tmp;
printf("%lld\n", b - a + 1 - t1 - t2 + t3);
return 0;
}
| replace | 27 | 48 | 27 | 31 | TLE | |
p02995 | Python | Runtime Error | from math import gcd
def main():
A, B, C, D = map(int, input().split())
Q_AC, R_AC = A // C, A % C
Q_AD, R_AD = A // D, A % D
Q_BC, R_BC = B // C, B % C
Q_BD, R_BD = B // D, B % D
Q_ACD, R_ACD = A // lcm(C, D), A % lcm(C, D)
Q_BCD, R_BCD = B // lcm(C, D), B % lcm(C, D)
N_C = num_baisu(Q_AC, Q_BC, R_AC, R_BC)
N_D = num_baisu(Q_AD, Q_BD, R_AD, R_BD)
N_CD = num_baisu(Q_ACD, Q_BCD, R_ACD, R_BCD)
print(B - A + 1 - (N_C + N_D - N_CD))
return
def lcm(x, y):
return (x * y) // gcd(x, y)
def num_baisu(Q_A, Q_B, R_A, R_B):
if R_A == 0 and R_B == 0:
return Q_B - Q_A + 1
elif R_A == 0 and R_B != 0:
return Q_B - Q_A + 1
elif R_A != 0 and R_B == 0:
return Q_B - (Q_A + 1) + 1
else:
return Q_B - (Q_A + 1) + 1
if __name__ == "__main__":
main()
| from fractions import gcd
def main():
A, B, C, D = map(int, input().split())
Q_AC, R_AC = A // C, A % C
Q_AD, R_AD = A // D, A % D
Q_BC, R_BC = B // C, B % C
Q_BD, R_BD = B // D, B % D
Q_ACD, R_ACD = A // lcm(C, D), A % lcm(C, D)
Q_BCD, R_BCD = B // lcm(C, D), B % lcm(C, D)
N_C = num_baisu(Q_AC, Q_BC, R_AC, R_BC)
N_D = num_baisu(Q_AD, Q_BD, R_AD, R_BD)
N_CD = num_baisu(Q_ACD, Q_BCD, R_ACD, R_BCD)
print(B - A + 1 - (N_C + N_D - N_CD))
return
def lcm(x, y):
return (x * y) // gcd(x, y)
def num_baisu(Q_A, Q_B, R_A, R_B):
if R_A == 0 and R_B == 0:
return Q_B - Q_A + 1
elif R_A == 0 and R_B != 0:
return Q_B - Q_A + 1
elif R_A != 0 and R_B == 0:
return Q_B - (Q_A + 1) + 1
else:
return Q_B - (Q_A + 1) + 1
if __name__ == "__main__":
main()
| replace | 0 | 1 | 0 | 1 | 0 | |
p02995 | Python | Runtime Error | from math import gcd
A, B, C, D = [int(x) for x in input().split(" ")]
c = (B // C) - (A // C) + int(A % C == 0)
d = (B // D) - (A // D) + int(A % D == 0)
lcm_cd = (C * D) // gcd(C, D)
cd = (B // (lcm_cd)) - (A // (lcm_cd)) + int(A % (lcm_cd) == 0)
c_or_d = c + d - cd
print((B - A + 1) - c_or_d)
| from fractions import gcd
A, B, C, D = [int(x) for x in input().split(" ")]
c = (B // C) - (A // C) + int(A % C == 0)
d = (B // D) - (A // D) + int(A % D == 0)
lcm_cd = (C * D) // gcd(C, D)
cd = (B // (lcm_cd)) - (A // (lcm_cd)) + int(A % (lcm_cd) == 0)
c_or_d = c + d - cd
print((B - A + 1) - c_or_d)
| replace | 0 | 1 | 0 | 1 | 0 | |
p02995 | Python | Runtime Error | from math import gcd
A, B, C, D = map(int, input().split())
C_div = B // C - (A - 1) // C
D_div = B // D - (A - 1) // D
CD = C * D // gcd(C, D)
CD_div = B // CD - (A - 1) // CD
print(B - A + 1 - C_div - D_div + CD_div)
| from fractions import gcd
A, B, C, D = map(int, input().split())
C_div = B // C - (A - 1) // C
D_div = B // D - (A - 1) // D
CD = C * D // gcd(C, D)
CD_div = B // CD - (A - 1) // CD
print(B - A + 1 - C_div - D_div + CD_div)
| replace | 0 | 1 | 0 | 1 | 0 | |
p02995 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF 1e18
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
int gcd(int x, int y) {
if (max(x, y) % min(x, y) == 0)
return y;
return gcd(min(x, y), max(x, y) % min(x, y));
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
int func(int x, int c, int d) { return x - (x / c + x / d - x / (lcm(c, d))); }
signed main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int ans = func(b, c, d) - func(a - 1, c, d);
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF 1e18
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
int gcd(int x, int y) { return (y ? gcd(y, x % y) : x); }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
int func(int x, int c, int d) { return x - (x / c + x / d - x / (lcm(c, d))); }
signed main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int ans = func(b, c, d) - func(a - 1, c, d);
cout << ans << endl;
}
| replace | 17 | 22 | 17 | 18 | 0 | |
p02995 | Python | Runtime Error | from math import gcd
A, B, C, D = map(int, input().split())
G = gcd(C, D)
L = C * D // G
ca = (A - 1) // C
cb = B // C
da = (A - 1) // D
db = B // D
la = (A - 1) // L
lb = B // L
div = cb + db - (ca + da) - (lb - la)
print(B - (A - 1) - div)
| from fractions import gcd
A, B, C, D = map(int, input().split())
G = gcd(C, D)
L = C * D // G
ca = (A - 1) // C
cb = B // C
da = (A - 1) // D
db = B // D
la = (A - 1) // L
lb = B // L
div = cb + db - (ca + da) - (lb - la)
print(B - (A - 1) - div)
| replace | 0 | 1 | 0 | 1 | 0 | |
p02995 | Python | Runtime Error | from math import gcd
a, b, c, d = map(int, input().split())
e = (c * d) // gcd(c, d)
c_min = a + (c - a % c) if (a % c) != 0 else a
c_max = b - b % c
d_min = a + (d - a % d) if (a % d) != 0 else a
d_max = b - b % d
e_min = a + (e - a % e) if (a % e) != 0 else a
e_max = b - b % e
n_c = (c_max - c_min) // c + 1 if c_min <= c_max else 0
n_d = (d_max - d_min) // d + 1 if d_min <= d_max else 0
n_e = (e_max - e_min) // e + 1 if e_min <= e_max else 0
ans = b - a + 1 - n_c - n_d + n_e
print(ans)
| from fractions import gcd
a, b, c, d = map(int, input().split())
e = (c * d) // gcd(c, d)
c_min = a + (c - a % c) if (a % c) != 0 else a
c_max = b - b % c
d_min = a + (d - a % d) if (a % d) != 0 else a
d_max = b - b % d
e_min = a + (e - a % e) if (a % e) != 0 else a
e_max = b - b % e
n_c = (c_max - c_min) // c + 1 if c_min <= c_max else 0
n_d = (d_max - d_min) // d + 1 if d_min <= d_max else 0
n_e = (e_max - e_min) // e + 1 if e_min <= e_max else 0
ans = b - a + 1 - n_c - n_d + n_e
print(ans)
| replace | 0 | 1 | 0 | 1 | 0 | |
p02995 | Python | Runtime Error | from math import gcd
a, b, c, d = map(int, input().split())
def cnt_div(a, b, x):
q, r = divmod(a, x)
if r == 0:
m = q - 1
else:
m = q
n = b // x
return n - m
num_c = cnt_div(a, b, c)
num_d = cnt_div(a, b, d)
lcm = int((c * d) / gcd(c, d))
num_c_d_gcd = cnt_div(a, b, lcm)
print((b - a + 1) - (num_c + num_d - num_c_d_gcd))
| from fractions import gcd
a, b, c, d = map(int, input().split())
def cnt_div(a, b, x):
q, r = divmod(a, x)
if r == 0:
m = q - 1
else:
m = q
n = b // x
return n - m
num_c = cnt_div(a, b, c)
num_d = cnt_div(a, b, d)
lcm = int((c * d) / gcd(c, d))
num_c_d_gcd = cnt_div(a, b, lcm)
print((b - a + 1) - (num_c + num_d - num_c_d_gcd))
| replace | 0 | 1 | 0 | 1 | 0 | |
p02995 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
#define repi(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2i(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define deg2rad(deg) (((deg) / 360) * 2 * M_PI)
#define rad2deg(rad) (((rad) / 2 / M_PI) * 360)
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
const ll INF = (1LL << 60);
const int INFi = (1 << 29);
/*素数判定*/
bool is_prime(ll n) {
if (n == 1)
return false;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
/*約数列挙*/
vll enum_divisors(ll n) {
vll l;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
l.push_back(i);
if (n / i != i)
l.push_back(n / i);
}
}
sort(all(l));
return l;
}
/*素因数分解*/
vector<P> prime_factorize(ll n) {
vector<P> l;
for (ll i = 2; i * i <= n; i++) {
if (n % i != 0)
continue;
ll e = 0;
while (n % i == 0) {
e++;
n /= i;
}
l.push_back({i, e});
}
if (n != 1)
l.push_back({n, 1});
return l;
}
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll cnt_a = 0, cnt_b = 0;
rep(i, a) if (i % c != 0 && i % d != 0) cnt_a++;
rep(i, b + 1) if (i % c != 0 && i % d != 0) cnt_b++;
cout << cnt_b - cnt_a << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
#define repi(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2i(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define deg2rad(deg) (((deg) / 360) * 2 * M_PI)
#define rad2deg(rad) (((rad) / 2 / M_PI) * 360)
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
const ll INF = (1LL << 60);
const int INFi = (1 << 29);
/*素数判定*/
bool is_prime(ll n) {
if (n == 1)
return false;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
/*約数列挙*/
vll enum_divisors(ll n) {
vll l;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
l.push_back(i);
if (n / i != i)
l.push_back(n / i);
}
}
sort(all(l));
return l;
}
/*素因数分解*/
vector<P> prime_factorize(ll n) {
vector<P> l;
for (ll i = 2; i * i <= n; i++) {
if (n % i != 0)
continue;
ll e = 0;
while (n % i == 0) {
e++;
n /= i;
}
l.push_back({i, e});
}
if (n != 1)
l.push_back({n, 1});
return l;
}
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
a--;
cout << (b - ((b / c + b / d) - (b / (c * d / __gcd(c, d))))) -
(a - ((a / c + a / d) - (a / (c * d / __gcd(c, d)))))
<< endl;
return 0;
} | replace | 71 | 76 | 71 | 75 | TLE | |
p02995 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int x, long long int y) {
long long int tmp;
long long int r;
if (x > y) {
tmp = x;
x = y;
y = tmp;
}
r = y % x;
while (r != 0) {
y = x;
x = r;
r = y % x;
}
return x;
}
int main() {
long long int a, b, c, d, i;
long long int ans = (b - a + 1) - (b / c - a / c) - (b / d - a / d);
long long int g = gcd(c, d);
ans += (b / g - a / g);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int x, long long int y) {
long long int tmp;
long long int r;
if (x > y) {
tmp = x;
x = y;
y = tmp;
}
r = y % x;
while (r != 0) {
y = x;
x = r;
r = y % x;
}
return x;
}
int main() {
long long int a, b, c, d, i;
cin >> a >> b >> c >> d;
long long int ans =
(b - a + 1) - (b / c - (a - 1) / c) - (b / d - (a - 1) / d);
long long int g = c * d / gcd(c, d);
ans += (b / g - (a - 1) / g);
cout << ans << endl;
} | replace | 22 | 25 | 22 | 27 | 0 | |
p02995 | C++ | Runtime Error | #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;
ll high_gcd(ll a, ll b) {
if (b == 0)
return 0;
return high_gcd(b, a % b);
}
ll kosuu(ll a, ll b, ll c) {
ll d = (a + c - 1) / c;
ll e = b / c;
ll ans = e - d + 1;
return ans;
}
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
if (C < D) {
swap(C, D);
}
ll gcd = high_gcd(C, D);
ll lcm = C / gcd * D;
ll ans = B - A + 1;
ll kazu = 0;
kazu = kosuu(A, B, C);
ans -= kazu;
kazu = kosuu(A, B, D);
ans -= kazu;
kazu = kosuu(A, B, lcm);
ans += kazu;
cout << ans << endl;
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;
ll high_gcd(ll a, ll b) { return b ? high_gcd(b, a % b) : a; }
ll kosuu(ll a, ll b, ll c) {
ll d = (a + c - 1) / c;
ll e = b / c;
ll ans = e - d + 1;
return ans;
}
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
if (C < D) {
swap(C, D);
}
ll gcd = high_gcd(C, D);
ll lcm = C / gcd * D;
ll ans = B - A + 1;
ll kazu = 0;
kazu = kosuu(A, B, C);
ans -= kazu;
kazu = kosuu(A, B, D);
ans -= kazu;
kazu = kosuu(A, B, lcm);
ans += kazu;
cout << ans << endl;
return 0;
}
| replace | 43 | 48 | 43 | 44 | -8 | |
p02995 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a, b, c, d, g, x = 0;
cin >> a >> b >> c >> d;
for (int64_t h = min(c, d) / 2; h > 0; h--) {
if (c % h == 0 && d % h == 0) {
g = h;
break;
}
}
x = c * d / g;
cout << (b - a + 1) - (b / c + b / d + (a - 1) / x) +
((a - 1) / c + (a - 1) / d + b / x)
<< endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a, b, c, d, g, x = 0;
cin >> a >> b >> c >> d;
x = c * d / __gcd(c, d);
cout << (b - a + 1) - (b / c + b / d + (a - 1) / x) +
((a - 1) / c + (a - 1) / d + b / x)
<< endl;
} | replace | 8 | 16 | 8 | 9 | 0 | |
p02995 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll r;
while (b != 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll cnt_b = 0;
ll cnt_a = 0;
ll t_a = 0, t_b = 0;
ll g = gcd(C, D);
ll l = C * D / g;
for (ll i = l; i <= B; i += l) {
t_b++;
}
for (ll i = l; i < A; i += l) {
t_a++;
}
ll num_c = B / C;
ll num_d = B / D;
cnt_b = B - num_c - num_d + t_b;
ll c = (A - 1) / C;
ll d = (A - 1) / D;
cnt_a = A - 1 - c - d + t_a;
cout << cnt_b - cnt_a << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll r;
while (b != 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll cnt_b = 0;
ll cnt_a = 0;
ll t_a = 0, t_b = 0;
ll g = gcd(C, D);
ll l = C * D / g;
t_b = B / l;
t_a = (A - 1) / l;
ll num_c = B / C;
ll num_d = B / D;
cnt_b = B - num_c - num_d + t_b;
ll c = (A - 1) / C;
ll d = (A - 1) / D;
cnt_a = A - 1 - c - d + t_a;
cout << cnt_b - cnt_a << endl;
return 0;
}
| replace | 26 | 33 | 26 | 28 | TLE | |
p02995 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
template <typename T> T gcd(T a, T b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
template <typename T> T lcm(T a, T b) { return a * b / gcd(a, b); }
void Main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long g = gcd(c, d);
long long l = c / g * d;
long long ans = 0;
for (long long i = l * (a / l + 1); i <= l * (b / l + 1); i += l) {
long long diff = min(b, i) - max(a, i - l);
ans += diff;
ans -= diff / c;
ans -= diff / d;
if (diff == l)
ans++;
}
cout << ans << endl;
}
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
template <typename T> T gcd(T a, T b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
template <typename T> T lcm(T a, T b) { return a * b / gcd(a, b); }
void Main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long g = gcd(c, d);
long long l = c / g * d;
long long bb = b - b / c - b / d + b / l;
a--;
long long aa = a - a / c - a / d + a / l;
cout << bb - aa << endl;
}
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
| replace | 19 | 29 | 19 | 23 | TLE | |
p02995 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
// #include "graph.cpp"
#define ll long long
#define loop(i, n) for (int i = 0; i < n; ++i)
#define rep(i, x, n) for (int i = x; i <= n; ++i)
#define iteloop(type, data, name, it) \
for (type<data>::iterator it = name.begin(); it != name.end(); ++it)
using namespace std;
using namespace __gnu_pbds;
ll a, b, c, d;
// Recursive function to return gcd of a and b
ll gcd(ll an, ll bn) {
if (bn == 0)
return an;
return gcd(bn, an % bn);
}
int main() {
cin.sync_with_stdio(false), cin.tie(0), cout.tie(0);
freopen("in.txt", "rt", stdin);
cin >> a >> b >> c >> d;
ll div1 = a / c;
ll div2 = b / c;
ll divC = div2 - div1;
if (a % c == 0) {
divC++;
}
div1 = a / d;
div2 = b / d;
ll divD = div2 - div1;
if (a % d == 0) {
divD++;
}
ll gcdNum = gcd(c, d);
ll lcm = (c * d) / gcdNum;
div1 = a / lcm;
div2 = b / lcm;
ll divLcm = div2 - div1;
if (a % lcm == 0) {
divLcm++;
}
ll range = b - a + 1;
range -= divC;
range -= divD;
range += divLcm;
cout << range << endl;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
// #include "graph.cpp"
#define ll long long
#define loop(i, n) for (int i = 0; i < n; ++i)
#define rep(i, x, n) for (int i = x; i <= n; ++i)
#define iteloop(type, data, name, it) \
for (type<data>::iterator it = name.begin(); it != name.end(); ++it)
using namespace std;
using namespace __gnu_pbds;
ll a, b, c, d;
// Recursive function to return gcd of a and b
ll gcd(ll an, ll bn) {
if (bn == 0)
return an;
return gcd(bn, an % bn);
}
int main() {
cin.sync_with_stdio(false), cin.tie(0), cout.tie(0);
// freopen("in.txt","rt",stdin);
cin >> a >> b >> c >> d;
ll div1 = a / c;
ll div2 = b / c;
ll divC = div2 - div1;
if (a % c == 0) {
divC++;
}
div1 = a / d;
div2 = b / d;
ll divD = div2 - div1;
if (a % d == 0) {
divD++;
}
ll gcdNum = gcd(c, d);
ll lcm = (c * d) / gcdNum;
div1 = a / lcm;
div2 = b / lcm;
ll divLcm = div2 - div1;
if (a % lcm == 0) {
divLcm++;
}
ll range = b - a + 1;
range -= divC;
range -= divD;
range += divLcm;
cout << range << endl;
} | replace | 21 | 22 | 21 | 22 | -8 | |
p02995 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll a, b, c, d;
cin >> a >> b >> c >> d;
int count = 0;
for (int i = a; i <= b; i++) {
if (i % c != 0 && i % d != 0)
count++;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll div_c = b / c - (a - 1) / c;
ll div_d = b / d - (a - 1) / d;
ll count = div_c + div_d - (b / (c * d / (__gcd(c, d)))) +
((a - 1) / (c * d / (__gcd(c, d))));
ll ans = abs(b - a + 1 - count);
cout << ans << endl;
}
| replace | 6 | 12 | 6 | 14 | TLE | |
p02995 | C++ | Runtime Error | /* _
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||_ \
| | \\\ - /'| | |
| \_| `\`---'// |_/ |
\ .-\__ `-. -'__/-. /
___`. .' /--.--\ `. .'___
."" '< `.___\_<|>_/___.' _> \"".
| | : `- \`. ;`. _/; .'/ / .' ; |
\ \ `-. \_\_`. _.'_/_/ -' _.' /
===========`-.`___`-.__\ \___ /__.-'_.'_.-'================
Please give me AC.
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using int64 = long long;
using uint64 = unsigned long long;
using vi = vector<int>;
using vl = vector<int64>;
using pii = pair<int, int>;
using pll = pair<int64, int64>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(v) (v).begin(), (v).end()
#define print(x) cout << (x) << '\n'
#define print2(x, y) cout << (x) << ' ' << (y) << '\n'
#define print3(x, y, z) cout << (x) << ' ' << (y) << ' ' << (z) << '\n'
#define printn(v) \
rep(i, (v).size() - 1) cout << (v)[i] << ' '; \
cout << (v)[n - 1] << '\n';
#define debug(x) cerr << #x << ": " << (x) << '\n'
#define debug2(x, y) \
cerr << #x << ": " << (x) << ", " << #y << ": " << (y) << '\n'
#define debug3(x, y, z) \
cerr << #x << ": " << (x) << ", " << #y << ": " << (y) << ", " << #z << ": " \
<< (z) << '\n'
#define dbg(v) \
for (size_t _ = 0; _ < v.size(); ++_) { \
cerr << #v << "[" << _ << "] : " << v[_] << '\n'; \
}
// constant
const int INF = (1 << 30) - 1;
const int64 INF64 = (1LL << 62) - 1;
// End of template.
// x 以下の自然数でdで割り切れるものの個数
int64 f(int64 x, int64 d) { return x / d; }
int64 gcd(int64 a, int64 b) {
if (a < b)
return gcd(b, a);
int64 r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int64 lcm(int64 a, int64 b) { return a * b / gcd(a, b); }
int main() {
cout << fixed << setprecision(15);
ios::sync_with_stdio(false);
cin.tie(nullptr);
int64 a, b, c, d;
cin >> a >> b >> c >> d;
a--;
int64 y = b - (f(b, c) + f(b, d) - f(b, lcm(c, d)));
int64 x = a - (f(a, c) + f(a, d) - f(b, lcm(a, d)));
print(y - x);
return 0;
}
| /* _
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||_ \
| | \\\ - /'| | |
| \_| `\`---'// |_/ |
\ .-\__ `-. -'__/-. /
___`. .' /--.--\ `. .'___
."" '< `.___\_<|>_/___.' _> \"".
| | : `- \`. ;`. _/; .'/ / .' ; |
\ \ `-. \_\_`. _.'_/_/ -' _.' /
===========`-.`___`-.__\ \___ /__.-'_.'_.-'================
Please give me AC.
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using int64 = long long;
using uint64 = unsigned long long;
using vi = vector<int>;
using vl = vector<int64>;
using pii = pair<int, int>;
using pll = pair<int64, int64>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(v) (v).begin(), (v).end()
#define print(x) cout << (x) << '\n'
#define print2(x, y) cout << (x) << ' ' << (y) << '\n'
#define print3(x, y, z) cout << (x) << ' ' << (y) << ' ' << (z) << '\n'
#define printn(v) \
rep(i, (v).size() - 1) cout << (v)[i] << ' '; \
cout << (v)[n - 1] << '\n';
#define debug(x) cerr << #x << ": " << (x) << '\n'
#define debug2(x, y) \
cerr << #x << ": " << (x) << ", " << #y << ": " << (y) << '\n'
#define debug3(x, y, z) \
cerr << #x << ": " << (x) << ", " << #y << ": " << (y) << ", " << #z << ": " \
<< (z) << '\n'
#define dbg(v) \
for (size_t _ = 0; _ < v.size(); ++_) { \
cerr << #v << "[" << _ << "] : " << v[_] << '\n'; \
}
// constant
const int INF = (1 << 30) - 1;
const int64 INF64 = (1LL << 62) - 1;
// End of template.
// x 以下の自然数でdで割り切れるものの個数
int64 f(int64 x, int64 d) { return x / d; }
int64 gcd(int64 a, int64 b) {
if (a < b)
return gcd(b, a);
int64 r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int64 lcm(int64 a, int64 b) { return a * b / gcd(a, b); }
int main() {
cout << fixed << setprecision(15);
ios::sync_with_stdio(false);
cin.tie(nullptr);
int64 a, b, c, d;
cin >> a >> b >> c >> d;
a--;
int64 y = b - (f(b, c) + f(b, d) - f(b, lcm(c, d)));
int64 x = a - (f(a, c) + f(a, d) - f(a, lcm(c, d)));
print(y - x);
return 0;
}
| replace | 101 | 102 | 101 | 102 | 0 | |
p02995 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define _Pi 3.1415926535
using namespace std;
typedef long long ll;
long long gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll nC = 0, nD = 0, nCD = 0;
ll i = 1;
while (i * c <= b) {
if (i * c >= a)
++nC;
++i;
}
i = 1;
while (i * d <= b) {
if (i * d >= a)
++nD;
++i;
}
ll gCD = gcd(c, d);
i = 1;
while (i * c * d / gCD <= b) {
if (i * c * d / gCD >= max({a, c, d}))
++nCD;
++i;
}
ll ans = b - a + 1;
ans -= nC + nD - nCD;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define _Pi 3.1415926535
using namespace std;
typedef long long ll;
long long gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll nC, nD, nCD;
nC = b / c - (a - 1) / c;
nD = b / d - (a - 1) / d;
nCD = b / (c * d / gcd(c, d)) - (a - 1) / (c * d / gcd(c, d));
ll ans = b - a + 1;
ans -= nC + nD - nCD;
cout << ans << endl;
return 0;
}
| replace | 16 | 36 | 16 | 20 | TLE | |
p02995 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define what_is_v(x) \
cerr << #x << " is "; \
for (auto &e : (x)) \
cerr << e << ' '; \
cerr << '\n'; // vector, set
#define what_is_a(x, n) \
cerr << #x << " is "; \
for (int i = 0; i < n; i++) \
cerr << x[i] << ' '; \
cerr << '\n'; // n first element of array
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define st first
#define nd second
#define cerr_pair(x) '{' << x.st << ", " << x.nd << '}'
#define pwhat_is(x) cerr << #x << " is " << cerr_pair(x) << endl;
#define pwhat_is_v(x) \
cerr << #x << " is "; \
for (auto &e : (x)) \
cerr << cerr_pair(e) << ' '; \
cerr << '\n'; // vector, set
#define pwhat_is_a(x, n) \
cerr << #x << " is "; \
for (int i = 0; i < n; i++) \
cerr << cerr_pair(x[i]) << ' '; \
cerr << '\n'; // n first element of array
#define endl '\n'
#define int long long
typedef pair<int, int> pii;
const int N = 1e5 + 5;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int a, b, c, d;
int cound_divisors(int n, int d) { return n / d; }
int range_count(int l, int r, int d) {
return cound_divisors(r, d) - cound_divisors(l - 1, d);
}
int32_t main() {
IOS
// freopen("input.txt", "r", stdin);
cin >>
a >> b >> c >> d;
int lcm = (c * d) / __gcd(a, b);
int ans = (b - a + 1) - range_count(a, b, c) - range_count(a, b, d) +
range_count(a, b, lcm);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define what_is_v(x) \
cerr << #x << " is "; \
for (auto &e : (x)) \
cerr << e << ' '; \
cerr << '\n'; // vector, set
#define what_is_a(x, n) \
cerr << #x << " is "; \
for (int i = 0; i < n; i++) \
cerr << x[i] << ' '; \
cerr << '\n'; // n first element of array
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define st first
#define nd second
#define cerr_pair(x) '{' << x.st << ", " << x.nd << '}'
#define pwhat_is(x) cerr << #x << " is " << cerr_pair(x) << endl;
#define pwhat_is_v(x) \
cerr << #x << " is "; \
for (auto &e : (x)) \
cerr << cerr_pair(e) << ' '; \
cerr << '\n'; // vector, set
#define pwhat_is_a(x, n) \
cerr << #x << " is "; \
for (int i = 0; i < n; i++) \
cerr << cerr_pair(x[i]) << ' '; \
cerr << '\n'; // n first element of array
#define endl '\n'
#define int long long
typedef pair<int, int> pii;
const int N = 1e5 + 5;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int a, b, c, d;
int cound_divisors(int n, int d) { return n / d; }
int range_count(int l, int r, int d) {
return cound_divisors(r, d) - cound_divisors(l - 1, d);
}
int32_t main() {
IOS
// freopen("input.txt", "r", stdin);
cin >>
a >> b >> c >> d;
int lcm = (c * d) / __gcd(c, d);
int ans = (b - a + 1) - range_count(a, b, c) - range_count(a, b, d) +
range_count(a, b, lcm);
cout << ans << endl;
return 0;
}
| replace | 49 | 51 | 49 | 50 | 0 | |
p02995 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
#define rep(i, n) for (i = 0; i < (n); ++i)
#define rrep(i, n) for (i 1; i <= (n); ++i)
#define drep(i, n) for (i(n) - 1; i >= 0; --i)
#define fin(ans) cout << (ans) << endl
#define P 1000000007
#define STI(s) atoi(s.c_str()) // string to int
#define mp(p, q) make_pair(p, q)
#define Sort(a) sort(a.begin(), a.end())
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = INT_MAX;
const long long LLINF = 1LL << 60;
// g++ -std=c++1z main.cpp
//./a.exe
bool isPrime(int x) {
int i;
if (x < 2)
return 0;
else if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
for (i = 3; i * i <= x; i += 2)
if (x % i == 0)
return 0;
return 1;
}
ll gcd(ll c, ll d) { return d ? gcd(d, c % d) : c; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
//////////////////////////////////////////////////////
int a, b, c, d, n, e, f, l, h, i, j;
cin >> a >> b >> c >> d;
n = b - a + 1;
if (a % c == 0) {
e = b / c - a / c + 1;
} else {
e = b / c - a / c;
}
if (a % d == 0) {
f = b / d - a / d + 1;
} else {
f = b / d - a / d;
}
l = lcm(c, d);
if (a % l == 0) {
h = b / l - a / l + 1;
} else {
h = b / l - a / l;
}
i = e + f - h;
j = n - i;
cout << j << endl;
//////////////////////////////////////////////////////
return 0;
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
#define rep(i, n) for (i = 0; i < (n); ++i)
#define rrep(i, n) for (i 1; i <= (n); ++i)
#define drep(i, n) for (i(n) - 1; i >= 0; --i)
#define fin(ans) cout << (ans) << endl
#define P 1000000007
#define STI(s) atoi(s.c_str()) // string to int
#define mp(p, q) make_pair(p, q)
#define Sort(a) sort(a.begin(), a.end())
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = INT_MAX;
const long long LLINF = 1LL << 60;
// g++ -std=c++1z main.cpp
//./a.exe
bool isPrime(int x) {
int i;
if (x < 2)
return 0;
else if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
for (i = 3; i * i <= x; i += 2)
if (x % i == 0)
return 0;
return 1;
}
ll gcd(ll c, ll d) { return d ? gcd(d, c % d) : c; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
//////////////////////////////////////////////////////
ll a, b, c, d, n, e, f, l, h, i, j;
cin >> a >> b >> c >> d;
n = b - a + 1;
if (a % c == 0) {
e = b / c - a / c + 1;
} else {
e = b / c - a / c;
}
if (a % d == 0) {
f = b / d - a / d + 1;
} else {
f = b / d - a / d;
}
l = lcm(c, d);
if (a % l == 0) {
h = b / l - a / l + 1;
} else {
h = b / l - a / l;
}
i = e + f - h;
j = n - i;
cout << j << endl;
//////////////////////////////////////////////////////
return 0;
} | replace | 72 | 73 | 72 | 73 | 0 | |
p02995 | C++ | Runtime Error | #include <iostream>
using namespace std;
/* a と b の最大公約数を返す関数 */
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
int main() {
long long A, B, C, D, G;
long long L;
long long cnt;
cin >> A >> B >> C >> D;
G = GCD(A, B);
L = C * D / G;
A = A - 1;
// cnt = (B - B / C - B / D + B / L)-((A-1)- (A - 1)/C-(A-1)/D+(A-1)/L);
cnt = (B - B / C - B / D + B / L) - (A - A / C - A / D + A / L);
cout << cnt << endl;
return 0;
} | #include <iostream>
using namespace std;
/* a と b の最大公約数を返す関数 */
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
int main() {
long long A, B, C, D, G;
long long L;
long long cnt;
cin >> A >> B >> C >> D;
G = GCD(C, D);
L = C * D / G;
A = A - 1;
// cnt = (B - B / C - B / D + B / L)-((A-1)- (A - 1)/C-(A-1)/D+(A-1)/L);
cnt = (B - B / C - B / D + B / L) - (A - A / C - A / D + A / L);
cout << cnt << endl;
return 0;
} | replace | 20 | 21 | 20 | 21 | 0 | |
p02995 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
if (c < d)
swap(c, d);
ll x = c, y = d;
ll r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
ll lcm = c * d / y;
ll ans = b - a;
ll i;
for (i = a; i < a + c; i++) {
if (i % c == 0) {
ans -= (b - i) / c;
break;
}
}
for (i = a; i < a + d; i++) {
if (i % d == 0) {
ans -= (b - i) / d;
break;
}
}
for (i = a; i < a + lcm; i++) {
if (i % lcm == 0) {
ans += (b - i) / lcm;
break;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
if (c < d)
swap(c, d);
ll x = c, y = d;
ll r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
ll lcm = c * d / y;
ll ans = b - b / c - b / d + b / lcm;
ans -= (a - 1) - (a - 1) / c - (a - 1) / d + (a - 1) / lcm;
cout << ans << endl;
return 0;
} | replace | 22 | 43 | 22 | 24 | TLE | |
p02996 | C++ | Runtime Error | #include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
int main(int argc, char *argv[]) {
int N;
std::cin >> N;
std::map<long int, std::vector<long int>, std::greater<long int>> jobs;
long int A, B;
for (int i = 0; i < N; ++i) {
std::cin >> A >> B;
if (jobs.find(B) == jobs.end()) {
jobs[B] = std::vector<long int>{A};
continue;
}
jobs[B].emplace_back(A);
}
std::priority_queue<long int> queue;
auto jobsIter = jobs.begin();
long int t = (*jobsIter).first;
for (auto A : (*jobsIter).second) {
queue.push(A);
}
++jobsIter;
while (!queue.empty()) {
t -= queue.top();
queue.pop();
if (jobsIter != jobs.end()) {
while ((*jobsIter).first >= t) {
for (auto A : (*jobsIter).second) {
queue.push(A);
}
++jobsIter;
}
if (queue.empty()) {
t = (*jobsIter).first;
for (auto A : (*jobsIter).second) {
queue.push(A);
}
++jobsIter;
}
}
}
if (t >= 0) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
return 0;
}
| #include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
int main(int argc, char *argv[]) {
int N;
std::cin >> N;
std::map<long int, std::vector<long int>, std::greater<long int>> jobs;
long int A, B;
for (int i = 0; i < N; ++i) {
std::cin >> A >> B;
if (jobs.find(B) == jobs.end()) {
jobs[B] = std::vector<long int>{A};
continue;
}
jobs[B].emplace_back(A);
}
std::priority_queue<long int> queue;
auto jobsIter = jobs.begin();
long int t = (*jobsIter).first;
for (auto A : (*jobsIter).second) {
queue.push(A);
}
++jobsIter;
while (!queue.empty()) {
t -= queue.top();
queue.pop();
if (jobsIter != jobs.end()) {
while ((*jobsIter).first >= t && jobsIter != jobs.end()) {
for (auto A : (*jobsIter).second) {
queue.push(A);
}
++jobsIter;
}
if (queue.empty()) {
t = (*jobsIter).first;
for (auto A : (*jobsIter).second) {
queue.push(A);
}
++jobsIter;
}
}
}
if (t >= 0) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
return 0;
}
| replace | 31 | 32 | 31 | 32 | -11 | |
p02996 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi = acos(-1.0);
const ll mod = pow(10, 9) + 7;
const ll INF = pow(2, 31) - 1;
typedef pair<int, int> P;
typedef vector<int> vi;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
ll lc = (a / g) * b;
return lc;
}
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
int time = 0;
P p[20005];
rep(i, n) { cin >> p[i].second >> p[i].first; }
sort(p, p + n);
int ind = 0;
rep(i, n) {
time += p[i].second;
if (time > p[i].first) {
break;
}
ind++;
}
if (ind == n)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi = acos(-1.0);
const ll mod = pow(10, 9) + 7;
const ll INF = pow(2, 31) - 1;
typedef pair<int, int> P;
typedef vector<int> vi;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
ll lc = (a / g) * b;
return lc;
}
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
int time = 0;
P p[200005];
rep(i, n) { cin >> p[i].second >> p[i].first; }
sort(p, p + n);
int ind = 0;
rep(i, n) {
time += p[i].second;
if (time > p[i].first) {
break;
}
ind++;
}
if (ind == n)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | replace | 42 | 43 | 42 | 43 | 0 | |
p02996 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define loop(i, m, n) for (ll i = m; i < n; ++i)
#define ggr \
getchar(); \
getchar(); \
return 0;
#define pie 3.141592653589793238462643383279
#define elif else if
#define P pair<ll, ll>
const int inf = 1000000007;
int bin(int bina) {
int ans = 0;
for (int i = 0; bina > 0; i++) {
ans = ans + (bina % 2) * pow(10, i);
bina = bina / 2;
}
return ans;
}
bool prime(int n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x * y / gcd(x, y); }
int kai(int x) {
if (x == 0)
return 1;
return kai(x - 1) * x % inf;
}
int mod_pow(int x, int y, int mod) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % mod;
}
x = x * x % mod;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
return kai(x) * mod_pow(kai(x - y), inf - 2, inf) % inf *
mod_pow(kai(y), inf - 2, inf) % inf;
}
struct union_find {
int par[200010], size_[200010];
void init(int x) {
rep(i, x) {
par[i] = i;
size_[i] = 1;
}
}
int find(int x) {
if (par[x] == x)
return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (size_[x] < size_[y]) {
par[x] = y;
size_[y] += size_[x];
} else {
par[y] = x;
size_[x] += size_[y];
}
}
};
struct edge {
int to, cost;
};
pair<int, int> p[100010];
signed main() {
int n;
cin >> n;
rep(i, n) { cin >> p[i].second >> p[i].first; }
sort(p, p + n);
int sum = 0;
rep(i, n) {
sum += p[i].second;
if (p[i].first < sum) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define loop(i, m, n) for (ll i = m; i < n; ++i)
#define ggr \
getchar(); \
getchar(); \
return 0;
#define pie 3.141592653589793238462643383279
#define elif else if
#define P pair<ll, ll>
const int inf = 1000000007;
int bin(int bina) {
int ans = 0;
for (int i = 0; bina > 0; i++) {
ans = ans + (bina % 2) * pow(10, i);
bina = bina / 2;
}
return ans;
}
bool prime(int n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x * y / gcd(x, y); }
int kai(int x) {
if (x == 0)
return 1;
return kai(x - 1) * x % inf;
}
int mod_pow(int x, int y, int mod) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % mod;
}
x = x * x % mod;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
return kai(x) * mod_pow(kai(x - y), inf - 2, inf) % inf *
mod_pow(kai(y), inf - 2, inf) % inf;
}
struct union_find {
int par[200010], size_[200010];
void init(int x) {
rep(i, x) {
par[i] = i;
size_[i] = 1;
}
}
int find(int x) {
if (par[x] == x)
return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (size_[x] < size_[y]) {
par[x] = y;
size_[y] += size_[x];
} else {
par[y] = x;
size_[x] += size_[y];
}
}
};
struct edge {
int to, cost;
};
pair<int, int> p[200010];
signed main() {
int n;
cin >> n;
rep(i, n) { cin >> p[i].second >> p[i].first; }
sort(p, p + n);
int sum = 0;
rep(i, n) {
sum += p[i].second;
if (p[i].first < sum) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| replace | 85 | 86 | 85 | 86 | 0 | |
p02996 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct node {
int c, lim;
bool operator<(const node &y) { return lim < y.lim; }
};
node a[100100];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d%d", &a[i].c, &a[i].lim);
}
sort(a + 1, a + n + 1);
int cnt = 0;
int fg = 1;
for (int i = 1; i <= n; i++) {
cnt += a[i].c;
if (cnt > a[i].lim) {
fg = 0;
break;
}
}
if (fg) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
struct node {
int c, lim;
bool operator<(const node &y) { return lim < y.lim; }
};
node a[200200];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d%d", &a[i].c, &a[i].lim);
}
sort(a + 1, a + n + 1);
int cnt = 0;
int fg = 1;
for (int i = 1; i <= n; i++) {
cnt += a[i].c;
if (cnt > a[i].lim) {
fg = 0;
break;
}
}
if (fg) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02996 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef struct ss {
int a, b;
bool operator<(const ss &x) const {
if (x.b != b)
return b < x.b;
}
} s;
s node[200007];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d%d", &node[i].a, &node[i].b);
}
sort(node + 1, node + 1 + n);
long long time = 0;
for (int i = 1; i <= n; ++i) {
time += 1ll * node[i].a;
if (time > 1ll * node[i].b) {
printf("No");
return 0;
}
}
printf("Yes");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef struct ss {
int a, b;
bool operator<(const ss &x) const {
if (x.b != b)
return b < x.b;
else
return a < x.a;
}
} s;
s node[200007];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d%d", &node[i].a, &node[i].b);
}
sort(node + 1, node + 1 + n);
long long time = 0;
for (int i = 1; i <= n; ++i) {
time += 1ll * node[i].a;
if (time > 1ll * node[i].b) {
printf("No");
return 0;
}
}
printf("Yes");
return 0;
}
| insert | 7 | 7 | 7 | 9 | 0 | |
p02996 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
typedef long long LL;
const int maxn = 200007;
struct thing {
int t;
int e;
} a[maxn];
bool cmp(thing x, thing y) {
if (x.e > y.e) {
return false;
} else
return true;
}
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i].t >> a[i].e;
}
sort(a, a + N, cmp);
long long res = 0;
int flag = 0;
for (int i = 0; i < N; i++) {
res += a[i].t;
if (res > a[i].e) {
flag = 1;
break;
}
}
if (flag) {
cout << "No" << endl;
} else
cout << "Yes" << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
typedef long long LL;
const int maxn = 200007;
struct thing {
int t;
int e;
} a[maxn];
bool cmp(thing x, thing y) {
if (x.e > y.e) {
return false;
} else if (x.e == y.e) {
return x.t < y.t;
} else
return true;
}
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i].t >> a[i].e;
}
sort(a, a + N, cmp);
long long res = 0;
int flag = 0;
for (int i = 0; i < N; i++) {
res += a[i].t;
if (res > a[i].e) {
flag = 1;
break;
}
}
if (flag) {
cout << "No" << endl;
} else
cout << "Yes" << endl;
return 0;
}
| insert | 17 | 17 | 17 | 19 | 0 | |
p02996 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#define maxn 20005
using namespace std;
int n, sum = 0;
struct job {
int a, b;
} jobs[maxn];
int cmp(job x, job y) { return x.b < y.b; }
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> jobs[i].a >> jobs[i].b;
}
sort(jobs + 1, jobs + n + 1, cmp);
for (int i = 1; i <= n; i++) {
sum += jobs[i].a;
if (sum > jobs[i].b) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
} | #include <algorithm>
#include <iostream>
#define maxn 200005
using namespace std;
int n, sum = 0;
struct job {
int a, b;
} jobs[maxn];
int cmp(job x, job y) { return x.b < y.b; }
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> jobs[i].a >> jobs[i].b;
}
sort(jobs + 1, jobs + n + 1, cmp);
for (int i = 1; i <= n; i++) {
sum += jobs[i].a;
if (sum > jobs[i].b) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02996 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
struct node {
int st;
int ed; // start&end
} a[1005]; // 结构体
bool cmp(node x, node y) { return x.ed < y.ed; }
int main() {
int n, i, t = 0, ans = 1, total = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d%d", &a[i].st, &a[i].ed);
sort(a + 1, a + n + 1, cmp);
t = a[1].ed;
ans = 1;
for (i = 1; i <= n + 1; i++) {
if (total <= t) {
t = a[i].ed;
} else {
printf("No");
return 0;
}
total += a[i].st;
}
printf("Yes");
return 0;
} | #include <algorithm>
#include <cstdio>
using namespace std;
struct node {
int st;
int ed;
} a[200005];
bool cmp(node x, node y) { return x.ed < y.ed; }
int main() {
int n, i, t = 0, ans = 1, total = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d%d", &a[i].st, &a[i].ed);
sort(a + 1, a + n + 1, cmp);
t = a[1].ed;
ans = 1;
for (i = 1; i <= n + 1; i++) {
if (total <= t) {
t = a[i].ed;
} else {
printf("No");
return 0;
}
total += a[i].st;
}
printf("Yes");
return 0;
} | replace | 5 | 7 | 5 | 7 | 0 | |
p02996 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
using lint = int64_t;
int main() {
int N;
pair<lint, lint> p[100010];
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> p[i].second;
cin >> p[i].first;
}
sort(p + 1, p + 1 + N);
int time = 0;
lint sum = 0;
for (int i = 1; i <= N; i++) {
sum += p[i].second;
time = p[i].first;
if (sum > time) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
using lint = int64_t;
int main() {
int N;
pair<lint, lint> p[200010];
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> p[i].second;
cin >> p[i].first;
}
sort(p + 1, p + 1 + N);
int time = 0;
lint sum = 0;
for (int i = 1; i <= N; i++) {
sum += p[i].second;
time = p[i].first;
if (sum > time) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02996 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int n;
pair<int, int> a[100000];
int main() {
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i].second >> a[i].first;
sort(a, a + n);
int tv = 0, f = 0;
for (int i = 0; i < n; ++i) {
tv += a[i].second;
if (a[i].first < tv) {
f = 1;
break;
}
}
cout << (!f ? "Yes" : "No") << endl;
} | #include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int n;
pair<int, int> a[200000];
int main() {
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i].second >> a[i].first;
sort(a, a + n);
int tv = 0, f = 0;
for (int i = 0; i < n; ++i) {
tv += a[i].second;
if (a[i].first < tv) {
f = 1;
break;
}
}
cout << (!f ? "Yes" : "No") << endl;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02996 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
ll n;
vector<pair<ll, ll>> v(100005);
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> v[i].second >> v[i].first;
}
while (v.size() > n)
v.pop_back();
sort(v.begin(), v.end());
ll cur;
for (int i = 0; i < n; i++) {
if (cur + v[i].second > v[i].first)
return cout << "No", 0;
cur += v[i].second;
}
cout << "Yes" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
ll n;
vector<pair<ll, ll>> v(200005);
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> v[i].second >> v[i].first;
}
while (v.size() > n)
v.pop_back();
sort(v.begin(), v.end());
ll cur;
for (int i = 0; i < n; i++) {
if (cur + v[i].second > v[i].first)
return cout << "No", 0;
cur += v[i].second;
}
cout << "Yes" << endl;
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02996 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#define D first
#define T second
using namespace std;
long long n, s;
pair<int, int> a[100005];
int main() {
int i;
cin >> n;
for (i = 0; i < n; i++)
scanf("%d%d", &a[i].T, &a[i].D);
sort(a, a + n);
for (i = 0; i < n; i++) {
s += a[i].T;
if (s > a[i].D) {
puts("No");
return 0;
}
}
puts("Yes");
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#define D first
#define T second
using namespace std;
long long n, s;
pair<int, int> a[200005];
int main() {
int i;
cin >> n;
for (i = 0; i < n; i++)
scanf("%d%d", &a[i].T, &a[i].D);
sort(a, a + n);
for (i = 0; i < n; i++) {
s += a[i].T;
if (s > a[i].D) {
puts("No");
return 0;
}
}
puts("Yes");
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02996 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int MAX = 100000;
int main() {
int N;
pair<int, int> x[MAX];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> x[i].second >> x[i].first;
}
sort(x, x + N);
int sum = 0;
int lim = 0;
for (int i = 0; i < N; i++) {
sum += x[i].second;
lim = x[i].first;
if (lim < sum) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int MAX = 200001;
int main() {
int N;
pair<int, int> x[MAX];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> x[i].second >> x[i].first;
}
sort(x, x + N);
int sum = 0;
int lim = 0;
for (int i = 0; i < N; i++) {
sum += x[i].second;
lim = x[i].first;
if (lim < sum) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02996 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
ll int b[200005];
ll int a[200005];
bool compare(const pair<ll int, int> p1, const pair<ll int, int> p2) {
if (b[p1.second] == b[p2.second]) {
return p1.first < p2.second;
}
return b[p1.second] < b[p2.second];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--) {
int n;
cin >> n;
vector<pair<ll int, int>> v;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
v.push_back({b[i] - a[i], i});
}
sort(v.begin(), v.end(), compare);
ll int time = 0;
bool rt = true;
for (int i = 0; i < n; i++) {
if (time <= v[i].first) {
} else {
rt = false;
break;
}
time += a[v[i].second];
}
if (rt) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
ll int b[200005];
ll int a[200005];
bool compare(const pair<ll int, int> p1, const pair<ll int, int> p2) {
if (b[p1.second] == b[p2.second]) {
return p1.first < p2.first;
}
return b[p1.second] < b[p2.second];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--) {
int n;
cin >> n;
vector<pair<ll int, int>> v;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
v.push_back({b[i] - a[i], i});
}
sort(v.begin(), v.end(), compare);
ll int time = 0;
bool rt = true;
for (int i = 0; i < n; i++) {
if (time <= v[i].first) {
} else {
rt = false;
break;
}
time += a[v[i].second];
}
if (rt) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02996 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> X;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
X.push_back(make_pair(b, a));
sort(X.begin(), X.end());
long long sum = 0;
for (auto j : X) {
sum += j.second;
if (sum > j.first) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> X;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
X.push_back(make_pair(b, a));
}
sort(X.begin(), X.end());
long long sum = 0;
for (auto j : X) {
sum += j.second;
if (sum > j.first) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | replace | 11 | 19 | 11 | 19 | TLE | |
p02996 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#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++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
const ll mod = 1e9 + 7;
const int inf = 1 << 30;
int main() {
int n;
cin >> n;
priority_queue<l_l, vector<l_l>, greater<l_l>> q;
rep(i, n) {
int a, b;
cin >> a >> b;
q.push(l_l(b, a));
}
ll time = 0;
rep(i, n) {
time += q.top().second;
if (time > q.top().first) {
cout << "No" << endl;
return 0;
}
q.pop();
}
cout << "Yes" << endl;
} | // #define _GLIBCXX_DEBUG
#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++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
const ll mod = 1e9 + 7;
const int inf = 1 << 30;
int main() {
int n;
cin >> n;
priority_queue<l_l, vector<l_l>, greater<l_l>> q;
rep(i, n) {
int a, b;
cin >> a >> b;
q.push(l_l(b, a));
}
ll time = 0;
rep(i, n) {
time += q.top().second;
if (time > q.top().first) {
cout << "No" << endl;
return 0;
}
q.pop();
}
cout << "Yes" << endl;
} | replace | 0 | 1 | 0 | 1 | TLE | |
p02996 | C++ | Runtime Error | #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;
}
| replace | 47 | 50 | 47 | 49 | -11 | |
p02996 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define inf 2147483647
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rr read()
#define ll long long
#define repb(i, a, b) for (int i = a; i <= b; i++)
#define CloseIo ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
ll read() {
char ch = getchar();
int x = 0, f = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while ('0' <= ch && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
const int N = 1e5 + 5;
struct node {
ll x, y;
} z[N];
bool cmp(const node a, const node b) {
if (a.y != b.y)
return a.y < b.y;
return a.x < b.x;
}
int main() {
ll n = rr, sum = 0, end = 0;
for (int i = 0; i < n; i++) {
ll x = rr, y = rr;
sum += x;
end = max(end, y);
z[i].x = x;
z[i].y = y;
}
if (end < sum) {
printf("No\n");
return 0;
}
sort(z, z + n, cmp);
ll time = 0;
for (int i = 0; i < n; i++) {
if (time + z[i].x <= z[i].y)
time += z[i].x;
else {
printf("No\n");
return 0;
}
}
printf("Yes\n");
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define inf 2147483647
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rr read()
#define ll long long
#define repb(i, a, b) for (int i = a; i <= b; i++)
#define CloseIo ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
ll read() {
char ch = getchar();
int x = 0, f = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while ('0' <= ch && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
const int N = 1e5 + 5;
struct node {
ll x, y;
} z[2 * N];
bool cmp(const node a, const node b) {
if (a.y != b.y)
return a.y < b.y;
return a.x < b.x;
}
int main() {
ll n = rr, sum = 0, end = 0;
for (int i = 0; i < n; i++) {
ll x = rr, y = rr;
sum += x;
end = max(end, y);
z[i].x = x;
z[i].y = y;
}
if (end < sum) {
printf("No\n");
return 0;
}
sort(z, z + n, cmp);
ll time = 0;
for (int i = 0; i < n; i++) {
if (time + z[i].x <= z[i].y)
time += z[i].x;
else {
printf("No\n");
return 0;
}
}
printf("Yes\n");
}
| replace | 36 | 37 | 36 | 37 | 0 | |
p02996 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ALL(a) (a).begin(), (a).end()
const ll mod = 1e9 + 7;
bool compare(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second)
return a.second < b.second;
}
int main() {
int n;
cin >> n;
vector<pair<int, int>> p(n);
rep(i, n) {
int a, b;
cin >> a >> b;
p[i] = make_pair(a, b);
}
sort(ALL(p), compare);
int time = 0;
rep(i, n) {
time += p[i].first;
if (time > p[i].second) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ALL(a) (a).begin(), (a).end()
const ll mod = 1e9 + 7;
bool compare(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second)
return a.second < b.second;
else
return a.first < b.first;
}
int main() {
int n;
cin >> n;
vector<pair<int, int>> p(n);
rep(i, n) {
int a, b;
cin >> a >> b;
p[i] = make_pair(a, b);
}
sort(ALL(p), compare);
int time = 0;
rep(i, n) {
time += p[i].first;
if (time > p[i].second) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | insert | 10 | 10 | 10 | 12 | 0 | |
p02996 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long a[200010];
long long b[200010];
long long v[500000] = {0};
int main() {
long long n, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
v[b[i]] += a[i];
}
sort(b, b + n);
for (int i = 0; i < n; i++) {
if (b[i] == b[i - 1] && i)
continue;
// cout<<v[b[i]]<<" "<<ans<<" "<<b[i]<<endl;
if ((ans + v[b[i]]) > b[i]) {
cout << "No";
return 0;
} else
ans = ans + v[b[i]];
}
cout << "Yes";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long a[200010];
long long b[200010];
map<int, int> v;
int main() {
long long n, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
v[b[i]] += a[i];
}
sort(b, b + n);
for (int i = 0; i < n; i++) {
if (b[i] == b[i - 1] && i)
continue;
// cout<<v[b[i]]<<" "<<ans<<" "<<b[i]<<endl;
if ((ans + v[b[i]]) > b[i]) {
cout << "No";
return 0;
} else
ans = ans + v[b[i]];
}
cout << "Yes";
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02996 | C++ | Runtime Error | // Written By NewbieChd
#include <algorithm>
#include <cctype>
#include <cstdio>
#define int long long
using namespace std;
const int BUF = 1000000;
char buf[BUF], *p1, *p2;
inline char getChar() {
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, BUF, stdin), p1 == p2)
? EOF
: *p1++;
}
inline int read() {
register int f = 0;
char c;
while (!isdigit(c = getChar())) {
}
do
f = f * 10 + (c ^ 48);
while (isdigit(c = getChar()));
return f;
}
const int maxN = 100003;
int a[maxN], b[maxN], ind[maxN];
inline bool cmp(int x, int y) { return b[x] < b[y]; }
signed main() {
int n = read(), i, now = 0;
for (i = 1; i <= n; ++i)
a[i] = read(), b[i] = read(), ind[i] = i;
sort(ind + 1, ind + n + 1, cmp);
for (i = 1; i <= n; ++i)
if ((now += a[ind[i]]) > b[ind[i]])
break;
printf(i > n ? "Yes\n" : "No\n");
return 0;
}
| // Written By NewbieChd
#include <algorithm>
#include <cctype>
#include <cstdio>
#define int long long
using namespace std;
const int BUF = 1000000;
char buf[BUF], *p1, *p2;
inline char getChar() {
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, BUF, stdin), p1 == p2)
? EOF
: *p1++;
}
inline int read() {
register int f = 0;
char c;
while (!isdigit(c = getChar())) {
}
do
f = f * 10 + (c ^ 48);
while (isdigit(c = getChar()));
return f;
}
const int maxN = 200003;
int a[maxN], b[maxN], ind[maxN];
inline bool cmp(int x, int y) { return b[x] < b[y]; }
signed main() {
int n = read(), i, now = 0;
for (i = 1; i <= n; ++i)
a[i] = read(), b[i] = read(), ind[i] = i;
sort(ind + 1, ind + n + 1, cmp);
for (i = 1; i <= n; ++i)
if ((now += a[ind[i]]) > b[ind[i]])
break;
printf(i > n ? "Yes\n" : "No\n");
return 0;
}
| replace | 25 | 26 | 25 | 26 | 0 | |
p02996 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
struct node {
int a, b;
} a[N];
int cmp(node a, node b) { return a.b < b.b; }
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i].a >> a[i].b;
sort(a + 1, a + n + 1, cmp);
int t = 0;
for (int i = 1; i <= n; i++) {
t = t + a[i].a;
// cout<<"t= "<< t<<endl;
if (t > a[i].b) {
printf("No\n");
return 0;
}
}
printf("Yes\n");
// cout << "Hello world!" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
struct node {
int a, b;
} a[N];
int cmp(node a, node b) { return a.b < b.b; }
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i].a >> a[i].b;
sort(a + 1, a + n + 1, cmp);
int t = 0;
for (int i = 1; i <= n; i++) {
t = t + a[i].a;
// cout<<"t= "<< t<<endl;
if (t > a[i].b) {
printf("No\n");
return 0;
}
}
printf("Yes\n");
// cout << "Hello world!" << endl;
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02996 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <queue>
using namespace std;
const int Maxn = 2e5;
int N;
struct Node {
int t1, t2;
bool operator<(const Node &rhs) const { return t2 < rhs.t2; }
} A[2 * Maxn + 5];
priority_queue<int> q;
int main() {
#ifdef LOACL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
scanf("%d", &N);
for (int i = 1; i <= N; i++)
scanf("%d %d", &A[i].t1, &A[i].t2);
sort(A + 1, A + N + 1);
int t = 0, tot = 0;
for (int i = 1; i <= N; i++) {
if (t + A[i].t1 <= A[i].t2) {
tot++;
t += A[i].t1;
q.push(A[i].t1);
} else {
int maxx = q.top();
if (A[i].t1 < maxx) {
q.pop();
q.push(A[i].t1);
t = t - maxx + A[i].t1;
}
}
}
if (tot == N)
puts("Yes");
else
puts("No");
return 0;
} | #include <algorithm>
#include <cstdio>
#include <queue>
using namespace std;
const int Maxn = 2e5;
int N;
struct Node {
int t1, t2;
bool operator<(const Node &rhs) const { return t2 < rhs.t2; }
} A[2 * Maxn + 5];
priority_queue<int> q;
int main() {
#ifdef LOACL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
scanf("%d", &N);
for (int i = 1; i <= N; i++)
scanf("%d %d", &A[i].t1, &A[i].t2);
sort(A + 1, A + N + 1);
int t = 0, tot = 0;
for (int i = 1; i <= N; i++) {
if (t + A[i].t1 <= A[i].t2) {
tot++;
t += A[i].t1;
q.push(A[i].t1);
} else {
if (q.empty())
continue;
int maxx = q.top();
if (A[i].t1 < maxx) {
q.pop();
q.push(A[i].t1);
t = t - maxx + A[i].t1;
}
}
}
if (tot == N)
puts("Yes");
else
puts("No");
return 0;
} | insert | 29 | 29 | 29 | 31 | 0 | |
p02996 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
struct each {
int x, y;
} a[N];
bool com(each x, each y) {
if (x.y == y.y)
return x.x < y.x;
return x.y < y.y;
}
int n;
int main() {
int t = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d%d", &a[i].x, &a[i].y);
sort(a + 1, a + n + 1, com);
for (int i = 1; i <= n; i++)
if (t + a[i].x <= a[i].y)
t += a[i].x;
else {
puts("No");
return 0;
}
puts("Yes");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
struct each {
int x, y;
} a[N];
bool com(each x, each y) {
if (x.y == y.y)
return x.x < y.x;
return x.y < y.y;
}
int n;
int main() {
int t = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d%d", &a[i].x, &a[i].y);
sort(a + 1, a + n + 1, com);
for (int i = 1; i <= n; i++)
if (t + a[i].x <= a[i].y)
t += a[i].x;
else {
puts("No");
return 0;
}
puts("Yes");
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02996 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
const int MAX = 100005;
int main() {
pair<int, int> A[MAX];
int N, a, b;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> a >> b;
A[i].first = b;
A[i].second = a;
}
sort(A, A + N);
int temp = 0;
for (int i = 0; i < N; ++i) {
temp += A[i].second;
if (temp > A[i].first) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
const int MAX = 200005;
int main() {
pair<int, int> A[MAX];
int N, a, b;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> a >> b;
A[i].first = b;
A[i].second = a;
}
sort(A, A + N);
int temp = 0;
for (int i = 0; i < N; ++i) {
temp += A[i].second;
if (temp > A[i].first) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02996 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define D()
#define INF 1000000000000
#define MOD 10000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define INITA(a, i, j, v) \
for (ll k = i; k <= j; k++) { \
a[k] = v; \
}
int main() {
ll n;
cin >> n;
pair<ll, ll> arr[200001];
ll a, b;
REP(i, n) { cin >> arr[i].first >> arr[i].second; }
sort(begin(arr), begin(arr) + n,
[](pair<ll, ll> const &lhs, pair<ll, ll> const &rhs) {
if (lhs.second != rhs.second)
return lhs.second < rhs.second;
if (lhs.first != rhs.first)
return lhs.first > rhs.first;
return true;
});
ll tmp = 0;
REP(i, n) {
if (tmp + arr[i].first <= arr[i].second) {
tmp += arr[i].first;
} else {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define D()
#define INF 1000000000000
#define MOD 10000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define INITA(a, i, j, v) \
for (ll k = i; k <= j; k++) { \
a[k] = v; \
}
int main() {
ll n;
cin >> n;
pair<ll, ll> arr[200001];
ll a, b;
REP(i, n) { cin >> arr[i].first >> arr[i].second; }
sort(begin(arr), begin(arr) + n,
[](pair<ll, ll> a, pair<ll, ll> b) { return a.second < b.second; });
ll tmp = 0;
REP(i, n) {
if (tmp + arr[i].first <= arr[i].second) {
tmp += arr[i].first;
} else {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | replace | 51 | 58 | 51 | 52 | 0 | |
p02996 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int n;
P tasks[101010];
int main() {
cin >> n;
rep(i, n) {
cin >> tasks[i].second >> tasks[i].first;
if (tasks[i].first < tasks[i].second) {
cout << "No" << endl;
return 0;
}
}
sort(tasks, tasks + n);
ll t = 0;
rep(i, n) {
t += (long)tasks[i].second;
if (t > tasks[i].first) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int n;
P tasks[202020];
int main() {
cin >> n;
rep(i, n) {
cin >> tasks[i].second >> tasks[i].first;
if (tasks[i].first < tasks[i].second) {
cout << "No" << endl;
return 0;
}
}
sort(tasks, tasks + n);
ll t = 0;
rep(i, n) {
t += (long)tasks[i].second;
if (t > tasks[i].first) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02996 | C++ | Runtime Error | // Keep working hard :)
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
multimap<int, int> mp;
void fileIO() {
#ifndef ONLINE_JUDGE
freopen("int.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
}
int main() {
IOS;
fileIO();
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
mp.insert({y, x});
}
int temp = 0;
for (auto it : mp) {
temp += it.second;
if (temp > it.first) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
| // Keep working hard :)
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
multimap<int, int> mp;
void fileIO() {
#ifndef ONLINE_JUDGE
freopen("int.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
}
int main() {
IOS;
// fileIO();
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
mp.insert({y, x});
}
int temp = 0;
for (auto it : mp) {
temp += it.second;
if (temp > it.first) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
| replace | 20 | 21 | 20 | 21 | 0 | |
p02996 | C++ | Runtime Error | // temprates
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
using ll = long long;
using namespace std;
#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define LFOR(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); i++)
#define FORR(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define LFORR(i, a, b) for (ll i = (int)(a); i >= (ll)(b); i--)
#define REP(i, n) FOR(i, 0, (int)(n)-1)
#define LREP(i, n) LFOR(i, 0, (ll)(n)-1)
#define REPR(i, n) FORR(i, (int)(n)-1, 0)
#define LREPR(i, n) LFORR(i, (ll)(n)-1, 0)
#define SIZ(v) int(v.size())
const int INF = 1e8;
const ll LINF = 1e15;
const int MOD = 1e9 + 7;
struct Work {
ll a;
ll b;
};
bool operator<(Work w1, Work w2) {
return (w1.b != w2.b) ? w1.b < w2.b : w1.a < w1.b;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
vector<Work> tasks;
bool ans = true;
cin >> n;
REP(i, n) {
ll a, b;
cin >> a >> b;
tasks.push_back(Work{a, b});
}
sort(tasks.begin(), tasks.end());
ll t = 0;
for (int i = 0; i < n; i++) {
if (t + tasks[i].a <= tasks[i].b) {
t += tasks[i].a;
} else {
ans = false;
break;
}
}
cout << ((ans) ? "Yes" : "No") << endl;
}
| // temprates
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
using ll = long long;
using namespace std;
#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define LFOR(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); i++)
#define FORR(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define LFORR(i, a, b) for (ll i = (int)(a); i >= (ll)(b); i--)
#define REP(i, n) FOR(i, 0, (int)(n)-1)
#define LREP(i, n) LFOR(i, 0, (ll)(n)-1)
#define REPR(i, n) FORR(i, (int)(n)-1, 0)
#define LREPR(i, n) LFORR(i, (ll)(n)-1, 0)
#define SIZ(v) int(v.size())
const int INF = 1e8;
const ll LINF = 1e15;
const int MOD = 1e9 + 7;
struct Work {
ll a;
ll b;
};
bool operator<(Work w1, Work w2) { return w1.b < w2.b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
vector<Work> tasks;
bool ans = true;
cin >> n;
REP(i, n) {
ll a, b;
cin >> a >> b;
tasks.push_back(Work{a, b});
}
sort(tasks.begin(), tasks.end());
ll t = 0;
for (int i = 0; i < n; i++) {
if (t + tasks[i].a <= tasks[i].b) {
t += tasks[i].a;
} else {
ans = false;
break;
}
}
cout << ((ans) ? "Yes" : "No") << endl;
}
| replace | 40 | 43 | 40 | 41 | 0 | |
p02996 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
ll n, i;
ll t = 0;
pair<ll, ll> p[100000];
cin >> n;
for (i = 0; i < n; i++) {
cin >> p[i].second >> p[i].first;
}
sort(p, p + n);
for (i = 0; i < n; i++) {
t += p[i].second;
if (p[i].first < t) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
ll n, i;
ll t = 0;
pair<ll, ll> p[200000];
cin >> n;
for (i = 0; i < n; i++) {
cin >> p[i].second >> p[i].first;
}
sort(p, p + n);
for (i = 0; i < n; i++) {
t += p[i].second;
if (p[i].first < t) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02996 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using P = pair<int, int>;
constexpr int INF = 1e9;
constexpr ll INFLL = 1e18;
constexpr int MOD = 1e9 + 7;
const ld PI = acosl(-1);
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(n) n.begin(), n.end()
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
// cout << fixed << setprecision(6);
int n;
cin >> n;
vector<P> ba;
rep(i, n) cin >> ba[i].second >> ba[i].first;
sort(ba.rbegin(), ba.rend());
int time = ba[0].first;
for (auto t : ba) {
time = min(time, t.first);
time -= t.second;
if (time < 0) {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using P = pair<int, int>;
constexpr int INF = 1e9;
constexpr ll INFLL = 1e18;
constexpr int MOD = 1e9 + 7;
const ld PI = acosl(-1);
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(n) n.begin(), n.end()
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
// cout << fixed << setprecision(6);
int n;
cin >> n;
vector<P> ba(n);
rep(i, n) cin >> ba[i].second >> ba[i].first;
sort(ba.rbegin(), ba.rend());
int time = ba[0].first;
for (auto t : ba) {
time = min(time, t.first);
time -= t.second;
if (time < 0) {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
return 0;
} | replace | 23 | 24 | 23 | 24 | -11 | |
p02996 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define vi vector<int>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i > b; i--)
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define MOD 1000000007
#define PI 3.14159265359
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
using namespace __gnu_pbds;
typedef tree<pii,null_type,less
<pii>,rb_tree_tag,tree_order_statistics_node_update>ind_set;
*/
///*X.find_by_order("index")
/// X.order_of_key("key")
#define deb(x) cerr << #x << " : " << x << "\n";
#ifndef local
#define deb(x) ;
#endif
///----------------------------------------------------------------------------------
int n;
pii arr[100005];
void solve() {
cin >> n;
rep(i, 0, n) cin >> arr[i].ss >> arr[i].ff;
sort(arr, arr + n);
int ct = 0;
rep(i, 0, n) {
ct += arr[i].ss;
if (ct > arr[i].ff) {
cout << "No";
return;
}
}
cout << "Yes";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef local
/// freopen("input.txt","r",stdin);
/// freopen("output.txt","w",stdout);
#endif
clock_t qwertyuiop = clock();
int t = 1;
/// cin>>t;
rep(a, 0, t) {
/// cout<<"Case #"<<a+1<<": ";
solve();
}
#ifdef local
{
qwertyuiop = clock() - qwertyuiop;
double time_taken = ((double)qwertyuiop) / CLOCKS_PER_SEC;
cerr << fixed << setprecision(5) << "\n\nTime Taken : " << time_taken
<< " seconds\n";
}
#endif
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define vi vector<int>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i > b; i--)
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define MOD 1000000007
#define PI 3.14159265359
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
using namespace __gnu_pbds;
typedef tree<pii,null_type,less
<pii>,rb_tree_tag,tree_order_statistics_node_update>ind_set;
*/
///*X.find_by_order("index")
/// X.order_of_key("key")
#define deb(x) cerr << #x << " : " << x << "\n";
#ifndef local
#define deb(x) ;
#endif
///----------------------------------------------------------------------------------
int n;
pii arr[400005];
void solve() {
cin >> n;
rep(i, 0, n) cin >> arr[i].ss >> arr[i].ff;
sort(arr, arr + n);
int ct = 0;
rep(i, 0, n) {
ct += arr[i].ss;
if (ct > arr[i].ff) {
cout << "No";
return;
}
}
cout << "Yes";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef local
/// freopen("input.txt","r",stdin);
/// freopen("output.txt","w",stdout);
#endif
clock_t qwertyuiop = clock();
int t = 1;
/// cin>>t;
rep(a, 0, t) {
/// cout<<"Case #"<<a+1<<": ";
solve();
}
#ifdef local
{
qwertyuiop = clock() - qwertyuiop;
double time_taken = ((double)qwertyuiop) / CLOCKS_PER_SEC;
cerr << fixed << setprecision(5) << "\n\nTime Taken : " << time_taken
<< " seconds\n";
}
#endif
}
| replace | 35 | 36 | 35 | 36 | 0 | |
p02996 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
#define int long long
using namespace std;
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
pair<int, int> a[114514];
signed main() {
int n;
cin >> n;
rep(0, i, n) {
cin >> a[i].second;
cin >> a[i].first;
}
sort(a, a + n);
int sum = 0;
rep(0, i, n) {
sum += a[i].second;
if (sum > a[i].first) {
c("No") return 0;
}
}
c("Yes")
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
#define int long long
using namespace std;
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
pair<int, int> a[214514];
signed main() {
int n;
cin >> n;
rep(0, i, n) {
cin >> a[i].second;
cin >> a[i].first;
}
sort(a, a + n);
int sum = 0;
rep(0, i, n) {
sum += a[i].second;
if (sum > a[i].first) {
c("No") return 0;
}
}
c("Yes")
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02996 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define imfor(i, n) for (int i = 0; i < n; i++)
using namespace std;
ll MOD = 1000000007;
bool pairCompare(const pair<int, int> &firstElem,
const pair<int, int> &secondElem) {
return firstElem.second < secondElem.second;
}
int main() {
ll n;
pair<ll, ll> p[100010];
cin >> n;
imfor(i, n) {
ll a, b;
cin >> a >> b;
p[i] = make_pair(a, b);
}
sort(p, p + n, pairCompare);
ll t = 0;
bool ans = true;
imfor(i, n) {
t += p[i].first;
if (t > p[i].second) {
ans = false;
break;
}
}
if (ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define imfor(i, n) for (int i = 0; i < n; i++)
using namespace std;
ll MOD = 1000000007;
bool pairCompare(const pair<int, int> &firstElem,
const pair<int, int> &secondElem) {
return firstElem.second < secondElem.second;
}
int main() {
ll n;
pair<ll, ll> p[300010];
cin >> n;
imfor(i, n) {
ll a, b;
cin >> a >> b;
p[i] = make_pair(a, b);
}
sort(p, p + n, pairCompare);
ll t = 0;
bool ans = true;
imfor(i, n) {
t += p[i].first;
if (t > p[i].second) {
ans = false;
break;
}
}
if (ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | replace | 28 | 29 | 28 | 29 | 0 | |
p02996 | C++ | Runtime Error | /*
Life Before Death, Strength Before Weakness, Journey Before Destination
------------------------------------------------------------------------
You don't become great by trying to be great.
You become great by wanting to do something,
and then doing it so hard that you become great in the process.
*/
// #pragma comment(linker, ack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#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 rep(i, n) for (ll i = 0; i < (n); ++i)
#define repA(i, a, n) for (ll i = a; i <= (n); ++i)
#define repD(i, a, n) for (ll i = a; i >= (n); --i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define fill(a) memset(a, 0, sizeof(a))
#define fst first
#define snd second
// #define mp make_pair
#define pb push_back
#define PI 3.141592653589793238462643383279502884197169399 /* pi */
#define te \
ll ti; \
cin >> ti; \
while (ti--) \
solve();
typedef long double ld;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
const int maxN = 100100;
vector<pii> v;
ll pre[maxN];
void solve() {
ll n, x, y;
cin >> n;
rep(i, n) {
cin >> x >> y;
v.pb({y, x});
}
sort(all(v));
// pre[0] = v[0].snd;
repA(i, 0, n - 1) {
pre[i] = pre[i - 1] + v[i].snd;
if (pre[i] > v[i].fst) {
cout << "No" << endl;
return;
}
}
cout << "Yes" << endl;
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
/*
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
*/
// te
solve();
return 0;
} | /*
Life Before Death, Strength Before Weakness, Journey Before Destination
------------------------------------------------------------------------
You don't become great by trying to be great.
You become great by wanting to do something,
and then doing it so hard that you become great in the process.
*/
// #pragma comment(linker, ack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#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 rep(i, n) for (ll i = 0; i < (n); ++i)
#define repA(i, a, n) for (ll i = a; i <= (n); ++i)
#define repD(i, a, n) for (ll i = a; i >= (n); --i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define fill(a) memset(a, 0, sizeof(a))
#define fst first
#define snd second
// #define mp make_pair
#define pb push_back
#define PI 3.141592653589793238462643383279502884197169399 /* pi */
#define te \
ll ti; \
cin >> ti; \
while (ti--) \
solve();
typedef long double ld;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
const int maxN = 200100;
vector<pii> v;
ll pre[maxN];
void solve() {
ll n, x, y;
cin >> n;
rep(i, n) {
cin >> x >> y;
v.pb({y, x});
}
sort(all(v));
// pre[0] = v[0].snd;
repA(i, 0, n - 1) {
pre[i] = pre[i - 1] + v[i].snd;
if (pre[i] > v[i].fst) {
cout << "No" << endl;
return;
}
}
cout << "Yes" << endl;
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
/*
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
*/
// te
solve();
return 0;
} | replace | 52 | 53 | 52 | 53 | 0 | |
p02996 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
pair<long long, long long> pairs[100100];
long long sum;
sum = 0;
for (int i = 0; i < N; i++) {
cin >> pairs[i].second;
cin >> pairs[i].first;
}
sort(pairs, pairs + N);
for (int i = 0; i < N; i++) {
sum += pairs[i].second;
if (sum > pairs[i].first) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
pair<long long, long long> pairs[200200];
long long sum;
sum = 0;
for (int i = 0; i < N; i++) {
cin >> pairs[i].second;
cin >> pairs[i].first;
}
sort(pairs, pairs + N);
for (int i = 0; i < N; i++) {
sum += pairs[i].second;
if (sum > pairs[i].first) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02996 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <memory>
#include <set>
#include <vector>
#define ll long long
using namespace std;
const int NMAX = 100000 + 3;
int c[NMAX], d[NMAX], a[NMAX];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> c[i] >> d[i];
a[i] = i;
}
sort(a + 1, a + n + 1, [&](int a, int b) { return d[a] < d[b]; });
cout << endl;
// for (int i = 1; i <= n; ++i) {
// cout << d[a[i]] << " " << c[a[i]] << endl;
// }
ll time = 0;
for (int i = 1; i <= n; ++i) {
time += c[a[i]];
if (time > d[a[i]]) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <memory>
#include <set>
#include <vector>
#define ll long long
using namespace std;
const int NMAX = 200000 + 3;
int c[NMAX], d[NMAX], a[NMAX];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> c[i] >> d[i];
a[i] = i;
}
sort(a + 1, a + n + 1, [&](int a, int b) { return d[a] < d[b]; });
cout << endl;
// for (int i = 1; i <= n; ++i) {
// cout << d[a[i]] << " " << c[a[i]] << endl;
// }
ll time = 0;
for (int i = 1; i <= n; ++i) {
time += c[a[i]];
if (time > d[a[i]]) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02996 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 1000000007
#define LINF 1000000000000000007
#define MOD 1000000007
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define repb(i, n) for (int i = n - 1; i >= 0; i--)
#define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define ARDEB(i, X) cout << #X << "[" << i << "]: " << X[i] << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define ARDEB(i, X) \
{}
#define END \
{}
#endif
typedef pair<int, int> P;
struct edge {
int to, cost;
};
typedef long long ll;
int ans, ans2;
// �ő����
ll gcd(ll a, ll b) {
if (a == 0 || b == 0)
return 0;
if (a < b) {
ll sw;
sw = a;
a = b;
b = sw;
}
ll r;
while ((r = a % b) != 0) {
a = b;
b = r;
}
return b;
}
// �ŏ����{��
ll lcm(ll a, ll b) {
if (a == 0 || b == 0)
return 0;
return a / gcd(a, b) * b;
}
signed main() {
int n;
pair<int, int> p[111111];
cin >> n;
rep(i, n) cin >> p[i].second >> p[i].first;
sort(p, p + n);
int time = 0;
rep(i, n) {
time += p[i].second;
if (time > p[i].first) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 1000000007
#define LINF 1000000000000000007
#define MOD 1000000007
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define repb(i, n) for (int i = n - 1; i >= 0; i--)
#define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define ARDEB(i, X) cout << #X << "[" << i << "]: " << X[i] << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define ARDEB(i, X) \
{}
#define END \
{}
#endif
typedef pair<int, int> P;
struct edge {
int to, cost;
};
typedef long long ll;
int ans, ans2;
// �ő����
ll gcd(ll a, ll b) {
if (a == 0 || b == 0)
return 0;
if (a < b) {
ll sw;
sw = a;
a = b;
b = sw;
}
ll r;
while ((r = a % b) != 0) {
a = b;
b = r;
}
return b;
}
// �ŏ����{��
ll lcm(ll a, ll b) {
if (a == 0 || b == 0)
return 0;
return a / gcd(a, b) * b;
}
signed main() {
int n;
pair<int, int> p[2 * 111111];
cin >> n;
rep(i, n) cin >> p[i].second >> p[i].first;
sort(p, p + n);
int time = 0;
rep(i, n) {
time += p[i].second;
if (time > p[i].first) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| replace | 74 | 75 | 74 | 75 | 0 | |
p02996 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define vi vector<ll>
#define sll(x) scanf("%lld", &x)
#define prll(x) printf("%lld ", x)
#define pri(x) printf("%d ", x)
#define si(x) scanf("%d", &x)
#define el printf("\n")
#define pb push_back
#define f first
#define s second
#define arrondi(a) (long long)floor(a + 0.5);
#define NIL -1
ll N = 500005;
ll MAX = 9223372036854775807;
ll MOD = 1000000007;
long double PI = 4 * atan(1);
bool f(const pair<ll, ll> &a, const pair<ll, ll> &b) { return a.s < b.s; }
int main() {
IOS;
cout.precision(30);
int n;
cin >> n;
ll a, b;
vector<pair<ll, ll>> A;
for (int i = 0; i < n; i++) {
cin >> a >> b;
A.pb(make_pair(a, b));
}
sort(A.begin(), A.end(), f);
for (int i = 0; i < n; i++) {
int deb = i, fin = i;
for (int j = deb + 1; j < n; j++) {
if (A[i].s == A[j].s)
fin++;
}
i = fin + 1;
sort(A.begin() + deb, A.begin() + fin + 1);
}
ll s = 0;
bool res = true;
for (int i = 0; i < n; i++) {
s += A[i].f;
if (s > A[i].s) {
res = false;
break;
}
}
if (res)
cout << "Yes";
else
cout << "No";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define vi vector<ll>
#define sll(x) scanf("%lld", &x)
#define prll(x) printf("%lld ", x)
#define pri(x) printf("%d ", x)
#define si(x) scanf("%d", &x)
#define el printf("\n")
#define pb push_back
#define f first
#define s second
#define arrondi(a) (long long)floor(a + 0.5);
#define NIL -1
ll N = 500005;
ll MAX = 9223372036854775807;
ll MOD = 1000000007;
long double PI = 4 * atan(1);
bool f(const pair<ll, ll> &a, const pair<ll, ll> &b) { return a.s < b.s; }
int main() {
IOS;
cout.precision(30);
int n;
cin >> n;
ll a, b;
vector<pair<ll, ll>> A;
for (int i = 0; i < n; i++) {
cin >> a >> b;
A.pb(make_pair(a, b));
}
sort(A.begin(), A.end(), f);
for (int i = 0; i < n; i++) {
int deb = i, fin = i;
for (int j = deb + 1; j < n; j++) {
if (A[i].s == A[j].s)
fin++;
else
break;
}
i = fin + 1;
sort(A.begin() + deb, A.begin() + fin + 1);
}
ll s = 0;
bool res = true;
for (int i = 0; i < n; i++) {
s += A[i].f;
if (s > A[i].s) {
res = false;
break;
}
}
if (res)
cout << "Yes";
else
cout << "No";
return 0;
}
| insert | 41 | 41 | 41 | 43 | TLE | |
p02996 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define reg register
#define rep(a, b, c) for (reg int a = b, a##end = c; a <= a##end; ++a)
#define drep(a, b, c) for (reg int a = b, a##end = c; a >= a##end; --a)
char IO;
int rd() {
int s = 0, f = 0;
while (IO = getchar(), IO < '0' || IO > '9')
if (IO == '-')
f = 1;
do
s = (s << 1) + (s << 3) + (IO ^ '0');
while (IO = getchar(), IO >= '0' && IO <= '9');
return f ? -s : s;
}
const int N = 200100;
int n;
struct node {
int x, y;
bool operator<(const node __) const { return y < __.y; }
} a[N];
int main() {
n = rd();
rep(i, 1, n) a[i].x = rd(), a[i].y = rd();
sort(a + 1, a + n + 1);
ll now = 0;
for (int i = 1; i <= n; i++) {
if ((now += a[i].x) > a[i].y)
return puts("No");
}
puts("Yes");
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define reg register
#define rep(a, b, c) for (reg int a = b, a##end = c; a <= a##end; ++a)
#define drep(a, b, c) for (reg int a = b, a##end = c; a >= a##end; --a)
char IO;
int rd() {
int s = 0, f = 0;
while (IO = getchar(), IO < '0' || IO > '9')
if (IO == '-')
f = 1;
do
s = (s << 1) + (s << 3) + (IO ^ '0');
while (IO = getchar(), IO >= '0' && IO <= '9');
return f ? -s : s;
}
const int N = 200100;
int n;
struct node {
int x, y;
bool operator<(const node __) const { return y < __.y; }
} a[N];
int main() {
n = rd();
rep(i, 1, n) a[i].x = rd(), a[i].y = rd();
sort(a + 1, a + n + 1);
ll now = 0;
for (int i = 1; i <= n; i++) {
if ((now += a[i].x) > a[i].y)
return puts("No"), 0;
}
puts("Yes");
}
| replace | 37 | 38 | 37 | 38 | 0 | |
p02996 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef struct {
int a;
int b;
} ab;
ab s[100100];
int com(ab t1, ab t2) { return t1.b < t2.b; }
int main() {
int n, flag = 1, ti = 0;
cin >> n;
for (int i = 0; i < n; i++)
scanf("%d%d", &s[i].a, &s[i].b);
sort(s, s + n, com);
for (int i = 0; i < n; i++) {
ti += s[i].a;
if (ti > s[i].b) {
flag = 0;
break;
}
}
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef struct {
int a;
int b;
} ab;
ab s[200100];
int com(ab t1, ab t2) { return t1.b < t2.b; }
int main() {
int n, flag = 1, ti = 0;
cin >> n;
for (int i = 0; i < n; i++)
scanf("%d%d", &s[i].a, &s[i].b);
sort(s, s + n, com);
for (int i = 0; i < n; i++) {
ti += s[i].a;
if (ti > s[i].b) {
flag = 0;
break;
}
}
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02996 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int N;
cin >> N;
int A[100100], B[100100];
P C[100100];
bool flag = true;
for (int i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
if (b < a)
flag = false;
C[i] = P(b, a);
}
//
sort(C, C + N);
ll now = 0;
for (int i = 0; i < N; i++) {
ll x = C[i].first;
ll y = C[i].second;
if (now + y > x) {
flag = false;
} else {
now += y;
}
}
if (!flag)
cout << "No" << endl;
else
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int N;
cin >> N;
;
P C[200100];
bool flag = true;
for (int i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
if (b < a)
flag = false;
C[i] = P(b, a);
}
//
sort(C, C + N);
ll now = 0;
for (int i = 0; i < N; i++) {
ll x = C[i].first;
ll y = C[i].second;
if (now + y > x) {
flag = false;
} else {
now += y;
}
}
if (!flag)
cout << "No" << endl;
else
cout << "Yes" << endl;
} | replace | 8 | 10 | 8 | 10 | 0 | |
p02996 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define ll long long
const ll N = 2 * 1e5;
ll n, m;
struct node {
ll a, b;
} f[N];
bool cmp(node a, node b) { return a.b < b.b; }
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%lld%lld", &f[i].a, &f[i].b);
sort(f + 1, f + 1 + n, cmp);
for (int i = 1; i <= n; i++) {
m += f[i].a;
if (m > f[i].b) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define ll long long
const int N = 3 * 1e5;
ll n, m;
struct node {
ll a, b;
} f[N];
bool cmp(node a, node b) { return a.b < b.b; }
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%lld%lld", &f[i].a, &f[i].b);
sort(f + 1, f + 1 + n, cmp);
for (int i = 1; i <= n; i++) {
m += f[i].a;
if (m > f[i].b) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02996 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
typedef long long int ll;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
int N;
int sum = 0;
bool judge = true;
int main(void) {
pair<int, int> a[100001];
cin >> N;
rep(i, 0, N) cin >> a[i].second >> a[i].first;
sort(a, a + N);
rep(i, 0, N) {
sum += a[i].second;
if (sum > a[i].first) {
judge = false;
break;
}
}
if (judge == true)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
typedef long long int ll;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
int N;
int sum = 0;
bool judge = true;
int main(void) {
pair<int, int> a[200001];
cin >> N;
rep(i, 0, N) cin >> a[i].second >> a[i].first;
sort(a, a + N);
rep(i, 0, N) {
sum += a[i].second;
if (sum > a[i].first) {
judge = false;
break;
}
}
if (judge == true)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.