Submission #1150734

#TimeUsernameProblemLanguageResultExecution timeMemory
1150734sofiefuInside information (BOI21_servers)C++20
2 / 100
1083 ms9720 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define vo vector #define pb push_back #define se second #define fi first #define all(v) v.begin(), v.end() typedef vector<int> vi; typedef pair<int, int> pii; #define rep(i, a, b) for(int i=(a); i<b; i++) #define pr1(x) cerr << #x << '=' << x << ' '; //for google contests #define umap unordered_map #define uset unordered_set #define repd(i, a, b) for(int i=(b-1); i >= a; i--) void _pr(signed x) {cerr << x;} void _pr(long long x) {cerr << x;} void _pr(size_t x) {cerr << x;} void _pr(string &x) {cerr << x;} void _pr(double x) {cerr << x;} void _pr(char x) {cerr << '\'' << x << '\'';} void _pr(const char* x) {cerr << x;} void _pr(bool x) {cerr << (x ? "true" : "false");} template<typename T, typename V> void _pr(const pair<T, V> &x); template<typename T, typename V> void _pr(const pair<T, V> &x) {cerr << "\e[95m" << "[ "; _pr(x.first); cerr << ", "; _pr(x.second); cerr << "\e[95m" << ']';} template<typename T> void _pr(const T &x) {int F=0; cerr << '{'; for(auto &i: x) cerr << (F++ ? ", " : ""), _pr(i); cerr << "\e[91m" << '}';} template <typename T, typename... V> void _pr(T t, V... v) {_pr(t); if(sizeof...(v)) cerr << ", "; _pr(v...);} #define pr(x...) cerr << "\e[91m" << __func__ << ':' << __LINE__ << " [" << #x << "] = ["; _pr(x); cerr << "\e[91m" << ']' << "\033[0m" << endl; mt19937 mt_rng(chrono::steady_clock::now().time_since_epoch().count()); int rand(int l, int r){return uniform_int_distribution<int>(l, r)(mt_rng);} //go for outline with ;, then details int const inf = 1e18, mxn = 1e5+4; int n, q; vo<vo<pii>> adj(mxn); int solve(int at, int p, int goal, int prevind, int tme){ if(at==goal) return 1; int ret = 0; for(auto [x, ind]: adj[at]){ if(x==p || prevind>ind || ind>tme) continue; ret |= solve(x, at, goal, ind, tme); } return ret; } signed main(){ cin.tie(0)->sync_with_stdio(0); cin>>n>>q; int timer = 0; vo<array<int, 3>> queries; rep(i, 0, n-1+q){ char t; int a, b; cin>>t; if(t=='S'){ cin>>a>>b; a--, b--; adj[a].pb({b, timer}); adj[b].pb({a, timer}); } else if(t=='Q'){ cin>>a>>b; a--, b--; queries.pb({a, b, timer}); } else{ cin>>a; a--; queries.pb({-1, a, timer}); } timer++; } for(auto [a, b, tme]: queries){ if(a==-1) cout << "-1\n"; else cout << (solve(b, b, a, -1, tme) ? "yes":"no") << "\n"; } }
#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...
#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...