#284756 (C++17) No.732 3PrimeCounting

• 問題: No.732 3PrimeCounting
• ユーザー: ant2357
• 提出日時: 2018-09-13 01:51:29
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 397 ms / 3,000 ms
• コード長: 1,292 bytes
• コンパイル時間: 2,213 ms
• コンパイル使用メモリ: 203,844 KB
• 実行使用メモリ: 4,700 KB
• 最終ジャッジ日時: 2023-09-10 20:50:12
• 合計ジャッジ時間: 9,482 ms
• ジャッジサーバーID （参考情報）: judge11 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,380 KB
testcase_01	AC	2 ms; 4,380 KB
testcase_02	AC	3 ms; 4,376 KB
testcase_03	AC	2 ms; 4,384 KB
testcase_04	AC	2 ms; 4,384 KB
testcase_05	AC	2 ms; 4,404 KB
testcase_06	AC	2 ms; 4,380 KB
testcase_07	AC	3 ms; 4,380 KB
testcase_08	AC	3 ms; 4,380 KB
testcase_09	AC	2 ms; 4,384 KB
testcase_10	AC	3 ms; 4,384 KB
testcase_11	AC	3 ms; 4,376 KB
testcase_12	AC	3 ms; 4,384 KB
testcase_13	AC	3 ms; 4,380 KB
testcase_14	AC	2 ms; 4,384 KB
testcase_15	AC	3 ms; 4,376 KB
testcase_16	AC	2 ms; 4,456 KB
testcase_17	AC	3 ms; 4,380 KB
testcase_18	AC	2 ms; 4,380 KB
testcase_19	AC	2 ms; 4,376 KB
testcase_20	AC	3 ms; 4,384 KB
testcase_21	AC	3 ms; 4,380 KB
testcase_22	AC	3 ms; 4,436 KB
testcase_23	AC	3 ms; 4,432 KB
testcase_24	AC	3 ms; 4,380 KB
testcase_25	AC	4 ms; 4,380 KB
testcase_26	AC	3 ms; 4,500 KB
testcase_27	AC	3 ms; 4,380 KB
testcase_28	AC	3 ms; 4,384 KB
testcase_29	AC	3 ms; 4,592 KB
testcase_30	AC	3 ms; 4,428 KB
testcase_31	AC	3 ms; 4,384 KB
testcase_32	AC	4 ms; 4,380 KB
testcase_33	AC	4 ms; 4,560 KB
testcase_34	AC	4 ms; 4,376 KB
testcase_35	AC	3 ms; 4,376 KB
testcase_36	AC	3 ms; 4,380 KB
testcase_37	AC	3 ms; 4,408 KB
testcase_38	AC	3 ms; 4,436 KB
testcase_39	AC	3 ms; 4,384 KB
testcase_40	AC	3 ms; 4,388 KB
testcase_41	AC	3 ms; 4,384 KB
testcase_42	AC	3 ms; 4,384 KB
testcase_43	AC	2 ms; 4,380 KB
testcase_44	AC	3 ms; 4,376 KB
testcase_45	AC	3 ms; 4,380 KB
testcase_46	AC	3 ms; 4,376 KB
testcase_47	AC	2 ms; 4,384 KB
testcase_48	AC	4 ms; 4,424 KB
testcase_49	AC	5 ms; 4,376 KB
testcase_50	AC	3 ms; 4,432 KB
testcase_51	AC	3 ms; 4,388 KB
testcase_52	AC	2 ms; 4,380 KB
testcase_53	AC	7 ms; 4,552 KB
testcase_54	AC	104 ms; 4,380 KB
testcase_55	AC	103 ms; 4,380 KB
testcase_56	AC	105 ms; 4,384 KB
testcase_57	AC	20 ms; 4,388 KB
testcase_58	AC	21 ms; 4,428 KB
testcase_59	AC	8 ms; 4,380 KB
testcase_60	AC	30 ms; 4,396 KB
testcase_61	AC	30 ms; 4,444 KB
testcase_62	AC	139 ms; 4,480 KB
testcase_63	AC	58 ms; 4,380 KB
testcase_64	AC	39 ms; 4,404 KB
testcase_65	AC	39 ms; 4,380 KB
testcase_66	AC	3 ms; 4,380 KB
testcase_67	AC	2 ms; 4,376 KB
testcase_68	AC	120 ms; 4,396 KB
testcase_69	AC	120 ms; 4,384 KB
testcase_70	AC	107 ms; 4,380 KB
testcase_71	AC	107 ms; 4,596 KB
testcase_72	AC	54 ms; 4,400 KB
testcase_73	AC	247 ms; 4,700 KB
testcase_74	AC	253 ms; 4,624 KB
testcase_75	AC	3 ms; 4,384 KB
testcase_76	AC	115 ms; 4,388 KB
testcase_77	AC	22 ms; 4,380 KB
testcase_78	AC	180 ms; 4,508 KB
testcase_79	AC	121 ms; 4,380 KB
testcase_80	AC	160 ms; 4,468 KB
testcase_81	AC	108 ms; 4,380 KB
testcase_82	AC	2 ms; 4,380 KB
testcase_83	AC	21 ms; 4,380 KB
testcase_84	AC	23 ms; 4,604 KB
testcase_85	AC	89 ms; 4,376 KB
testcase_86	AC	163 ms; 4,576 KB
testcase_87	AC	397 ms; 4,628 KB
testcase_88	AC	391 ms; 4,612 KB

ソースコード

#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using ld = long double;

const double PI = 3.1415926535897932384626433832795;

const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { -1, 0, 1, 0 };

int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }

vector<int> sieveOfEratosthenes(int n) {
	vector<bool> isPrimes(n + 1, true);
	isPrimes[0] = isPrimes[1] = false;

	for (int i = 2; i * i <= n; i++) {
		if (isPrimes[i]) {
			for (int j = 2 * i; j <= n; j += i) {
				isPrimes[j] = false;
			}
		}
	}

	vector<int> res;
	for (int i = 2; i <= n; i++) {
		if (isPrimes[i]) {
			res.push_back(i);
		}
	}

	return res;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	const int N_MAX = 100000;

	int n;
	cin >> n;

	vector<int> nPrimes = sieveOfEratosthenes(n);
	vector<int> n3Primes = sieveOfEratosthenes(3 * n);

	ll ans = 0;
	vector<int> cnt(3 * N_MAX + 1), primes;
	for (auto p : nPrimes) {
		for (auto abc : n3Primes) {
			if (p >= abc) {
				continue;
			}

			ans += cnt[abc - p];
		}

		for (auto q : primes) {
			cnt[p + q]++;
		}

		primes.emplace_back(p);
	}

	cout << ans << endl;
	return 0;
}