oj.uz

답안 #343838

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
343838 2021-01-04T14:27:54 Z emil_physmath Chessboard (IZhO18_chessboard) C++17
100 / 100
 889 ms 6024 KB 
#include <iostream>
#include <stdio.h>
using namespace std;
const int MAXK=100005;

long long mini[MAXK], maxi[MAXK], minj[MAXK], maxj[MAXK];

long long NumWhite(long long, long long, long long, long long, long long cellLen);
long long FindAns(long long n, long long k, long long cellLen);
int main()
{
	long long n, k;
	cin>>n>>k;
	for (int i=0; i<k; i++)
		scanf("%lld%lld%lld%lld", mini+i, minj+i, maxi+i, maxj+i);
	long long  ans=n*n;
	for (int cellLen=1; cellLen*cellLen<=n; cellLen++)
		if (n%cellLen==0)
		{
			ans=min(ans, FindAns(n, k, cellLen));
			ans=min(ans, FindAns(n, k, n/cellLen));
		}
	cout<<ans<<'\n';

	char I;
	cin >> I;
	return 0;
}

long long FindAns(long long n, long long k, long long cellLen)
{
	if (cellLen>=n) return n*n;
	long long shouldWhite=0, shouldBlack=0, isBlack=0;
	for (int i=0; i<k; i++)
	{
		shouldWhite+=NumWhite(mini[i], minj[i], maxi[i], maxj[i], cellLen);
		isBlack+=(maxi[i]-mini[i]+1)*(maxj[i]-minj[i]+1);
	}
	shouldBlack=(n*n-NumWhite(1, 1, n, n, cellLen))-(isBlack-shouldWhite);
	return min(shouldWhite+shouldBlack, n*n-(shouldWhite+shouldBlack));
}
using ll = long long;
ll prefans(ll x, ll y, ll k, ll f)
{
	ll ans;
	ll ab = y / k, a;
	a = (ab + 1) / 2;
	a *= k;
	if (ab % 2 == 0)
		a += y % k;
	if (x <= k)
		ans = x * a;
	else
	{
		ll aa = y - a;
		ll q = x / k;
		ans = aa * (q / 2) * k;
		ans += a * ((q + 1) / 2) * k;
		if (q % 2)
			ans += aa * (x % k);
		else ans += a * (x % k);
	}
	if (f == 1)
		return ans;
	else return x * y - ans;
}

long long NumWhite(long long mini, long long minj, long long maxi, long long maxj, long long len)
{
	if (!mini) mini=1;
	if (!minj) minj=1;
	if (mini==1 && minj==1)
	{
        return prefans(maxi, maxj, len, 1);
		long long  ans=0, i=maxi, j=maxj;
		ans+=len*len*(((i/len)*(j/len)+1)/2);
		if ((i/len)%2)
			ans+=(i%len)*((j/len)/2)*len;
		else
			ans+=(i%len)*((j/len+1)/2)*len;
		if ((j/len)%2)
			ans+=(j%len)*((i/len)/2)*len;
		else
			ans+=(j%len)*((i/len+1)/2)*len;
		if ((i/len)%2==(j/len)%2)
			ans+=(i%len)*(j%len);
		return ans;
	}
	return NumWhite(1, 1, maxi, maxj, len)-
		NumWhite(1, 1, maxi, minj-1, len)-NumWhite(1, 1, mini-1, maxj, len)+
		NumWhite(1, 1, mini-1, minj-1, len);
}

Compilation message

