oj.uz

Submission #648319

# Submission time Handle Problem Language Result Execution time Memory
648319 2022-10-06T02:40:21 Z ghostwriter Ice Hockey World Championship (CEOI15_bobek) C++14
100 / 100
 205 ms 20920 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#else
#define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    DIT ME CHUYEN BAO LOC
----------------------------------------------------------------
*/
const int N = 40;
int n;
ll m, c[N], rs = 0;
vll a, a1;
void brute(int i, ll s) {
	if (i > n / 2 - 1) {
		a.pb(s);
		return;
	}
	brute(i + 1, s);
	brute(i + 1, s + c[i]);
}
void brute1(int i, ll s) {
	if (i > n - 1) {
		a1.pb(s);
		return;
	}
	brute1(i + 1, s);
	brute1(i + 1, s + c[i]);
}
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    cin >> n >> m;
    FRN(i, n) cin >> c[i];
    if (n == 1) {
    	cout << (c[0] <= m? 2 : 1);
    	return 0;
    }
    brute(0, 0);
    brute1(n / 2, 0);
    sort(all(a));
    sort(all(a1));
    int r = sz(a) - 1;
    EACH(i, a1) {
    	WHILE(r >= 0 && i + a[r] > m) --r;
    	rs += r + 1;
    }
    cout << rs;
    return 0;
}
/*
5 1000
100 1500 500 500 1000
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

Compilation message

bobek.cpp: In function 'int main()':
bobek.cpp:34:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   34 | #define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
      |                            ^
bobek.cpp:76:5: note: in expansion of macro 'FRN'
   76 |     FRN(i, n) cin >> c[i];
      |     ^~~
bobek.cpp:36:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   36 | #define EACH(i, x) for (auto &(i) : (x))
      |                               ^
bobek.cpp:86:5: note: in expansion of macro 'EACH'
   86 |     EACH(i, a1) {
      |     ^~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 2008 KB Output is correct
2 Correct 45 ms 5452 KB Output is correct
3 Correct 197 ms 20796 KB Output is correct
4 Correct 47 ms 5452 KB Output is correct
5 Correct 6 ms 1608 KB Output is correct
6 Correct 5 ms 984 KB Output is correct
7 Correct 10 ms 1620 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2896 KB Output is correct
2 Correct 17 ms 1992 KB Output is correct
3 Correct 76 ms 10520 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 3 ms 984 KB Output is correct
6 Correct 10 ms 1620 KB Output is correct
7 Correct 11 ms 1620 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 3540 KB Output is correct
2 Correct 68 ms 6608 KB Output is correct
3 Correct 67 ms 6608 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 31 ms 6608 KB Output is correct
6 Correct 149 ms 20920 KB Output is correct
7 Correct 64 ms 6608 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 12748 KB Output is correct
2 Correct 16 ms 2008 KB Output is correct
3 Correct 6 ms 984 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 4 ms 984 KB Output is correct
6 Correct 145 ms 12740 KB Output is correct
7 Correct 10 ms 1620 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2008 KB Output is correct
2 Correct 45 ms 5440 KB Output is correct
3 Correct 5 ms 984 KB Output is correct
4 Correct 5 ms 984 KB Output is correct
5 Correct 36 ms 6592 KB Output is correct
6 Correct 16 ms 2000 KB Output is correct
7 Correct 194 ms 20796 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 20852 KB Output is correct
2 Correct 16 ms 2008 KB Output is correct
3 Correct 6 ms 984 KB Output is correct
4 Correct 205 ms 20880 KB Output is correct
5 Correct 48 ms 10568 KB Output is correct
6 Correct 11 ms 1620 KB Output is correct
7 Correct 24 ms 2896 KB Output is correct