Submission #1685077
Source Code Expand
//2017-10-14
//miaomiao
//
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
#define LL long long
#define For(i, a, b) for(register int i = (a); i <= (int)(b); ++i)
#define Forr(i, a, b) for(register int i = (a); i >= (int)(b); --i)
#define MN (2200+5)
#define N (100000+5)
char chr;
inline void Read(LL &x){
chr = getchar();
while(chr < '0' || chr > '9') chr = getchar();
x = 0;
while(chr >= '0' && chr <= '9'){
x = (x<<1) + (x<<3) + (chr^'0'); chr = getchar();
}
}
bool vis[MN];
int pn, num[MN];
LL a[N], sqr3[MN], sqr[MN];
inline void Init(int nn){
For(i, 1, nn) sqr3[i] = 1ll*i*i*i, sqr[i] = 1ll*i*i;
For(i, 2, nn){
if(!vis[i]) vis[i] = true, num[++pn] = i;
For(j, 1, pn){
if(i * num[j] > nn) break;
vis[i*num[j]] = true;
if(i % num[j] == 0) break;
}
}
}
struct node{
LL x, y, tot;
}me[N];
map<LL, int> ms;
int mn;
int main(){
int n, j;
LL x, y, tmp, form;
Init(2160);
scanf("%d", &n);
For(i, 1, n){
Read(a[i]);
Forr(dj, pn, 1){
j = num[dj];
while(!(a[i] % sqr3[j])) a[i] /= sqr3[j];
}
if(ms.count(a[i])){++me[ms[a[i]]].tot; continue;}
form = a[i]; x = 1; y = 1;
Forr(dj, pn, 1){
j = num[dj];
while(!(a[i] % sqr[j])) x *= j, a[i] /= sqr[j];
}
Forr(dj, pn, 1){
j = num[dj];
while(!(a[i] % j)) y *= j, a[i] /= j;
}
tmp = sqrt(a[i]);
if(tmp*tmp == a[i]) x *= tmp;
else y *= a[i];
me[++mn] = (node){x, y, 1}; ms[a[i]=form] = mn;
}
int ans = 0, id;
LL mv, ov;
if(ms.count(1)) ++ans, ms[1] = -1;
For(i, 1, n){
if(ms[mv = a[i]] == -1) continue;
id = ms[mv]; ov = me[id].x * me[id].y * me[id].y;
if(!ms.count(ov)){ans += me[id].tot; ms[mv] = -1; continue;}
ans += max(me[id].tot, me[ms[ov]].tot);
ms[mv] = ms[ov] = -1;
}
printf("%d\n", ans);
return 0;
}
Submission Info
Submission Time
2017-10-14 22:36:41+0900
Task
D - Anticube
User
miaomiao
Language
C++14 (GCC 5.4.1)
Score
1100
Code Size
1969 Byte
Status
AC
Exec Time
1187 ms
Memory
9600 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:59:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
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
1155 ms
9600 KB
02.txt
AC
1148 ms
9600 KB
03.txt
AC
1151 ms
9600 KB
04.txt
AC
1157 ms
9600 KB
05.txt
AC
1160 ms
9600 KB
06.txt
AC
1187 ms
9600 KB
07.txt
AC
1153 ms
9600 KB
08.txt
AC
1147 ms
9600 KB
09.txt
AC
1145 ms
9600 KB
10.txt
AC
1155 ms
9600 KB
11.txt
AC
635 ms
3712 KB
12.txt
AC
633 ms
3712 KB
13.txt
AC
673 ms
4224 KB
14.txt
AC
678 ms
4224 KB
15.txt
AC
676 ms
4224 KB
16.txt
AC
675 ms
4224 KB
17.txt
AC
380 ms
1024 KB
18.txt
AC
379 ms
1024 KB
19.txt
AC
379 ms
1024 KB
20.txt
AC
380 ms
1024 KB
21.txt
AC
850 ms
6272 KB
22.txt
AC
851 ms
6272 KB
23.txt
AC
858 ms
6400 KB
24.txt
AC
852 ms
6272 KB
25.txt
AC
852 ms
6272 KB
26.txt
AC
855 ms
6272 KB
27.txt
AC
1017 ms
8192 KB
28.txt
AC
352 ms
1024 KB
29.txt
AC
353 ms
1024 KB
30.txt
AC
352 ms
1024 KB
31.txt
AC
354 ms
1152 KB
32.txt
AC
354 ms
1024 KB
33.txt
AC
1 ms
256 KB
34.txt
AC
371 ms
1024 KB
35.txt
AC
370 ms
1024 KB
36.txt
AC
1 ms
256 KB
37.txt
AC
688 ms
4352 KB
38.txt
AC
687 ms
4352 KB
39.txt
AC
684 ms
4352 KB
40.txt
AC
685 ms
4352 KB
41.txt
AC
1 ms
256 KB
42.txt
AC
1 ms
256 KB
43.txt
AC
1 ms
256 KB
44.txt
AC
1 ms
256 KB
45.txt
AC
1 ms
256 KB
46.txt
AC
1 ms
256 KB
47.txt
AC
1 ms
256 KB
48.txt
AC
1 ms
256 KB
s1.txt
AC
1 ms
256 KB
s2.txt
AC
1 ms
256 KB
s3.txt
AC
1 ms
256 KB