結果

問題 No.990 N×Mマス計算（Kの倍数）
ユーザー MarcusAureliusAntoninusMarcusAureliusAntoninus
提出日時 2020-02-14 23:02:59
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 195 ms / 2,000 ms
コード長 1,260 bytes
コンパイル時間 2,395 ms
コンパイル使用メモリ 207,868 KB
最終ジャッジ日時 2025-01-09 00:29:49
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 19
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:18:23: warning: format ‘%lld’ expects argument of type ‘long long int*’, but argument 4 has type ‘int64_t*’ {aka ‘long int*’} [-Wformat=]
   18 |         scanf("%d%d%lld %c", &N, &M, &K, &op);
      |                    ~~~^              ~~
      |                       |              |
      |                       long long int* int64_t* {aka long int*}
      |                    %ld
main.cpp:21:27: warning: format ‘%lld’ expects argument of type ‘long long int*’, but argument 2 has type ‘long int*’ [-Wformat=]
   21 |                 scanf("%lld", &e);
      |                        ~~~^   ~~
      |                           |   |
      |                           |   long int*
      |                           long long int*
      |                        %ld
main.cpp:23:27: warning: format ‘%lld’ expects argument of type ‘long long int*’, but argument 2 has type ‘long int*’ [-Wformat=]
   23 |                 scanf("%lld", &e);
      |                        ~~~^   ~~
      |                           |   |
      |                           |   long int*
      |                           long long int*
      |                        %ld
main.cpp:61:20: warning: format ‘%lld’ expects argument of type ‘long long int’, but argument 2 has type ‘int64_t’ {aka ‘long int’} [-Wformat=]
   61 |         printf("%lld\n", ans);
      |                 ~~~^     ~~~
      |                    |     |
      |                    |     int64_t {aka long int}
      |                    long long int
      |                 %ld
main.cpp:18:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   18 |         scanf("%d%d%lld %c", &N, &M, &K, &op);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:21:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared w

ソースコード

diff # 

#include <bits/stdc++.h>

int64_t calcGCD(int64_t a, int64_t b)
{
	while (a)
	{
		b %= a;
		std::swap(a, b);
	}
	return b;
}

int main()
{
	int N, M;
	int64_t K;
	char op;
	scanf("%d%d%lld %c", &N, &M, &K, &op);
	std::vector<int64_t> A(N), B(M);
	for (auto& e: B)
		scanf("%lld", &e);
	for (auto& e: A)
		scanf("%lld", &e);

	int64_t ans{};
	if (op == '+')
	{
		std::map<int64_t, int64_t> rest_a, rest_b;
		for (auto& e: A)
			rest_a[e % K]++;
		for (auto& e: B)
			rest_b[e % K]++;
		for (auto& e: rest_a)
			ans += e.second * rest_b[K - e.first];
		ans += rest_a[0] * rest_b[0];
	}
	else
	{
		std::vector<int> div, count;
		div.reserve(10'000);
		for (int64_t i{1}; i * i <= K; i++)
			if (K % i == 0)
			{
				div.push_back(i);
				if (i * i != K)
					div.push_back(K / i);
			}
		std::sort(div.begin(), div.end());
		count.resize(div.size());
		
		for (auto& e: B)
			count[std::lower_bound(div.begin(), div.end(), K / calcGCD(e, K)) - div.begin()]++;
		for (int i{(int)div.size() - 1}; i >= 0; i--)
			for (int j{i + 1}; j < (int)div.size(); j++)
				if (div[j] % div[i] == 0)
					count[j] += count[i];
		
		for (auto& e: A)
			ans += count[std::lower_bound(div.begin(), div.end(), calcGCD(e, K)) - div.begin()];
	}
	printf("%lld\n", ans);

	return 0;
}
0