Submission #1512441
Source Code Expand
#include<bits/stdc++.h> #define ll long long #define N 100000 #define M 3000 using namespace std; int n,ans,p[M+5]; ll x; vector<int> pr; map<ll,int> mp; void init() { for(int i=2;i<=M;i++) { if(!p[i]) { pr.push_back(i); for(int j=i+i;j<=M;j+=i) { p[j]=1; } } } } ll ters(ll x) { for(int i=0;i<pr.size();i++) { ll bol=1ll*pr[i]*pr[i]*pr[i]; while(x%bol==0) x/=bol; } return x; } ll pai(ll x) { ll pi=1; vector<ll> carp; for(int i=0;i<pr.size();i++) { int no=0; while(x%pr[i]==0) x/=pr[i],no++; if(no) { for(int j=1;j<=3-no;j++,carp.push_back(pr[i])); } } ll sq=sqrt(x); if(sq*sq==x) { carp.push_back(sq); } else { for(int i=0;i<2;i++,carp.push_back(x)); } for(int i=0;i<carp.size();i++) { pi*=carp[i]; if(pi>1ll*N*N) { return 0; } } return pi; } int main() { scanf("%d",&n); init(); for(int i=1;i<=n;i++) { scanf("%lld",&x); x=ters(x); mp[x]++; } for(auto i:mp) { ll inv=pai(i.first); if(i.first==1 || !inv) { ans+=2; continue ; } if(mp.find(inv)!=mp.end()) { ans+=max(mp[inv],i.second); } else { ans+=2*i.second; } } printf("%d",ans/2); }
Submission Info
Submission Time | |
---|---|
Task | D - Anticube |
User | hamzqq9 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1342 Byte |
Status | WA |
Exec Time | 1013 ms |
Memory | 8576 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:65:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:68:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld",&x); ^
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 1012 ms | 6528 KB |
02.txt | WA | 1009 ms | 6528 KB |
03.txt | WA | 1010 ms | 6528 KB |
04.txt | WA | 1009 ms | 6528 KB |
05.txt | AC | 1011 ms | 8576 KB |
06.txt | AC | 1009 ms | 6528 KB |
07.txt | AC | 1010 ms | 6528 KB |
08.txt | WA | 1009 ms | 6528 KB |
09.txt | AC | 1010 ms | 6528 KB |
10.txt | WA | 1013 ms | 6528 KB |
11.txt | WA | 646 ms | 2176 KB |
12.txt | WA | 646 ms | 2176 KB |
13.txt | WA | 675 ms | 2560 KB |
14.txt | WA | 674 ms | 2560 KB |
15.txt | WA | 675 ms | 2560 KB |
16.txt | WA | 677 ms | 2560 KB |
17.txt | AC | 490 ms | 256 KB |
18.txt | AC | 490 ms | 256 KB |
19.txt | AC | 490 ms | 256 KB |
20.txt | AC | 490 ms | 256 KB |
21.txt | WA | 800 ms | 4096 KB |
22.txt | WA | 799 ms | 4096 KB |
23.txt | WA | 802 ms | 4096 KB |
24.txt | WA | 802 ms | 4096 KB |
25.txt | WA | 800 ms | 4096 KB |
26.txt | WA | 799 ms | 4096 KB |
27.txt | AC | 942 ms | 5504 KB |
28.txt | AC | 472 ms | 256 KB |
29.txt | AC | 476 ms | 256 KB |
30.txt | AC | 473 ms | 256 KB |
31.txt | AC | 473 ms | 256 KB |
32.txt | AC | 473 ms | 256 KB |
33.txt | AC | 1 ms | 256 KB |
34.txt | AC | 491 ms | 256 KB |
35.txt | AC | 488 ms | 256 KB |
36.txt | AC | 1 ms | 256 KB |
37.txt | WA | 684 ms | 2688 KB |
38.txt | WA | 684 ms | 2688 KB |
39.txt | WA | 683 ms | 2688 KB |
40.txt | WA | 684 ms | 2688 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 |