Submission #272935

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
272935	2020-08-18T20:20:08 Z	MarcoMeijer	Ice Hockey World Championship (CEOI15_bobek)	C++14	60 / 100	1000 ms	92964 KB

bobek

#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 = 1e6+10;

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

ll getSM(ll bg, ll bm) {
    ll tot = 0;
    while(bm) {
        ll rem = bm&-bm;
        bm -= rem;
        tot += a[LOG2[rem] + bg];
    }
    return tot;
}

void program() {
    IN(n,m);
    RE(i,n) IN(a[i]);
    
    RE(i,21) LOG2[(1<<i)] = i;
    ll mid = n/2;
    ll len = mid;
    RE(bm,(1ll<<len)) {
        lef[getSM(0,bm)]++;
    }
    len = n-mid;
    RE(bm,(1ll<<len)) {
        rig[getSM(mid,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;
    int cur = N-1;
    FOR(p,lef) {
        ll mx = m - p.fi;
        while(b[cur] > mx && cur != 0) cur--;
        ans += p.se * sm[cur];
    }
    OUTL(ans);
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	640 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	512 KB	Output is correct
7	Correct	1 ms	512 KB	Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	32 ms	2168 KB	Output is correct
2	Correct	275 ms	24988 KB	Output is correct
3	Execution timed out	1065 ms	54068 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	50 ms	3448 KB	Output is correct
2	Correct	69 ms	9336 KB	Output is correct
3	Correct	139 ms	1844 KB	Output is correct
4	Correct	1 ms	416 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	32 ms	4088 KB	Output is correct
7	Correct	56 ms	9592 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	171 ms	20984 KB	Output is correct
2	Correct	315 ms	21368 KB	Output is correct
3	Correct	306 ms	20344 KB	Output is correct
4	Correct	1 ms	512 KB	Output is correct
5	Correct	24 ms	384 KB	Output is correct
6	Correct	326 ms	3064 KB	Output is correct
7	Correct	624 ms	57976 KB	Output is correct

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	111 ms	14712 KB	Output is correct
2	Correct	370 ms	37368 KB	Output is correct
3	Correct	23 ms	4992 KB	Output is correct
4	Correct	24 ms	4992 KB	Output is correct
5	Correct	38 ms	384 KB	Output is correct
6	Correct	158 ms	14712 KB	Output is correct
7	Execution timed out	1097 ms	92964 KB	Time limit exceeded

Subtask #10
0 / 10.0

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

Submission #272935

Compilation message