Submission #846233


Source Code Expand

Copy
//In the name of Allah
#include <bits/stdc++.h>
using namespace std;

typedef long long ll; 

const int maxN = 1000 * 100 + 100; 
const int mx = 2500 + 10; 

ll a[maxN]; 
map<ll,int> cnt; 
vector<int> pr; 
int mark[maxN]; 

int main() { 
	for( int i = 2 ; i < maxN ; i++ ) if( !mark[i] ) { 
		pr.push_back(i); 
		for( int j = i + i ; j < maxN ; j += i ) 
			mark[j] = true; 
	}

	ios::sync_with_stdio(false); cin.tie(0); 
	int n; cin >> n; 
	for( int i = 0 ; i < n ; i++ ) { 
		cin >> a[i]; 
		for( int t = 2 ; t < mx ; t++ ) { 
			ll z = t * 1ll * t * t; 
			while( a[i] % z == 0 ) 
				a[i] /= z; 
		}
		cnt[a[i]]++; 
	}
	sort( a , a + n ); 
	int ans = 0; 
	if( cnt[1] ) ans = 1; 
	cnt[1] = 0; 
	for( int i = 0 ; i < n ; i++ ) 
		if( cnt[a[i]] ) { 
			ll x = a[i]; 
			ll z = 1; 
			for( auto y : pr ) { 
				int v = 0; 
				while( x % y == 0 ) { 
					v++; 
					x /= y;
				}
				if( v == 1 ) z *= y * 1ll * y; 
				else if( v == 2 ) z *= y; 
			}
			if( x > 1 ) ans += cnt[a[i]]; 
			else { 
				ans += max( cnt[a[i]] , cnt[z] ); 
				cnt[z] = 0;
			}
			cnt[a[i]] = 0; 
			//cerr << a[i] << "   " << z << " ANS CHANGED TO " << ans << endl;
		}
	cout << ans << endl;
}

Submission Info

Submission Time
Task D - Anticube
User LiTi
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1233 Byte
Status TLE
Exec Time 5258 ms
Memory 7936 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1100
Status
AC × 3
AC × 24
TLE × 27
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 5254 ms 7936 KB
02.txt TLE 5254 ms 7936 KB
03.txt TLE 5258 ms 7936 KB
04.txt TLE 5254 ms 7936 KB
05.txt TLE 5254 ms 7936 KB
06.txt TLE 5254 ms 7936 KB
07.txt TLE 5254 ms 7936 KB
08.txt TLE 5254 ms 7936 KB
09.txt TLE 5254 ms 7936 KB
10.txt TLE 5254 ms 7936 KB
11.txt TLE 5253 ms 3456 KB
12.txt TLE 5257 ms 3456 KB
13.txt TLE 5253 ms 3840 KB
14.txt TLE 5257 ms 3840 KB
15.txt TLE 5253 ms 3840 KB
16.txt TLE 5253 ms 3968 KB
17.txt AC 4576 ms 1536 KB
18.txt AC 4589 ms 1536 KB
19.txt AC 4587 ms 1536 KB
20.txt AC 4585 ms 1536 KB
21.txt TLE 5254 ms 5504 KB
22.txt TLE 5257 ms 5504 KB
23.txt TLE 5257 ms 5504 KB
24.txt TLE 5254 ms 5504 KB
25.txt TLE 5257 ms 5504 KB
26.txt TLE 5254 ms 5504 KB
27.txt TLE 5257 ms 6912 KB
28.txt AC 4515 ms 1536 KB
29.txt AC 4534 ms 1536 KB
30.txt AC 4516 ms 1536 KB
31.txt AC 4519 ms 1536 KB
32.txt AC 4517 ms 1536 KB
33.txt AC 6 ms 768 KB
34.txt AC 4537 ms 1536 KB
35.txt AC 4559 ms 1536 KB
36.txt AC 6 ms 768 KB
37.txt TLE 5253 ms 3968 KB
38.txt TLE 5253 ms 3968 KB
39.txt TLE 5257 ms 3968 KB
40.txt TLE 5253 ms 3968 KB
41.txt AC 6 ms 768 KB
42.txt AC 6 ms 768 KB
43.txt AC 7 ms 768 KB
44.txt AC 6 ms 768 KB
45.txt AC 6 ms 768 KB
46.txt AC 6 ms 768 KB
47.txt AC 6 ms 768 KB
48.txt AC 6 ms 768 KB
s1.txt AC 7 ms 768 KB
s2.txt AC 6 ms 768 KB
s3.txt AC 7 ms 768 KB