제출 #24705

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
24705		kdh9949	Ice Hockey World Championship (CEOI15_bobek)	C++14	100 / 100	369 ms	18404 KiB

bobek

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n, p, q;
ll m, x[20], y[20], a[1048576], b[1048576], ans;

int main(){
	scanf("%d%lld", &n, &m);
	p = n / 2; q = n - p;
	if(n == 1){
		ll x; scanf("%lld", &x);
		printf("%lld\n", x <= m ? 2 : 1);
		return 0;
	}
	for(int i = 0; i < p; i++){
		scanf("%lld", x + i);
	}
	for(int i = 0; i < q; i++){
		scanf("%lld", y + i);
	}
	for(int i = 0; i < (1 << p); i++){
		for(int j = 0; j < p; j++) if((1 << j) & i) a[i] += x[j];
	}
	for(int i = 0; i < (1 << q); i++){
		for(int j = 0; j < q; j++) if((1 << j) & i) b[i] += y[j];
	}
	sort(a, a + (1 << p));
	sort(b, b + (1 << q));
	for(int i = 0, j = (1 << q) - 1; i < (1 << p); i++){
		for(; j >= 0; j--){
			if(a[i] + b[j] <= m) break;
		}
		ans += (j + 1);
	}
	printf("%lld\n", ans);
}

컴파일 시 표준 에러 (stderr) 메시지

bobek.cpp: In function 'int main()':
bobek.cpp:13:34: warning: format '%lld' expects argument of type 'long long int', but argument 2 has type 'int' [-Wformat=]
   printf("%lld\n", x <= m ? 2 : 1);
                                  ^
bobek.cpp:9:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%lld", &n, &m);
                         ^
bobek.cpp:12:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   ll x; scanf("%lld", &x);
                          ^
bobek.cpp:17:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", x + i);
                       ^
bobek.cpp:20:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", y + i);
                       ^

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