text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > p;
int main() {
int tc;
cin >> tc;
while (tc--) {
p.clear();
int n, a, b;
cin >> n;
bool value = true;
for (int i = 0; i < n; ++i) {
cin >> a >> b;
if (a < b) value = false;
if (p.empty())
p.push_back({a, b});
else {
if (a < p.back().first || b < p.back().second ||
a - p.back().first < b - p.back().second)
value = false;
p.push_back({a, b});
}
}
if (value)
cout << "YES\n";
else
cout << "NO\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int t, n, a[105], b[105];
void solve() {
for (int i = 1; i <= n; ++i)
if (a[i] - a[i - 1] < b[i] - b[i - 1] || a[i - 1] > a[i] ||
b[i - 1] > b[i]) {
puts("NO");
return;
}
puts("YES");
}
int main() {
cin >> t;
while (t--) {
cin >> n;
for (int i = 1; i <= n; ++i) cin >> a[i] >> b[i];
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
pair<int, int> p[n];
for (int i = 0; i < n; i++) {
cin >> p[i].first >> p[i].second;
}
bool check = true;
for (int i = 0; i < n; i++) {
if (p[i].first < p[i].second) check = false;
if (i > 0) {
if (p[i].first == p[i - 1].first) {
if (p[i].second != p[i - 1].second) check = false;
} else if (p[i].first > p[i - 1].first) {
if (p[i].second < p[i - 1].second) check = false;
} else
check = false;
if (p[i].first - p[i - 1].first < p[i].second - p[i - 1].second)
check = false;
}
}
if (check)
cout << "YES\n";
else
cout << "NO\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, t;
cin >> t;
while (t--) {
cin >> n;
long long a[n], b[n];
cin >> a[0] >> b[0];
bool f = 1;
if (n == 1) {
if (a[0] >= b[0])
cout << "YES\n";
else
cout << "NO\n";
continue;
}
for (long long i = 1; i < n; i++) {
cin >> a[i] >> b[i];
}
for (long long i = 1; i < n; i++) {
if (a[0] < b[0]) {
f = 0;
break;
}
if (a[i] < a[i - 1]) {
f = 0;
break;
}
if (b[i] < b[i - 1]) {
f = 0;
break;
}
if (a[i] < b[i]) {
f = 0;
break;
}
if (a[i] - a[i - 1] < b[i] - b[i - 1]) {
f = 0;
break;
}
}
if (!f)
cout << "NO\n";
else
cout << "YES\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
bool f(long long x, long long y) { return x > y; }
void c_p_c() {}
void solve() {
long long n;
cin >> n;
long long p = 0, c = 0;
bool be = true;
while (n--) {
long long x, y;
cin >> x >> y;
if (x < p || y < c || y - c > x - p) {
be = false;
}
p = x;
c = y;
}
if (be)
cout << "YES\n";
else
cout << "NO\n";
}
int32_t main() {
c_p_c();
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long fx[] = {1, 1, 0, -1, -1, -1, 0, 1};
long long fy[] = {0, 1, 1, 1, 0, -1, -1, -1};
long long ar[5000005], br[500005];
vector<long long> a, b, c;
map<long long, long long> m1, m2, m3;
void Execute() {
long long N, NB, VAL, A, B, C, G, INC, DEC, L, R, D, mx = -1, mx1 = -1;
long long plays, clears;
cin >> N;
long long prev = 0, pre = 0, ok = 1;
for (long long i = (1); i <= (N); i++) {
cin >> L >> R;
if (i == 1) {
plays = L;
clears = R;
if (L < R) ok = 0;
} else if (i >= 2) {
long long dif = L - plays;
long long dif1 = R - clears;
if (dif >= 0 && dif1 >= 0 && L >= R) {
if (dif >= dif1) {
plays = L;
clears = R;
} else {
ok = 0;
plays = L;
clears = R;
}
} else {
ok = 0;
plays = L;
clears = R;
}
}
plays = L;
clears = R;
}
if (ok == 0)
cout << ("NO") << endl;
else
cout << ("YES") << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
int ___T;
cin >> ___T;
for (int cs = 1; cs <= ___T; cs++) {
Execute();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n, a[109], b[109], flag = 1;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d%d", &a[i], &b[i]);
for (int i = 1; i <= n; i++) {
if (a[i] < b[i]) {
flag = 0;
break;
}
}
for (int i = 2; i <= n; i++) {
if (a[i] - a[i - 1] < 0 || b[i] - b[i - 1] < 0) {
flag = 0;
break;
}
if (a[i] - a[i - 1] < b[i] - b[i - 1]) {
flag = 0;
break;
}
}
if (flag)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n;
cin >> t;
while (t--) {
cin >> n;
int p, c, p_p, p_c;
bool ans = true;
cin >> p >> c;
if (p < c) {
ans = false;
}
p_p = p, p_c = c;
for (int i = 1; i < n; ++i) {
cin >> p >> c;
if (p < c || p < p_p || c < p_c || (c - p_c) > (p - p_p)) {
ans = false;
}
p_p = p;
p_c = c;
}
if (ans) {
cout << "Yes"
<< "\n";
} else {
cout << "No"
<< "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long x, y, max1 = 0, max2 = 0, c = 0;
for (long long i = 0; i < n; i++) {
cin >> x >> y;
if (x < max1 || y < max2 || x < y) c = 1;
if (x - max1 < y - max2) c = 1;
max1 = x;
max2 = y;
}
if (c == 1)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cout.tie(NULL);
cin.tie(NULL);
long long int t;
cin >> t;
while (t--) {
long long int n, i, j, flag = 0;
cin >> n;
long long int a[n][2];
for (i = 0; i < n; i++) cin >> a[i][0] >> a[i][1];
if (a[0][0] < a[0][1])
flag = 1;
else {
for (i = 1; i < n; i++) {
if (a[i][0] < a[i - 1][0] || a[i][1] < a[i - 1][1]) {
flag = 1;
break;
}
if (a[i][1] > a[i - 1][1]) {
if (a[i][1] - a[i - 1][1] > a[i][0] - a[i - 1][0]) {
flag = 1;
break;
}
}
}
}
if (flag == 1)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
long long int a, b, pa = 0, pb = 0;
cin >> n;
bool flag = true;
while (n--) {
cin >> a >> b;
if (a < pa || b < pb || (b - pb) > (a - pa)) {
flag = false;
}
pa = a;
pb = b;
}
if (flag == true) {
cout << "YES\n";
} else {
cout << "NO\n";
}
return;
}
int main() {
int test = 1;
cin >> test;
while (test--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
pair<long long, long long> a[n];
for (long long i = 0; i < n; ++i) {
cin >> a[i].first >> a[i].second;
}
if (a[0].first < a[0].second) {
cout << "NO" << '\n';
return;
}
for (long long i = 1; i < n; ++i) {
if (a[i].first - a[i - 1].first < a[i].second - a[i - 1].second ||
a[i].first < a[i - 1].first || a[i].second < a[i - 1].second) {
cout << "NO" << '\n';
return;
}
}
cout << "YES" << '\n';
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long T = 1;
cin >> T;
for (long long i = 1; i <= T; ++i) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long int n, i, j, ca, pa, sign = 0;
cin >> n;
long long int C[n + 1], P[n + 1];
C[0] = 0, P[0] = 0;
for (i = 1; i <= n; i++) {
cin >> P[i] >> C[i];
if (C[i] < C[i - 1] || P[i] < P[i - 1]) {
sign = 1;
}
if (P[i] < C[i]) sign = 1;
}
for (i = 1; i <= n; i++) {
if ((P[i] - P[i - 1]) < (C[i] - C[i - 1])) sign = 1;
}
if (sign == 1)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
fast();
int t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
long long int pp = 0, ps = 0;
long long int a[n][2];
for (long long int i = 0; i < n; i++) {
for (long long int j = 0; j < 2; j++) {
cin >> a[i][j];
}
}
long long int ans = false;
for (long long int i = 0; i < n; i++) {
if ((a[i][1] > a[i][0]) || (a[i][0] < pp) || (a[i][1] < ps) ||
(a[i][1] - ps > a[i][0] - pp)) {
cout << "NO" << endl;
ans = true;
break;
} else {
pp = a[i][0];
ps = a[i][1];
}
}
if (!ans) {
cout << "YES" << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
while (t--) {
long long n, r = 0, s = 0, fl = 0, i;
cin >> n;
vector<pair<long long, long long> > vp;
while (n--) {
long long p, c;
cin >> p >> c;
vp.push_back(make_pair(p, c));
}
for (i = 0; i < vp.size(); i++) {
if (vp[i].first >= r && vp[i].second >= s) {
if (vp[i].first - r >= vp[i].second - s) {
r = vp[i].first;
s = vp[i].second;
} else {
fl = 1;
cout << "NO";
break;
}
} else {
fl = 1;
cout << "NO";
break;
}
}
if (fl == 0) cout << "YES";
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int t, n;
pair<int, int> pre, now;
int main() {
cin >> t;
while (t--) {
cin >> n;
bool flag = 1;
pre = pair<int, int>(0, 0);
while (n--) {
cin >> now.first >> now.second;
if ((now.first < pre.first) || (now.second < pre.second) ||
(now.second - pre.second > now.first - pre.first))
flag = 0;
pre = now;
}
if (flag)
puts("YES");
else
puts("NO");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll INF = (ll)1e18;
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr ll dx[4] = {1LL, 0LL, -1LL, 0LL};
constexpr ll dy[4] = {0LL, 1LL, 0LL, -1LL};
constexpr ll dx8[8] = {1LL, 0LL, -1LL, 0LL, 1LL, 1LL, -1LL, -1LL};
constexpr ll dy8[8] = {0LL, 1LL, 0LL, -1LL, 1LL, -1LL, 1LL, -1LL};
void p() { std::cout << '\n'; }
template <typename Head, typename... Tail>
void p(Head head, Tail... tail) {
std::cout << head << (sizeof...(tail) ? " " : "");
p(tail...);
}
template <typename T>
inline void pv(std::vector<T>& v) {
for (ll i = 0, N = v.size(); i < N; i++)
std::cout << v[i] << " \n"[i == N - 1];
}
template <typename T>
inline bool chmax(T& a, T b) {
return a < b && (a = b, true);
}
template <typename T>
inline bool chmin(T& a, T b) {
return a > b && (a = b, true);
}
template <typename T>
inline void uniq(std::vector<T>& v) {
v.erase(std::unique(v.begin(), v.end()), v.end());
}
void solve() {
ll Q;
cin >> Q;
vector<bool> ans(Q, true);
for (ll q = 0, q_length = (Q); q < q_length; ++q) {
ll N;
cin >> N;
vector<ll> a(N), b(N);
for (ll i = 0, i_length = (N); i < i_length; ++i) cin >> a[i] >> b[i];
for (ll i = 0, i_length = (N); i < i_length; ++i)
if (a[i] < b[i]) {
ans[q] = false;
continue;
}
for (ll i = 0, i_length = (N - 1); i < i_length; ++i)
if (a[i + 1] < a[i] || b[i + 1] < b[i]) {
ans[q] = false;
continue;
}
for (ll i = 0, i_length = (N - 1); i < i_length; ++i)
if (a[i + 1] == a[i] && b[i + 1] != b[i]) {
ans[q] = false;
continue;
}
for (ll i = 0, i_length = (N - 1); i < i_length; ++i)
if (a[i + 1] - a[i] < b[i + 1] - b[i]) {
ans[q] = false;
continue;
}
}
for (ll i = 0, i_length = (Q); i < i_length; ++i)
cout << (ans[i] ? "YES" : "NO") << endl;
}
signed main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void fileioe() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
}
bool cmp(pair<int, int> a, pair<int, int> b) {
if (a.first == b.first) return a.second < b.second;
return a.first < b.first;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
1;
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<pair<int, int> > v;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
v.push_back({a, b});
}
bool flag = false;
if (v[0].first < v[0].second) {
flag = true;
}
for (int i = 1; i < n && !flag; i++) {
if (v[i].first < v[i].second || v[i - 1].first > v[i].first ||
v[i - 1].second > v[i].second) {
flag = true;
break;
}
if (v[i].second - v[i - 1].second > v[i].first - v[i - 1].first) {
flag = true;
break;
}
}
if (flag)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int it = 0; it < t; it++) {
int n;
cin >> n;
int p[n], c[n];
for (int i = 0; i < n; i++) cin >> p[i] >> c[i];
string ans = "YES";
if (n == 1 && p[0] < c[0]) ans = "NO";
for (int i = 0; i < n - 1; i++) {
if (p[i] < c[i] || p[i + 1] < p[i] || c[i + 1] < c[i] ||
p[i + 1] - p[i] < c[i + 1] - c[i]) {
ans = "NO";
break;
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
bool isPrime(long long n) {
long long c;
if (n <= 1) return false;
c = sqrt(n);
for (int i = 2; i <= c; i++)
if (n % i == 0) return false;
return true;
}
const long long N = 1e5 + 7;
long long l, k, d, tr, n, m, sum, mini, maxi, a, b, c, x, y;
long long t[N];
set<int> vis;
vector<int> v;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
for (cin >> tr; tr--;) {
cin >> n;
mini = 0;
a = 0;
b = 0;
for (int i = 0; i < n; i++) {
cin >> x >> y;
if (x >= a && y >= b) {
if ((x - a) < (y - b)) {
mini++;
}
} else {
mini++;
}
a = x;
b = y;
}
if (mini) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 103;
int p[MAXN], c[MAXN];
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
bool check = true;
for (int i = 1; i <= n; i++) {
cin >> p[i] >> c[i];
if (c[i] > p[i] || c[i] < c[i - 1] || p[i] < c[i] ||
p[i] - p[i - 1] < c[i] - c[i - 1])
check = false;
}
if (check)
cout << "YES"
<< "\n";
else
cout << "NO"
<< "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int p[1234], c[1234];
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
int i;
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int i;
int flag = 0;
int a = 0, b = 0;
for (i = 0; i < n; i++) {
cin >> p[i] >> c[i];
if (p[i] - a < c[i] - b) {
flag = 1;
}
if (p[i] - a < 0) {
flag = 1;
}
if (c[i] - b < 0) flag = 1;
a = p[i];
b = c[i];
}
if (flag) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 205;
const long long int mod = 1000000007;
long long int m;
long long int gc(long long int a, long long int b) {
if (b == 0) return a;
return gc(b, a % b);
}
long long int power(long long int x, long long int y, long long int p) {
long long int res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
vector<bool> prime(100005, true);
vector<long long int> v;
void sieve(long long int n) {
prime[1] = false;
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p) prime[i] = false;
}
}
for (int i = 2; i <= n; i++) {
if (prime[i] == true) v.push_back(i);
}
}
bool comp(pair<long long int, long long int>& p1,
pair<long long int, long long int>& p2) {
return (p1.second < p2.second);
}
int BIT[1000];
void update(int x, int delta) {
int n;
for (; x <= n; x += x & -x) BIT[x] += delta;
}
int query(int x) {
int sum = 0;
for (; x > 0; x -= x & -x) sum += BIT[x];
return sum;
}
vector<vector<long long int> > dp(30005, vector<long long int>(248, -1));
void lcs() {
vector<int> d;
int ans, n;
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
vector<int>::iterator it = upper_bound(d.begin(), d.end(), x);
if (it == d.end())
d.push_back(x);
else
*it = x;
}
printf("LIS = %d", d.size());
}
long long int dfs(long long int src, long long int p,
vector<long long int> adj[], vector<long long int>& sz) {
sz[src] = 1;
for (int i = 0; i < adj[src].size(); i++) {
long long int v = adj[src][i];
if (v == p) continue;
sz[src] += dfs(v, src, adj, sz);
}
return sz[src];
}
void dfs2(long long int src, long long int p, vector<long long int> adj[],
vector<long long int>& dp, vector<long long int>& ans,
long long int m) {
ans[src] = dp[src];
for (int i = 0; i < adj[src].size(); i++) {
long long int v = adj[src][i];
if (v == p) continue;
dp[src] /= (dp[v] + 1);
dp[v] = ((dp[v] % m) * (dp[src] + 1) % m) % m;
dfs2(v, src, adj, dp, ans, m);
dp[v] /= (dp[src] + 1);
dp[src] = ((dp[src] % m) * (dp[v] + 1) % m);
}
return;
}
inline long long int add(long long int a, long long int b) {
return ((a % m) + (b % m)) % m;
}
inline long long int sub(long long int a, long long int b) {
return ((a % m) - (b % m) + m) % m;
}
inline long long int mul(long long int a, long long int b) {
return ((a % m) * (b % m)) % m;
}
long long int dfs1(vector<long long int> adj[], long long int src,
long long int p, long long int col,
vector<long long int>& dp) {
dp[src] = 1;
for (int i = 0; i < adj[src].size(); i++) {
long long int v = adj[src][i];
if (v == p) continue;
long long int st = dfs1(adj, v, src, 1, dp);
if (col == 1) {
long long int temp = 0;
temp = add(temp, dfs1(adj, v, src, 0, dp));
temp = add(temp, st);
dp[src] = mul(dp[src], temp);
} else {
dp[src] = mul(dp[src], st);
}
}
return dp[src];
}
long long int solution(vector<long long int> A, long long int k) {
long long int N = A.size();
if (N < k || N < 1 || k < 1) return 0;
if (N == k) return 1;
vector<long long int> v1(N, 0);
vector<long long int> v2(N, 0);
vector<long long int> v3(N, 0);
v2[N - 1] = 1;
v3[A[N - 1] - 1] = 1;
for (long long int i = N - 2; i >= 0; i--) {
v2[i] = v2[i + 1];
if (v3[A[i] - 1] == 0) {
v2[i]++;
v3[A[i] - 1] = 1;
}
}
for (long long int j = 1; j < k; j++) {
fill(v3.begin(), v3.end(), 0);
v1[N - 1] = 0;
for (long long int i = N - 2; i >= 0; i--) {
v1[i] = v1[i + 1];
v1[i] = v1[i] + v2[i + 1];
v1[i] = v1[i] - v3[A[i] - 1];
v3[A[i] - 1] = v2[i + 1];
}
v2 = v1;
}
return v1[0];
}
long long int recur(long long int idx, long long int sum,
vector<pair<long long int, long long int> >& v,
vector<long long int>& b, vector<long long int>& pre,
vector<long long int>& dp) {
if (idx == b.size()) return 0;
if (dp[idx] != -1) return dp[idx];
long long int temp = INT_MAX;
temp = min(temp, recur(idx + 1, sum, v, b, pre, dp) + b[idx]);
for (int i = 0; i < v.size(); i++) {
long long int x = v[i].first;
long long int y = v[i].second;
if (idx + x - 1 >= b.size()) continue;
long long int calc = pre[idx + x - 1] - pre[idx + y - 1];
temp = min(temp, recur(idx + x, sum, v, b, pre, dp) + calc);
}
dp[idx] = temp;
return temp;
}
set<pair<long long int, long long int> > temp;
void dfs(long long int src, vector<long long int>& p,
vector<long long int> adj[], vector<bool>& vis, vector<bool>& v) {
vector<long long int>::iterator it;
vis[src] = true;
for (it = adj[src].begin(); it != adj[src].end(); it++) {
if ((*it) == p[src]) continue;
if (!vis[*it]) {
p[*it] = src;
dfs((*it), p, adj, vis, v);
} else {
if (v[*it] == true)
continue;
else {
long long int c = (*it);
long long int d = src;
temp.insert(make_pair(c, d));
v[c] = true;
v[d] = true;
long long int coun = 1;
while (d != c) {
temp.insert(make_pair(d, p[d]));
coun++;
v[p[d]] = true;
d = p[d];
}
}
}
}
}
long long int recur(long long int idx, long long int k, long long int n) {
if (idx == n) return 1;
if (idx > n) return 0;
long long int temp = 0;
temp += recur(idx + 1, k, n);
temp += (idx + k, k, n);
return temp;
}
long long int find(long long int u, vector<long long int>& parent) {
if (u == parent[u])
return u;
else
return parent[u] = find(parent[u], parent);
}
void unio(long long int u, long long int v, vector<long long int>& parent,
vector<long long int>& ran, map<long long int, long long int>& m1) {
u = find(u, parent);
v = find(v, parent);
if (u == v) return;
if (ran[u] >= ran[v]) {
parent[v] = u;
ran[u] += v;
m1[u] += m1[v];
} else {
parent[u] = v;
ran[v] += u;
m1[v] += m1[u];
}
}
long long int dfs(long long int src, long long int p, vector<long long int>& a,
vector<pair<long long int, long long int> > adj[],
vector<long long int>& dp) {
long long int can1 = 0;
long long int can2 = 0;
vector<pair<long long int, long long int> >::iterator it;
for (it = adj[src].begin(); it != adj[src].end(); it++) {
if (((*it).first == p)) continue;
long long int st =
max(0LL, dfs((*it).first, src, a, adj, dp) - (*it).second);
if (st > can1) {
can2 = can1;
can1 = st;
} else if (st > can2) {
can2 = st;
}
}
dp[src] = a[src] + can1 + can2;
return (max(can1, can2) + a[src]);
}
long long int ans = 0;
vector<vector<long long int> > col(1003, vector<long long int>(1003, -1));
vector<vector<long long int> > store(1003, vector<long long int>(1003, -1));
long long int dfs(vector<vector<char> >& c, vector<vector<bool> >& vis,
long long int temp, long long int i, long long int j,
bool& check, char ch, long long int color) {
if (i < 0 || j < 0 || i >= vis.size() || j >= vis[0].size()) return temp;
if (ch == 'A' && c[i][j] != 'D') return temp;
if (ch == 'D' && c[i][j] != 'I') return temp;
if (ch == 'I' && c[i][j] != 'M') return temp;
if (ch == 'M' && c[i][j] != 'A') return temp;
if (vis[i][j]) {
if (c[i][j] == 'D' && color == col[i][j]) {
check = true;
cout << color << " " << i << " " << j << endl;
return 0;
}
}
if (dp[i][j] != -1) return dp[i][j];
col[i][j] = color;
vis[i][j] = true;
long long int cac = 0;
if (c[i][j] == 'A') {
ans = max(ans, temp + 1);
cac = max(cac, dfs(c, vis, temp + 1, i - 1, j, check, c[i][j], color));
cac = max(cac, dfs(c, vis, temp + 1, i + 1, j, check, c[i][j], color));
cac = max(cac, dfs(c, vis, temp + 1, i, j + 1, check, c[i][j], color));
cac = max(cac, dfs(c, vis, temp + 1, i, j - 1, check, c[i][j], color));
}
cac = max(cac, dfs(c, vis, temp, i - 1, j, check, c[i][j], color));
cac = max(cac, dfs(c, vis, temp, i + 1, j, check, c[i][j], color));
cac = max(cac, dfs(c, vis, temp, i, j + 1, check, c[i][j], color));
cac = max(cac, dfs(c, vis, temp, i, j - 1, check, c[i][j], color));
dp[i][j] = max(0LL, cac - temp);
return cac;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
vector<pair<long long int, long long int> > v;
for (int i = 0; i < n; i++) {
long long int x, y;
cin >> x >> y;
v.push_back(make_pair(x, y));
}
bool ans = true;
for (long long int i = 1; i < n; i++) {
if (v[i].first < v[i - 1].first) {
ans = false;
break;
}
if (v[i].second < v[i - 1].second) {
ans = false;
break;
}
if (v[i].first - v[i - 1].first < v[i].second - v[i - 1].second) {
ans = false;
break;
}
if (v[i].first < v[i].second) {
ans = false;
break;
}
}
if (v[0].first < v[0].second) ans = false;
if (ans == true) {
cout << "YES" << endl;
} else
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void testcase() {
int n;
cin >> n;
pair<long long int, long long int> arr[n];
for (long long int i = 0; i < n; i++) {
cin >> arr[i].first;
cin >> arr[i].second;
}
long long int strt = 0;
long long int end = 0;
for (long long int i = 0; i < n; i++) {
int plays = arr[i].first - strt;
int clears = arr[i].second - end;
strt = arr[i].first;
end = arr[i].second;
if (plays >= 0 and clears >= 0) {
if (plays >= clears) {
continue;
} else {
cout << "NO\n";
return;
}
} else {
cout << "NO\n";
return;
}
}
cout << "YES\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
testcase();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long mod2 = 123;
const long long N = 5e5 + 10;
void solve() {
int n;
cin >> n;
pair<long long, long long> x[n];
for (int i = 0; i < n; i++) cin >> x[i].first >> x[i].second;
for (int i = 0; i < n; i++) {
if (x[i].second > x[i].first) {
cout << "NO";
return;
}
if (i == 0) continue;
if (x[i].second < x[i - 1].second || x[i].first < x[i - 1].first) {
cout << "NO";
return;
}
if (x[i].second - x[i - 1].second > x[i].first - x[i - 1].first) {
cout << "NO";
return;
}
}
cout << "YES";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
int t = 1;
cin >> t;
for (int i = 1; i <= t; i++) {
solve();
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::string;
int main() {
int t = 0;
cin >> t;
for (int i = 0; i < t; ++i) {
int n = 0;
cin >> n;
bool res = true;
int p_pr = 0;
int c_pr = 0;
if (n > 0) {
cin >> p_pr >> c_pr;
}
if (c_pr > p_pr) {
res = false;
}
for (int j = 1; j < n; ++j) {
int p = 0;
int c = 0;
cin >> p >> c;
if (p < p_pr) {
res = false;
}
if (c < c_pr) {
res = false;
}
if (p - c < p_pr - c_pr) {
res = false;
}
p_pr = p;
c_pr = c;
}
if (res) {
cout << "YES\n";
} else {
cout << "NO\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<pair<long long, long long> > v;
for (long long i = 0; i < n; i++) {
long long x, y;
cin >> x >> y;
v.push_back(make_pair(x, y));
}
int f = 0, c = 0;
for (int i = 0; i < n; i++) {
if (v[i].first >= v[i].second) {
for (int j = 0; j < i; j++) {
if (v[j].second <= v[i].second && v[j].first <= v[i].first &&
v[i].first - v[j].first >= v[i].second - v[j].second) {
c++;
} else
f = 1;
}
if (f == 1) break;
} else {
f = 1;
break;
}
}
if (f == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, a1 = 0, b1 = 0, a, b, flag = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a >> b;
if (!flag) {
if (a - a1 < 0 || b - b1 < 0)
flag = 1;
else {
if ((b - b1) > (a - a1)) flag = 1;
}
a1 = a;
b1 = b;
}
}
if (flag)
cout << "NO\n";
else
cout << "YES\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long M = (long long)pow(2, 60);
bool check(pair<long long, long long> p1, pair<long long, long long> p2) {
if (p1.first == p2.first) return p1.second < p2.second;
return p1.first < p2.first;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long x, y, a, b, f = 0, mx = -1, my = -1;
for (long long i = 0; i < n; i++) {
cin >> a >> b;
if (b > a) f = 1;
if (i == 0) {
x = a;
y = b;
} else {
if (x > a || y > b || (b - y > a - x) || x < mx || y < my) f = 1;
x = a;
y = b;
}
if (y > x) f = 1;
mx = max(mx, a);
my = max(my, b);
if (mx < my) f = 1;
}
if (f)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long p[n], c[n];
for (long long i = 0; i < n; i++) cin >> p[i] >> c[i];
if (p[0] >= c[0]) {
long long flag = 0;
for (long long i = 1; i < n; i++) {
if ((p[i] >= c[i]) && (p[i] >= p[i - 1]) && (c[i] >= c[i - 1]) &&
((p[i] - p[i - 1]) >= (c[i] - c[i - 1])))
continue;
else {
flag = 1;
break;
}
}
if (flag)
cout << "NO" << endl;
else
cout << "YES" << endl;
} else
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
int p = 0, c = 0;
int flag = 0;
for (int i = 0; i < n; i++) {
if (b[i] - c > a[i] - p || b[i] < c || a[i] < p) {
flag = 1;
break;
}
p = a[i];
c = b[i];
}
if (flag == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
int a[110], b[110];
int T, n;
int main() {
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
bool pd = true;
for (int i = 1; i <= n; ++i) {
scanf("%d%d", &a[i], &b[i]);
if (a[i] < b[i] || a[i] < a[i - 1] || b[i] < b[i - 1]) {
pd = false;
}
if (a[i] - a[i - 1] < b[i] - b[i - 1]) {
pd = false;
}
}
if (!pd) {
printf("NO\n");
} else {
printf("YES\n");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> p(n + 1, 0), c(n + 1, 0);
for (int i = 1; i <= n; ++i) {
cin >> p[i] >> c[i];
}
bool poss = true;
for (int i = 1; i <= n; ++i) {
int dp = p[i] - p[i - 1];
int dc = c[i] - c[i - 1];
if (dp >= 0 && dc >= 0) {
if (dp < dc) poss = false;
} else
poss = false;
}
cout << (poss ? "YES" : "NO") << "\n";
}
}
|
#include <bits/stdc++.h>
const int N = 1e5 + 5;
const int INF = 0x3f3f3f3f;
const int MAXINT = 2147483647;
const int mod = 1000000007;
const long long MAXLONG = 9223372036854775807;
using namespace std;
template <class T>
inline bool Read(T &ret) {
char c;
int sgn;
if (static_cast<void>(c = getchar()), c == EOF) return 0;
while (c != '-' && (c < '0' || c > '9')) c = getchar();
sgn = (c == '-') ? -1 : 1;
ret = (c == '-') ? 0 : (c - '0');
while (static_cast<void>(c = getchar()), c >= '0' && c <= '9')
ret = ret * 10 + (c - '0');
ret *= sgn;
return 1;
}
template <class T>
inline void Write(T x) {
if (x < 0) putchar('-'), Write(x);
if (x > 9) Write(x / 10);
putchar(x % 10 + '0');
}
void solve(int question_num) {
while (question_num--) {
int n;
cin >> n;
struct node {
int a, b;
node() : a(0), b(0) {}
} a[103];
for (int i = 1; i <= n; ++i) {
cin >> a[i].a >> a[i].b;
}
int flage = 0;
for (int i = 1; i <= n; ++i) {
if ((a[i].a < a[i - 1].a) || (a[i].b < a[i - 1].b)) {
flage = 1;
break;
}
if (a[i].a - a[i - 1].a >= a[i].b - a[i - 1].b) continue;
flage = 1;
break;
}
if (flage)
cout << "NO\n";
else
cout << "YES\n";
}
}
int main() {
int t = 1;
cin >> t;
solve(t);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, temp, temp2, temp3 = 0;
cin >> n;
int temp4 = 0, temp5 = 0;
for (int i = 0; i < n; i++) {
cin >> temp >> temp2;
if (!(temp >= temp2 && temp >= temp4 && temp2 >= temp5 &&
temp - temp4 >= temp2 - temp5))
temp3 = 1;
temp4 = temp;
temp5 = temp2;
}
temp3 == 1 ? cout << "NO" << endl : cout << "YES" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-11;
template <class T>
inline void checkmin(T &a, T b) {
if (b < a) a = b;
}
template <class T>
inline void checkmax(T &a, T b) {
if (b > a) a = b;
}
template <class T>
inline T sqr(T x) {
return x * x;
}
template <class T>
inline void bin(T n, int pos) {
T i, one = 1, two = 2;
for (i = (one << (pos - 1)); i > 0; i = (i >> 1))
cout << ((n & i) ? "1" : "0");
cout << endl;
}
int lsb(unsigned int v) {
int r;
static const int MultiplyDeBruijnBitPosition[32] = {
0, 1, 28, 2, 29, 14, 24, 3, 30, 22, 20, 15, 25, 17, 4, 8,
31, 27, 13, 23, 21, 19, 16, 7, 26, 12, 18, 6, 11, 5, 10, 9};
r = MultiplyDeBruijnBitPosition[((uint32_t)((v & -v) * 0x077CB531U)) >> 27];
return r + 1;
}
template <class T>
inline int msb(T n) {
return (n == 0) ? 0 : (1 + msb(n >> 1));
}
template <class T>
inline T getbit(T n, int pos) {
return ((n & (1 << pos)) ? 1 : 0);
}
template <class T>
inline int countbit(T n) {
return (n == 0) ? 0 : (1 + countbit(n & (n - 1)));
}
template <class T>
inline void setbit(T &n, int p) {
n = n | (1LL << p);
}
template <class T>
inline T gcd(T a, T b) {
if (a < 0) return gcd(-a, b);
if (b < 0) return gcd(a, -b);
return (b == 0) ? a : gcd(b, a % b);
}
bool isequal(vector<int> a, vector<int> b) {
for (int i = 0; i < (a.size()); i++)
if (a[i] != b[i]) return false;
return true;
}
template <class T>
bool allequal(vector<T> a) {
sort(a.begin(), a.end());
return a[0] == a[a.size() - 1];
}
template <class T>
void printarray(vector<T> a) {
for (int i = 0; i < (a.size()); i++) cout << a[i] << " ";
cout << endl;
}
void printmatrix(vector<vector<int>> a, int n, int m) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cout << setw(4) << a[i][j];
}
cout << endl;
}
}
void readmatrix(vector<vector<int>> &a, int n, int m) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
}
template <class T>
void printsubarray(vector<T> a, int start, int end) {
if (start < 0 or end > a.size() - 1) cout << "Out of bounds" << endl;
for (int i = start; i <= end; i++) cout << a[i] << " ";
cout << endl;
}
bool isprime(int n) {
if (n < 2) return false;
if (n == 2) return true;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return true;
}
void split(const string &s, char c, vector<string> &result) {
stringstream ss(s);
string x;
while (getline(ss, x, c)) result.push_back(x);
}
void err(vector<string>::iterator it) {}
template <typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
cerr << it->substr((*it)[0] == ' ', it->length()) << " = " << a << '\n';
err(++it, args...);
}
void yup() { cout << "Yes" << endl; }
void nope() { cout << "No" << endl; }
void Yup() { cout << "YES" << endl; }
void Nope() { cout << "NO" << endl; }
void readarray(vector<int> &a, int size) {
int tmp;
a.clear();
for (int i = 0; i < (size); i++) {
cin >> tmp;
a.push_back(tmp);
}
}
void solvecase() {
int n, m;
int k;
cin >> n;
pair<int, int> g[111];
for (int i = 0; i < n; i++) {
cin >> g[i].first >> g[i].second;
}
bool ok = true;
if (g[0].first < g[0].second) ok = false;
for (int i = 1; i < n; i++) {
if ((g[i].first < g[i - 1].first) or (g[i].second < g[i - 1].second))
ok = false;
}
for (int i = 1; i < n; i++) {
int jumpc = g[i].second - g[i - 1].second;
int jumpp = g[i].first - g[i - 1].first;
if (jumpc > jumpp) ok = false;
}
ok ? Yup() : Nope();
}
int main() {
int cases = 1;
cin >> cases;
while (cases--) {
solvecase();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n;
scanf("%d", &n);
int a[n][2];
for (int i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1];
}
if (a[0][0] < a[0][1]) {
cout << "NO\n";
continue;
}
int flag = 0;
for (int i = 1; i < n; i++) {
if (a[i][0] < a[i - 1][0] || a[i][1] < a[i - 1][1] || a[i][0] < a[i][1] ||
(a[i][0] - a[i - 1][0]) < a[i][1] - a[i - 1][1]) {
cout << "NO\n";
flag = 1;
break;
}
}
if (flag == 0) cout << "YES\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
std::vector<pair<long long, long long> > v(n);
for (int i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
}
if (v[0].first < v[0].second) {
cout << "NO"
<< "\n";
continue;
}
bool ok = true;
for (int i = 1; i < n; i++) {
if (v[i].first < v[i].second) ok = false;
if (v[i].first < v[i - 1].first) ok = false;
if (v[i].second < v[i - 1].second) ok = false;
if ((v[i].first - v[i - 1].first) < (v[i].second - v[i - 1].second))
ok = false;
}
if (ok)
cout << "YES"
<< "\n";
else
cout << "NO"
<< "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n;
scanf("%d", &n);
int a[n], b[n];
for (int i = 0; i < n; i++) scanf("%d%d", &a[i], &b[i]);
if (a[0] < b[0])
printf("NO\n");
else {
int f = 1;
for (int i = 1; i < n; i++) {
if (a[i] < a[i - 1] || b[i] < b[i - 1]) {
f = 0;
break;
}
if (a[i] - a[i - 1] < b[i] - b[i - 1]) {
f = 0;
break;
}
}
if (f)
printf("YES\n");
else
printf("NO\n");
}
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
constexpr long long MOD = 1000000007LL;
template <class T, class U>
inline bool chmax(T &a, U b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class U>
inline bool chmin(T &a, U b) {
if (a > b) {
a = b;
return true;
}
return false;
}
void solve() {
int N;
cin >> N;
vector<pair<int, int> > A;
for (int i = 0; i < (N); ++i) {
int a, b;
cin >> a >> b;
A.emplace_back(a, b);
}
int na = 0, nb = 0;
bool ok = true;
for (int i = 0; i < (N); ++i) {
if (A[i].first < na) ok = false;
if (A[i].second < nb) ok = false;
if (A[i].first - na < A[i].second - nb) ok = false;
na = A[i].first;
nb = A[i].second;
}
cout << (ok ? "YES" : "NO") << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int Q;
cin >> Q;
while (Q--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O2")
vector<long long int> ar[1000001];
long long int vis[1000001], dis[1000001], level[1000001];
const int MAX_SIZE = 1000001;
const int N = 2000010;
const int mod = 1e9 + 7;
vector<int> isprime(MAX_SIZE, true);
vector<int> prime;
vector<int> SPF(MAX_SIZE);
long long int fact[N];
void manipulated_seive(int N) {
isprime[0] = isprime[1] = false;
for (int i = 2; i < N; ++i) {
if (isprime[i]) {
prime.push_back(i);
SPF[i] = i;
}
for (int j = 0;
j < (int)prime.size() && i * prime[j] < N && prime[j] <= SPF[i]; ++j) {
isprime[i * prime[j]] = false;
SPF[i * prime[j]] = prime[j];
}
}
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
unordered_map<long long int, long long int> myp;
void primeFactors(long long int n) {
while (n % 2 == 0) {
myp[2]++;
n = n / 2;
}
for (long long int i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) {
myp[i]++;
n = n / i;
}
}
if (n > 2) myp[n]++;
}
long long int gcd(long long int a, long long int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long int findlcm(long long int a, long long int b) {
return a * b / gcd(a, b);
}
long long int power(long long int a, long long int b) {
long long int res = 1;
while (b) {
if (b % 2) res *= a;
a *= a;
b /= 2;
}
return res;
}
long long int power_mod(long long int a, long long int b, long long int p) {
long long int res = 1;
while (b) {
if (b % 2) {
res *= a;
res %= p;
}
a *= a;
a %= p;
b /= 2;
}
return res;
}
long long int mod_inverse(long long int x) {
return power_mod(x, mod - 2, mod);
}
long long int nCr(long long int n, long long int r) {
if (r == 0) return 1;
long long int a = fact[n];
long long int b = mod_inverse(fact[n - r]);
long long int c = mod_inverse(fact[r]);
return (((a * b) % mod) * c) % mod;
}
void fun() {
long long int n;
cin >> n;
long long int preP = INT_MAX, preC = INT_MAX;
long long int cP, cC, flag = 0;
for (long long int i = 1; i <= n; i++) {
cin >> cP >> cC;
if (i != 1) {
if (cP == preP && cC > preC) {
flag = 1;
}
if (cP >= preP && cC >= preC && cC <= cP) {
} else {
flag = 1;
}
long long int dC = cC - preC;
long long int dP = cP - preP;
if (dC > dP) flag = 1;
}
if (i == 1) {
if (cC <= cP) {
} else {
flag = 1;
}
}
preP = cP, preC = cC;
}
if (flag == 1) {
cout << "NO" << '\n';
return;
}
cout << "YES" << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
unsigned long long int t;
cin >> t;
while (t--) {
cout << fixed;
cout << setprecision(10);
fun();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long int i, j, k, l, t, n;
cin >> t;
while (t--) {
cin >> n;
vector<pair<long long int, long long int>> v;
for (i = 0; i < n; i++) {
cin >> l >> j;
v.push_back(make_pair(l, j));
}
long long int cnt = 0;
if (v[0].second > v[0].first) {
cout << "NO" << endl;
continue;
}
for (i = 1; i < n; i++) {
if (v[i].first < v[i - 1].first || v[i].second < v[i - 1].second) {
cnt++;
cout << "NO" << endl;
break;
} else if (v[i].first == v[i - 1].first &&
v[i].second != v[i - 1].second) {
cnt++;
cout << "NO" << endl;
break;
} else if (v[i].second > v[i].first) {
cnt++;
cout << "NO" << endl;
break;
} else if (v[i].second - v[i - 1].second > v[i].first - v[i - 1].first) {
cnt++;
cout << "NO" << endl;
break;
}
}
if (cnt == 0) cout << "YES" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
while (a != 0) {
T temp = a;
a = b % a;
b = temp;
}
return b;
}
template <class T>
T egcd(T a, T b, T &x, T &y) {
T gcd, xt, yt;
if (a == 0) {
gcd = b;
x = 0, y = 1;
} else {
gcd = egcd(b % a, a, xt, yt);
x = yt - (b / a) * xt;
y = xt;
}
return gcd;
}
template <class T>
T expo(T base, T exp, T mod) {
T res = 1;
base = base % mod;
while (exp > 0) {
if (exp & 1) res = (res * base) % mod;
exp = exp >> 1;
base = (base * base) % mod;
}
return res;
}
template <class T>
T modinv(T a, T mod) {
T x, y;
egcd<T>(a, mod, x, y);
while (x < 0) x += mod;
while (x >= mod) x -= mod;
return x;
}
template <class T>
T modinvfermat(T a, T mod) {
return expo<T>(a, mod - 2, mod);
}
template <class T>
bool rev(T a, T b) {
return a > b;
}
template <class T>
long long maxpower(T a, T b) {
long long ans = 0;
while (a > 0 && a % b == 0) {
ans++;
a /= b;
}
return ans;
}
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<pair<int, int>> v(n);
for (auto i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
v[i] = make_pair(a, b);
}
int flag = 0;
if (v[0].first < v[0].second) {
cout << "NO" << endl;
} else {
for (auto i = 1; i < n; i++) {
if (v[i].first - v[i - 1].first >= v[i].second - v[i - 1].second) {
if (v[i].first - v[i - 1].first >= 0 &&
v[i].second - v[i - 1].second >= 0) {
} else {
cout << "NO" << endl;
flag = 1;
break;
}
} else {
cout << "NO" << endl;
flag = 1;
break;
}
}
if (flag == 0) cout << "YES" << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 5;
int p[N], c[N];
int main() {
int T;
scanf("%d", &T);
while (T--) {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d%d", &p[i], &c[i]);
}
bool flag = 1;
for (int i = 1; i <= n && flag; i++) {
int x = p[i] - p[i - 1];
int y = c[i] - c[i - 1];
if (x < 0 || y < 0) flag = 0;
if (x < y) flag = 0;
if (p[i] < c[i]) flag = 0;
}
printf("%s\n", flag ? "YES" : "NO");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<pair<int, int> > v(n);
for (int i = (0); i < int(n); i++) cin >> v[i].first >> v[i].second;
bool ok = true;
for (int i = (0); i < int(n); i++)
if (v[i].first < v[i].second) ok = false;
for (int i = (1); i < int(n); i++) {
int N = v[i].first - v[i - 1].first, m = v[i].second - v[i - 1].second;
if (N < 0 || m < 0 || m > N) ok = false;
}
cout << (ok ? "YES" : "NO") << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int p[n];
int c[n];
for (int i = 0; i < n; i++) {
cin >> p[i] >> c[i];
}
if (n == 1) {
if (p[0] >= c[0])
cout << "YES\n";
else
cout << "NO\n";
} else {
bool ye = true;
if (c[0] > p[0]) ye = false;
for (int i = 1; i < n; i++) {
if (p[i] < p[i - 1] || c[i] < c[i - 1] ||
(p[i] - p[i - 1]) < c[i] - c[i - 1] || c[i] > p[i]) {
ye = false;
break;
}
}
if (ye == true)
cout << "YES\n";
else
cout << "NO\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int cases;
cin >> cases;
while (cases--) {
int n;
cin >> n;
int plays = 0, clears = 0;
int plays_old = 0, clears_old = 0;
bool poss = true;
for (int i = 0; i < n; i++) {
cin >> plays >> clears;
int new_plays = plays - plays_old;
int new_clears = clears - clears_old;
if (new_clears > new_plays) {
poss = false;
} else if (new_plays < 0 || new_clears < 0) {
poss = false;
}
plays_old = plays;
clears_old = clears;
}
cout << (poss ? "YES" : "NO") << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int tc;
scanf("%d", &tc);
while (tc--) {
int n;
scanf("%d", &n);
int p = 0, c = 0;
bool fl = true;
for (int i = 0; i < int(n); i++) {
int x, y;
scanf("%d%d", &x, &y);
if (x < p || y < c || y - c > x - p) fl = false;
p = x, c = y;
}
puts(fl ? "YES" : "NO");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int o, n, x, z, i, t, d, w, j, p, h, max = 0, y, k, m, l, r, q;
cin >> t;
while (t--) {
d = 0;
cin >> n;
long long int a[n][2];
for (i = 0; i < n; i++) {
for (j = 0; j < 2; j++) cin >> a[i][j];
}
if (n == 1) {
if (a[0][0] >= a[0][1])
cout << "YES";
else
cout << "NO";
} else {
for (i = 1; i < n; i++) {
l = a[i][0];
k = a[i][1];
x = a[i - 1][0];
o = a[i - 1][1];
if ((l >= k) && (l >= x) && (x >= o) && (k >= o)) {
if ((k - o) <= (l - x)) {
continue;
} else {
d++;
break;
}
} else {
d++;
break;
}
}
if (d == 1)
cout << "NO";
else
cout << "YES";
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long pow(long long a, long long b) {
if (b == 0) return 1;
if (b & 1) return a * pow(a, b / 2) * pow(a, b / 2);
return pow(a, b / 2) * pow(a, b / 2);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
int q = 1;
cin >> q;
while (q--) {
int n;
cin >> n;
int a, b, bo = 1, p = 0, c = 0;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
if (p > x || c > y || x - p < y - c) bo = 0;
p = x, c = y;
}
if (bo)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long t, n, p, c, prep, prec;
bool ok = 1;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> t;
while (t--) {
cin >> n;
ok = 1;
prep = 0;
prec = 0;
for (int i = 0; i < n; i++) {
cin >> p >> c;
if (p < prep) ok = 0;
if (c < prec) ok = 0;
if ((c - prec) > (p - prep)) ok = 0;
prep = p;
prec = c;
}
if (ok)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int T, n, a[105], b[105], ans;
int main() {
scanf("%d", &T);
while (T--) {
ans = 1;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d%d", &a[i], &b[i]);
if (a[i] < a[i - 1] || b[i] < b[i - 1] ||
a[i] - a[i - 1] < b[i] - b[i - 1])
ans = 0;
}
if (ans)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
int n;
cin >> t;
int arr[107], brr[107];
while (t--) {
cin >> n;
int flag = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i] >> brr[i];
}
if (n == 1) {
if (arr[0] >= brr[0]) {
flag = 1;
cout << "YES" << endl;
continue;
} else {
cout << "NO" << endl;
flag = 1;
continue;
}
}
if (arr[0] < brr[0]) {
cout << "NO" << endl;
flag = 1;
continue;
}
for (int i = 1; i < n; i++) {
if (((arr[i] - arr[i - 1]) < (brr[i] - brr[i - 1])) ||
(arr[i] < arr[i - 1]) || (brr[i] < brr[i - 1])) {
flag = 1;
cout << "NO" << endl;
break;
}
}
if (!flag) cout << "YES" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(NULL);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long a, b;
cin >> a >> b;
long long flag = 1;
if (a < b) flag = 0;
for (__typeof(n) i = (1) - ((1) > (n)); i != (n) - ((1) > (n));
i += 1 - 2 * ((1) > (n))) {
long long na, nb;
cin >> na >> nb;
if (nb > na) flag = 0;
if (na < a || nb < b || ((na - a) < (nb - b))) flag = 0;
a = na, b = nb;
}
cout << ((flag == 1) ? "YES" : "NO") << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
int n, p, c, s1 = 0, s2 = 0;
while (t--) {
s1 = 0, s2 = 0;
cin >> n;
vector<int> play;
vector<int> cl;
int n1 = n;
while (n1--) {
cin >> p >> c;
play.push_back(p);
cl.push_back(c);
}
if (n == 1) {
if (c > p) {
cout << "NO\n";
continue;
}
}
int f = 0;
for (int i = 1; i < n; i++) {
if ((play.at(i) - play.at(i - 1)) < (cl.at(i) - cl.at(i - 1))) {
f = 1;
break;
}
}
if (f == 1) {
cout << "NO\n";
continue;
}
f = 0;
for (int i = 0; i < n; i++) {
s1 += play.at(i);
s2 += cl.at(i);
if ((s2 > s1)) {
f = 1;
break;
}
}
if (f == 1) {
cout << "NO\n";
continue;
}
f = 0;
for (int i = 1; i < n; i++) {
if ((play.at(i) < play.at(i - 1)) || (cl.at(i) < cl.at(i - 1))) {
f = 1;
break;
}
}
if (f == 1) {
cout << "NO\n";
continue;
} else {
int f = 0;
for (int i = 1; i < n; i++) {
if (cl.at(i) > cl.at(i - 1)) {
if (play.at(i) <= play.at(i - 1)) {
f = 1;
break;
}
}
}
if (f == 0) {
cout << "YES\n";
} else {
cout << "NO\n";
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int tc;
scanf("%d", &tc);
while (tc--) {
int n;
scanf("%d", &n);
int p = 0, c = 0;
int f1 = 0;
for (int i = 0; i < int(n); i++) {
int x, y;
scanf("%d%d", &x, &y);
if (x < p || y < c || y - c > x - p) f1 = 1;
p = x, c = y;
}
if (!f1)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
vector<pair<long long, long long>> A(n);
for (long long i = 0; i < (long long)n; i++) {
cin >> A[i].first >> A[i].second;
}
for (long long i = 0; i < (long long)n; i++) {
if (A[i].first < A[i].second) {
cout << "NO\n";
return;
}
if (i > 0 &&
(A[i].first < A[i - 1].first || A[i].second < A[i - 1].second)) {
cout << "NO\n";
return;
}
if (i > 0 && A[i].first - A[i - 1].first < A[i].second - A[i - 1].second) {
cout << "NO\n";
return;
}
}
cout << "YES\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long T;
cin >> T;
for (long long t = 0; t < (long long)T; t++) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
const long long inf = 1e9;
const int maxn = 3e5 + 10;
void rmax(long long& r, long long x) { r = max(r, x); }
long long n, m, k, x, y;
long long a[maxn], b[maxn];
string s;
int main(void) {
ios_base::sync_with_stdio(0), cin.tie(0);
int tc;
cin >> tc;
while (tc--) {
cin >> n;
for (int i = 1; i <= n; ++i) cin >> a[i] >> b[i];
bool yes = true;
for (int i = 1; i < n; ++i) {
if (a[i] > a[i + 1]) yes = false;
if (b[i] > b[i + 1]) yes = false;
if (a[i + 1] - a[i] < b[i + 1] - b[i]) yes = false;
if (a[i] < b[i]) yes = false;
}
if (a[n] < b[n]) yes = false;
cout << (yes ? "YES\n" : "NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
int T;
cin >> T;
for (int tc = 1; tc <= T; tc++) {
int n;
cin >> n;
vector<pair<int, int> > v(n);
for (int i = 0; i < n; i++) cin >> v[i].first >> v[i].second;
bool can = 1;
for (int i = 0; i < n; i++) {
int p = v[i].first;
int c = v[i].second;
if (c > p) can = 0;
if (i > 0) {
int delta_clear = c - v[i - 1].second;
int delta_play = p - v[i - 1].first;
if (delta_play < 0 || delta_clear < 0) can = 0;
if (delta_clear > delta_play) can = 0;
}
}
if (can) {
cout << "YES\n";
} else
cout << "NO\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int dx[4] = {0, 0, -1, 1};
const int dy[4] = {-1, 1, 0, 0};
int main() {
int i, j, k, n;
long int mx, mn, sm = 0;
int t;
cin >> t;
while (t--) {
int f = 0;
cin >> n;
vector<pair<int, int>> v(n);
for (i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
v[i] = (make_pair(a, b));
}
if (v[0].first < v[0].second) f = 1;
for (i = 1; i < n; i++) {
int x = v[i].first - v[i - 1].first;
int y = v[i].second - v[i - 1].second;
if (x < 0 || y < 0 || (v[i].first < v[i].second) ||
(v[i - 1].first < v[i - 1].second) || y > x) {
f = 1;
break;
}
}
if (f)
cout << "NO"
<< "\n";
else {
cout << "YES"
<< "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18 + 10;
const int inf = 1e9 + 10, dx[] = {0, 0, 1, -1, 1, -1, 1, -1},
dy[] = {1, -1, 0, 0, 1, 1, -1, -1};
long long MOD = 1e9 + 7;
long double eps = 1e-7, pi = acos(-1);
int t, n, p, c, last_p, last_c;
int main() {
ios_base::sync_with_stdio(0);
cin >> t;
for (int i = 0; i < t; i++) {
bool ans = 1;
cin >> n;
last_c = 0, last_p = 0;
for (int j = 0; j < n; j++) {
cin >> p >> c;
if (p < last_p || c < last_c || c > p || (p - last_p) < (c - last_c)) {
ans = 0;
}
last_p = p;
last_c = c;
}
cout << ((ans) ? "YES\n" : "NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
int n, f = 1;
cin >> n;
int p[n], c[n];
for (int i = 0; i < n; i++) {
cin >> p[i] >> c[i];
}
if (p[0] < c[0]) {
f = 0;
}
for (int i = 1; i < n; i++) {
if (p[i] < p[i - 1] || c[i] < c[i - 1] || p[i] < c[i] ||
((p[i] - p[i - 1]) < c[i] - c[i - 1])) {
f = 0;
break;
}
}
if (f == 0) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, i, j, s = 1;
cin >> n;
int a[n], b[n];
for (i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
for (i = 0; i < n; i++) {
if (b[i] > a[i]) {
s = 0;
break;
}
if (i > 0) {
if ((a[i] - a[i - 1]) < (b[i] - b[i - 1])) {
s = 0;
break;
}
}
for (j = 0; j < i; j++) {
if (a[i] < a[j]) {
s = 0;
break;
}
if (b[i] < b[j]) {
s = 0;
break;
}
}
}
if (s == 1) {
cout << "YES"
<< "\n";
} else {
cout << "NO"
<< "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
int p1 = 0, p2 = 0, ans = 1;
for (int i = 0; i < n; i++) {
int t1, t2;
cin >> t1 >> t2;
if (t1 - p1 < t2 - p2 or t2 > t1 or p1 < p2 or t1 < p1 or t2 < p2) ans = 0;
p1 = t1;
p2 = t2;
}
cout << (ans ? "YES" : "NO");
cout << endl;
return;
}
int main() {
int t = 1;
cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
int p, c;
cin >> p >> c;
v.push_back(make_pair(p, c));
}
int spi = INT_MIN, sci = INT_MIN;
bool flag = true;
for (int i = 0; i < n; i++) {
int sp = v[i].first;
int sc = v[i].second;
if (sp < sc || sp < spi || sc < sci || (sc - sci) > (sp - spi)) {
cout << "NO" << endl;
flag = false;
break;
}
spi = sp;
sci = sc;
}
if (flag) cout << "YES" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
cin >> T;
for (int tc = 1; tc <= T; tc++) {
int n;
cin >> n;
vector<pair<int, int> > v(n);
for (int i = 0; i < n; i++) cin >> v[i].first >> v[i].second;
bool can = 1;
for (int i = 0; i < n; i++) {
int p = v[i].first;
int c = v[i].second;
if (c > p) can = 0;
if (i > 0) {
int delta_clear = c - v[i - 1].second;
int delta_play = p - v[i - 1].first;
if (delta_play < 0 || delta_clear < 0) can = 0;
if (delta_clear > delta_play) can = 0;
}
}
if (can) {
cout << "YES\n";
} else
cout << "NO\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
pair<int, int> arr[n];
bool fg = 0;
for (int i = 0; i < n; ++i) {
cin >> arr[i].first >> arr[i].second;
if (arr[i].second > arr[i].first) fg = 1;
if (i == 0) continue;
if (arr[i].second > arr[i].first) fg = 1;
if (arr[i].first < arr[i - 1].first || arr[i].second < arr[i - 1].second)
fg = 1;
int maxch = arr[i].first - arr[i - 1].first;
if (arr[i].second > arr[i - 1].second + maxch) fg = 1;
}
if (fg) {
cout << "NO\n";
} else {
cout << "YES\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int tc = 1;
const int mod = 1e9 + 7;
const long long Inf = (long long)2e18 + 5;
const int N = 2e5 + 5;
int solve() {
int n, a, b;
cin >> n;
int x = 0, y = 0;
bool v = true;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (y > b || x > a) {
v = false;
} else if (b > y && a <= x) {
v = false;
} else if (a < b)
v = false;
else if (a - x < b - y)
v = false;
x = a;
y = b;
}
if (v)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
int main() {
int test = 1;
scanf("%d", &test);
while (test--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct debugger {
template <typename T>
debugger& operator,(const T& v) {
cerr << v << " ";
return *this;
}
} dbg;
inline long long gcd(long long a, long long b) {
a = ((a) < 0 ? -(a) : (a));
b = ((b) < 0 ? -(b) : (b));
while (b) {
a = a % b;
swap(a, b);
}
return a;
}
long long ext_gcd(long long A, long long B, long long* X, long long* Y) {
long long x2, y2, x1, y1, x, y, r2, r1, q, r;
x2 = 1;
y2 = 0;
x1 = 0;
y1 = 1;
for (r2 = A, r1 = B; r1 != 0;
r2 = r1, r1 = r, x2 = x1, y2 = y1, x1 = x, y1 = y) {
q = r2 / r1;
r = r2 % r1;
x = x2 - (q * x1);
y = y2 - (q * y1);
}
*X = x2;
*Y = y2;
return r2;
}
inline long long modInv(long long a, long long m) {
long long x, y;
ext_gcd(a, m, &x, &y);
x %= m;
if (x < 0) x += m;
return x;
}
inline long long bigmod(long long a, long long p, long long m) {
long long res = 1 % m, x = a % m;
while (p) {
if (p & 1) res = (res * x) % m;
x = (x * x) % m;
p >>= 1;
}
return res;
}
const long long inf = 2147383647;
const long long mod = 1000000007;
const double pi = 2 * acos(0.0);
const double eps = 1e-11;
const int SZ = 300005;
int A[SZ], B[SZ];
int N;
bool solve() {
if (B[1] > A[1]) return false;
for (long long i = (2); i <= (N); ++i) {
if (B[i] > A[i]) return false;
int dif1 = A[i] - A[i - 1];
int dif2 = B[i] - B[i - 1];
if (dif1 < 0 || dif2 < 0) return false;
if (dif2 > dif1) return false;
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tc;
cin >> tc;
for (long long cs = (1); cs <= (tc); ++cs) {
cin >> N;
for (long long i = (1); i <= (N); ++i) cin >> A[i] >> B[i];
if (solve())
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
const long long LINF = 1e18;
const int INF = 1e9;
const int M = 1e9 + 7;
const double EPS = 1e-9;
using namespace std;
int main(int argc, const char* argv[]) {
std::ios_base::sync_with_stdio(0);
int T;
cin >> T;
for (int t = 0; t < (int)(T); t++) {
int n;
cin >> n;
int pl = 0, cl = 0;
bool fl = 1;
for (int i = 0; i < (int)(n); i++) {
int p, c;
cin >> p >> c;
if (p < pl || c < cl) fl = 0;
if (p - pl < c - cl) fl = 0;
pl = p;
cl = c;
}
if (fl)
cout << "YES\n";
else
cout << "NO\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t > 0) {
t--;
int n;
cin >> n;
pair<int, int> a[n];
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
}
if (n == 1) {
if (a[0].first >= a[0].second) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
if (a[0].first < a[0].second) {
cout << "NO" << endl;
} else {
int i = 1;
while (i < n) {
if (a[i - 1].first <= a[i].first && a[i - 1].second <= a[i].second &&
a[i].first >= a[i].second &&
a[i].first - a[i - 1].first >= a[i].second - a[i - 1].second) {
i++;
} else {
break;
}
}
if (i == n) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int N = 1e5 + 5, inf = 1e18;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
long long int l = 0, r = 0;
long long int f = 0;
for (long long int i = 0; i < n; ++i) {
long long int a, b;
cin >> a >> b;
if (b - r > a - l || b > a || a < l || b < r) {
f = 1;
}
l = a;
r = b;
}
if (f == 1) {
cout << "NO"
<< "\n";
} else {
cout << "YES"
<< "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
int main() {
long long t;
scanf("%lld", &t);
;
while (t--) {
long long n;
scanf("%lld", &n);
;
long long pla[n];
long long clr[n];
for (int i = 0; i < n; i++) {
long long a, b;
cin >> (a) >> (b);
pla[i] = a;
clr[i] = b;
}
long long temp = 0;
for (int i = 1; i < n; i++) {
if (pla[i] < pla[i - 1]) {
temp = 1;
break;
}
}
if (temp) {
cout << ("NO") << endl;
continue;
}
for (int i = 1; i < n; i++) {
if (clr[i] < clr[i - 1]) {
temp = 1;
break;
}
}
if (temp) {
cout << ("NO") << endl;
continue;
}
for (int i = 0; i < n; i++) {
if (clr[i] > pla[i]) {
temp = 1;
break;
}
}
if (temp) {
cout << ("NO") << endl;
continue;
}
for (int i = 1; i < n; i++) {
if ((pla[i] - pla[i - 1]) < (clr[i] - clr[i - 1])) {
temp = 1;
break;
}
}
if (temp) {
cout << ("NO") << endl;
} else
cout << ("YES") << endl;
}
return (0);
}
|
#include <bits/stdc++.h>
using namespace std;
int a[300005];
int b[300005];
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i] >> b[i];
}
if (a[1] < b[1]) {
cout << "NO" << endl;
} else {
int fl = 0;
for (int i = 2; i <= n; ++i) {
int x = a[i] - a[i - 1];
int y = b[i] - b[i - 1];
if (x < 0 || y < 0 || x < y) {
cout << "NO" << endl;
fl = 1;
break;
}
}
if (fl == 0) cout << "YES" << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << " ";
err(++it, args...);
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int t = 1;
cin >> t;
while (t--) {
long long int n;
cin >> n;
long long int pp, pc, sump = 0, sumc = 0;
cin >> pp >> pc;
sump += pp;
sumc += pc;
bool pass = true;
if (sump < sumc) pass = false;
for (long long int i = 1, p, c; i < n; i++) {
cin >> p >> c;
sump += p;
sumc += c;
if (p < pp || (p - pp < c - pc) || (c < pc)) {
pass = false;
}
pp = p;
pc = c;
}
cout << (pass ? "YES" : "NO") << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
long long x, count = 0;
cin >> x;
long long arr[x][2];
cin >> arr[0][0] >> arr[0][1];
if (arr[0][0] >= arr[0][1]) count += 1;
for (int i = 1; i < x; i++) {
cin >> arr[i][0] >> arr[i][1];
if (arr[i][0] >= arr[i - 1][0] && arr[i][1] >= arr[i - 1][1] &&
(arr[i][0] - arr[i - 1][0]) >= (arr[i][1] - arr[i - 1][1]))
count += 1;
}
if (count == x)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
while (t--) {
long long n, flag = 0;
cin >> n;
long long l[n], r[n];
for (int i = 0; i < n; i++) {
cin >> l[i] >> r[i];
}
for (int i = 1; i < n; i++) {
if (l[i] < l[i - 1] || r[i] < r[i - 1] ||
(r[i] - r[i - 1]) > (l[i] - l[i - 1]) || l[i] < r[i])
flag = 1;
}
if (n == 1) {
if (l[0] >= r[0])
cout << "YES" << endl;
else
cout << "NO" << endl;
} else {
if (flag == 0 && l[0] >= r[0])
cout << "YES" << endl;
else
cout << "NO" << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
const long long MAX = 100100;
void pre() {}
void solve() {
long long n;
cin >> n;
vector<long long> p(n), c(n);
for (long long i = 0; i < n; ++i) cin >> p[i] >> c[i];
for (long long i = 0; i < n; ++i) {
if (c[i] > p[i]) {
cout << "NO"
<< "\n";
return;
}
}
for (long long i = 1; i < n; ++i) {
if (p[i] < p[i - 1]) {
cout << "NO"
<< "\n";
return;
}
if (c[i] < c[i - 1]) {
cout << "NO"
<< "\n";
return;
}
if ((p[i] - p[i - 1]) < (c[i] - c[i - 1])) {
cout << "NO"
<< "\n";
return;
}
}
cout << "YES"
<< "\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
pre();
long long t = 1;
cin >> t;
for (long long CASE = 1; CASE <= t; ++CASE) {
solve();
}
{};
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
while (T--) {
int n;
cin >> n;
std::vector<int> a(n);
std::vector<int> b(n);
for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
bool ispos = true;
if (a[0] < b[0]) ispos = false;
for (int i = 1; i < n; i++) {
if (a[0] < b[0]) ispos = false;
int p = a[i] - a[i - 1];
int q = b[i] - b[i - 1];
if (q > p) ispos = false;
if (p < 0 || q < 0) ispos = false;
}
if (ispos) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long t, n, p[100009], c[100009], flag;
int main() {
cin >> t;
while (t--) {
cin >> n;
flag = 0;
for (int i = 0; i < n; i++) {
cin >> p[i] >> c[i];
if (i)
if (c[i] > p[i] || p[i] < p[i - 1] || c[i] < c[i - 1] ||
((c[i] - c[i - 1]) > (p[i] - p[i - 1])))
flag = 1;
}
if (flag || (c[0] > p[0]))
cout << "NO" << endl;
else
cout << "YES" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n, p, c, maxC = 0, maxP = 0;
cin >> t;
while (t--) {
cin >> n;
string ans = "YES";
int maxC = 0, maxP = 0;
while (n--) {
cin >> p >> c;
if (p < maxP || c < maxC || p - maxP < c - maxC) {
ans = "NO";
}
maxP = p;
maxC = c;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
template <class T>
int gmax(T &a, T b) {
if (b > a) {
a = b;
return 1;
}
return 0;
}
template <class T>
int gmin(T &a, T b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using namespace std;
const int INF = 0x3f3f3f3f;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
int p[105], t[105];
int main() {
int T;
scanf("%d", &T);
while (T--) {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d %d", &p[i], &t[i]);
}
bool suc = true;
for (int i = 1; i < n && suc; ++i) {
if (t[i] < t[i - 1] || p[i] < p[i - 1]) {
suc = false;
break;
}
}
for (int i = 0; i < n; ++i) {
if (t[i] && (p[i] / t[i] < 1)) {
suc = false;
break;
}
}
for (int i = 1; i < n; ++i) {
if (t[i] != t[i - 1] && (p[i] - p[i - 1]) / (t[i] - t[i - 1]) < 1) {
suc = false;
break;
}
}
for (int i = 1; i < n && suc; ++i) {
if (t[i] > t[i - 1] && p[i] == p[i - 1]) {
suc = false;
break;
}
}
printf("%s\n", suc ? "YES" : "NO");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, temp1, temp2, i, k = 0;
vector<int> a;
;
vector<int> b;
;
cin >> n;
for (int i = 0; i <= n - 1; i++) {
cin >> temp1 >> temp2;
a.push_back(temp1);
b.push_back(temp2);
}
if (a[0] < b[0])
k++;
else {
for (int i = 0; i <= n - 2; i++) {
if (a[i + 1] < a[i] || b[i + 1] < b[i]) {
k++;
break;
} else if (a[i + 1] == a[i]) {
if (b[i + 1] != b[i]) {
k++;
break;
}
} else if ((a[i + 1] - a[i]) > 0) {
if ((b[i + 1] - b[i]) > (a[i + 1] - a[i])) {
k++;
break;
}
}
}
}
if (k == 1)
cout << "NO\n";
else
cout << "YES\n";
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
long long int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
vector<pair<long long int, long long int> > v;
long long int i, j, k;
for (i = 0; i <= n - 1; i++) {
long long int x, y;
cin >> x >> y;
v.push_back({x, y});
}
long long int c = 0;
long long int sum1 = v[0].first, sum2 = v[0].second;
if (sum1 < sum2) {
cout << "NO" << '\n';
continue;
}
for (i = 0; i <= n - 2; i++) {
long long int x = v[i + 1].first - v[i].first;
long long int y = v[i + 1].second - v[i].second;
if (y < 0) {
c = 1;
break;
}
if (x < 0) {
c = 1;
break;
}
sum1 += x;
sum2 += y;
if (sum1 < sum2) {
c = 1;
break;
}
if (y > x) {
c = 1;
break;
}
}
if (c == 1) {
cout << "NO" << '\n';
} else {
cout << "YES" << '\n';
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
string Levelcheck(vector<vector<int> > vec) {
int n;
n = vec.size();
if (vec[0][0] < vec[0][1]) {
return "NO";
}
for (int i = 1; i < n; i++) {
if (vec[i][0] < vec[i][1]) {
return "NO";
}
if (vec[i][0] < vec[i - 1][0]) {
return "NO";
}
if (vec[i][1] < vec[i - 1][1]) {
return "NO";
}
if ((vec[i][0] - vec[i - 1][0]) < (vec[i][1] - vec[i - 1][1])) {
return "NO";
}
}
return "YES";
}
int main() {
int t;
cin >> t;
vector<vector<int> > vec;
vector<int> vec1;
vector<string> vec2;
for (int i = 0; i < t; i++) {
int n;
cin >> n;
for (int j = 0; j < n; j++) {
int a;
int b;
cin >> a >> b;
vec1.push_back(a);
vec1.push_back(b);
vec.push_back(vec1);
vec1.clear();
}
string result = Levelcheck(vec);
vec2.push_back(result);
vec.clear();
}
for (int i = 0; i < t; i++) {
cout << vec2[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
f = ch == '-' ? -1 : 1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
return x * f;
}
const int N = 105;
int n, p[N], c[N];
int main() {
int T = read();
while (T--) {
n = read();
for (int i = 1; i <= n; i++) p[i] = read(), c[i] = read();
p[0] = 0;
c[0] = 0;
int fl = 1;
for (int i = 1; i <= n; i++) {
if (c[i] < c[i - 1] || p[i] < p[i - 1]) {
fl = 0;
break;
}
if (c[i] - c[i - 1] > p[i] - p[i - 1]) {
fl = 0;
break;
}
}
if (fl)
puts("YES");
else
puts("NO");
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1), eps = 1e-6;
const int dx[4] = {-1, 1, 0, 0}, dy[4] = {0, 0, -1, 1};
const int N = 1e6 + 5, M = 2e6 + 5, mod = 1e9 + 7;
int n;
int p[N], c[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int T;
cin >> T;
while (T--) {
cin >> n;
bool success = true;
for (int i = 1, d = 0; i <= n; i++) {
cin >> p[i] >> c[i];
if (p[i] < c[i] || p[i] < p[i - 1] || c[i] < c[i - 1] || p[i] - c[i] < d)
success = false;
d = p[i] - c[i];
}
cout << (success ? "YES" : "NO") << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool sortinrev(long long x, long long y) { return x > y; }
void swap(long long* a, long long* b) {
long long temp = *a;
*a = *b;
*b = temp;
}
long long div_ceil(long long a, long long b) { return (a + b - 1) / b; }
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
const int MOD = 1000 * 1000 * 1000 + 7;
const long long INF = 1e18L + 5;
const int nax = 1000005;
const int N = int(1e6);
void solve() {
long long n;
cin >> n;
long long prevP, prevC;
bool flag = 1;
cin >> prevP >> prevC;
if (prevC > prevP) flag = 0;
for (long long i = 1; i < n; i++) {
long long x, y;
cin >> x >> y;
if (prevC > y || prevP > x || x < y) flag = 0;
if (y - prevC > x - prevP) flag = 0;
prevP = x;
prevC = y;
}
if (flag)
cout << "YES\n";
else
cout << "NO\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t = 1;
cin >> t;
while (t--) {
solve();
}
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, b;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
int ca = 0, cb = 0;
bool flag = true;
for (int i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
int da = a - ca, db = b - cb;
if (da < 0 or db < 0) flag = false;
if (da < db) flag = false;
ca = a;
cb = b;
}
printf("%s\n", (flag ? "YES" : "NO"));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct node {
int p, c;
} a[103];
bool cmp(node x, node y) {
if (x.p == y.p)
return x.c < y.c;
else
return x.p < y.p;
}
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int i;
bool ok = 1;
for (i = 1; i <= n; i++) cin >> a[i].p >> a[i].c;
if (n == 1 && a[1].p < a[1].c) ok = 0;
for (i = 2; i <= n; i++) {
if (a[i].p < a[i - 1].p || a[i].c < a[i - 1].c) {
ok = 0;
break;
}
}
for (i = 1; i <= n; i++) {
if (a[i].p < a[i].c) {
ok = 0;
break;
}
}
if (ok) {
for (i = 2; i <= n; i++) {
if (a[i].p - a[i - 1].p < a[i].c - a[i - 1].c) {
ok = 0;
break;
}
}
}
if (ok)
puts("YES");
else
puts("NO");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, i, j, k = 0, l, p, q, a = 0, b = 0;
cin >> n;
for (i = 0; i < n; i++) {
p = a;
q = b;
cin >> a >> b;
if (p > a || q > b || b - q > a - p) k = 1;
}
if (k == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
int p[N], c[N];
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
bool fl = 0;
for (int i = 1; i <= n; i++) scanf("%d%d", &p[i], &c[i]);
for (int i = 1; i < n; i++)
if (p[i] > p[i + 1] || c[i] > c[i + 1] ||
p[i + 1] - p[i] < c[i + 1] - c[i] || p[i] < c[i])
fl = 1;
if (p[n] < c[n]) fl = 1;
if (fl)
puts("NO");
else
puts("YES");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
ll t;
cin >> t;
while (t--) {
ll n;
cin >> n;
vector<ll> p(n), c(n);
for (int i = 0; i < n; i++) cin >> p[i] >> c[i];
bool tt = false;
ll x = 0, y = 0;
for (int i = 0; i < n; i++) {
x = p[i] - x;
y = c[i] - y;
if (x >= y && x > -1 && y > -1) {
} else {
tt = true;
break;
}
x = p[i];
y = c[i];
}
if (tt == true)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int p[110], c[110];
void solve() {
for (auto i = (1); i <= (n - 1); i++) {
if (p[i] < p[i - 1] || c[i] < c[i - 1]) {
cout << "NO\n";
return;
}
if (c[i] > c[i - 1]) {
auto diff = c[i] - c[i - 1];
if (p[i] - p[i - 1] < diff) {
cout << "NO\n";
return;
}
}
}
if (c[0] <= p[0])
cout << "YES";
else
cout << "NO";
cout << "\n";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
cin >> n;
for (int i = 0; i < n; i++) cin >> p[i] >> c[i];
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, a, b, t, flag, x, y;
cin >> t;
while (t--) {
cin >> n;
flag = 0;
x = 0;
y = 0;
for (i = 1; i <= n; i++) {
cin >> a >> b;
if (a < x || b < y || a < b || (a - x) < (b - y)) {
flag = 1;
}
x = a;
y = b;
}
if (flag == 1)
cout << "NO\n";
else
cout << "YES\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
int a, b, j = 1;
cin >> a >> b;
if (b > a) j = 0;
for (int i = 1; i < n; i++) {
int x, y;
cin >> x >> y;
if (j) {
if (y > x)
j = 0;
else if (x - a < y - b) {
j = 0;
} else if (x - a < 0 || y - b < 0) {
j = 0;
}
}
a = x;
b = y;
}
if (j)
cout << "YES\n";
else
cout << "NO\n";
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
int t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int t;
for (std::cin >> t; t; t--) {
int n;
std::cin >> n;
int p = 0, c = 0;
bool ok = true;
for (size_t i = 0; i < n; i++) {
int pp, cc;
std::cin >> pp >> cc;
ok &= (pp - cc) >= (p - c) && pp >= p && cc >= c;
p = pp;
c = cc;
}
std::cout << (ok ? "YES" : "NO") << std::endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
int p1 = a[0], c1 = b[0], flag = 0, l = 0;
for (int i = 1; i < n; i++) {
l = 1;
p1 = a[i] - a[i - 1];
c1 = b[i] - b[i - 1];
if (c1 >= 0 && p1 >= 0 && p1 >= c1) {
;
} else {
cout << "NO" << endl;
flag = 1;
break;
}
}
if (a[0] < b[0] && flag == 0) {
cout << "NO" << endl;
} else if (flag == 0) {
cout << "YES" << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7, INF = 0x3f3f3f3f;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
long long r = 1 % P;
for (a %= P; n; a = a * a % P, n >>= 1)
if (n & 1) r = r * a % P;
return r;
}
long long inv(long long first) {
return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;
}
inline int rd() {
int first = 0;
char p = getchar();
while (p < '0' || p > '9') p = getchar();
while (p >= '0' && p <= '9') first = first * 10 + p - '0', p = getchar();
return first;
}
const int N = 1e6 + 50;
int n, p[N], c[N];
void work() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) cin >> p[i] >> c[i];
for (int i = 2; i <= n; ++i)
if (p[i] < p[i - 1]) return puts("NO"), void();
for (int i = 2; i <= n; ++i)
if (c[i] < c[i - 1]) return puts("NO"), void();
for (int i = 1; i <= n; ++i) {
if (c[i] - c[i - 1] > p[i] - p[i - 1]) return puts("NO"), void();
}
return puts("YES"), void();
}
int main() {
int t;
scanf("%d", &t);
while (t--) work();
}
|
#include <bits/stdc++.h>
using namespace std;
inline int qpow(int b, long long e, int m = 998244353) {
int a = 1;
for (; e; e >>= 1, b = (long long)b * b % m)
if (e & 1) a = (long long)a * b % m;
return a;
}
int n, m, q, k;
int a[300005], b[300005];
int main() {
int tests = 1;
scanf("%d", &tests);
while (tests--) {
scanf("%d", &n);
for (int i = 1; i <= (n); ++i) scanf("%d%d", a + i, b + i);
int ok = 1;
for (int i = 1; i <= (n); ++i)
if (a[i] < a[i - 1] || b[i] < b[i - 1]) ok = 0;
for (int i = 1; i <= (n); ++i)
if (a[i] - a[i - 1] < b[i] - b[i - 1]) ok = 0;
puts(ok ? "YES" : "NO");
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.