제출 #427274

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
427274		model_code	GCD-sum (CPSPC17_gcds)	C++17	10 / 100	805 ms	5944 KiB

Main

# include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
	if (a == 0)
		return b;
	else
		return gcd(b % a, a);
}
const int MN = 20;
long long gcd_arr[1 << MN];
long long a[MN];
const long long inf = 1e18 + 44;
long long dp[1 << MN][MN + 1];
int main() {
	int n;
	scanf("%d", &n);
	assert(n <= MN);
	for (int i = 0; i < n; ++i)
		scanf("%lld", a + i);
	gcd_arr[0] = 0;
	for (int mask = 1; mask < (1 << n); ++mask) {
		int i = __builtin_ctz(mask);
		assert((1 << i) == (mask & -mask));
		gcd_arr[mask] = gcd(a[i], gcd_arr[mask &~ (1 << i)]);
	}
	for (int mask = 0; mask < (1 << n); ++mask)
		for (int i = 0; i <= n; ++i)
			dp[mask][i] = -inf;
	dp[0][0] = 0;
	for (int mask = 1; mask < (1 << n); ++mask)
		for (int i = 1; i <= n; ++i) {
			assert(dp[mask][i] == -inf);
			for (int subset = mask; subset > 0; subset = (subset - 1) & mask) {
				assert(subset > 0);
				dp[mask][i] = max(dp[mask][i], dp[mask &~ subset][i - 1] + gcd_arr[subset]);
			}
		}
	for (int mask = 1; mask < (1 << n); ++mask)
		assert(dp[mask][1] == gcd_arr[mask]);
	for (int i = 1; i <= n; ++i)
		printf("%lld\n", dp[(1 << n) - 1][i]);
}

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

Main.cpp: In function 'int main()':
Main.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
Main.cpp:19:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |   scanf("%lld", a + i);
      |   ~~~~~^~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 8
• Subtask 4: 0 / 8
• Subtask 5: 0 / 14
• Subtask 6: 0 / 25
• Subtask 7: 0 / 35