Contest Duration: - (local time) (110 minutes) Back to Home

Submission #846480

Source Code Expand

Copy
```#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):x)
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge

#ifdef DONLINE_JUDGE
// palindromic tree is better than splay tree!
#define lld I64d
#endif

int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(10);
int N;
cin >> N;
vector<int> P;
for(int i =2; i <= 2200; i++) {
bool isP =true;
for(int j =2; j < i; j++) if(i%j == 0) isP =false;
if(isP) P.push_back(i);}
//	cout << P.size() << "\n";
map< pair<long long,long long>,int> M;
for(int i =0; i < N; i++) {
long long x;
cin >> x;
long long y =x, z =1;
ALL_THE(P,it) {
if(*it > x) break;
if(x%(*it) != 0) continue;
long long a =1LL*(*it)*(*it)*(*it);
while(x%a == 0) {
x /=a;
y /=a;}
int pa =0;
while(x%(*it) == 0) {x /=*it; pa++;}
if(pa == 2) z *=(*it);
if(pa == 1) z *=1LL*(*it)*(*it);
z =min(z,1LL<<35);}
if(x > 1) {
long long s =sqrt(x);
while(s > 0 && s*s > x) s--;
while(s*s < x) s++;
if(s*s == x) z *=s;
else z *=x*x;}
z =min(z,1LL<<35);
M[make_pair(y,z)]++;}
int ans =0;
if(M[make_pair(1LL,1LL)] > 0) ans++;
ALL_THE(M,it) if(it->ff.ff > 0) {
auto jt =M.find(make_pair(it->ff.ss,it->ff.ff));
if(jt == M.end()) ans +=it->ss;
else if(it->ff.ff > it->ff.ss) ans +=max(it->ss,jt->ss);
}
cout << ans << "\n";
return 0;}

// look at my code
// my code is amazing
```

#### Submission Info

Submission Time 2016-08-21 21:37:49+0900 D - Anticube xellos C++14 (GCC 5.4.1) 1100 2083 Byte AC 713 ms 6528 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 708 ms 6528 KB
02.txt AC 709 ms 6528 KB
03.txt AC 713 ms 6528 KB
04.txt AC 710 ms 6528 KB
05.txt AC 710 ms 6528 KB
06.txt AC 710 ms 6528 KB
07.txt AC 705 ms 6528 KB
08.txt AC 709 ms 6528 KB
09.txt AC 710 ms 6528 KB
10.txt AC 711 ms 6528 KB
11.txt AC 678 ms 2176 KB
12.txt AC 671 ms 2176 KB
13.txt AC 671 ms 2560 KB
14.txt AC 668 ms 2560 KB
15.txt AC 677 ms 2560 KB
16.txt AC 676 ms 2688 KB
17.txt AC 106 ms 256 KB
18.txt AC 105 ms 256 KB
19.txt AC 105 ms 256 KB
20.txt AC 105 ms 256 KB
21.txt AC 556 ms 4096 KB
22.txt AC 547 ms 4096 KB
23.txt AC 550 ms 4096 KB
24.txt AC 554 ms 4096 KB
25.txt AC 552 ms 4096 KB
26.txt AC 548 ms 4096 KB
27.txt AC 454 ms 5504 KB
28.txt AC 33 ms 256 KB
29.txt AC 42 ms 256 KB
30.txt AC 51 ms 256 KB
31.txt AC 51 ms 256 KB
32.txt AC 51 ms 256 KB
33.txt AC 23 ms 256 KB
34.txt AC 90 ms 256 KB
35.txt AC 82 ms 256 KB
36.txt AC 23 ms 256 KB
37.txt AC 657 ms 2688 KB
38.txt AC 653 ms 2688 KB
39.txt AC 651 ms 2688 KB
40.txt AC 652 ms 2688 KB
41.txt AC 23 ms 256 KB
42.txt AC 23 ms 256 KB
43.txt AC 23 ms 256 KB
44.txt AC 23 ms 256 KB
45.txt AC 23 ms 256 KB
46.txt AC 23 ms 256 KB
47.txt AC 23 ms 256 KB
48.txt AC 23 ms 256 KB
s1.txt AC 23 ms 256 KB
s2.txt AC 23 ms 256 KB
s3.txt AC 23 ms 256 KB