# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
726101 | Jovica | 사다리꼴 (balkan11_trapezoid) | C++14 | 1081 ms | 4536 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
long long n;
vector<tuple<long long,long long,long long,long long> > v;
bool visited[100000];
pair<long long,long long> dp[100000];
/// zima,nacini
pair<long long,long long> f(long long poz)
{
//cout <<"ulava u "<<poz<<endl;
if (poz==v.size()) return {0,0};
if (visited[poz]==true) return dp[poz];
long long zima=0,nacini=1;
pair<long long,long long> p={zima,nacini};
for (int i=0;i<n;i++)
{
if (get<1>(v[poz])<get<0>(v[i]) && get<3>(v[poz])<get<2>(v[i]))
{
//cout<<"poz = "<<poz<<" && i = "<<i<<" "<< get<1>(v[poz])<<" < "<<get<0>(v[i])<<" && "<<get<3>(v[poz])<<" < "<<get<2>(v[i])<<endl;
p=f(i);
if (p.first==zima) nacini+=p.second;
else if(p.first>zima)
{
zima=p.first;
nacini=p.second;
}
}
}
zima++;
p={zima,nacini};
visited[poz]=true;
dp[poz]=p;
return p;
}
int main()
{
cin>>n;
for (long long i=0;i<n;i++)
{
long long A,B,C,D;
cin>>A>>B>>C>>D;
v.push_back({A,B,C,D});
}
//sort(v.begin(),v.end());
pair<long long,long long> p={0,0};
for (long long i=0;i<n;i++)
if (visited[i]==false)
{
pair<long long,long long> q=f(i);
//cout<< "i="<<i<<" zima="<<q.first<<endl<<" najde="<<q.second<<endl;
if (p.first==q.first) p.second+=q.second;
if (q.first>p.first) p=q;
}
//for (int i=1;i<n;i++) if (dp[i].second==p.first) p.second+=dp[i].second;
cout<<p.first<<" "<<p.second<<endl;
return 0;
}
///////
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |