Submission #1521072
Source Code Expand
#include<iostream>
#include<fstream>
#include<sstream>
#include<algorithm>
#include<cstdio>
#include<cctype>
#include<cassert>
#include<cmath>
#include<ctime>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<iomanip>
#include<utility>
using namespace std;
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define rg register
#define il inline
#define lch(x) ((x)<<1)
#define rch(x) ((x)<<1^1)
#define eprintf(...) fprintf(stderr,__VA_ARGS__)
#define rep0(i,n) for(register int i=0;i<(n);++i)
#define per0(i,n) for(register int i=(n)-1;i>=0;--i)
#define rep(i,st,ed) for(register int i=(st);i<=(ed);++i)
#define per(i,ed,st) for(register int i=(ed);i>=(st);--i)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef double dbl;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T> il T qmin(const T &a,const T &b){return a<b?a:b;}
template<typename T> il T qmax(const T &a,const T &b){return a>b?a:b;}
template<typename T> il void getmin(T &a,const T &b){if(a>b) a=b;}
template<typename T> il void getmax(T &a,const T &b){if(a<b) a=b;}
il void fileio(string s){
freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout);
}
const int inf=(int)1e9+7;
const ll linf=(ll)1e17+7;
const int N=2161;
ll a[N],need[N],rest[N];
int prime[N],tot;
map<pll,int> cnt;
int n;
il void init(){
static bool kicked[N];
rep(i,2,N-1){
if(!kicked[i]) prime[++tot]=i;
rep(j,1,tot){
if(i*prime[j]>=N) break;
kicked[i*prime[j]]=true;
if(i%prime[j]==0) break;
}
}
}
int main(){
init();
scanf("%d",&n);
rep(i,1,n){
scanf("%lld",a+i);
need[i]=rest[i]=1;
ll tmp=a[i];
rep(j,1,tot){
int v=prime[j];
if(tmp%v!=0) continue;
int times=0;
while(tmp%v==0) tmp/=v,++times;
times%=3;
if(times==1){
rest[i]*=v;
need[i]*=v*v;
}else if(times==2){
rest[i]*=v*v;
need[i]*=v;
}
}
if(tmp>1){
ll v=floor(sqrt(tmp));
if(v*v==tmp){
rest[i]*=tmp;
need[i]*=v;
}else{
rest[i]*=tmp;
need[i]*=tmp*tmp;
}
}
// cerr<<need[i]<<" "<<rest[i]<<endl;
++cnt[mp(rest[i],need[i])];
}
int ans=0;
while(cnt.begin()!=cnt.end()){
pll p=cnt.begin()->X,q=mp(p.Y,p.X);
if(p.X==1) ++ans;
else{
ans+=qmax(cnt[p],cnt[q]);
cnt.erase(q);
}
cnt.erase(cnt.begin());
}
printf("%d\n",ans);
return 0;
}
Submission Info
Submission Time
2017-08-20 14:38:36+0900
Task
D - Anticube
User
zyding
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
2609 Byte
Status
RE
Exec Time
114 ms
Memory
512 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:74:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:76:20: 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
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
RE
106 ms
512 KB
02.txt
RE
105 ms
512 KB
03.txt
RE
105 ms
512 KB
04.txt
RE
105 ms
512 KB
05.txt
RE
107 ms
512 KB
06.txt
RE
107 ms
512 KB
07.txt
RE
106 ms
512 KB
08.txt
RE
106 ms
512 KB
09.txt
RE
106 ms
512 KB
10.txt
RE
105 ms
512 KB
11.txt
RE
107 ms
512 KB
12.txt
RE
105 ms
512 KB
13.txt
RE
106 ms
512 KB
14.txt
RE
106 ms
512 KB
15.txt
RE
105 ms
512 KB
16.txt
RE
105 ms
512 KB
17.txt
RE
105 ms
256 KB
18.txt
RE
108 ms
256 KB
19.txt
RE
106 ms
256 KB
20.txt
RE
106 ms
256 KB
21.txt
RE
106 ms
384 KB
22.txt
RE
108 ms
384 KB
23.txt
RE
105 ms
384 KB
24.txt
RE
105 ms
384 KB
25.txt
RE
105 ms
384 KB
26.txt
RE
106 ms
384 KB
27.txt
RE
106 ms
384 KB
28.txt
RE
105 ms
256 KB
29.txt
RE
107 ms
256 KB
30.txt
RE
106 ms
256 KB
31.txt
RE
105 ms
256 KB
32.txt
RE
105 ms
256 KB
33.txt
AC
1 ms
256 KB
34.txt
RE
114 ms
256 KB
35.txt
RE
106 ms
256 KB
36.txt
AC
1 ms
256 KB
37.txt
RE
106 ms
512 KB
38.txt
RE
108 ms
512 KB
39.txt
RE
105 ms
512 KB
40.txt
RE
105 ms
512 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