//author:
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define ONLINE_JUDGE
void solve() {
int n;
cin >> n;
vector <pair <int, int>> vec(n +1);
for(int i = 1; i <= n; i++) {
cin >> vec[i].second >> vec[i].first;
vec[i].first *= -1;
vec[i].second *= -1;
}
int q;
cin >> q;
for(int i = 1; i <= q; i++) {
int l, r;
cin >> l >> r;
multiset <pair <int, int>> ms(vec.begin() + l, vec.begin() + r +1);
int cnt = 0;
while(!ms.empty()) {
auto it = ms.begin();
while(it != ms.end()) {
auto [a, b] = *it;
//cerr << -a << " " << -b << "\n";
ms.erase(it);
if(ms.empty()) {
break;
}
it = ms.lower_bound({a, 0});
}
cnt++;
}
cout << cnt << "\n";
//cerr << "\n";
}
return;
}
signed main() {
#ifndef ONLINE_JUDGE
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int t = 1; //cin >> t;
while(t--)
solve();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
98 ms |
10832 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1033 ms |
864 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1033 ms |
864 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1030 ms |
10968 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
98 ms |
10832 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |