답안 #69272 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
69272	2018-08-20T10:55:48 Z	istlemin	Chessboard (IZhO18_chessboard)	C++14	100 / 100	1727 ms	61384 KB

chessboard

#include<bits/stdc++.h>

using namespace std;

#define rep(i,a,b) for(int i = a; i<int(b);++i)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define trav(a,c) for(auto a: c)

typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pii;

ll n,k;

ll ceilDiv(ll a,ll b){
	return a/b + (a%b!=0);
}

ll getNumBlack(ll x1,ll y1,ll x2,ll y2, ll sq){
    ll x12 = ceilDiv(x1,sq);
	ll y12 = ceilDiv(y1,sq);
	ll x22 = x2/sq;
	ll y22 = y2/sq;

    if((x12+y12)%2==0){ //black in left lower corner
        ll r1,r2;
        if(x22<x12){
            r1 = 0;
            r2 = x2-x1;
		} else if((x22-x12+2)%2==1){
            r1 = ((x22-x12)/2+1)*sq;
            r2 = ((x22-x12)/2)*sq + (x2-x22*sq) + (x12*sq-x1);
        } else {
            r1 = (x22-x12)/2*sq + (x2-x22*sq);
            r2 = (x22-x12)/2*sq + (x12*sq-x1);
        }

        ll c1,c2;
        if(y22<y12){
            c1 = 0;
            c2 = y2-y1;
		} else if((y22-y12+2)%2==1){
            c1 = ((y22-y12)/2+1)*sq;
            c2 = ((y22-y12)/2)*sq + (y2-y22*sq) + (y12*sq-y1);
        } else {
            c1 = (y22-y12)/2*sq + (y2-y22*sq);
            c2 = (y22-y12)/2*sq + (y12*sq-y1);
        }
		return r1*c1+r2*c2;
    } else {
		ll r1,r2;
        if(x22<x12){
            r1 = 0;
            r2 = x2-x1;
		} else if((x22-x12+2)%2==1){
            r1 = ((x22-x12)/2+1)*sq;
            r2 = ((x22-x12)/2)*sq + (x2-x22*sq) + (x12*sq-x1);
        } else {
            r1 = (x22-x12)/2*sq + (x2-x22*sq);
            r2 = (x22-x12)/2*sq + (x12*sq-x1);
        }

        ll c1,c2;
		if(y22<y12){
            c1 = 0;
            c2 = y2-y1;
		} else if((y22-y12)%2==1){
            c1 = ((y22-y12)/2+1)*sq;
            c2 = ((y22-y12)/2)*sq + (y2-y22*sq) + (y12*sq-y1);
        } else {
            c1 = (y22-y12)/2*sq + (y2-y22*sq);
            c2 = (y22-y12)/2*sq + (y12*sq-y1);
        }
		return r1*c2+r2*c1;
    }
}

vector<tuple<ll,ll,ll,ll> > v;

ll getCost(ll sq, bool startWhite){
    ll blackToBlack = 0;
    ll blackToWhite = 0;

    ll whiteToWhite, whiteToBlack;

    if((n/sq)%2==1){
		whiteToWhite = ((n/sq)*(n/sq)/2)*sq*sq;
		whiteToBlack = ((n/sq)*(n/sq)/2+1)*sq*sq;
    } else {
		whiteToWhite = ((n/sq)*(n/sq)/2)*sq*sq;
		whiteToBlack = ((n/sq)*(n/sq)/2)*sq*sq;
    }
    if(startWhite) swap(whiteToBlack,whiteToWhite);

    rep(i,0,k){
		ll x1,y1,x2,y2;
		tie(x1,y1,x2,y2) = v[i];
		ll sz = (x2-x1)*(y2-y1);
        ll numBlack = getNumBlack(x1,y1,x2,y2,sq);
        if(startWhite)
			numBlack = sz-numBlack;

		whiteToBlack -= numBlack;
        blackToBlack += numBlack;
		whiteToWhite -= sz-numBlack;
        blackToWhite += sz-numBlack;
    }

    return whiteToBlack + blackToWhite;
}

