#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n, k, cnt, x, y, xx, yy;
ll a[3][3];
void subt2()
{
ll c1, c2;
c1 = c2 = 0;
for ( int i = 1; i <= k; i ++ ) {
cin >> x >> y >> xx >> yy;
a[x%2][y%2] ++;
}
c1 = (n*n)/2;
c2 = c1 + 1;
c1 = c1 - ( a[1][0] + a[0][1] );
c1 = c1 + ( a[1][1] + a[0][0] );
c2 = c2 - ( a[1][1] + a[0][0] );
c2 = c2 + ( a[1][0] + a[0][1] );
cout << min( c1, c2 );
exit(0);
}
int main()
{
cin >> n >> k;
for ( int i = 1; i <= n; i ++ ) {
if ( n % i == 0 ) cnt ++;
}
if ( cnt == 2 ) subt2();
cout << (n*n)/2;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
71 ms |
328 KB |
Output is correct |
2 |
Correct |
19 ms |
348 KB |
Output is correct |
3 |
Correct |
46 ms |
256 KB |
Output is correct |
4 |
Correct |
44 ms |
256 KB |
Output is correct |
5 |
Correct |
63 ms |
256 KB |
Output is correct |
6 |
Correct |
41 ms |
256 KB |
Output is correct |
7 |
Correct |
11 ms |
376 KB |
Output is correct |
8 |
Correct |
41 ms |
376 KB |
Output is correct |
9 |
Correct |
99 ms |
376 KB |
Output is correct |
10 |
Correct |
56 ms |
376 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
71 ms |
328 KB |
Output is correct |
2 |
Correct |
19 ms |
348 KB |
Output is correct |
3 |
Correct |
46 ms |
256 KB |
Output is correct |
4 |
Correct |
44 ms |
256 KB |
Output is correct |
5 |
Correct |
63 ms |
256 KB |
Output is correct |
6 |
Correct |
41 ms |
256 KB |
Output is correct |
7 |
Correct |
11 ms |
376 KB |
Output is correct |
8 |
Correct |
41 ms |
376 KB |
Output is correct |
9 |
Correct |
99 ms |
376 KB |
Output is correct |
10 |
Correct |
56 ms |
376 KB |
Output is correct |
11 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
12 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |