oj.uz

Submission #43507

# Submission time Handle Problem Language Result Execution time Memory
43507 2018-03-16T19:49:49 Z XmtosX Ice Hockey World Championship (CEOI15_bobek) C++14
40 / 100
 300 ms 25268 KB 
#include <bits//stdc++.h>
using namespace std;
const int mod=1e9+7;
int n;
long long m,a[50];
vector <long long> v1,v2;
void bt (int pos,int x,long long sum)
{
    if (pos==x)
    {
        if (x==n)
            v2.push_back(sum);
        else
            v1.push_back(sum);
        return;
    }
    bt(pos+1,x,sum);
    bt(pos+1,x,sum+a[pos]);
}
int main()
{
    cin >>n>>m;
    for (int i=0;i<n;i++)
        cin >>a[i];
    v2.push_back(m+1);
    bt(0,n/2,0);
    bt(n/2,n,0);
    sort(v2.begin(),v2.end());
    long long ans=0;
    sort(v1.begin(),v1.end());
    for (int i=0;i<v1.size();i++)
    {
        long long x=(m-v1[i]);
        if (x<0)
            break;
        ans+= ((upper_bound(v2.begin(),v2.end(),x)-v2.begin()));
        ans%=mod;
    }
    cout <<ans;
    return 0;
}

Compilation message

bobek.cpp: In function 'int main()':
bobek.cpp:31:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<v1.size();i++)
                   ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 248 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 388 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 496 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 1 ms 548 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 1 ms 620 KB Output is correct
5 Correct 1 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 3292 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 3808 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 52 ms 5848 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 227 ms 21220 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 21220 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 300 ms 25268 KB Output isn't correct
2 Halted 0 ms 0 KB -