int main(){
	cin.sync_with_stdio(false);
    cin>>n>>k;
    rep(i,0,k){
		ll x1,y1,x2,y2;
		cin>>x1>>y1>>x2>>y2;
		--x1;--y1;
        v.emplace_back(x1,y1,x2,y2);
    }

    /*ll numDivs = 0;
    rep(i,1,n)
		if(n%i==0)
			numDivs++;

    cout<<numDivs<<endl;*/

    ll bestCost = 1e18;

    rep(i,1,n){
		if(n%i==0){
			bestCost = min(bestCost,getCost(i,false));
			bestCost = min(bestCost,getCost(i,true));
		}
    }
    cout<<bestCost<<endl;

	//cout<<getNumBlack(3,5,5,7,4)<<endl;
	//return 0;
    /*srand(time(NULL));
    rep(i,0,1000){
		ll x2 = rand()%10+1;
		ll y2 = rand()%10+1;
		ll x1 = rand()%x2;
		ll y1 = rand()%y2;
		cout<<getNumBlack(x1,y1,x2,y2,rand()%10+1)<<endl;
    }*/


    /*ll w = 7;
    ll h = 5;
    rep(i,0,10){
		rep(j,0,10){
			cout<<(getNumBlack(j,i,j+w,i+h,2)==(w*h/2))<<" ";
		}
        cout<<endl;
    }*/
}

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	43 ms	2712 KB	Output is correct
2	Correct	13 ms	2712 KB	Output is correct
3	Correct	37 ms	2768 KB	Output is correct
4	Correct	35 ms	2768 KB	Output is correct
5	Correct	40 ms	2768 KB	Output is correct
6	Correct	40 ms	2768 KB	Output is correct
7	Correct	8 ms	2768 KB	Output is correct
8	Correct	25 ms	2784 KB	Output is correct
9	Correct	63 ms	4832 KB	Output is correct
10	Correct	34 ms	4832 KB	Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	4832 KB	Output is correct
2	Correct	3 ms	4832 KB	Output is correct
3	Correct	3 ms	4832 KB	Output is correct
4	Correct	4 ms	4832 KB	Output is correct
5	Correct	4 ms	4832 KB	Output is correct
6	Correct	2 ms	4832 KB	Output is correct
7	Correct	3 ms	4832 KB	Output is correct
8	Correct	3 ms	4832 KB	Output is correct
9	Correct	3 ms	4832 KB	Output is correct
10	Correct	2 ms	4832 KB	Output is correct
11	Correct	3 ms	4832 KB	Output is correct
12	Correct	2 ms	4832 KB	Output is correct
13	Correct	4 ms	4832 KB	Output is correct
14	Correct	4 ms	4832 KB	Output is correct
15	Correct	4 ms	4832 KB	Output is correct
16	Correct	26 ms	4832 KB	Output is correct
17	Correct	50 ms	4844 KB	Output is correct
18	Correct	91 ms	4844 KB	Output is correct
19	Correct	351 ms	4856 KB	Output is correct
20	Correct	396 ms	4980 KB	Output is correct
21	Correct	48 ms	4980 KB	Output is correct
22	Correct	3 ms	4980 KB	Output is correct
23	Correct	63 ms	4980 KB	Output is correct
24	Correct	85 ms	4980 KB	Output is correct
25	Correct	14 ms	4980 KB	Output is correct
26	Correct	59 ms	4980 KB	Output is correct
27	Correct	76 ms	4980 KB	Output is correct
28	Correct	100 ms	4980 KB	Output is correct
29	Correct	24 ms	4980 KB	Output is correct
30	Correct	7 ms	4980 KB	Output is correct

