oj.uz

Submission #62440

# Submission time Handle Problem Language Result Execution time Memory
62440 2018-07-28T13:13:57 Z Mamnoon_Siam Ice Hockey World Championship (CEOI15_bobek) C++17
50 / 100
 702 ms 25408 KB 
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

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

#define debug(s) cout << #s << " = " << s << endl
#define all(v) (v).begin(), (v).end()
#define KeepUnique(v) (v).erase( unique(all(v)), v.end() )
#define MEMSET(a, val) memset(a, val, sizeof (a))
#define PB push_back
#define endl '\n'
typedef long long ll;

inline int myrand(int l, int r) {
	int ret = rand(); ret <<= 15; ret ^= rand();
	if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
	return ret;
}

template <typename F, typename S>
ostream& operator << (ostream& os, const pair< F, S>& p) {
	return os<<"(" <<p.first<<", "<<p.second<<")"; }

typedef pair<int, int> ii;

template<typename T> using min_pq =
	std::priority_queue<T, vector<T>, greater<T> >;

//int dx[] = {-1, +0, +1, +0};
//int dy[] = {+0, +1, +0, -1};

void gen(vector<ll> &vec, int pos, ll sum, vector<ll> &to) {
	if(pos == vec.size()) return void(to.emplace_back(sum));
	gen(vec, pos + 1, sum + vec[pos], to);
	gen(vec, pos + 1, sum, to);
}

int32_t main () {
	// freopen("in", "r", stdin);
    ll B; int n; cin >> n >> B;
    vector<ll> v(n);
    for(ll &b : v) cin >> b;
    if(n == 1) {
    	cout << 1 + int(v[0] <= B) << endl;
    	return 0;
    }
    vector<ll> Left(v.begin(), v.begin() + (n >> 1) + 1), Right(v.begin() + (n >> 1) + 1, v.end());
    vector<ll> L, R;
    gen(Left, 0, 0, L);
    gen(Right, 0, 0, R);
    sort(all(R));
    ll ans = 0;
    for(int b : L) {
    	ans += upper_bound(all(R), B - b) - R.begin();
    }
    cout << ans << endl;
}

Compilation message

bobek.cpp: In function 'int myrand(int, int)':
bobek.cpp:18:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
  ^~
bobek.cpp:18:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
                          ^~~
bobek.cpp: In function 'void gen(std::vector<long long int>&, int, ll, std::vector<long long int>&)':
bobek.cpp:35:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(pos == vec.size()) return void(to.emplace_back(sum));
     ~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2792 KB Output is correct
2 Correct 137 ms 6876 KB Output is correct
3 Correct 702 ms 25408 KB Output is correct
4 Correct 136 ms 25408 KB Output is correct
5 Correct 16 ms 25408 KB Output is correct
6 Correct 9 ms 25408 KB Output is correct
7 Correct 13 ms 25408 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 25408 KB Output is correct
2 Correct 34 ms 25408 KB Output is correct
3 Correct 300 ms 25408 KB Output is correct
4 Correct 3 ms 25408 KB Output is correct
5 Correct 8 ms 25408 KB Output is correct
6 Correct 15 ms 25408 KB Output is correct
7 Correct 13 ms 25408 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 25408 KB Output is correct
2 Correct 169 ms 25408 KB Output is correct
3 Correct 169 ms 25408 KB Output is correct
4 Correct 4 ms 25408 KB Output is correct
5 Correct 51 ms 25408 KB Output is correct
6 Correct 201 ms 25408 KB Output is correct
7 Correct 53 ms 25408 KB Output is correct

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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