oj.uz

Submission #272938

# Submission time Handle Problem Language Result Execution time Memory
272938 2020-08-18T20:25:13 Z MarcoMeijer Ice Hockey World Championship (CEOI15_bobek) C++14
70 / 100
 289 ms 33028 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 = 1e6+10;

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

ll getSM(int bg, int bm) {
    ll tot = 0;
    while(bm) {
        int 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;
    int mid = n/2;
    int len = mid;
    RE(bm,(1<<len))
        lef.pb(getSM(0,bm));
    len = n-mid;
    RE(bm,(1<<len))
        rig.pb(getSM(mid,bm));

    sort(all(lef));
    sort(all(rig));

    b[0] = -1;
    sm[0] = 0;
    FOR(p,rig) {
        if(b[N] != p) sm[N+1] = sm[N], N++;
        b[N] = p;
        sm[N]++;
    }
    N++;

    ll ans = 0;
    int cur = N-1;
    FOR(p,lef) {
        ll mx = m - p;
        while(b[cur] > mx && cur != 0) cur--;
        ans += sm[cur];
    }
    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 1 ms 384 KB Output is correct
3 Correct 0 ms 384 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 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 0 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 1 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 384 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 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 512 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2296 KB Output is correct
2 Correct 63 ms 7528 KB Output is correct
3 Correct 274 ms 23624 KB Output is correct
4 Correct 62 ms 7412 KB Output is correct
5 Correct 9 ms 1660 KB Output is correct
6 Correct 7 ms 1148 KB Output is correct
7 Correct 14 ms 2556 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 2936 KB Output is correct
2 Correct 23 ms 3320 KB Output is correct
3 Correct 97 ms 10736 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 4 ms 1024 KB Output is correct
6 Correct 14 ms 1916 KB Output is correct
7 Correct 14 ms 2556 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 6372 KB Output is correct
2 Correct 94 ms 9312 KB Output is correct
3 Correct 95 ms 9184 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 49 ms 6776 KB Output is correct
6 Correct 208 ms 20980 KB Output is correct
7 Correct 105 ms 14944 KB Output is correct

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 4208 KB Output is correct
2 Correct 63 ms 8804 KB Output is correct
3 Correct 7 ms 1532 KB Output is correct
4 Correct 9 ms 1664 KB Output is correct
5 Correct 54 ms 6772 KB Output is correct
6 Correct 21 ms 4216 KB Output is correct
7 Incorrect 257 ms 33028 KB Output isn't correct

Subtask #10
0 / 10.0

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