Subtask #5
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	43 ms	2712 KB	Output is correct
2	Correct	13 ms	2712 KB	Output is correct
3	Correct	37 ms	2768 KB	Output is correct
4	Correct	35 ms	2768 KB	Output is correct
5	Correct	40 ms	2768 KB	Output is correct
6	Correct	40 ms	2768 KB	Output is correct
7	Correct	8 ms	2768 KB	Output is correct
8	Correct	25 ms	2784 KB	Output is correct
9	Correct	63 ms	4832 KB	Output is correct
10	Correct	34 ms	4832 KB	Output is correct
11	Correct	3 ms	4832 KB	Output is correct
12	Correct	3 ms	4832 KB	Output is correct
13	Correct	3 ms	4832 KB	Output is correct
14	Correct	4 ms	4832 KB	Output is correct
15	Correct	4 ms	4832 KB	Output is correct
16	Correct	2 ms	4832 KB	Output is correct
17	Correct	3 ms	4832 KB	Output is correct
18	Correct	3 ms	4832 KB	Output is correct
19	Correct	3 ms	4832 KB	Output is correct
20	Correct	2 ms	4832 KB	Output is correct
21	Correct	3 ms	4832 KB	Output is correct
22	Correct	2 ms	4832 KB	Output is correct
23	Correct	4 ms	4832 KB	Output is correct
24	Correct	4 ms	4832 KB	Output is correct
25	Correct	4 ms	4832 KB	Output is correct
26	Correct	26 ms	4832 KB	Output is correct
27	Correct	50 ms	4844 KB	Output is correct
28	Correct	91 ms	4844 KB	Output is correct
29	Correct	351 ms	4856 KB	Output is correct
30	Correct	396 ms	4980 KB	Output is correct
31	Correct	48 ms	4980 KB	Output is correct
32	Correct	3 ms	4980 KB	Output is correct
33	Correct	63 ms	4980 KB	Output is correct
34	Correct	85 ms	4980 KB	Output is correct
35	Correct	14 ms	4980 KB	Output is correct
36	Correct	59 ms	4980 KB	Output is correct
37	Correct	76 ms	4980 KB	Output is correct
38	Correct	100 ms	4980 KB	Output is correct
39	Correct	24 ms	4980 KB	Output is correct
40	Correct	7 ms	4980 KB	Output is correct
41	Correct	318 ms	4980 KB	Output is correct
42	Correct	94 ms	4980 KB	Output is correct
43	Correct	166 ms	4980 KB	Output is correct
44	Correct	84 ms	4980 KB	Output is correct
45	Correct	88 ms	4980 KB	Output is correct
46	Correct	407 ms	4980 KB	Output is correct
47	Correct	67 ms	4980 KB	Output is correct
48	Correct	121 ms	4980 KB	Output is correct
49	Correct	78 ms	4980 KB	Output is correct
50	Correct	1447 ms	4980 KB	Output is correct
51	Correct	1527 ms	6716 KB	Output is correct
52	Correct	1495 ms	9172 KB	Output is correct
53	Correct	1533 ms	11212 KB	Output is correct
54	Correct	1631 ms	13508 KB	Output is correct
55	Correct	1641 ms	15632 KB	Output is correct
56	Correct	1534 ms	18192 KB	Output is correct

