oj.uz

답안 #93163

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
93163 2019-01-06T16:19:07 Z Makhsud Chessboard (IZhO18_chessboard) C++17
39 / 100
 140 ms 508 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;

ll n, k, cnt, x, y, xx, yy;
ll a[50005][3][3];
vector <ll> d;

int main()
{
	cin >> n >> k;
	for ( int i = 1; i < n; i ++ ) {
		if ( n % i == 0 ) {
			d.push_back(i);
		}
	}
	for ( int i = 1; i <= k; i ++ ) {
		cin >> x >> y >> xx >> yy;
		ll r, c;
		for ( auto e: d ) {
			r = (x/e) + ( (x%e) && 1 );
			c = (y/e) + ( (y%e) && 1 );
			a[e][r%2][c%2] ++;
		}
	}
	ll ans1, ans2, mn = INT_MAX;
	for ( auto e: d ) {
		ans1 = ans2 = 0;
		for ( int i = 1; i <= (n/e); i ++ ) {
			if ( i % 2 == 1 ) {
				ans1 += (e*e) * ( (n/e) / 2 );
				ans2 += (e*e) * ( ( (n/e) + 1 ) / 2 );
			} else {
				ans1 += (e*e) * ( ( (n/e) + 1 ) / 2 );
				ans2 += (e*e) * ( (n/e) / 2 );
			}
		}		
		ans1 = ans1 + a[e][1][1] + a[e][0][0];
		ans2 = ans2 + a[e][1][0] + a[e][0][1];
		ans1 = ans1 - ( a[e][1][0] + a[e][0][1] );
		ans2 = ans2 - ( a[e][1][1] + a[e][0][0] );
		mn = min ( mn, min ( ans1, ans2 ) );
	}
	cout << mn;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 252 KB Output is correct
8 Correct 2 ms 256 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 376 KB Output is correct
2 Correct 19 ms 256 KB Output is correct
3 Incorrect 47 ms 400 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 2 ms 252 KB Output is correct
16 Correct 26 ms 376 KB Output is correct
17 Correct 73 ms 376 KB Output is correct
18 Correct 91 ms 508 KB Output is correct
19 Correct 129 ms 376 KB Output is correct
20 Correct 140 ms 376 KB Output is correct
21 Correct 72 ms 396 KB Output is correct
22 Correct 2 ms 428 KB Output is correct
23 Correct 44 ms 376 KB Output is correct
24 Correct 82 ms 376 KB Output is correct
25 Correct 10 ms 376 KB Output is correct
26 Correct 52 ms 256 KB Output is correct
27 Correct 66 ms 376 KB Output is correct
28 Correct 86 ms 508 KB Output is correct
29 Correct 30 ms 376 KB Output is correct
30 Correct 4 ms 376 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 376 KB Output is correct
2 Correct 19 ms 256 KB Output is correct
3 Incorrect 47 ms 400 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 252 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 72 ms 376 KB Output is correct
10 Correct 19 ms 256 KB Output is correct
11 Incorrect 47 ms 400 KB Output isn't correct
12 Halted 0 ms 0 KB -