Submission #850376

#	Time	Username	Problem	Language	Result	Execution time	Memory
850376		niter	Jail (JOI22_jail)	C++14	0 / 100	0 ms	428 KiB

jail

#include <bits/stdc++.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define pii pair<int,int>
#define pb push_back
#define ins insert
#define ff first
#define ss second
#define opa(x) cout << #x << " = " << x << ", ";
#define op(x) cout << #x << " = " << x << endl;
#define ops(x) cout << x;
#define entr cout << endl;
#define spac cout << ' ';
#define all(x) (x).begin(), (x).end()
#define STL(x) cout << #x << " : "; for(auto &qwe:x) cout << qwe << ' '; cout << endl;
#define arr(x, n) cout << #x << " : "; loop(qwe,0,n) cout << x[qwe] << ' '; cout << endl;
#define deb1 cout << "deb1" << endl;
#define deb2 cout << "deb2" << endl;
#define deb3 cout << "deb3" << endl;
#define deb4 cout << "deb4" << endl;
#define deb5 cout << "deb5" << endl;
using namespace std;
typedef long long ll;

const int mxn = 120200;
int a[mxn];

void solve(){
    int n, m;
    cin >> n >> m;
    loop(i,1,n+1) a[i] = 0;
    loop(i,0,n){
        int x, y; cin >> x >> y;
    }
    loop(i,0,m){
        int x, y;
        cin >> x >> y;
        if(x > y) swap(x, y);
        a[x]++;
        a[y+1]--;
    }
    loop(i,1,n+1){
        a[i] += a[i-1];
        if(a[i] > 1){
            cout << "No\n";
            return;
        }
    }
    cout << "Yes\n";
    return;
}

int main(){
    ios::sync_with_stdio(false); cin.tie(0);
//    freopen("test_input.txt", "r", stdin);
    int t = 1; cin >> t;
    while(t--){
        solve();
    }
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 16
• Subtask 4: 0 / 28
• Subtask 5: 0 / 12
• Subtask 6: 0 / 11
• Subtask 7: 0 / 23