#include <bits/stdc++.h>
using namespace std;
long long bitmask[50005];
int mmare[50005];
int dl[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dc[8] = {0, 1, 1, 1, 0, -1, -1, -1};
bool prime(int x,int y)
{
if (x==1||y==1)
{
return true;
}
if (x==0||y==0)
{
return false;
}
if (bitmask[x]&bitmask[y])
{
return false;
}
if (mmare[x]>1&&mmare[x]==mmare[y])
{
return false;
}
return true;
}
long long sum=0;
void fractal(int x,int y,int lung,int dir,int jum)
{
if (lung==0)
{
return;
}
int i;
for (i=1; i<=lung; i++)
{
x=x+dl[dir];
y=y+dc[dir];
sum=sum+prime(x,y);
}
if (jum==1)
{
lung=lung/2;
}
fractal(x,y,lung,(dir+1)&7,1-jum);
fractal(x,y,lung,(dir-1)&7,1-jum);
}
bool c[50005];
int n,m,frac,i,j,nr,x,y,numar;
int main()
{
cin>>n>>m>>frac;
nr=-1;
int lim=max(n,m);
for (i=2; i<=lim; i++)
{
if (mmare[i]==0)
{
for (j=i; j<=lim; j+=i)
{
mmare[j]=i;
}
}
}
for (i=2; i*i<=lim; i++)
{
if (bitmask[i]==0)
{
nr++;
for (j=i; j<=lim; j+=i)
{
bitmask[j]+=(1<<nr);
}
}
}
for (i=1; i<=frac; i++)
{
cin>>x>>y>>numar;
x--;
y--;
sum=sum+prime(x,y);
fractal(x,y,numar,0,1);
}
cout<<sum;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
332 KB |
Output is correct |
2 |
Correct |
19 ms |
424 KB |
Output is correct |
3 |
Incorrect |
394 ms |
872 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
619 ms |
860 KB |
Output isn't correct |
2 |
Incorrect |
617 ms |
860 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1028 ms |
860 KB |
Output isn't correct |
2 |
Incorrect |
1084 ms |
864 KB |
Output isn't correct |
3 |
Incorrect |
1108 ms |
864 KB |
Output isn't correct |
4 |
Incorrect |
1140 ms |
964 KB |
Output isn't correct |
5 |
Incorrect |
1190 ms |
864 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2099 ms |
868 KB |
Output isn't correct |
2 |
Incorrect |
2209 ms |
968 KB |
Output isn't correct |
3 |
Incorrect |
2390 ms |
864 KB |
Output isn't correct |
4 |
Incorrect |
2486 ms |
864 KB |
Output isn't correct |
5 |
Incorrect |
2576 ms |
876 KB |
Output isn't correct |
6 |
Incorrect |
2723 ms |
864 KB |
Output isn't correct |
7 |
Incorrect |
2812 ms |
860 KB |
Output isn't correct |
8 |
Incorrect |
2852 ms |
864 KB |
Output isn't correct |
9 |
Incorrect |
2851 ms |
964 KB |
Output isn't correct |
10 |
Incorrect |
2874 ms |
864 KB |
Output isn't correct |