oj.uz

Submission #74564

# Submission time Handle Problem Language Result Execution time Memory
74564 2018-09-03T17:37:53 Z kingside Ice Hockey World Championship (CEOI15_bobek) C++14
100 / 100
 468 ms 21408 KB 
// C++ includes used for precompiling -*- C++ -*-

// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library.  This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.

// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.

// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
// <http://www.gnu.org/licenses/>.

/** @file stdc++.h
 *  This is an implementation file for a precompiled header.
 */

// 17.4.1.2 Headers

// C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
//#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif

using namespace std;
 
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed<<setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcount(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
const int MOD = (int) 1e9 + 7;
const int INF = (int) 1e9;
const ll LINF = (ll) 1e18;
const ld PI = acos((ld) -1);
const ld EPS = 1e-9;
ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
ll fpow(ll n, ll k, int p = MOD) {ll r = 1;for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
template<class T> void setmin(T& a, T val) {if (a > val) a = val;}
template<class T> void setmax(T& a, T val) {if (a < val) a = val;}
void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}
void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}
int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}
int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}

const int N=40,M=1<<20;
ll a[N],b[N];

vector<ll> A,B;


 
// Driver program to test above functions
int main()
{
	ll n,m;
	cin>>n>>m;

	for(int i=1;i<=n/2;i++)
		cin>>a[i];

	for(int i=n/2+1;i<=n;i++)
		cin>>b[i-n/2];

	int k=n/2;
	for(int mask=0;mask<1<<k;mask++)
	{
		ll val=0;
		for(int j=0;j<k;j++)
		{
			if(mask&1<<j)
				val+=a[j+1];

		}

		if(val<=m)
			A.pb(val);

	}


	sort(A.begin(),A.end());

	k=n-k;

	for(int mask=0;mask<1<<k;mask++)
	{
		ll val=0;
		for(int j=0;j<k;j++)
		{
			if(mask&1<<j)
				val+=b[j+1];

		}

		if(val<=m)
			B.pb(val);

	}


	sort(B.begin(),B.end());

	ll ans=0;
	for(int i=0;i<A.size();i++)
	{
		ll u=A[i];
		int cnt=upper_bound(B.begin(),B.end(),m-A[i])-B.begin();

		//cout<<u<<" "<<cnt<<"\n";

		ans+=cnt;
	}

	cout<<ans<<"\n";
    return 0;
}

Compilation message

bobek.cpp: In function 'int main()':
bobek.cpp:216:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<A.size();i++)
              ~^~~~~~~~~
bobek.cpp:218:6: warning: unused variable 'u' [-Wunused-variable]
   ll u=A[i];
      ^

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 592 KB Output is correct
2 Correct 2 ms 624 KB Output is correct
3 Correct 2 ms 644 KB Output is correct
4 Correct 2 ms 644 KB Output is correct
5 Correct 2 ms 656 KB Output is correct
6 Correct 3 ms 660 KB Output is correct
7 Correct 2 ms 660 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 680 KB Output is correct
2 Correct 2 ms 680 KB Output is correct
3 Correct 2 ms 704 KB Output is correct
4 Correct 2 ms 704 KB Output is correct
5 Correct 2 ms 712 KB Output is correct
6 Correct 2 ms 824 KB Output is correct
7 Correct 2 ms 824 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 2384 KB Output is correct
2 Correct 106 ms 5772 KB Output is correct
3 Correct 466 ms 21172 KB Output is correct
4 Correct 106 ms 21172 KB Output is correct
5 Correct 19 ms 21172 KB Output is correct
6 Correct 13 ms 21172 KB Output is correct
7 Correct 11 ms 21172 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 21172 KB Output is correct
2 Correct 37 ms 21172 KB Output is correct
3 Correct 190 ms 21172 KB Output is correct
4 Correct 2 ms 21172 KB Output is correct
5 Correct 12 ms 21172 KB Output is correct
6 Correct 25 ms 21172 KB Output is correct
7 Correct 11 ms 21172 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 21172 KB Output is correct
2 Correct 160 ms 21172 KB Output is correct
3 Correct 162 ms 21172 KB Output is correct
4 Correct 2 ms 21172 KB Output is correct
5 Correct 106 ms 21172 KB Output is correct
6 Correct 409 ms 21408 KB Output is correct
7 Correct 61 ms 21408 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 342 ms 21408 KB Output is correct
2 Correct 38 ms 21408 KB Output is correct
3 Correct 14 ms 21408 KB Output is correct
4 Correct 2 ms 21408 KB Output is correct
5 Correct 10 ms 21408 KB Output is correct
6 Correct 322 ms 21408 KB Output is correct
7 Correct 14 ms 21408 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 21408 KB Output is correct
2 Correct 106 ms 21408 KB Output is correct
3 Correct 13 ms 21408 KB Output is correct
4 Correct 14 ms 21408 KB Output is correct
5 Correct 118 ms 21408 KB Output is correct
6 Correct 36 ms 21408 KB Output is correct
7 Correct 155 ms 21408 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 448 ms 21408 KB Output is correct
2 Correct 39 ms 21408 KB Output is correct
3 Correct 13 ms 21408 KB Output is correct
4 Correct 468 ms 21408 KB Output is correct
5 Correct 157 ms 21408 KB Output is correct
6 Correct 33 ms 21408 KB Output is correct
7 Correct 19 ms 21408 KB Output is correct