Submission #847162


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 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<=100000;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>k) break;
		}
		if (k>1) ds.push_back({k, 1});
		ll o=1;
		ld oo=1;
		for (auto d:ds){
			if (d.S==1) {
				o*=d.F*d.F;
				oo*=(ld)(d.F*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]);
		}
	}
	cout<<v<<endl;
}

Submission Info

Submission Time
Task D - Anticube
User Laakeri
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1206 Byte
Status WA
Exec Time 5258 ms
Memory 10624 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1100
Status
AC × 3
AC × 23
WA × 2
TLE × 26
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 TLE 5258 ms 7040 KB
02.txt TLE 5257 ms 6912 KB
03.txt TLE 5257 ms 7040 KB
04.txt TLE 5258 ms 7040 KB
05.txt TLE 5254 ms 6912 KB
06.txt TLE 5257 ms 6912 KB
07.txt TLE 5257 ms 7040 KB
08.txt TLE 5254 ms 7040 KB
09.txt TLE 5257 ms 7040 KB
10.txt TLE 5257 ms 7040 KB
11.txt TLE 5256 ms 2432 KB
12.txt TLE 5257 ms 2432 KB
13.txt TLE 5257 ms 4096 KB
14.txt TLE 5257 ms 4096 KB
15.txt TLE 5237 ms 4096 KB
16.txt TLE 5257 ms 4096 KB
17.txt AC 67 ms 512 KB
18.txt AC 67 ms 512 KB
19.txt AC 69 ms 512 KB
20.txt AC 70 ms 512 KB
21.txt TLE 5257 ms 5120 KB
22.txt TLE 5257 ms 5120 KB
23.txt TLE 5257 ms 5120 KB
24.txt TLE 5257 ms 5120 KB
25.txt TLE 5257 ms 5116 KB
26.txt TLE 5257 ms 5120 KB
27.txt AC 1846 ms 10624 KB
28.txt AC 21 ms 512 KB
29.txt AC 26 ms 512 KB
30.txt WA 25 ms 512 KB
31.txt AC 25 ms 512 KB
32.txt AC 24 ms 512 KB
33.txt AC 11 ms 512 KB
34.txt AC 60 ms 512 KB
35.txt AC 60 ms 512 KB
36.txt AC 11 ms 512 KB
37.txt TLE 5256 ms 2944 KB
38.txt TLE 5257 ms 2944 KB
39.txt TLE 5257 ms 2944 KB
40.txt TLE 5257 ms 2944 KB
41.txt AC 11 ms 512 KB
42.txt AC 11 ms 512 KB
43.txt AC 12 ms 512 KB
44.txt AC 11 ms 512 KB
45.txt AC 11 ms 512 KB
46.txt AC 27 ms 512 KB
47.txt WA 11 ms 512 KB
48.txt AC 11 ms 512 KB
s1.txt AC 12 ms 512 KB
s2.txt AC 11 ms 512 KB
s3.txt AC 11 ms 512 KB