oj.uz

Submission #272931

# Submission time Handle Problem Language Result Execution time Memory
272931 2020-08-18T20:14:47 Z MarcoMeijer Ice Hockey World Championship (CEOI15_bobek) C++14
50 / 100
 1000 ms 113528 KB 
#include <bits/stdc++.h>
using namespace std;

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }

// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }

//===================//
//  Added libraries  //
//===================//

//===================//
//end added libraries//
//===================//

void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}


//===================//
//   begin program   //
//===================//

const int MX = 3e5;

ll n, m;
ll a[MX];
map<ll,ll> lef, rig;
ll b[MX], sm[MX], N=0;

ll getSM(ll bg, ll ed, ll bm) {
    ll tot = 0;
    REP(i,bg,ed) {
        int j = i-bg;
        if(bm & (1ll<<j)) {
            tot += a[i];
        }
    }
    return tot;
}

void program() {
    IN(n,m);
    RE(i,n) IN(a[i]);
    
    ll mid = n/2;
    ll len = mid;
    RE(bm,(1ll<<len)) {
        lef[getSM(0,mid,bm)]++;
    }
    len = n-mid;
    RE(bm,(1ll<<len)) {
        rig[getSM(mid,n,bm)]++;
    }

    b[0] = -1;
    sm[0] = 0; N++;
    FOR(p,rig) {
        b[N] = p.fi;
        sm[N] = p.se+sm[N-1];
        N++;
    }

    ll ans = 0;
    FOR(p,lef) {
        ll mx = m - p.fi;
        ll lb=0, ub=N-1;
        while(lb != ub) {
            ll mid = (lb+ub+1)/2;
            if(b[mid] <= mx) lb = mid;
            else ub = mid-1;
        }
        ans += p.se * sm[lb];
    }
    OUTL(ans);
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 2004 KB Output is correct
2 Correct 332 ms 24824 KB Output is correct
3 Execution timed out 1099 ms 51192 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 3448 KB Output is correct
2 Correct 82 ms 9316 KB Output is correct
3 Correct 179 ms 1784 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 37 ms 3960 KB Output is correct
7 Correct 72 ms 9464 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 200 ms 21032 KB Output is correct
2 Correct 409 ms 21184 KB Output is correct
3 Correct 388 ms 20216 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 68 ms 384 KB Output is correct
6 Correct 419 ms 3064 KB Output is correct
7 Runtime error 671 ms 113528 KB Execution killed with signal 11

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1095 ms 94628 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 14816 KB Output is correct
2 Correct 405 ms 37240 KB Output is correct
3 Correct 30 ms 4924 KB Output is correct
4 Correct 30 ms 4928 KB Output is correct
5 Correct 87 ms 384 KB Output is correct
6 Correct 107 ms 14752 KB Output is correct
7 Execution timed out 1099 ms 97188 KB Time limit exceeded

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1095 ms 89760 KB Time limit exceeded
2 Halted 0 ms 0 KB -