| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 874755 | efedmrlr | Railway Trip 2 (JOI22_ho_t4) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)), __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl
#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
const double EPS = 0.00001;
const int INF = 1e12;
const int N = 1e5+5;
const int M = 2e5+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,q,K;
vector<array<int,2> > lints, rints;
vector<array<int,3> > l_ms, l_mx, r_ms, r_mx;
vector<vector<int> > pl(N, vector<int>(LGN, N - 1)), pr(N, vector<int>(LGN, N - 1));
void prep_ints() {
sort(lints.begin(), lints.end());
sort(rints.begin(), rints.end());
int mx = 0;
vector<array<int,2> > tmp;
if(lints.size()) {
for(int i = 0; i<lints.size() - 1; i++) {
if(lints[i][0] == lints[i + 1][0]) continue;
tmp.pb(lints[i]);
}
tmp.pb(lints.back());
swap(tmp, lints); tmp.clear();
for(int i = 0; i<lints.size(); i++) {
if(lints[i][1] > mx) {
mx = lints[i][1];
tmp.pb(lints[i]);
}
}
swap(tmp, lints);
tmp.clear();
lints.pb({n+1, n+1});
for(int i = 0; i<lints.size() - 1; i++){
for(int j = lints[i][0]; j< lints[i + 1][0]; j++) {
pr[j][0] = lints[i][1];
}
}
}
if(rints.size()) {
mx = 0;
for(int i = 0; i<rints.size() - 1; i++) {
if(rints[i][0] == rints[i + 1][0]) continue;
tmp.pb(rints[i]);
}
tmp.pb(rints.back());
swap(tmp, rints); tmp.clear();
for(int i = 0; i<rints.size(); i++) {
if(rints[i][1] > mx) {
mx = rints[i][1];
tmp.pb(rints[i]);
}
}
swap(tmp , rints);
rints.pb({n+1, n+1});
for(int i = 0; i<rints.size() - 1; i++){
for(int j = rints[i][0]; j< rints[i + 1][0]; j++) {
pr[j][0] = rints[i][1];
}
}
}
calc_anc(pl);
calc_anc(pr);
}
void calc_anc(vector<vector<int> > &p) {
for(int k = 1; k<LGN; k++) {
for(int i = 1; i<=n; i++) {
p[i][k] = p[p[i][k - 1]][k - 1];
}
}
}
int answer(int s, int t, vector<vector<int> > &p) {
int ans = 1;
for(int i = LGN - 1; i>=0; i--) {
if(p[s][i] < t) {
ans += (1<<i);
s = p[s][i];
}
}
s = p[s][0];
if(s != N - 1 && s >= t) {
return ans;
}
return -1;
}
inline void solve() {
cin >> n >> K >> m;
for(int i = 0; i<m; i++) {
int l,r;
cin>>l>>r;
if(l > r) {
swap(l,r);
lints.pb({l, r});
}
else {
rints.pb({l, r});
}
}
prep_ints();
cin>>q;
for(int i = 0; i<q; i++) {
int s,t;
cin>>s>>t;
int ans = 0;
if(s > t) {
ans = answer(t, s, pl);
}
else {
ans = answer(s, t, pr);
}
cout<<ans<<"\n";
}
}
signed main() {
fastio();
int test = 1;
//cin>>test;
while(test--) {
solve();
}
}