#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 = 4e18;
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;
void prep_arr(vector<array<int,3> > &ms, vector<array<int,3> > &mx, vector<array<int,2> > &interval) {
int cur_max = 0;
int gr = 0;
int ind = 0;
for(int i = 0; i<interval.size() - 1; i++) {
if(interval[i][0] > cur_max) {
gr++;
ind = 0;
}
else if(interval[i + 1][0] <= cur_max) {
continue;
}
else {
ind++;
}
cur_max = interval[i][1];
mx.pb({interval[i][1], ind, gr});
ms.pb({interval[i][0], ind, gr});
}
ind++;
if(interval.back()[0] > cur_max) {
gr++;
ind = 0;
}
mx.pb({interval.back()[1], ind, gr});
ms.pb({interval.back()[0], ind, gr});
}
void prep_ints() {
sort(lints.begin(), lints.end());
sort(rints.begin(), rints.end());
int mx = 0;
vector<array<int,2> > tmp;
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();
mx = 0;
for(int i = 0; i<rints.size(); i++) {
if(rints[i][1] > mx) {
mx = rints[i][1];
tmp.pb(rints[i]);
}
}
swap(tmp , rints);
prep_arr(l_ms, l_mx, lints);
prep_arr(r_ms, r_mx, rints);
}
int answer(int s, int t, vector<array<int,3> > &ms, vector<array<int,3> > &mx, vector<array<int,2> > &interval) {
auto itr = upper_bound(interval.begin(), interval.end(), array<int,2>({s, INF}));
if(itr == interval.begin()) {
return -1;
}
itr--;
if((*itr)[1] >= t) {
return 1;
}
auto itrmn = upper_bound(ms.begin(), ms.end(), array<int,3>({s, INF, INF}));
auto itrmx = lower_bound(mx.begin(), mx.end(), array<int,3>({t, 0, 0}));
if(itrmn == ms.begin() || itrmx == mx.end()) return -1;
itrmn--;
if((*itrmn)[2] != (*itrmx)[2]) return -1;
return (*itrmx)[1] - (*itrmn)[1] + 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, l_ms, l_mx, lints);
}
else {
ans = answer(s, t, r_ms, r_mx, rints);
}
cout<<ans<<"\n";
}
}
signed main() {
fastio();
int test = 1;
//cin>>test;
while(test--) {
solve();
}
}
Compilation message
Main.cpp: In function 'std::string to_string(std::string, int, int)':
Main.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
7 | 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...); }
| ~~~^~~~~~~~~~
Main.cpp: In function 'void prep_arr(std::vector<std::array<long long int, 3> >&, std::vector<std::array<long long int, 3> >&, std::vector<std::array<long long int, 2> >&)':
Main.cpp:37:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
37 | for(int i = 0; i<interval.size() - 1; i++) {
| ~^~~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'void prep_ints()':
Main.cpp:67:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
67 | for(int i = 0; i<lints.size(); i++) {
| ~^~~~~~~~~~~~~
Main.cpp:76:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
76 | for(int i = 0; i<rints.size(); i++) {
| ~^~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
18 ms |
4728 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
34 ms |
4304 KB |
Output is correct |
| 2 |
Correct |
54 ms |
6100 KB |
Output is correct |
| 3 |
Correct |
50 ms |
10044 KB |
Output is correct |
| 4 |
Correct |
60 ms |
8812 KB |
Output is correct |
| 5 |
Correct |
53 ms |
6384 KB |
Output is correct |
| 6 |
Correct |
53 ms |
6328 KB |
Output is correct |
| 7 |
Incorrect |
90 ms |
8116 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
68 ms |
11068 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
