# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
82561 | thiago4532 | San (COCI17_san) | C++17 | 351 ms | 636 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;
const int maxn = 40;
int h[maxn], c[maxn];
int n, k;
int main(){
//ios::sync_with_stdio(false), cin.tie(0);
cin >> n >> k;
for(int i=1;i<=n;i++)
cin >> h[i] >> c[i];
int ans=0;
for(int i=1;i<(1<<n);i++){
vector<int> mark;
int num=0;
for(int j=1;j<=n;j++)
if(i&(1<<(j-1))) mark.push_back(j), num += c[j];
// cout << "{";
// for(int i=0;i<mark.size();i++)
// cout << mark[i] << ",}"[i==mark.size()-1];
// cout << "\n";
bool possible = (num >= k);
if(!possible) continue;
for(int j=0;j<mark.size()-1;j++){
if(h[mark[j+1]] < h[mark[j]]){
possible = false;
break;
}
}
if(possible) ++ans;
}
cout << ans << "\n";
return 0;
}
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... |