#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pi;
typedef pair<pi, int> pii;
typedef pair<ll,ll> pl;
typedef pair<db,db> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;
template<class T> using V = vector<T>;
template<class T, size_t SZ> using AR = array<T,SZ>;
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define For(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define Rof(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
template<class T> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0; }
constexpr int pct(int x) { return __builtin_popcount(x); }
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x))
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
ll half(ll x) { return fdiv(x,2); }
template<class T, class U> T fstTrue(T lo, T hi, U f) {
// note: if (lo+hi)/2 is used instead of half(lo+hi) then this will loop infinitely when lo=hi
hi ++; assert(lo <= hi); // assuming f is increasing
while (lo < hi) { // find first index such that f is true
T mid = half(lo+hi);
f(mid) ? hi = mid : lo = mid+1;
}
return lo;
}
template<class T, class U> T lstTrue(T lo, T hi, U f) {
lo --; assert(lo <= hi); // assuming f is decreasing
while (lo < hi) { // find first index such that f is true
T mid = half(lo+hi+1);
f(mid) ? lo = mid : hi = mid-1;
}
return lo;
}
template<class T> void remDup(vector<T>& v) {
sort(all(v)); v.erase(unique(all(v)),end(v)); }
// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);
template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }
template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }
// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) {
#ifdef LOCAL
return b ? "true" : "false";
#else
return ts((int)b);
#endif
}
template<class A> str ts(complex<A> c) {
stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
str res = ""; F0R(i,SZ) res += char('0'+b[i]);
return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
#ifdef LOCAL
bool fst = 1; str res = "{";
for (const auto& x: v) {
if (!fst) res += ", ";
fst = 0; res += ts(x);
}
res += "}"; return res;
#else
bool fst = 1; str res = "";
for (const auto& x: v) {
if (!fst) res += " ";
fst = 0; res += ts(x);
}
return res;
#endif
}
template<class A, class B> str ts(pair<A,B> p) {
#ifdef LOCAL
return "("+ts(p.f)+", "+ts(p.s)+")";
#else
return ts(p.f)+" "+ts(p.s);
#endif
}
// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) {
pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) {
pr(h); if (sizeof...(t)) pr(" "); ps(t...); }
// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
cerr << ts(h); if (sizeof...(t)) cerr << ", ";
DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
#define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
<< __FUNCTION__ << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
#define dbg(...) 0
#define chk(...) 0
#endif
int gcd(int a, int b) {if (b == 0)return a;return gcd(b, a % b);}
int max(int a,int b, int c){return max(a,max(b,c));}
int min(int a,int b, int c){return min(a,min(b,c));}
ll max(ll a,ll b, ll c){return max(a,max(b,c));}
ll min(ll a,ll b, ll c){return min(a,min(b,c));}
void dbga(int arr[], int n){vi v;For(i,n)v.pb(arr[i]);dbg(v);}
void dbga(ll arr[], int n){vi v;For(i,n)v.pb(arr[i]);dbg(v);}
// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str s = "") {
unsyncIO();
// cin.exceptions(cin.failbit);
// throws exception when do smth illegal
// ex. try to read letter into int
if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
// 576743 29995400689069LL
const int MOD = 30013; // 998244353;
const int MX = 3e5+5;
const ll INF = 1e18;
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1};
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
/**
* Description: 1D point update, range query where \texttt{comb} is
* any associative operation. If $N=2^p$ then \texttt{seg[1]==query(0,N-1)}.
* Time: O(\log N)
* Source:
* http://codeforces.com/blog/entry/18051
* KACTL
* Verification: SPOJ Fenwick
*/
template<class T> struct Seg { // comb(ID,b) = b
const T ID = mp(0,0); T comb(T a, T b) {
if(b.f>a.f)return mp(b.f,b.s);
if(a.f>b.f)return mp(a.f,a.s);
return mp(a.f,(a.s+b.s)%MOD);
}
int n; vector<T> seg;
void init(int _n) { n = _n; seg.assign(2*n,ID); }
void pull(int p) { seg[p] = comb(seg[2*p],seg[2*p+1]); }
void upd(int p, T val) { // set val at position p
p+=n;
seg[p]=comb(seg[p],val); for (p /= 2; p; p /= 2) pull(p); }
T query(int l, int r) { // sum on interval [l, r]
T ra = ID, rb = ID;
for (l += n, r += n+1; l < r; l /= 2, r /= 2) {
if (l&1) ra = comb(ra,seg[l++]);
if (r&1) rb = comb(seg[--r],rb);
}
return comb(ra,rb);
}
};
int cnt=1;
pi b[MX];
map<int,int> m;
vector<pii> ev;
vi a[MX];
Seg<pi> seg;
void solve(){
int n;re(n);
seg.init(2*n+5);
For(i,n){
a[i].resize(4);re(a[i]);
ev.pb(mp(mp(a[i][0],i),0));
ev.pb(mp(mp(a[i][1],i),1));
m[a[i][2]]=1;m[a[i][3]]=1;
}
trav(x,m){
m[x.f]=cnt++;
}
sort(all(ev));
dbg(ev);
seg.upd(0,mp(0,1));
dbg(seg.query(0,0));
trav(x,ev){
if(x.s==0){
pi tmp=seg.query(0,m[a[x.f.s][2]]);
b[x.f.s]=mp(tmp.f+1,tmp.s);//includes this one
dbg(x,tmp,b[x.f.s]);
}
else{
dbg(x.f.s,a[x.f.s][3],m[a[x.f.s][3]]);
seg.upd(m[a[x.f.s][3]],b[x.f.s]);
}
}
pi ret=mp(0,0);
For(i,n){
ret=seg.comb(ret,b[i]);
}
ps(ret);
}
int main() {
setIO();
int t=1;
// re(t);
while(t--)solve();
// you should actually read the stuff at the bottom
}
//psums, bsearch, two pointers
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* think of simple solution first
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/
Compilation message
trapezoid.cpp: In function 'void dbga(int*, int)':
trapezoid.cpp:163:26: warning: statement has no effect [-Wunused-value]
163 | #define dbg(...) 0
| ^
trapezoid.cpp:172:55: note: in expansion of macro 'dbg'
172 | void dbga(int arr[], int n){vi v;For(i,n)v.pb(arr[i]);dbg(v);}
| ^~~
trapezoid.cpp: In function 'void dbga(ll*, int)':
trapezoid.cpp:163:26: warning: statement has no effect [-Wunused-value]
163 | #define dbg(...) 0
| ^
trapezoid.cpp:173:54: note: in expansion of macro 'dbg'
173 | void dbga(ll arr[], int n){vi v;For(i,n)v.pb(arr[i]);dbg(v);}
| ^~~
trapezoid.cpp: In function 'void solve()':
trapezoid.cpp:163:26: warning: statement has no effect [-Wunused-value]
163 | #define dbg(...) 0
| ^
trapezoid.cpp:246:5: note: in expansion of macro 'dbg'
246 | dbg(ev);
| ^~~
trapezoid.cpp:163:26: warning: statement has no effect [-Wunused-value]
163 | #define dbg(...) 0
| ^
trapezoid.cpp:248:5: note: in expansion of macro 'dbg'
248 | dbg(seg.query(0,0));
| ^~~
trapezoid.cpp:163:26: warning: statement has no effect [-Wunused-value]
163 | #define dbg(...) 0
| ^
trapezoid.cpp:253:13: note: in expansion of macro 'dbg'
253 | dbg(x,tmp,b[x.f.s]);
| ^~~
trapezoid.cpp:163:26: warning: statement has no effect [-Wunused-value]
163 | #define dbg(...) 0
| ^
trapezoid.cpp:256:13: note: in expansion of macro 'dbg'
256 | dbg(x.f.s,a[x.f.s][3],m[a[x.f.s][3]]);
| ^~~
trapezoid.cpp: In function 'void setIn(str)':
trapezoid.cpp:176:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
176 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
trapezoid.cpp: In function 'void setOut(str)':
trapezoid.cpp:177:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
177 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
7404 KB |
Output is correct |
| 2 |
Correct |
5 ms |
7404 KB |
Output is correct |
| 3 |
Correct |
6 ms |
7532 KB |
Output is correct |
| 4 |
Correct |
6 ms |
7660 KB |
Output is correct |
| 5 |
Correct |
9 ms |
7788 KB |
Output is correct |
| 6 |
Correct |
10 ms |
8044 KB |
Output is correct |
| 7 |
Correct |
11 ms |
8300 KB |
Output is correct |
| 8 |
Correct |
14 ms |
8428 KB |
Output is correct |
| 9 |
Correct |
25 ms |
9512 KB |
Output is correct |
| 10 |
Correct |
41 ms |
11684 KB |
Output is correct |
| 11 |
Correct |
70 ms |
12836 KB |
Output is correct |
| 12 |
Correct |
131 ms |
18264 KB |
Output is correct |
| 13 |
Correct |
149 ms |
20248 KB |
Output is correct |
| 14 |
Correct |
176 ms |
22816 KB |
Output is correct |
| 15 |
Correct |
230 ms |
23572 KB |
Output is correct |
| 16 |
Correct |
240 ms |
24604 KB |
Output is correct |
| 17 |
Correct |
245 ms |
25660 KB |
Output is correct |
| 18 |
Correct |
193 ms |
26676 KB |
Output is correct |
| 19 |
Correct |
230 ms |
27860 KB |
Output is correct |
| 20 |
Correct |
268 ms |
28952 KB |
Output is correct |
