oj.uz

Submission #77861

# Submission time Handle Problem Language Result Execution time Memory
77861 2018-09-30T23:02:17 Z duality Ice Hockey World Championship (CEOI15_bobek) C++11
100 / 100
 414 ms 21404 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

LLI c[40];
vlli v1,v2;
int main() {
    int i;
    int N;
    LLI M;
    scanf("%d %lld",&N,&M);
    for (i = 0; i < N; i++) scanf("%lld",&c[i]);

    int j,h = N/2;
    for (i = 0; i < (1 << h); i++) {
        LLI s = 0;
        for (j = 0; j < h; j++) {
            if (i & (1 << j)) s += c[j];
        }
        v1.pb(s);
    }
    for (i = 0; i < (1 << (N-h)); i++) {
        LLI s = 0;
        for (j = 0; j < (N-h); j++) {
            if (i & (1 << j)) s += c[j+h];
        }
        v2.pb(s);
    }
    LLI ans = 0;
    sort(v1.begin(),v1.end());
    sort(v2.begin(),v2.end());
    j = 0;
    for (i = v1.size()-1; i >= 0; i--) {
        while ((j < v2.size()) && (v1[i]+v2[j] <= M)) j++;
        ans += j;
    }
    printf("%lld\n",ans);

    return 0;
}

Compilation message

bobek.cpp: In function 'int main()':
bobek.cpp:87:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while ((j < v2.size()) && (v1[i]+v2[j] <= M)) j++;
                 ~~^~~~~~~~~~~
bobek.cpp:64:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %lld",&N,&M);
     ~~~~~^~~~~~~~~~~~~~~~~
bobek.cpp:65:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < N; i++) scanf("%lld",&c[i]);
                             ~~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 752 KB Output is correct
2 Correct 2 ms 752 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 2 ms 804 KB Output is correct
5 Correct 2 ms 812 KB Output is correct
6 Correct 2 ms 816 KB Output is correct
7 Correct 2 ms 816 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 2476 KB Output is correct
2 Correct 94 ms 5928 KB Output is correct
3 Correct 414 ms 21368 KB Output is correct
4 Correct 96 ms 21368 KB Output is correct
5 Correct 18 ms 21368 KB Output is correct
6 Correct 15 ms 21368 KB Output is correct
7 Correct 22 ms 21368 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 21368 KB Output is correct
2 Correct 35 ms 21368 KB Output is correct
3 Correct 179 ms 21368 KB Output is correct
4 Correct 2 ms 21368 KB Output is correct
5 Correct 9 ms 21368 KB Output is correct
6 Correct 23 ms 21368 KB Output is correct
7 Correct 23 ms 21368 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 21368 KB Output is correct
2 Correct 143 ms 21368 KB Output is correct
3 Correct 144 ms 21368 KB Output is correct
4 Correct 2 ms 21368 KB Output is correct
5 Correct 101 ms 21368 KB Output is correct
6 Correct 355 ms 21368 KB Output is correct
7 Correct 141 ms 21368 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 291 ms 21368 KB Output is correct
2 Correct 33 ms 21368 KB Output is correct
3 Correct 12 ms 21368 KB Output is correct
4 Correct 2 ms 21368 KB Output is correct
5 Correct 10 ms 21368 KB Output is correct
6 Correct 327 ms 21368 KB Output is correct
7 Correct 22 ms 21368 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 21368 KB Output is correct
2 Correct 97 ms 21368 KB Output is correct
3 Correct 12 ms 21368 KB Output is correct
4 Correct 12 ms 21368 KB Output is correct
5 Correct 121 ms 21368 KB Output is correct
6 Correct 33 ms 21368 KB Output is correct
7 Correct 384 ms 21400 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 389 ms 21404 KB Output is correct
2 Correct 34 ms 21404 KB Output is correct
3 Correct 12 ms 21404 KB Output is correct
4 Correct 402 ms 21404 KB Output is correct
5 Correct 141 ms 21404 KB Output is correct
6 Correct 22 ms 21404 KB Output is correct
7 Correct 46 ms 21404 KB Output is correct