답안 #495097

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
495097	2021-12-18T04:46:57 Z	vinnipuh01	Chessboard (IZhO18_chessboard)	C++17	70 / 100	361 ms	5796 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, answer;


/*
    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;
int n, m, x[ 100001 ], y[ 100001 ], xx[ 100001 ], yy[ 100001 ];


int f( int o ) {
	num = m * m;
	sum = o * o;
	mn = num / sum;
	ans = mn / 2;
	num = mn / 2;
	if ( mn % 2 )
		num ++;
	ans = ans * sum;
	num = num * sum;
	sum = mx = 0;
	for ( int i = 1; i <= n; i ++ ) {
		if ( ( ( x[ i ] / o ) + ( y[ i ] / o ) ) % 2 ) {
			sum ++;
			ans --;
		}
		else {
			num --;
			mx ++;
		}
	}
	return min( ans + mx, num + sum );
}

main () {
	cin >> m >> n;
	prime_number = 1;
	for ( int i = 2; i < m; i ++ ) {
		if ( m % i == 0 ) {
			prime_number = 0;
			break;
		}
	}
	for ( int i = 1; i <= n; i ++ ) {
		cin >> x[ i ] >> y[ i ] >> xx[ i ] >> yy[ i ];
		x[ i ] --;
		y[ i ] --;
		xx[ i ] --;
		yy[ i ] --;
	}
	answer = f( 1 );
	int sq = sqrt( m );
	for ( int i = 2; i <= sq; i ++ ) {
		if ( m % i == 0 ) {
			answer = min( answer, min( f( i ), f( m / i ) ) );
		}
	}
	cout << answer;
}

Compilation message

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

Subtask #1

8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 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

#	결과	실행 시간	메모리	Grader output
1	Correct	79 ms	2240 KB	Output is correct
2	Correct	20 ms	716 KB	Output is correct
3	Correct	41 ms	1484 KB	Output is correct
4	Correct	56 ms	1608 KB	Output is correct
5	Correct	61 ms	1880 KB	Output is correct
6	Correct	39 ms	1312 KB	Output is correct
7	Correct	7 ms	460 KB	Output is correct
8	Correct	40 ms	1376 KB	Output is correct
9	Correct	103 ms	3044 KB	Output is correct
10	Correct	57 ms	1836 KB	Output is correct

Subtask #3

15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	2 ms	332 KB	Output is correct
14	Correct	2 ms	332 KB	Output is correct
15	Correct	2 ms	332 KB	Output is correct

Subtask #4

16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	2 ms	332 KB	Output is correct
14	Correct	2 ms	332 KB	Output is correct
15	Correct	2 ms	332 KB	Output is correct
16	Correct	37 ms	1028 KB	Output is correct
17	Correct	79 ms	2884 KB	Output is correct
18	Correct	84 ms	3336 KB	Output is correct
19	Correct	121 ms	3048 KB	Output is correct
20	Correct	125 ms	3404 KB	Output is correct
21	Correct	78 ms	2740 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	44 ms	1612 KB	Output is correct
24	Correct	102 ms	3108 KB	Output is correct
25	Correct	9 ms	520 KB	Output is correct
26	Correct	61 ms	2020 KB	Output is correct
27	Correct	73 ms	2316 KB	Output is correct
28	Correct	92 ms	3180 KB	Output is correct
29	Correct	33 ms	1252 KB	Output is correct
30	Correct	4 ms	332 KB	Output is correct

Subtask #5

23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	79 ms	2240 KB	Output is correct
2	Correct	20 ms	716 KB	Output is correct
3	Correct	41 ms	1484 KB	Output is correct
4	Correct	56 ms	1608 KB	Output is correct
5	Correct	61 ms	1880 KB	Output is correct
6	Correct	39 ms	1312 KB	Output is correct
7	Correct	7 ms	460 KB	Output is correct
8	Correct	40 ms	1376 KB	Output is correct
9	Correct	103 ms	3044 KB	Output is correct
10	Correct	57 ms	1836 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	2 ms	332 KB	Output is correct
24	Correct	2 ms	332 KB	Output is correct
25	Correct	2 ms	332 KB	Output is correct
26	Correct	37 ms	1028 KB	Output is correct
27	Correct	79 ms	2884 KB	Output is correct
28	Correct	84 ms	3336 KB	Output is correct
29	Correct	121 ms	3048 KB	Output is correct
30	Correct	125 ms	3404 KB	Output is correct
31	Correct	78 ms	2740 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	44 ms	1612 KB	Output is correct
34	Correct	102 ms	3108 KB	Output is correct
35	Correct	9 ms	520 KB	Output is correct
36	Correct	61 ms	2020 KB	Output is correct
37	Correct	73 ms	2316 KB	Output is correct
38	Correct	92 ms	3180 KB	Output is correct
39	Correct	33 ms	1252 KB	Output is correct
40	Correct	4 ms	332 KB	Output is correct
41	Correct	160 ms	2868 KB	Output is correct
42	Correct	122 ms	5404 KB	Output is correct
43	Correct	109 ms	4788 KB	Output is correct
44	Correct	110 ms	5296 KB	Output is correct
45	Correct	125 ms	5604 KB	Output is correct
46	Correct	145 ms	5416 KB	Output is correct
47	Correct	101 ms	4940 KB	Output is correct
48	Correct	128 ms	5024 KB	Output is correct
49	Correct	110 ms	4832 KB	Output is correct
50	Correct	303 ms	5296 KB	Output is correct
51	Correct	323 ms	5632 KB	Output is correct
52	Correct	339 ms	5264 KB	Output is correct
53	Correct	329 ms	5528 KB	Output is correct
54	Correct	295 ms	5192 KB	Output is correct
55	Correct	361 ms	5796 KB	Output is correct
56	Correct	276 ms	5048 KB	Output is correct

Subtask #6

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 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	79 ms	2240 KB	Output is correct
10	Correct	20 ms	716 KB	Output is correct
11	Correct	41 ms	1484 KB	Output is correct
12	Correct	56 ms	1608 KB	Output is correct
13	Correct	61 ms	1880 KB	Output is correct
14	Correct	39 ms	1312 KB	Output is correct
15	Correct	7 ms	460 KB	Output is correct
16	Correct	40 ms	1376 KB	Output is correct
17	Correct	103 ms	3044 KB	Output is correct
18	Correct	57 ms	1836 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	2 ms	332 KB	Output is correct
32	Correct	2 ms	332 KB	Output is correct
33	Correct	2 ms	332 KB	Output is correct
34	Correct	37 ms	1028 KB	Output is correct
35	Correct	79 ms	2884 KB	Output is correct
36	Correct	84 ms	3336 KB	Output is correct
37	Correct	121 ms	3048 KB	Output is correct
38	Correct	125 ms	3404 KB	Output is correct
39	Correct	78 ms	2740 KB	Output is correct
40	Correct	1 ms	204 KB	Output is correct
41	Correct	44 ms	1612 KB	Output is correct
42	Correct	102 ms	3108 KB	Output is correct
43	Correct	9 ms	520 KB	Output is correct
44	Correct	61 ms	2020 KB	Output is correct
45	Correct	73 ms	2316 KB	Output is correct
46	Correct	92 ms	3180 KB	Output is correct
47	Correct	33 ms	1252 KB	Output is correct
48	Correct	4 ms	332 KB	Output is correct
49	Correct	160 ms	2868 KB	Output is correct
50	Correct	122 ms	5404 KB	Output is correct
51	Correct	109 ms	4788 KB	Output is correct
52	Correct	110 ms	5296 KB	Output is correct
53	Correct	125 ms	5604 KB	Output is correct
54	Correct	145 ms	5416 KB	Output is correct
55	Correct	101 ms	4940 KB	Output is correct
56	Correct	128 ms	5024 KB	Output is correct
57	Correct	110 ms	4832 KB	Output is correct
58	Correct	303 ms	5296 KB	Output is correct
59	Correct	323 ms	5632 KB	Output is correct
60	Correct	339 ms	5264 KB	Output is correct
61	Correct	329 ms	5528 KB	Output is correct
62	Correct	295 ms	5192 KB	Output is correct
63	Correct	361 ms	5796 KB	Output is correct
64	Correct	276 ms	5048 KB	Output is correct
65	Correct	1 ms	208 KB	Output is correct
66	Incorrect	1 ms	208 KB	Output isn't correct
67	Halted	0 ms	0 KB	-