Subtask #6
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	248 KB	Output is correct
2	Correct	3 ms	484 KB	Output is correct
3	Correct	3 ms	564 KB	Output is correct
4	Correct	3 ms	564 KB	Output is correct
5	Correct	2 ms	564 KB	Output is correct
6	Correct	3 ms	564 KB	Output is correct
7	Correct	3 ms	564 KB	Output is correct
8	Correct	2 ms	564 KB	Output is correct
9	Correct	43 ms	2712 KB	Output is correct
10	Correct	13 ms	2712 KB	Output is correct
11	Correct	37 ms	2768 KB	Output is correct
12	Correct	35 ms	2768 KB	Output is correct
13	Correct	40 ms	2768 KB	Output is correct
14	Correct	40 ms	2768 KB	Output is correct
15	Correct	8 ms	2768 KB	Output is correct
16	Correct	25 ms	2784 KB	Output is correct
17	Correct	63 ms	4832 KB	Output is correct
18	Correct	34 ms	4832 KB	Output is correct
19	Correct	3 ms	4832 KB	Output is correct
20	Correct	3 ms	4832 KB	Output is correct
21	Correct	3 ms	4832 KB	Output is correct
22	Correct	4 ms	4832 KB	Output is correct
23	Correct	4 ms	4832 KB	Output is correct
24	Correct	2 ms	4832 KB	Output is correct
25	Correct	3 ms	4832 KB	Output is correct
26	Correct	3 ms	4832 KB	Output is correct
27	Correct	3 ms	4832 KB	Output is correct
28	Correct	2 ms	4832 KB	Output is correct
29	Correct	3 ms	4832 KB	Output is correct
30	Correct	2 ms	4832 KB	Output is correct
31	Correct	4 ms	4832 KB	Output is correct
32	Correct	4 ms	4832 KB	Output is correct
33	Correct	4 ms	4832 KB	Output is correct
34	Correct	26 ms	4832 KB	Output is correct
35	Correct	50 ms	4844 KB	Output is correct
36	Correct	91 ms	4844 KB	Output is correct
37	Correct	351 ms	4856 KB	Output is correct
38	Correct	396 ms	4980 KB	Output is correct
39	Correct	48 ms	4980 KB	Output is correct
40	Correct	3 ms	4980 KB	Output is correct
41	Correct	63 ms	4980 KB	Output is correct
42	Correct	85 ms	4980 KB	Output is correct
43	Correct	14 ms	4980 KB	Output is correct
44	Correct	59 ms	4980 KB	Output is correct
45	Correct	76 ms	4980 KB	Output is correct
46	Correct	100 ms	4980 KB	Output is correct
47	Correct	24 ms	4980 KB	Output is correct
48	Correct	7 ms	4980 KB	Output is correct
49	Correct	318 ms	4980 KB	Output is correct
50	Correct	94 ms	4980 KB	Output is correct
51	Correct	166 ms	4980 KB	Output is correct
52	Correct	84 ms	4980 KB	Output is correct
53	Correct	88 ms	4980 KB	Output is correct
54	Correct	407 ms	4980 KB	Output is correct
55	Correct	67 ms	4980 KB	Output is correct
56	Correct	121 ms	4980 KB	Output is correct
57	Correct	78 ms	4980 KB	Output is correct
58	Correct	1447 ms	4980 KB	Output is correct
59	Correct	1527 ms	6716 KB	Output is correct
60	Correct	1495 ms	9172 KB	Output is correct
61	Correct	1533 ms	11212 KB	Output is correct
62	Correct	1631 ms	13508 KB	Output is correct
63	Correct	1641 ms	15632 KB	Output is correct
64	Correct	1534 ms	18192 KB	Output is correct
65	Correct	3 ms	18192 KB	Output is correct
66	Correct	3 ms	18192 KB	Output is correct
67	Correct	1691 ms	20332 KB	Output is correct
68	Correct	1639 ms	22496 KB	Output is correct
69	Correct	1377 ms	24708 KB	Output is correct
70	Correct	1579 ms	26648 KB	Output is correct
71	Correct	1522 ms	28840 KB	Output is correct
72	Correct	1459 ms	31092 KB	Output is correct
73	Correct	1573 ms	33092 KB	Output is correct
74	Correct	1727 ms	35128 KB	Output is correct
75	Correct	1507 ms	37432 KB	Output is correct
76	Correct	1564 ms	39432 KB	Output is correct
77	Correct	257 ms	41712 KB	Output is correct
78	Correct	90 ms	43972 KB	Output is correct
79	Correct	167 ms	46260 KB	Output is correct
80	Correct	175 ms	48204 KB	Output is correct
81	Correct	173 ms	50356 KB	Output is correct
82	Correct	148 ms	52336 KB	Output is correct
83	Correct	134 ms	54560 KB	Output is correct
84	Correct	984 ms	56648 KB	Output is correct
85	Correct	1686 ms	58840 KB	Output is correct
86	Correct	7 ms	58840 KB	Output is correct
87	Correct	6 ms	58840 KB	Output is correct
88	Correct	1663 ms	61384 KB	Output is correct
89	Correct	306 ms	61384 KB	Output is correct
90	Correct	4 ms	61384 KB	Output is correct

답안 #69272

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 8.0 / 8.0

Subtask #3 15.0 / 15.0

Subtask #4 16.0 / 16.0

Subtask #5 23.0 / 23.0

Subtask #6 30.0 / 30.0

Subtask #1
8.0 / 8.0

Subtask #2
8.0 / 8.0

Subtask #3
15.0 / 15.0

Subtask #4
16.0 / 16.0

Subtask #5
23.0 / 23.0

Subtask #6
30.0 / 30.0