Submission #1688061
Source Code Expand
#include <cstdio> #include <cstring> #include <algorithm> #include <cmath> using namespace std; const int maxn = 1e5; const long long maxw = 1e10; int n; long long a[maxn]; int cnt_prime, prime[5000]; inline long long Sqr(int n) { return (long long)n * n; } inline long long Cube(int n) { return (long long)n * n * n; } long long GetRest(long long a) { long long b = 1; for (int i = 0; i < cnt_prime; ++i) { if (a % Sqr(prime[i]) == 0) { b *= prime[i]; a /= Sqr(prime[i]); } else if (a % prime[i] == 0) { b *= Sqr(prime[i]); a /= prime[i]; } } long long sqrt_a = floor(sqrt(a + (long double)0.5)); if (sqrt_a * sqrt_a == a) { b *= sqrt_a; } else { b *= a * a; } return b; } int main(void) { cnt_prime = 0; for (int n = 2; Cube(n) <= maxw; ++n) { bool is_prime = true; for (int i = 2; i * i <= n; ++i) { if (n % i == 0) { is_prime = false; break; } } if (is_prime) { prime[cnt_prime++] = n; } } scanf("%d", &n); for (int i = 0; i < n; ++i) { scanf("%lld", a + i); for (int j = 0; j < cnt_prime; ++j) { while (a[i] % Cube(prime[j]) == 0) { a[i] /= Cube(prime[j]); } } } sort(a, a + n); int ans = a[0] == 1; for (int i = 0; i < n; ++i) { if (a[i] == 1) continue; int j = i + 1; while (j < n && a[j] == a[i]) { ++j; } long long b = GetRest(a[i]); pair<long long*, long long*> res = equal_range(a, a + n, b); if (res.second == res.first || b > a[i]) { ans += max(j - i, (int)(res.second - res.first)); } i = j - 1; } printf("%d\n", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Anticube |
User | orbitingflea |
Language | C++14 (GCC 5.4.1) |
Score | 1100 |
Code Size | 1759 Byte |
Status | AC |
Exec Time | 988 ms |
Memory | 1152 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:57:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:59:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld", a + i); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1100 / 1100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 988 ms | 1152 KB |
02.txt | AC | 986 ms | 1024 KB |
03.txt | AC | 985 ms | 896 KB |
04.txt | AC | 986 ms | 896 KB |
05.txt | AC | 986 ms | 896 KB |
06.txt | AC | 986 ms | 896 KB |
07.txt | AC | 986 ms | 896 KB |
08.txt | AC | 986 ms | 896 KB |
09.txt | AC | 985 ms | 896 KB |
10.txt | AC | 986 ms | 896 KB |
11.txt | AC | 562 ms | 896 KB |
12.txt | AC | 562 ms | 896 KB |
13.txt | AC | 598 ms | 896 KB |
14.txt | AC | 599 ms | 896 KB |
15.txt | AC | 606 ms | 896 KB |
16.txt | AC | 598 ms | 896 KB |
17.txt | AC | 377 ms | 896 KB |
18.txt | AC | 377 ms | 896 KB |
19.txt | AC | 377 ms | 896 KB |
20.txt | AC | 377 ms | 896 KB |
21.txt | AC | 746 ms | 896 KB |
22.txt | AC | 746 ms | 896 KB |
23.txt | AC | 747 ms | 896 KB |
24.txt | AC | 746 ms | 896 KB |
25.txt | AC | 754 ms | 896 KB |
26.txt | AC | 745 ms | 896 KB |
27.txt | AC | 877 ms | 896 KB |
28.txt | AC | 363 ms | 896 KB |
29.txt | AC | 361 ms | 896 KB |
30.txt | AC | 363 ms | 896 KB |
31.txt | AC | 363 ms | 896 KB |
32.txt | AC | 363 ms | 896 KB |
33.txt | AC | 1 ms | 128 KB |
34.txt | AC | 380 ms | 896 KB |
35.txt | AC | 380 ms | 896 KB |
36.txt | AC | 1 ms | 128 KB |
37.txt | AC | 606 ms | 896 KB |
38.txt | AC | 606 ms | 896 KB |
39.txt | AC | 606 ms | 896 KB |
40.txt | AC | 606 ms | 896 KB |
41.txt | AC | 1 ms | 128 KB |
42.txt | AC | 1 ms | 128 KB |
43.txt | AC | 1 ms | 128 KB |
44.txt | AC | 2 ms | 128 KB |
45.txt | AC | 1 ms | 128 KB |
46.txt | AC | 1 ms | 128 KB |
47.txt | AC | 1 ms | 128 KB |
48.txt | AC | 1 ms | 128 KB |
s1.txt | AC | 1 ms | 128 KB |
s2.txt | AC | 1 ms | 128 KB |
s3.txt | AC | 1 ms | 128 KB |