#include <bits/stdc++.h>
using namespace std; using ii = pair<int,int>; using ll = long long;
void o_o(){ cerr << endl; }
template <class H, class...T> void o_o(H h,T...t) { cerr << ' ' << h; o_o(t...); }
#define debug(...) cerr<<'['<<#__VA_ARGS__<<"]:",o_o(__VA_ARGS__)
#define rep(i,a,b) for (auto i = (a); i <= (b); ++i)
#define all(x) (x).begin(), (x).end()
#define size(x) int((x).size())
#define fi first
#define se second
#define Mup(x,y) x = max(x,y)
const int N = 1e5+3;
int n;
priority_queue<pair<ii,ii>,vector<pair<ii,ii>>,less<>> pq;
struct segment_tree {
int t[2*N], c[2*N];
void update(int k, int v1, int v2) {
k += N;
for (t[k] = v1, c[k] = v2%30013; (k /= 2) >= 1;) {
if (t[2*k] < t[2*k+1]) c[k] = c[2*k+1];
else if (t[2*k] > t[2*k+1]) c[k] = c[2*k];
else c[k] = (c[2*k]+c[2*k+1])%30013;
t[k] = max(t[2*k],t[2*k+1]);
}
}
ii query(int a, int b) {
int r = 0, s = 0;
for (int x = a+N, y = b+N; x <= y; ++x /= 2, --y /= 2) {
if (x&1) Mup(r,t[x]);
if (~y&1) Mup(r,t[y]);
}
for (int x = a+N, y = b+N; x <= y; ++x /= 2, --y /= 2) {
if (x&1) { if (t[x] == r) s = (s+c[x])%30013; }
if (~y&1) { if (t[y] == r) s = (s+c[y])%30013; }
}
return {r,s};
}
} ds;
pair<ii,ii> t[N];
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n;
vector<int> xs, ys;
rep(i,1,n) {
cin >> t[i].fi.fi >> t[i].se.fi;
xs.push_back(t[i].fi.fi), xs.push_back(t[i].se.fi);
cin >> t[i].fi.se >> t[i].se.se;
ys.push_back(t[i].fi.se), ys.push_back(t[i].se.se);
}
sort(all(xs)), xs.erase(unique(all(xs)),end(xs));
sort(all(ys)), ys.erase(unique(all(ys)),end(ys));
rep(i,1,n) {
t[i].fi.fi = lower_bound(all(xs),t[i].fi.fi)-begin(xs);
t[i].fi.se = lower_bound(all(ys),t[i].fi.se)-begin(ys);
t[i].se.fi = lower_bound(all(xs),t[i].se.fi)-begin(xs);
t[i].se.se = lower_bound(all(ys),t[i].se.se)-begin(ys);
}
sort(t+1,t+n+1);
if (n <= 5000) {
int lis[N] {0,}, cnt[N] {0,};
int ans1 = 0, ans2 = 0;
rep(i,1,n) {
lis[i] = 1, cnt[i] = 1;
rep(j,1,n-1) {
if (t[j].se.fi < t[i].fi.fi and t[j].se.se < t[i].fi.se) {
if (lis[i] < lis[j]+1) {
lis[i] = lis[j]+1;
cnt[i] = cnt[j];
} else if (lis[i] == lis[j]+1)
cnt[i] = (cnt[i]+cnt[j])%30013;
}
}
Mup(ans1, lis[i]);
}
rep(i,1,n) if (ans1 == lis[i])
ans2 = (ans2+cnt[i])%30013;
cout << ans1 << ' ' << ans2;
}
else {
rep(i,1,n) {
auto [p1,p2] = t[i];
while (not empty(pq) and pq.top().fi.fi < p1.fi) {
ds.update(pq.top().fi.se, pq.top().se.fi,pq.top().se.se);
pq.pop();
}
auto [v1,v2] = ds.query(0,p1.se);
if (v1 == 0) v2 = 1;
pq.emplace(p2,ii{v1+1,v2});
}
while (not empty(pq)) {
ds.update(pq.top().fi.se,pq.top().se.fi,pq.top().se.se);
pq.pop();
}
auto [a1,a2] = ds.query(0,2*n+2);
cout << a1 << ' ' << a2;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 3 |
Correct |
2 ms |
1112 KB |
Output is correct |
| 4 |
Correct |
5 ms |
1108 KB |
Output is correct |
| 5 |
Correct |
12 ms |
1236 KB |
Output is correct |
| 6 |
Correct |
26 ms |
1244 KB |
Output is correct |
| 7 |
Correct |
63 ms |
1324 KB |
Output is correct |
| 8 |
Correct |
47 ms |
1392 KB |
Output is correct |
| 9 |
Incorrect |
15 ms |
2256 KB |
Output isn't correct |
| 10 |
Incorrect |
29 ms |
3504 KB |
Output isn't correct |
| 11 |
Incorrect |
33 ms |
3940 KB |
Output isn't correct |
| 12 |
Incorrect |
73 ms |
6176 KB |
Output isn't correct |
| 13 |
Runtime error |
79 ms |
8336 KB |
Execution killed with signal 11 |
| 14 |
Runtime error |
114 ms |
9432 KB |
Execution killed with signal 11 |
| 15 |
Runtime error |
88 ms |
9820 KB |
Execution killed with signal 11 |
| 16 |
Runtime error |
93 ms |
9328 KB |
Execution killed with signal 11 |
| 17 |
Runtime error |
135 ms |
10080 KB |
Execution killed with signal 11 |
| 18 |
Runtime error |
106 ms |
10936 KB |
Execution killed with signal 11 |
| 19 |
Runtime error |
101 ms |
12528 KB |
Execution killed with signal 11 |
| 20 |
Runtime error |
123 ms |
12892 KB |
Execution killed with signal 11 |
