oj.uz

Submission #476043

# Submission time Handle Problem Language Result Execution time Memory
476043 2021-09-24T16:36:40 Z stefantaga Squirrel (RMI18_squirrel) C++14
10 / 100
 3198 ms 968 KB 
#include <bits/stdc++.h>

using namespace std;

long long bitmask[50005];
int mmare[50005];
int dl[]={-1,-1,0,1,1,1,0,-1};
int dc[]={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]==mmare[y]&&mmare[y]>1)
    {
        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;
int main()
{
    cin>>n>>m>>frac;
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 (c[i]==0)
        {
            for (j=i;j<=lim;j+=i)
            {
                c[j]=1;
                bitmask[j]+=(1<<nr);
            }
            nr++;
        }
    }
    for (i=1;i<=frac;i++)
    {
        cin>>x>>y>>nr;x--;y--;
        sum=sum+prime(x,y);
        fractal(x,y,nr,0,1);
    }
    cout<<sum;
    return 0;
}

Subtask #1
10.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 332 KB Output is correct
2 Correct 34 ms 412 KB Output is correct
3 Incorrect 413 ms 844 KB Output isn't correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 647 ms 968 KB Output isn't correct
2 Incorrect 642 ms 912 KB Output isn't correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1070 ms 912 KB Output isn't correct
2 Incorrect 1081 ms 908 KB Output isn't correct
3 Incorrect 1152 ms 908 KB Output isn't correct
4 Incorrect 1187 ms 908 KB Output isn't correct
5 Incorrect 1238 ms 904 KB Output isn't correct

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 2220 ms 908 KB Output isn't correct
2 Incorrect 2305 ms 844 KB Output isn't correct
3 Incorrect 2437 ms 908 KB Output isn't correct
4 Incorrect 2594 ms 904 KB Output isn't correct
5 Incorrect 2709 ms 904 KB Output isn't correct
6 Incorrect 3077 ms 908 KB Output isn't correct
7 Incorrect 3198 ms 912 KB Output isn't correct
8 Incorrect 2973 ms 964 KB Output isn't correct
9 Incorrect 2987 ms 912 KB Output isn't correct
10 Incorrect 3173 ms 908 KB Output isn't correct