#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 - 1,yy - 1);
}
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 - 1,ys - 1);
}
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 - 1,yd - 1);
}
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;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
42 ms |
344 KB |
Output isn't correct |
2 |
Incorrect |
89 ms |
424 KB |
Output isn't correct |
3 |
Incorrect |
2012 ms |
596 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3413 ms |
432 KB |
Output isn't correct |
2 |
Correct |
3309 ms |
432 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
4757 ms |
348 KB |
Time limit exceeded |
2 |
Execution timed out |
4762 ms |
348 KB |
Time limit exceeded |
3 |
Execution timed out |
4764 ms |
348 KB |
Time limit exceeded |
4 |
Execution timed out |
4743 ms |
344 KB |
Time limit exceeded |
5 |
Execution timed out |
4759 ms |
348 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
4733 ms |
344 KB |
Time limit exceeded |
2 |
Execution timed out |
4719 ms |
600 KB |
Time limit exceeded |
3 |
Execution timed out |
4721 ms |
544 KB |
Time limit exceeded |
4 |
Execution timed out |
4758 ms |
348 KB |
Time limit exceeded |
5 |
Execution timed out |
4726 ms |
344 KB |
Time limit exceeded |
6 |
Execution timed out |
4721 ms |
348 KB |
Time limit exceeded |
7 |
Execution timed out |
4723 ms |
344 KB |
Time limit exceeded |
8 |
Execution timed out |
4738 ms |
344 KB |
Time limit exceeded |
9 |
Execution timed out |
4732 ms |
348 KB |
Time limit exceeded |
10 |
Execution timed out |
4751 ms |
348 KB |
Time limit exceeded |