# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
473194 | MamdouhN | San (COCI17_san) | C++17 | 1095 ms | 204 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;
#define int long long
#define endl "\n"
int n,k;
int towers[100],gold[100];
int solve(int idx,int sum)
{
//cout<<idx<<" "<<sum<<endl;
if(idx==n)return 0;
sum+=gold[idx];
int ret = 0;
if(sum>=k)ret = 1;
for(int i=idx+1;i<n;i++)
{
if(towers[i]>=towers[idx])ret+=solve(i,sum);
}
return ret;
}
main()
{
cin>>n>>k;
for(int i=0;i<n;i++)cin>>towers[i]>>gold[i];
int ans = 0;
for(int i=0;i<n;i++)ans+=solve(i,0);
cout<<ans<<endl;
}
Compilation message (stderr)
# | 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... |