oj.uz

답안 #495216

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
495216 2021-12-18T06:43:12 Z vinnipuh01 Chessboard (IZhO18_chessboard) C++17
70 / 100
 2000 ms 3448 KB 
#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 ++ ) {
		for ( int j = x[ i ] / o; j <= xx[ i ] / o; j ++ ) {
			for ( int k = y[ i ] / o; k <= yy[ i ] / o; k ++ ) {
				if ( ( ( j ) + ( k ) ) % 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:79:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   79 | main () {
      | ^~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 2208 KB Output is correct
2 Correct 17 ms 716 KB Output is correct
3 Correct 46 ms 1488 KB Output is correct
4 Correct 42 ms 1612 KB Output is correct
5 Correct 60 ms 1992 KB Output is correct
6 Correct 37 ms 1284 KB Output is correct
7 Correct 10 ms 460 KB Output is correct
8 Correct 44 ms 1284 KB Output is correct
9 Correct 114 ms 3052 KB Output is correct
10 Correct 51 ms 1760 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 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 2 ms 332 KB Output is correct
5 Correct 2 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 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 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 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 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 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 25 ms 1288 KB Output is correct
17 Correct 70 ms 2880 KB Output is correct
18 Correct 91 ms 3264 KB Output is correct
19 Correct 127 ms 3008 KB Output is correct
20 Correct 143 ms 3372 KB Output is correct
21 Correct 67 ms 2796 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 45 ms 1500 KB Output is correct
24 Correct 80 ms 3016 KB Output is correct
25 Correct 9 ms 460 KB Output is correct
26 Correct 48 ms 1988 KB Output is correct
27 Correct 64 ms 2324 KB Output is correct
28 Correct 92 ms 3268 KB Output is correct
29 Correct 38 ms 1220 KB Output is correct
30 Correct 3 ms 332 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 2208 KB Output is correct
2 Correct 17 ms 716 KB Output is correct
3 Correct 46 ms 1488 KB Output is correct
4 Correct 42 ms 1612 KB Output is correct
5 Correct 60 ms 1992 KB Output is correct
6 Correct 37 ms 1284 KB Output is correct
7 Correct 10 ms 460 KB Output is correct
8 Correct 44 ms 1284 KB Output is correct
9 Correct 114 ms 3052 KB Output is correct
10 Correct 51 ms 1760 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 2 ms 332 KB Output is correct
15 Correct 2 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 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 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 25 ms 1288 KB Output is correct
27 Correct 70 ms 2880 KB Output is correct
28 Correct 91 ms 3264 KB Output is correct
29 Correct 127 ms 3008 KB Output is correct
30 Correct 143 ms 3372 KB Output is correct
31 Correct 67 ms 2796 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 45 ms 1500 KB Output is correct
34 Correct 80 ms 3016 KB Output is correct
35 Correct 9 ms 460 KB Output is correct
36 Correct 48 ms 1988 KB Output is correct
37 Correct 64 ms 2324 KB Output is correct
38 Correct 92 ms 3268 KB Output is correct
39 Correct 38 ms 1220 KB Output is correct
40 Correct 3 ms 332 KB Output is correct
41 Correct 140 ms 2900 KB Output is correct
42 Correct 105 ms 3216 KB Output is correct
43 Correct 116 ms 2888 KB Output is correct
44 Correct 111 ms 3140 KB Output is correct
45 Correct 104 ms 3272 KB Output is correct
46 Correct 159 ms 3188 KB Output is correct
47 Correct 95 ms 3012 KB Output is correct
48 Correct 145 ms 2928 KB Output is correct
49 Correct 93 ms 2816 KB Output is correct
50 Correct 381 ms 3096 KB Output is correct
51 Correct 404 ms 3352 KB Output is correct
52 Correct 403 ms 3204 KB Output is correct
53 Correct 416 ms 3448 KB Output is correct
54 Correct 383 ms 3056 KB Output is correct
55 Correct 406 ms 3372 KB Output is correct
56 Correct 369 ms 3096 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 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 67 ms 2208 KB Output is correct
10 Correct 17 ms 716 KB Output is correct
11 Correct 46 ms 1488 KB Output is correct
12 Correct 42 ms 1612 KB Output is correct
13 Correct 60 ms 1992 KB Output is correct
14 Correct 37 ms 1284 KB Output is correct
15 Correct 10 ms 460 KB Output is correct
16 Correct 44 ms 1284 KB Output is correct
17 Correct 114 ms 3052 KB Output is correct
18 Correct 51 ms 1760 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 2 ms 332 KB Output is correct
23 Correct 2 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 204 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 25 ms 1288 KB Output is correct
35 Correct 70 ms 2880 KB Output is correct
36 Correct 91 ms 3264 KB Output is correct
37 Correct 127 ms 3008 KB Output is correct
38 Correct 143 ms 3372 KB Output is correct
39 Correct 67 ms 2796 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 45 ms 1500 KB Output is correct
42 Correct 80 ms 3016 KB Output is correct
43 Correct 9 ms 460 KB Output is correct
44 Correct 48 ms 1988 KB Output is correct
45 Correct 64 ms 2324 KB Output is correct
46 Correct 92 ms 3268 KB Output is correct
47 Correct 38 ms 1220 KB Output is correct
48 Correct 3 ms 332 KB Output is correct
49 Correct 140 ms 2900 KB Output is correct
50 Correct 105 ms 3216 KB Output is correct
51 Correct 116 ms 2888 KB Output is correct
52 Correct 111 ms 3140 KB Output is correct
53 Correct 104 ms 3272 KB Output is correct
54 Correct 159 ms 3188 KB Output is correct
55 Correct 95 ms 3012 KB Output is correct
56 Correct 145 ms 2928 KB Output is correct
57 Correct 93 ms 2816 KB Output is correct
58 Correct 381 ms 3096 KB Output is correct
59 Correct 404 ms 3352 KB Output is correct
60 Correct 403 ms 3204 KB Output is correct
61 Correct 416 ms 3448 KB Output is correct
62 Correct 383 ms 3056 KB Output is correct
63 Correct 406 ms 3372 KB Output is correct
64 Correct 369 ms 3096 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 1 ms 204 KB Output is correct
67 Execution timed out 2061 ms 3096 KB Time limit exceeded
68 Halted 0 ms 0 KB -