oj.uz

Submission #854741

# Submission time Handle Problem Language Result Execution time Memory
854741 2023-09-28T17:25:52 Z Tenis0206 Squirrel (RMI18_squirrel) C++11
0 / 100
 4700 ms 600 KB 
#include <bits/stdc++.h>

using namespace std;

int dx[] = {-1,0,1,0};
int dy[] = {0,1,0,-1};

int m,n,f;

int rez = 0;

bool coprime(int x, int y)
{
    return __gcd(x,y) == 1;
}

void solve(int x, int y, int s, int dir)
{
    for(int i=1;i<=s;i++)
    {
        int xx = x + i * dx[dir];
        int yy = y + i * dy[dir];
        rez += coprime(xx,yy);
    }
    x = x + s * dx[dir];
    y = y + s * dy[dir];
    if(s==1)
    {
        return;
    }
    for(int i=1;i<=s/2;i++)
    {
        int xs = x + i * dx[dir] + i * dx[(dir + 3) % 4];
        int ys = y + i * dy[dir] + i * dy[(dir + 3) % 4];
        rez += coprime(xs,ys);
    }
    solve(x + (s / 2) * dx[dir] + (s / 2) * dx[(dir + 3) % 4], y + (s / 2) * dy[dir] + (s / 2) * dy[(dir + 3) % 4], s / 2, dir);
    solve(x + (s / 2) * dx[dir] + (s / 2) * dx[(dir + 3) % 4], y + (s / 2) * dy[dir] + (s / 2) * dy[(dir + 3) % 4], s / 2, (dir + 3) % 4);
    for(int i=1;i<=s/2;i++)
    {
        int xd = x + i * dx[dir] + i * dx[(dir + 1) % 4];
        int yd = y + i * dy[dir] + i * dy[(dir + 1) % 4];
        rez += coprime(xd,yd);
    }
    solve(x + (s / 2) * dx[dir] + (s / 2) * dx[(dir + 1) % 4], y + (s / 2) * dy[dir] + (s / 2) * dy[(dir + 1) % 4], s / 2, dir);
    solve(x + (s / 2) * dx[dir] + (s / 2) * dx[(dir + 1) % 4], y + (s / 2) * dy[dir] + (s / 2) * dy[(dir + 1) % 4], s / 2, (dir + 1) % 4);
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    #ifdef home
    freopen("nr.in","r",stdin);
    freopen("nr.out","w",stdout);
    #endif // home
    cin>>m>>n>>f;
    for(int i=1;i<=f;i++)
    {
        int x,y,s;
        cin>>x>>y>>s;
        rez += coprime(x,y);
        solve(x,y,s,0);
    }
    cout<<rez<<'\n';
    return 0;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 41 ms 348 KB Output isn't correct
2 Incorrect 88 ms 348 KB Output isn't correct
3 Incorrect 1990 ms 432 KB Output isn't correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3377 ms 428 KB Output isn't correct
2 Incorrect 3274 ms 428 KB Output isn't correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4723 ms 344 KB Time limit exceeded
2 Execution timed out 4754 ms 348 KB Time limit exceeded
3 Execution timed out 4747 ms 544 KB Time limit exceeded
4 Execution timed out 4767 ms 600 KB Time limit exceeded
5 Execution timed out 4760 ms 348 KB Time limit exceeded

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4704 ms 344 KB Time limit exceeded
2 Execution timed out 4798 ms 344 KB Time limit exceeded
3 Execution timed out 4736 ms 348 KB Time limit exceeded
4 Execution timed out 4772 ms 348 KB Time limit exceeded
5 Execution timed out 4755 ms 348 KB Time limit exceeded
6 Execution timed out 4741 ms 348 KB Time limit exceeded
7 Execution timed out 4750 ms 348 KB Time limit exceeded
8 Execution timed out 4722 ms 348 KB Time limit exceeded
9 Execution timed out 4704 ms 348 KB Time limit exceeded
10 Execution timed out 4754 ms 348 KB Time limit exceeded