제출 #1121564

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1121564		vjudge1	Ice Hockey World Championship (CEOI15_bobek)	C++11	0 / 100	1 ms	508 KiB

bobek

#include <bits/stdc++.h>
#define GOOD_LUCK ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define int long long
#define itn int
#define Int int
#define INF -1000000
#define MOD 1000000007
#define endl "\n"
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
using namespace std;

int temp;

signed main() {
	
	GOOD_LUCK
	
    int t;
	t = 1;
//	cin >> t;
    while (t--) {
    	int n, m, s=1, cnt=0, k=0;
    	cin >> n >> m;
    	vector <int> v;
    	for (int i=0; i < n; i++) {
    		cin >> temp;
    		if (temp < m) {
				v.push_back(temp);
				k+=temp;
			}
    		if (temp == m) s++;
		}
		if (k <= m) {
			cout << (1 << v.size()) + s;
			break;
		}
		n = v.size();
//		sort(v.begin(), v.end());
		int p[n];
		for (int i=0; i < n; i++) {
			if (i ==0) p[i] = v[i];
			else p[i] = p[i-1] + v[i];
		}
		for (int i=0; i < n; i++) {
			for (int j=i; j < n; j++) {
				if (p[j] - p[i-1] <= m) cnt++;
			}
		}
		cout << cnt + s;
	}

    return 0;
}
// Problem B
// by Ekber_Ekber

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10