oj.uz

Submission #448636

# Submission time Handle Problem Language Result Execution time Memory
448636 2021-07-31T09:57:08 Z Khizri Ice Hockey World Championship (CEOI15_bobek) C++17
50 / 100
 30 ms 7456 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=1e6+5;
ll t=1,n,arr[56],dp[mxn],k;
void solve(){
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>arr[i];
	}
	dp[0]=1;
	sort(arr+1,arr+n+1);
	ll ans=0;
	for(int i=1;i<=n;i++){
		for(int j=k;j>=arr[i];j--){
			dp[j]+=dp[j-arr[i]];
		}
	}
	for(int i=0;i<=k;i++){
		ans+=dp[i];
	}
	cout<<ans<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 6548 KB Output is correct
2 Correct 5 ms 3908 KB Output is correct
3 Correct 4 ms 3532 KB Output is correct
4 Correct 8 ms 5452 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 12 ms 6476 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 460 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 460 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 584 KB Output is correct
2 Correct 17 ms 5036 KB Output is correct
3 Correct 30 ms 7456 KB Output is correct
4 Correct 15 ms 4812 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 4 ms 1612 KB Output is correct
7 Correct 1 ms 316 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 6 ms 2244 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 3020 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 23 ms 7124 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 4424 KB Output is correct
2 Correct 8 ms 2508 KB Output is correct
3 Correct 8 ms 2368 KB Output is correct
4 Correct 2 ms 844 KB Output is correct
5 Correct 0 ms 320 KB Output is correct
6 Correct 15 ms 4104 KB Output is correct
7 Correct 3 ms 2892 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 460 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 460 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 444 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -