Submission #1244015

#TimeUsernameProblemLanguageResultExecution timeMemory
1244015fskaricaJail (JOI22_jail)C++20
5 / 100
1069 ms10428 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define fi first #define se second #define pii pair<int, int> const int MAX = 2e5 + 10; int n, m; int x, y; vector <int> veze[MAX]; vector <pii> prisoner; vector <pii> prisoner2; int bio[MAX]; void input() { cin >> n; for (int i = 0; i <= n; i++) { bio[i] = 0; veze[i].clear(); } for (int i = 0; i < n - 1; i++) { cin >> x >> y; veze[x].push_back(y); veze[y].push_back(x); } cin >> m; prisoner.clear(); prisoner2.clear(); for (int i = 0; i < m; i++) { cin >> x >> y; if (x <= y) prisoner.push_back({x, y}); else prisoner2.push_back({x, y}); } sort(prisoner.rbegin(), prisoner.rend()); sort(prisoner2.begin(), prisoner2.end()); } void solve() { input(); for (auto e : prisoner2) bio[e.fi] = 1; bool sol = true; for (auto e : prisoner) { for (int i = e.fi; i <= e.se; i++) { if (bio[i]) { sol = false; break; } } bio[e.se] = 1; } for (auto e : prisoner2) { bio[e.fi] = 0; for (int i = e.fi; i >= e.se; i--) { if (bio[i]) { sol = false; break; } } bio[e.se] = 1; } if (sol) cout << "Yes\n"; else cout << "No\n"; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { solve(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...