이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
const int N = 50;
#define ll long long
map <ll, ll> cate;
map <ll, ll> dp;
set <ll> s;
ll v[N];
int main()
{
ll n, m, nr, i;
cin >> n >> m;
for (i = 1; i <= n; i++)
{
cin >> nr;
if (nr > m)
continue;
if (s.empty())
{
cate[nr] = 1;
s.insert(nr);
continue;
}
auto it = s.end();
while(it != s.begin())
{
it--;
ll val = *it;
if (val + nr > m)
continue;
if (cate[val + nr] == 0)
s.insert(val + nr);
cate[val + nr] += cate[val];
}
if (cate[nr] == 0)
s.insert(nr);
cate[nr]++;
}
ll ans = 0;
for (auto it : cate)
ans += it.second;
cout << ans + 1;
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... |
# | 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... |