Submission #848374


Source Code Expand

Copy
#include <bits/stdc++.h>
#define F first
#define S second
#define X real()
#define Y imag()
using namespace std;
typedef long long ll;
typedef long double ld;

int issq(ll x){
	ll t=sqrtl(x);
	if (t*t==x) return 1;
	if ((t-1)*(t-1)==x) return 1;
	if ((t+1)*(t+1)==x) return 1;
	return 0;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin>>n;
	int f1=0;
	map<ll, ll> h;
	for (int i=0;i<n;i++){
		ll s;
		cin>>s;
		for (ll d=2;d*d*d<=s;d++){
			while (s%(d*d*d)==0){
				s/=(d*d*d);
			}
		}
		if (s==1){
			f1=1;
		}
		else{
			h[s]++;
		}
	}
	ll v=0;
	if (f1) v++;
	vector<ll> ps;
	for (int i=2;i<=10000;i++){
		int f=0;
		for (int p:ps){
			if (p*p>i) break;
			if (i%p==0){
				f=1;
				break;
			}
		}
		if (!f) ps.push_back(i);
	}
	for (auto t:h){
		vector<pair<ll, int> > ds;
		ll k=t.F;
		for (ll p:ps){
			while (k%p==0){
				if (ds.size()>0&&ds.back().F==p) ds.back().S++;
				else ds.push_back({p, 1});
				k/=p;
			}
			if (p*p*p>k) break;
		}
		if (k>1&&k<=1000000) {
			for (ll p:ps){
				while (k%p==0){
					if (ds.size()>0&&ds.back().F==p) ds.back().S++;
					else ds.push_back({p, 1});
					k/=p;
				}
				if (p*p>k) break;
			}
			if (k>1) ds.push_back({k, 1});
		}
		else if(k>1){
			if (!issq(t.F)){
				v+=h[t.F];
			}
			else {
				ll ss=sqrtl(t.F);
				if (h[ss]==0) v+=h[t.F];
			}
			continue;
		}
		ll o=1;
		ld oo=1;
		for (auto d:ds){
			if (d.S==1) {
				o*=d.F*d.F;
				oo*=(ld)((ld)d.F*(ld)d.F);
			}
			else{
				o*=d.F;
				oo*=(ld)(d.F);
			}
		}
		if (oo>1e15){
			v+=h[t.F];
		}
		else if (o>t.F){
			v+=max(h[o], h[t.F]);
		}
		else{
			if (h[o]==0) v+=h[t.F];
		}
	}
	cout<<v<<endl;
}

Submission Info

Submission Time
Task D - Anticube
User Laakeri
Language C++14 (GCC 5.4.1)
Score 1100
Code Size 1752 Byte
Status AC
Exec Time 3100 ms
Memory 10624 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1100 / 1100
Status
AC × 3
AC × 51
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 3022 ms 6784 KB
02.txt AC 3023 ms 6784 KB
03.txt AC 3005 ms 6784 KB
04.txt AC 3003 ms 6784 KB
05.txt AC 3021 ms 6784 KB
06.txt AC 3025 ms 6784 KB
07.txt AC 2999 ms 6784 KB
08.txt AC 3025 ms 6784 KB
09.txt AC 3010 ms 6784 KB
10.txt AC 2999 ms 6784 KB
11.txt AC 3093 ms 2176 KB
12.txt AC 3100 ms 2304 KB
13.txt AC 790 ms 4224 KB
14.txt AC 800 ms 4224 KB
15.txt AC 794 ms 4224 KB
16.txt AC 794 ms 4224 KB
17.txt AC 59 ms 256 KB
18.txt AC 59 ms 256 KB
19.txt AC 59 ms 256 KB
20.txt AC 59 ms 256 KB
21.txt AC 1881 ms 5248 KB
22.txt AC 1878 ms 5120 KB
23.txt AC 1874 ms 5248 KB
24.txt AC 1876 ms 5248 KB
25.txt AC 1876 ms 5248 KB
26.txt AC 1871 ms 5120 KB
27.txt AC 453 ms 10624 KB
28.txt AC 14 ms 256 KB
29.txt AC 19 ms 256 KB
30.txt AC 17 ms 256 KB
31.txt AC 17 ms 256 KB
32.txt AC 17 ms 256 KB
33.txt AC 4 ms 256 KB
34.txt AC 52 ms 256 KB
35.txt AC 50 ms 256 KB
36.txt AC 4 ms 256 KB
37.txt AC 2902 ms 2944 KB
38.txt AC 2912 ms 2944 KB
39.txt AC 2895 ms 2944 KB
40.txt AC 2907 ms 2944 KB
41.txt AC 4 ms 256 KB
42.txt AC 4 ms 256 KB
43.txt AC 4 ms 256 KB
44.txt AC 4 ms 256 KB
45.txt AC 4 ms 256 KB
46.txt AC 4 ms 256 KB
47.txt AC 4 ms 256 KB
48.txt AC 4 ms 256 KB
s1.txt AC 4 ms 256 KB
s2.txt AC 4 ms 256 KB
s3.txt AC 4 ms 256 KB