oj.uz

답안 #495093

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
495093 2021-12-18T04:45:24 Z vinnipuh01 Chessboard (IZhO18_chessboard) C++17
16 / 100
 99 ms 3036 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 ++ ) {
		if ( ( x[ i ] + y[ i ] ) % 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 1 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 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 1 ms 204 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 2224 KB Output is correct
2 Correct 18 ms 844 KB Output is correct
3 Correct 42 ms 1440 KB Output is correct
4 Correct 43 ms 1652 KB Output is correct
5 Correct 53 ms 1904 KB Output is correct
6 Correct 33 ms 1348 KB Output is correct
7 Correct 7 ms 460 KB Output is correct
8 Correct 36 ms 1356 KB Output is correct
9 Correct 99 ms 3036 KB Output is correct
10 Correct 49 ms 1800 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 2224 KB Output is correct
2 Correct 18 ms 844 KB Output is correct
3 Correct 42 ms 1440 KB Output is correct
4 Correct 43 ms 1652 KB Output is correct
5 Correct 53 ms 1904 KB Output is correct
6 Correct 33 ms 1348 KB Output is correct
7 Correct 7 ms 460 KB Output is correct
8 Correct 36 ms 1356 KB Output is correct
9 Correct 99 ms 3036 KB Output is correct
10 Correct 49 ms 1800 KB Output is correct
11 Incorrect 1 ms 204 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 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 1 ms 204 KB Output is correct
9 Correct 65 ms 2224 KB Output is correct
10 Correct 18 ms 844 KB Output is correct
11 Correct 42 ms 1440 KB Output is correct
12 Correct 43 ms 1652 KB Output is correct
13 Correct 53 ms 1904 KB Output is correct
14 Correct 33 ms 1348 KB Output is correct
15 Correct 7 ms 460 KB Output is correct
16 Correct 36 ms 1356 KB Output is correct
17 Correct 99 ms 3036 KB Output is correct
18 Correct 49 ms 1800 KB Output is correct
19 Incorrect 1 ms 204 KB Output isn't correct
20 Halted 0 ms 0 KB -