oj.uz

Submission #208564

# Submission time Handle Problem Language Result Execution time Memory
208564 2020-03-11T16:27:52 Z fr_klr Ice Hockey World Championship (CEOI15_bobek) C++14
30 / 100
 232 ms 20816 KB 
//You can't fill the hole inside you with money, drugs and cars
#include<bits/stdc++.h>
using namespace std;

long long n, m;
vector<long long> v, a, b;

void create(long long st, long long en, vector<long long> &w){
    long long sz = en - st;
    w.push_back(0);
    for(long long mask = 1; mask < (1 << sz); mask++)
        w.push_back(w[mask - (mask & -mask)] + v[st + __builtin_ctz(mask)]);

}

long long inp(){
    long long A;
    cin >> A;
    return A;
}

void input(){
    cin >> n >> m;
    for(long long i = 0; i < n; i++)
        v.push_back(inp());
}

long long matches(long long p1 = 0, long long p2 = b.size() - 1, long long ans = 0){
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());

    for(; p2 > 0 and p1 < a.size(); p1++){
        while(p2 >= 0 and a[p1] + b[p2] > m)
            p2--;
        ans += (p2 + 1);
    }
    return ans;
}

long long solve(){
    create(0, n/2, a);
    create(n/2, n, b);

    return matches();
}

int main(){
    input();
    cout << solve();
}

Compilation message

bobek.cpp: In function 'long long int matches(long long int, long long int, long long int)':
bobek.cpp:32:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(; p2 > 0 and p1 < a.size(); p1++){
                      ~~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Incorrect 5 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2032 KB Output is correct
2 Incorrect 56 ms 5476 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 2924 KB Output is correct
2 Correct 24 ms 2160 KB Output is correct
3 Correct 99 ms 10588 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 8 ms 1012 KB Output is correct
6 Correct 16 ms 1648 KB Output is correct
7 Correct 16 ms 1648 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 3564 KB Output is correct
2 Correct 86 ms 6624 KB Output is correct
3 Correct 82 ms 6628 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 40 ms 6624 KB Output is correct
6 Correct 179 ms 20816 KB Output is correct
7 Incorrect 81 ms 6624 KB Output isn't correct

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 2036 KB Output is correct
2 Correct 56 ms 5476 KB Output is correct
3 Correct 11 ms 1012 KB Output is correct
4 Incorrect 10 ms 1012 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 20816 KB Output is correct
2 Incorrect 23 ms 2024 KB Output isn't correct
3 Halted 0 ms 0 KB -