Submission #125734

# Submission time Handle Problem Language Result Execution time Memory
125734 2019-07-06T09:44:17 Z faustaadp trapezoid (balkan11_trapezoid) C++17
18 / 100
500 ms 6008 KB
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
int n,i,ta,tb,tc,td,j,h1,h2,d[101010],d2[101010],mo=30013,K;
vector<int> v[101010];
pair<pair<int,int>,pair<int,int> > A[101010];
map<int,int> BIT;
int depe(int aa)
{
	if(d[aa]==-1)
	{
		d[aa]=0;
		int ii;
		for(ii=0;ii<v[aa].size();ii++)
			d[aa]=max(d[aa],depe(v[aa][ii]));
		d[aa]++;
	}
	return d[aa];
}
int depe2(int aa)
{
	if(depe(aa)==1)return 1;
	if(d2[aa]==-1)
	{
		d2[aa]=0;
		int ii;
		for(ii=0;ii<v[aa].size();ii++)
			if(depe(aa)==depe(v[aa][ii])+1)
				d2[aa]=(d2[aa]+depe2(v[aa][ii]))%mo;
	}
	return d2[aa];
}
void upd(int aa,int bb)
{
	int ii;
	for(ii=aa;ii<=K;ii+=(ii&(-ii)))
		BIT[ii]=max(BIT[ii],bb);
}
int que(int aa)
{
	int ii,H=0;
	for(ii=aa;ii>=1;ii-=(ii&(-ii)))
		H=max(H,BIT[ii]);
	return H;
}
int main()
{
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	K=1000000001;
	cin>>n;
	for(i=1;i<=n;i++)
	{
		cin>>ta>>tb>>tc>>td;
		A[i]=mp(mp(ta,tb),mp(tc,td));
	}
	if(1)
	{
		sort(A+1,A+1+n);
		for(i=1;i<=n;i++)
		{
			int L=i+1,R=n,C,H=0;
			while(L<=R)
			{
				C=(L+R)/2;
				if(A[i].fi.se<A[C].fi.fi)
				{
					H=C;
					R=C-1;
				}
				else
					L=C+1;
			}
			if(H)
				v[H].pb(i);
		}
		//return 0;
		for(i=n;i>=1;i--)d[i]=1;
		for(i=n;i>=1;i--)
		{
			//d[i]++;
			//upd(A[i].se.fi,d[i]);
			for(j=0;j<v[i].size();j++)
			{
				int now=v[i][j];
				ll k;
				for(k=i;k<=n;k++)
					if(A[now].se.se<A[k].se.fi)
						d[now]=max(d[now],d[k]+1);
		//		cout<<i<<" "<<now<<" "<<d[now]<<"\n";
			}
			//cout<<i<<" "<<d[i]<<"\n";
			h1=max(h1,d[i]);
		}
		//cout<<h1<<"\n";
	}
	else
	{
		for(i=1;i<=n;i++)
			for(j=1;j<=n;j++)
				if(A[i].fi.se<A[j].fi.fi&&A[i].se.se<A[j].se.fi)
					v[i].pb(j);
		memset(d,-1,sizeof(d));
		memset(d2,-1,sizeof(d2));
		for(i=1;i<=n;i++)
			h1=max(h1,depe(i));
		for(i=1;i<=n;i++)
			if(depe(i)==h1)
				h2=(h2+depe2(i))%mo;
	}
	cout<<h1<<" "<<h2<<"\n";	
}

Compilation message

trapezoid.cpp: In function 'int depe(int)':
trapezoid.cpp:18:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(ii=0;ii<v[aa].size();ii++)
            ~~^~~~~~~~~~~~~
trapezoid.cpp: In function 'int depe2(int)':
trapezoid.cpp:31:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(ii=0;ii<v[aa].size();ii++)
            ~~^~~~~~~~~~~~~
trapezoid.cpp: In function 'int main()':
trapezoid.cpp:86:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(j=0;j<v[i].size();j++)
            ~^~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Partially correct 4 ms 2680 KB Partially correct
2 Partially correct 4 ms 2680 KB Partially correct
3 Partially correct 5 ms 2808 KB Partially correct
4 Partially correct 6 ms 2808 KB Partially correct
5 Partially correct 10 ms 2808 KB Partially correct
6 Partially correct 18 ms 2936 KB Partially correct
7 Partially correct 30 ms 2936 KB Partially correct
8 Partially correct 19 ms 3064 KB Partially correct
9 Partially correct 145 ms 3344 KB Partially correct
10 Execution timed out 603 ms 3576 KB Time limit exceeded
11 Execution timed out 904 ms 3832 KB Time limit exceeded
12 Execution timed out 1083 ms 4472 KB Time limit exceeded
13 Execution timed out 1080 ms 4984 KB Time limit exceeded
14 Execution timed out 1087 ms 5240 KB Time limit exceeded
15 Execution timed out 1086 ms 5624 KB Time limit exceeded
16 Execution timed out 1083 ms 5624 KB Time limit exceeded
17 Execution timed out 1084 ms 5624 KB Time limit exceeded
18 Execution timed out 1076 ms 5752 KB Time limit exceeded
19 Execution timed out 1076 ms 5496 KB Time limit exceeded
20 Execution timed out 1079 ms 6008 KB Time limit exceeded