This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
///made by : Mr_Ph :D
#include<bits/stdc++.h>
#include<unordered_map>
typedef long long ll;
typedef long long int lli;
typedef unsigned long long ull;
using namespace std;
const double PI=acos(-1.0);
const ll mod=(ll)1e9+7;
//int dx[4] = {0, 0, 1, -1};
//int dy[4] = {1, -1, 0, 0};
///the defines :)
#define endl '\n'
#define vi vector<int>
#define vll vector<ll>
#define lower(s) transform(s.begin(),s.end(),s.begin(),::tolower)
#define upper(s) transform(s.begin(),s.end(),s.begin(),::toupper)
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
///the end of the defines ;)
void solve()
{
ll n,k;
cin>>n>>k;
vector<pair<ll,ll>>arr(n);
for(int i=0; i<n; i++)
cin>>arr[i].first>>arr[i].second;
set<vector<ll>>st;
for(ll i=0; i<(1<<n); i++)
{
vll temp;
ll sum=0;
ll prv=0;
for(ll e=0; e<n; e++)
{
ll Try=(1<<e)&i;
if(Try)
{
if(arr[e].first>=prv)
{
prv=arr[e].first;
temp.push_back(e);
sum+=arr[e].second;
}
}
}
if(sum>=k)
st.insert(temp);
}
cout<<st.sz<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
//freopen("window.in","r",stdin);
//freopen("output.txt","w",stdout);
int t=1;//int st;
//cin>>t;//cin>>st;
while(t--)
solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |