Submission #59354

#	Time	Username	Problem	Language	Result	Execution time	Memory
59354		Benq	trapezoid (balkan11_trapezoid)	C++14	100 / 100	325 ms	36984 KiB

trapezoid

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

    
pi comb(pi a, pi b) {  
    if (a.f != b.f) return max(a,b);
    return {a.f,(a.s+b.s)%30013};
} 
    
template<class T, int SZ> struct Seg {
    T seg[2*SZ], MN = {0,0};
    
    Seg() {
        memset(seg,0,sizeof seg);
    }
    
    void upd(int p, T value) {  // set value at position p
        for (seg[p += SZ] = value; p > 1; p >>= 1)
            seg[p>>1] = comb(seg[(p|1)^1],seg[p|1]); // non-commutative operations
    }
    
    void build() {
        F0Rd(i,SZ) seg[i] = comb(seg[2*i],seg[2*i+1]);
    }
    
    T query(int l, int r) {  // sum on interval [l, r]
        T res1 = MN, res2 = MN; r++;
        for (l += SZ, r += SZ; l < r; l >>= 1, r >>= 1) {
            if (l&1) res1 = comb(res1,seg[l++]);
            if (r&1) res2 = comb(seg[--r],res2);
        }
        return comb(res1,res2);
    }
};

Seg<pi,1<<18> S;
int N;
map<int,int> m;
priority_queue<array<int,4>,vector<array<int,4>>,greater<array<int,4>>> p;
pi ans;
vector<array<int,4>> v;

void input() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N;
    m[0] = 1;
    F0R(i,N) {
        int a,b,c,d; cin >> a >> b >> c >> d;
        v.pb({a,b,c,d});
        m[c] = m[d] = 0;
    }
    S.upd(0,{0,1});
    int co = 0;
    for (auto& a: m) a.s = co++;
    for (auto& a: v) {
        a[2] = m[a[2]];
        a[3] = m[a[3]];
    }
}

int main() {
    input();
    sort(all(v));
    for (auto x: v) {
        while (sz(p) && p.top()[0] < x[0]) {
            S.upd(p.top()[1],{p.top()[2],p.top()[3]});
            p.pop();
        }
        pi z = S.query(0,x[2]-1); z.f ++;
        ans = comb(ans,z);
        p.push({x[1],x[3],z.f,z.s});
    }
    cout << ans.f << " " << ans.s;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

• Subtask 1: 100 / 100