#763446 (D) No.1946 ロッカーの問題

• 問題: No.1946 ロッカーの問題
• ユーザー: daut-dlang
• 提出日時: 2022-05-20 22:22:20
• 言語: D (dmd 2.106.1)
• 結果: AC
• 実行時間: 934 ms / 3,000 ms
• コード長: 2,734 bytes
• コンパイル時間: 893 ms
• コンパイル使用メモリ: 123,212 KB
• 実行使用メモリ: 13,008 KB
• 最終ジャッジ日時: 2024-06-22 15:14:57
• 合計ジャッジ時間: 5,121 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,812 KB
testcase_01	AC	1 ms; 6,944 KB
testcase_02	AC	2 ms; 6,944 KB
testcase_03	AC	720 ms; 13,008 KB
testcase_04	AC	2 ms; 6,940 KB
testcase_05	AC	17 ms; 6,940 KB
testcase_06	AC	21 ms; 6,940 KB
testcase_07	AC	17 ms; 6,940 KB
testcase_08	AC	173 ms; 6,944 KB
testcase_09	AC	628 ms; 10,776 KB
testcase_10	AC	507 ms; 10,044 KB
testcase_11	AC	13 ms; 6,940 KB
testcase_12	AC	104 ms; 6,940 KB
testcase_13	AC	1 ms; 6,940 KB
testcase_14	AC	1 ms; 6,944 KB
testcase_15	AC	1 ms; 6,944 KB
testcase_16	AC	1 ms; 6,940 KB
testcase_17	AC	375 ms; 6,944 KB
testcase_18	AC	934 ms; 9,388 KB

ソースコード

import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }
double euDist(T)(T[] a, T[] b) { auto c = a.dup; c[] -= b[]; c[] *= c[]; return sqrt(cast(double)c.sum); }
double[] rotate(double[] vec, double rad) { return [cos(rad)*vec[0] - sin(rad)*vec[1], sin(rad)*vec[0] + cos(rad)*vec[1]]; }
double norm(double[] vec) { return sqrt(reduce!((a,b)=>a+b*b)(0.0, vec)); }
double dotProd(double[] a, double[] b) { auto r = a.dup; r[] *= b[]; return r.sum; }

//long mod = 10^^9 + 7;
long mod = 998_244_353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }
void modpow(ref long x, long y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(ref long x, long y) { y.modpow(mod - 2); x.modm(y); }

void main()
{
	auto N = RD;
	auto M = RD;
	auto A = RDA;
	
	auto arr = new long[](N);
	foreach (i; 0..M)
	{
		arr[A[i]-1] = 1;
	}

	long ans;
	foreach_reverse (i; 0..N)
	{
		auto x = i + 1;
		if (arr[i] == 1)
		{
			bool[long] set;
			for (long j = 1; j*j <= x; ++j)
			{
				if (x % j) continue;
				set[j] = true;
				set[x/j] = true;
			}
			foreach (key; set.keys)
				arr[key-1] ^= 1;
		}
		else
		{
			debug writeln("x:", x);
			++ans;
		}
	}

	writeln(ans);
	stdout.flush;
	debug readln;
}