Submission #1837813


Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <map>
#include <vector>
#define pb push_back

using namespace std;

typedef long long ll;
typedef pair<int,int> abcd;

const int N=100010;

int n,p[N];
ll a[N],b[N],c[N];

inline void Pre(){
  for(int i=2;i<=100000;i++){
    if(!p[i]) p[++*p]=i;
    for(int j=1;j<=*p && 1LL*p[j]*i<=100000;i++){
      p[p[j]*i]=1; if(i%p[j]==0) break;
    }
  }
}

map<ll,int> vis,ct;

int main(){
  scanf("%d",&n); Pre();
  for(int i=1;i<=n;i++) {
    scanf("%lld",&a[i]); b[i]=1; c[i]=1;
    for(int j=1;j<=*p && 1LL*p[j]*p[j]<=a[i];j++)
      if(a[i]%p[j]==0){
	int cnt=0; while(a[i]%p[j]==0) a[i]/=p[j],cnt++;
	cnt%=3; for(int k=1;k<=cnt;k++) c[i]*=p[j];
	if(cnt) for(int k=cnt+1;k<=3;k++) b[i]*=p[j];
      }
    c[i]*=a[i];
    ct[c[i]]++;
  }
  int ans=1; vis[1]=1;
  for(int i=1;i<=n;i++){
    if(vis[c[i]]) continue;
    ans+=max(ct[c[i]],ct[b[i]]);
    vis[c[i]]=vis[b[i]]=1;
  }
  printf("%d\n",ans);
  return 0;
}

Submission Info

Submission Time
Task D - Anticube
User SBP
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1028 Byte
Status WA
Exec Time 5256 ms
Memory 13440 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:30:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n); Pre();
                 ^
./Main.cpp:32:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld",&a[i]); b[i]=1; c[i]=1;
                        ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1100
Status
WA × 3
AC × 9
WA × 20
TLE × 22
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 5256 ms 8960 KB
02.txt TLE 5256 ms 8832 KB
03.txt TLE 5256 ms 8960 KB
04.txt TLE 5256 ms 8960 KB
05.txt TLE 5256 ms 9088 KB
06.txt TLE 5256 ms 8960 KB
07.txt TLE 5256 ms 9088 KB
08.txt TLE 5256 ms 10624 KB
09.txt TLE 5256 ms 8960 KB
10.txt TLE 5256 ms 8960 KB
11.txt TLE 5255 ms 1792 KB
12.txt TLE 5255 ms 1664 KB
13.txt WA 3993 ms 7808 KB
14.txt WA 4035 ms 7808 KB
15.txt WA 4070 ms 7808 KB
16.txt WA 4078 ms 7808 KB
17.txt WA 64 ms 2944 KB
18.txt WA 64 ms 2944 KB
19.txt WA 64 ms 2944 KB
20.txt WA 64 ms 2944 KB
21.txt TLE 5256 ms 3712 KB
22.txt TLE 5255 ms 3712 KB
23.txt TLE 5255 ms 3712 KB
24.txt TLE 5255 ms 3712 KB
25.txt TLE 5255 ms 3712 KB
26.txt TLE 5255 ms 3712 KB
27.txt WA 143 ms 13440 KB
28.txt AC 11 ms 2944 KB
29.txt AC 18 ms 2944 KB
30.txt WA 21 ms 2944 KB
31.txt WA 19 ms 2944 KB
32.txt WA 19 ms 2944 KB
33.txt WA 2 ms 640 KB
34.txt WA 60 ms 2944 KB
35.txt AC 54 ms 2944 KB
36.txt AC 2 ms 640 KB
37.txt TLE 5255 ms 1920 KB
38.txt TLE 5255 ms 1920 KB
39.txt TLE 5255 ms 1920 KB
40.txt TLE 5255 ms 1920 KB
41.txt WA 2 ms 640 KB
42.txt WA 2 ms 640 KB
43.txt AC 2 ms 640 KB
44.txt WA 2 ms 640 KB
45.txt AC 2 ms 640 KB
46.txt AC 2 ms 640 KB
47.txt AC 2 ms 640 KB
48.txt AC 2 ms 640 KB
s1.txt WA 2 ms 640 KB
s2.txt WA 2 ms 640 KB
s3.txt WA 2 ms 640 KB