Submission #495085

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
495085	2021-12-18T04:32:34 Z	vinnipuh01	Chessboard (IZhO18_chessboard)	C++17	16 / 100	93 ms	292 KB

chessboard

#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
#define int long long

using namespace std;

const long long oo = 1000000000000000000;

long long  sum, ans = 0, mx = 0, mn = 1000000000, num, pos;


/*
    ViHHiPuh

   (( `'-""``""-'` ))
     )-__-_.._-__-(
   / --- (o _ o) --- \
   \ .-* ( .0. ) *-. /
   _'-. ,_ '=' _, .-'_
  / `;#'#'# - #'#'#;` \
 \_)) -----'#'----- ((_/
      # --------- #
  '# ------- ------ #'
  /..-'# ------- #'-.\
  _\...-\'# -- #'/-.../_
  ((____)- '#' -(____))


    cout << fixed << setprecision(6) << x;

    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    freopen ( "sum.in", "r", stdin )
*/

bool prime_number;

main () {
	int n, m;
	cin >> m >> n;
	prime_number = 1;
	int x, y, xx, yy;
	for ( int i = 2; i < m; i ++ ) {
		if ( m % i == 0 ) {
			prime_number = 0;
			break;
		}
	}
	num = m * m;
	ans = oo;
	for ( int i = 1; i < m; i ++ ) {
		if ( m % i == 0 ) {
			sum = i * i;
			mn = num / sum;
			mn = mn / 2;
			if ( ans > mn * sum ) {
				ans = mn * sum;
				pos = sum;
			}
		}
	}
	if ( !n || prime_number ) {
		if ( !n )
			cout << ans;
		else {
			num = ( num + 1 ) / 2;
			sum = mx = 0;
			for ( int i = 1; i <= n; i ++ ) {
				cin >> x >> y >> xx >> yy;
				if ( ( x + y ) % 2 ) {
					sum ++;
					ans --;
				}
				else {
					mx ++;
					num --;
				}
			}
			cout << min( ans + mx, num + sum );
		}
	}
	else {
		mn = ( num ) / pos;
		mn = ( mn + 1 ) / 2;
		num = mn * pos;
		pos = sqrt( pos );
		sum = mx = 0;
		for ( int i = 1; i <= n; i ++ ) {
			cin >> x >> y >> xx >> yy;
			x --;
			y --;
			xx --;
			yy --;
			x /= pos;
			y /= pos;
			if ( ( x + y ) % 2 == 1 ) {
				sum ++;
				ans --;
			}
			else {
				mx ++;
				num --;
			}
		}
		cout << min( ans + mx, num + sum );
	}
}

Compilation message

chessboard.cpp:48:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   48 | main () {
      | ^~~~

Subtask #1

8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct

Subtask #2

8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	64 ms	268 KB	Output is correct
2	Correct	15 ms	292 KB	Output is correct
3	Correct	45 ms	204 KB	Output is correct
4	Correct	43 ms	204 KB	Output is correct
5	Correct	63 ms	268 KB	Output is correct
6	Correct	38 ms	204 KB	Output is correct
7	Correct	7 ms	204 KB	Output is correct
8	Correct	39 ms	276 KB	Output is correct
9	Correct	93 ms	264 KB	Output is correct
10	Correct	49 ms	264 KB	Output is correct

Subtask #3

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Incorrect	1 ms	204 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #4

0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Incorrect	1 ms	204 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #5

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	64 ms	268 KB	Output is correct
2	Correct	15 ms	292 KB	Output is correct
3	Correct	45 ms	204 KB	Output is correct
4	Correct	43 ms	204 KB	Output is correct
5	Correct	63 ms	268 KB	Output is correct
6	Correct	38 ms	204 KB	Output is correct
7	Correct	7 ms	204 KB	Output is correct
8	Correct	39 ms	276 KB	Output is correct
9	Correct	93 ms	264 KB	Output is correct
10	Correct	49 ms	264 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Incorrect	1 ms	204 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #6

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	64 ms	268 KB	Output is correct
10	Correct	15 ms	292 KB	Output is correct
11	Correct	45 ms	204 KB	Output is correct
12	Correct	43 ms	204 KB	Output is correct
13	Correct	63 ms	268 KB	Output is correct
14	Correct	38 ms	204 KB	Output is correct
15	Correct	7 ms	204 KB	Output is correct
16	Correct	39 ms	276 KB	Output is correct
17	Correct	93 ms	264 KB	Output is correct
18	Correct	49 ms	264 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Incorrect	1 ms	204 KB	Output isn't correct
25	Halted	0 ms	0 KB	-