| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 50598 | XmtosX | San (COCI17_san) | C++17 | 1090 ms | 544 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;
int n;
long long c[50],h[50],k;
long long bt(int pos,long long last,long long sum)
{
if (pos==n)
return (sum>=k);
long long ans=0;
if (h[pos]>=last)
ans=bt(pos+1,h[pos],sum+c[pos]);
ans+=bt(pos+1,last,sum);
return ans;
}
int main()
{
cin >>n>>k;
for (int i=0;i<n;i++)
cin >>h[i]>>c[i];
cout << bt(0,0,0);
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... | ||||
