이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define f1 first
#define s2 second
#define pb push_back
#define mp make_pair
#define ll long long
#define fri(a) freopen(a,"r",stdin);
#define fro(a) freopen(a,"w",stdout);
const int N=45;
ll n,k,height[N],val[N],ans;
vector<ll>v[N];
ll solve(int i,int m){
if(v[i].empty()){
if(m>=k)return 1;
return 0;
}
ll ans=0;
for(auto j:v[i]){
ans+=solve(j,m+val[j]);
}
if(m>=k)return ans+1;
return ans;
}
int main(){
//fri("in.txt");
//fro("out.txt");
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>k;
for(int i=0;i<n;i++){
cin>>height[i]>>val[i];
}
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
if(height[j]>=height[i]){
v[i].pb(j);
}
}
}
for(int i=0;i<n;i++){
ans+=solve(i,val[i]);
}
cout<<ans<<endl;
return 0;
}
# | 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... |