chessboard.cpp: In function 'int main()':
chessboard.cpp:15:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   15 |   scanf("%lld%lld%lld%lld", mini+i, minj+i, maxi+i, maxj+i);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 2284 KB Output is correct
2 Correct 8 ms 876 KB Output is correct
3 Correct 18 ms 1516 KB Output is correct
4 Correct 20 ms 1772 KB Output is correct
5 Correct 26 ms 2028 KB Output is correct
6 Correct 19 ms 1520 KB Output is correct
7 Correct 4 ms 620 KB Output is correct
8 Correct 16 ms 1388 KB Output is correct
9 Correct 40 ms 3180 KB Output is correct
10 Correct 23 ms 1900 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 14 ms 1132 KB Output is correct
17 Correct 34 ms 2924 KB Output is correct
18 Correct 50 ms 3436 KB Output is correct
19 Correct 173 ms 3052 KB Output is correct
20 Correct 194 ms 3564 KB Output is correct
21 Correct 31 ms 2924 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 32 ms 1644 KB Output is correct
24 Correct 46 ms 3180 KB Output is correct
25 Correct 8 ms 620 KB Output is correct
26 Correct 29 ms 2156 KB Output is correct
27 Correct 45 ms 2412 KB Output is correct
28 Correct 53 ms 3308 KB Output is correct
29 Correct 13 ms 1388 KB Output is correct
30 Correct 2 ms 364 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 2284 KB Output is correct
2 Correct 8 ms 876 KB Output is correct
3 Correct 18 ms 1516 KB Output is correct
4 Correct 20 ms 1772 KB Output is correct
5 Correct 26 ms 2028 KB Output is correct
6 Correct 19 ms 1520 KB Output is correct
7 Correct 4 ms 620 KB Output is correct
8 Correct 16 ms 1388 KB Output is correct
9 Correct 40 ms 3180 KB Output is correct
10 Correct 23 ms 1900 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 14 ms 1132 KB Output is correct
27 Correct 34 ms 2924 KB Output is correct
28 Correct 50 ms 3436 KB Output is correct
29 Correct 173 ms 3052 KB Output is correct
30 Correct 194 ms 3564 KB Output is correct
31 Correct 31 ms 2924 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 32 ms 1644 KB Output is correct
34 Correct 46 ms 3180 KB Output is correct
35 Correct 8 ms 620 KB Output is correct
36 Correct 29 ms 2156 KB Output is correct
37 Correct 45 ms 2412 KB Output is correct
38 Correct 53 ms 3308 KB Output is correct
39 Correct 13 ms 1388 KB Output is correct
40 Correct 2 ms 364 KB Output is correct
41 Correct 166 ms 2976 KB Output is correct
42 Correct 54 ms 3308 KB Output is correct
43 Correct 94 ms 3052 KB Output is correct
44 Correct 53 ms 3180 KB Output is correct
45 Correct 43 ms 3436 KB Output is correct
46 Correct 176 ms 3308 KB Output is correct
47 Correct 38 ms 3052 KB Output is correct
48 Correct 72 ms 3052 KB Output is correct
49 Correct 56 ms 3052 KB Output is correct
50 Correct 792 ms 3228 KB Output is correct
51 Correct 855 ms 3436 KB Output is correct
52 Correct 788 ms 3308 KB Output is correct
53 Correct 843 ms 3436 KB Output is correct
54 Correct 773 ms 3180 KB Output is correct
55 Correct 873 ms 3564 KB Output is correct
56 Correct 750 ms 3052 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 30 ms 2284 KB Output is correct
10 Correct 8 ms 876 KB Output is correct
11 Correct 18 ms 1516 KB Output is correct
12 Correct 20 ms 1772 KB Output is correct
13 Correct 26 ms 2028 KB Output is correct
14 Correct 19 ms 1520 KB Output is correct
15 Correct 4 ms 620 KB Output is correct
16 Correct 16 ms 1388 KB Output is correct
17 Correct 40 ms 3180 KB Output is correct
18 Correct 23 ms 1900 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 14 ms 1132 KB Output is correct
35 Correct 34 ms 2924 KB Output is correct
36 Correct 50 ms 3436 KB Output is correct
37 Correct 173 ms 3052 KB Output is correct
38 Correct 194 ms 3564 KB Output is correct
39 Correct 31 ms 2924 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 32 ms 1644 KB Output is correct
42 Correct 46 ms 3180 KB Output is correct
43 Correct 8 ms 620 KB Output is correct
44 Correct 29 ms 2156 KB Output is correct
45 Correct 45 ms 2412 KB Output is correct
46 Correct 53 ms 3308 KB Output is correct
47 Correct 13 ms 1388 KB Output is correct
48 Correct 2 ms 364 KB Output is correct
49 Correct 166 ms 2976 KB Output is correct
50 Correct 54 ms 3308 KB Output is correct
51 Correct 94 ms 3052 KB Output is correct
52 Correct 53 ms 3180 KB Output is correct
53 Correct 43 ms 3436 KB Output is correct
54 Correct 176 ms 3308 KB Output is correct
55 Correct 38 ms 3052 KB Output is correct
56 Correct 72 ms 3052 KB Output is correct
57 Correct 56 ms 3052 KB Output is correct
58 Correct 792 ms 3228 KB Output is correct
59 Correct 855 ms 3436 KB Output is correct
60 Correct 788 ms 3308 KB Output is correct
61 Correct 843 ms 3436 KB Output is correct
62 Correct 773 ms 3180 KB Output is correct
63 Correct 873 ms 3564 KB Output is correct
64 Correct 750 ms 3052 KB Output is correct
65 Correct 0 ms 364 KB Output is correct
66 Correct 0 ms 364 KB Output is correct
67 Correct 821 ms 3436 KB Output is correct
68 Correct 827 ms 3308 KB Output is correct
69 Correct 723 ms 2924 KB Output is correct
70 Correct 802 ms 3308 KB Output is correct
71 Correct 785 ms 3180 KB Output is correct
72 Correct 777 ms 3100 KB Output is correct
73 Correct 747 ms 3052 KB Output is correct
74 Correct 803 ms 3288 KB Output is correct
75 Correct 789 ms 3180 KB Output is correct
76 Correct 836 ms 3324 KB Output is correct
77 Correct 141 ms 3436 KB Output is correct
78 Correct 53 ms 3180 KB Output is correct
79 Correct 93 ms 2924 KB Output is correct
80 Correct 99 ms 3160 KB Output is correct
81 Correct 93 ms 2924 KB Output is correct
82 Correct 80 ms 3436 KB Output is correct
83 Correct 60 ms 3052 KB Output is correct
84 Correct 490 ms 3440 KB Output is correct
85 Correct 848 ms 3564 KB Output is correct
86 Correct 1 ms 364 KB Output is correct
87 Correct 1 ms 364 KB Output is correct
88 Correct 889 ms 6024 KB Output is correct
89 Correct 167 ms 1536 KB Output is correct
90 Correct 1 ms 364 KB Output is correct