oj.uz

Submission #567211

# Submission time Handle Problem Language Result Execution time Memory
567211 2022-05-23T09:24:13 Z maomao90 Jail (JOI22_jail) C++17
0 / 100
 16 ms 5444 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 200005;

int t;
int n;
vi adj[MAXN];
int m;
ii st[MAXN];
int lr[MAXN], rl[MAXN];
int psm[MAXN];

int fw[MAXN];
void incre(int i, int x) {
    for (; i <= n; i += i & -i) fw[i] += x;
}
int qry(int i) {
    int res = 0;
    for (; i > 0; i -= i & -i) res += fw[i];
    return res;
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> t;
    while (t--) {
        cin >> n;
        REP (i, 1, n) {
            int a, b; cin >> a >> b;
            adj[a].pb(b);
            adj[b].pb(a);
        }
        cin >> m;
        REP (i, 0, n + 1) {
            lr[i] = 0;
            rl[i] = n + 1;
            fw[i] = 0;
        }
        REP (i, 0, m) {
            cin >> st[i].FI >> st[i].SE;
            lr[st[i].FI] = st[i].SE;
            if (st[i].FI < st[i].SE) {
                //lr[st[i].FI] = st[i].SE;
            } else {
                rl[st[i].FI] = st[i].SE;
            }
        }
        REP (i, 1, n + 1) {
            if (lr[i] != 0) {
                cerr << i << ": " << lr[i] << '\n';
                incre(lr[i], 1);
            }
        }
        bool pos = 1;
        REP (i, 1, n + 1) {
            if (lr[i] != 0) {
                incre(lr[i], -1);
                if (lr[i] > i && qry(lr[i]) > 0) {
                    pos = 0;
                    break;
                }
            }
        }
        REP (i, 0, n + 1) {
            fw[i] = 0;
        }
        REP (i, 1, n + 1) {
            if (lr[i] != 0) {
                incre(lr[i], 1);
            }
        }
        RREP (i, n - 1, 0) {
            if (lr[i] != 0) {
                incre(lr[i], -1);
                if (lr[i] < i && qry(n) - qry(lr[i] - 1) > 0) {
                    //pos = 0;
                    break;
                }
            }
        }
        if (pos) {
            cout << "Yes\n";
        } else {
            cout << "No\n";
        }
    }
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Incorrect 16 ms 5444 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Incorrect 3 ms 5132 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Incorrect 3 ms 5132 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Incorrect 3 ms 5132 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Incorrect 3 ms 5132 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 4 ms 4948 KB Output is correct
5 Incorrect 10 ms 5204 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Incorrect 16 ms 5444 KB Output isn't correct
5 Halted 0 ms 0 KB -