답안 #674964

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
674964	2022-12-26T17:34:03 Z	LucaIlie	Chessboard (IZhO18_chessboard)	C++17	70 / 100	703 ms	5864 KB

chessboard

#include <bits/stdc++.h>

#define int long long

using namespace std;

const int maxK = 1e5;

struct rectangle {
    int l1, c1, l2, c2;
};

int l;
rectangle black[maxK];

int nxt( int x ) {
    return (x / l + 1) * l;
}

int prv( int x ) {
    return x / l * l - 1;
}

long long wbSq( int lin, int col, bool color ) {
    int x = (lin + 1) / 2, y = col / 2;

    if ( lin == 0 || col == 0 )
        return 0;
    return (x * x + y * y - 2 * x * y) * (color == 0 ? 1 : -1);
}

long long getCost( rectangle r ) {
    int l1 = r.l1, c1 = r.c1, l2 = r.l2, c2 = r.c2;
    long long cost = 0;

    if ( l1 / l == l2 / l && c1 / l == c2 / l )
        cost += (l2 - l1 + 1) * (c2 - c1 + 1) * wbSq( 1, 1, (l1 / l + c1 / l) % 2 );
    else if ( l1 / l == l2 / l ) {
        cost += (l2 - l1 + 1) * (nxt( c1 ) - c1) * wbSq( 1, 1, (l1 / l + c1 / l) % 2 );
        cost += (l2 - l1 + 1) * (c2 - prv( c2 )) * wbSq( 1, 1, (l2 / l + c2 / l) % 2 );

        cost += (l2 - l1 + 1) * wbSq( 1, c2 / l - c1 / l - 1, (l1 / l + nxt( c1 ) / l) % 2 );
    } else if ( c1 / l == c2 / l ) {

        cost += (nxt( l1 ) - l1) * (c2 - c1 + 1) * wbSq( 1, 1, (l1 / l + c2 / l) % 2 );
        cost += (l2 - prv( l2 )) * (c2 - c1 + 1) * wbSq( 1, 1, (l2 / l + c2 / l) % 2 );

        cost += (c2 - c1 + 1) * wbSq( l2 / l - l1 / l - 1, 1, (nxt( l1 ) / l + c1 / l) % 2 );
    } else {
        cost += (nxt( l1 ) - l1) * (nxt( c1 ) - c1) * wbSq( 1, 1, (l1 / l + c1 / l) % 2 );
        cost += (nxt( l1 ) - l1) * (c2 - prv( c2 )) * wbSq( 1, 1, (l1 / l + c2 / l) % 2 );
        cost += (l2 - prv( l2 )) * (nxt( c1 ) - c1) * wbSq( 1, 1, (l2 / l + c1 / l) % 2 );
        cost += (l2 - prv( l2 )) * (c2 - prv( c2 )) * wbSq( 1, 1, (l2 / l + c2 / l) % 2 );

        cost += (nxt( l1 ) - l1) * wbSq( 1, c2 / l - c1 / l - 1, (l1 / l + nxt( c1 ) / l) % 2 );
        cost += (nxt( c1 ) - c1) * wbSq( l2 / l - l1 / l - 1, 1, (nxt( l1 ) / l + c1 / l) % 2 );
        cost += (l2 - prv( l2 )) * wbSq( 1, c2 / l - c1 / l - 1, (l2 / l + nxt( c1 ) / l) % 2 );
        cost += (c2 - prv( c2 )) * wbSq( l2 / l - l1 / l - 1, 1, (nxt( l1 ) / l + c2 / l) % 2 );

        cost += l * l * wbSq( l2 / l - l1 / l - 1, c2 / l - c1 / l - 1, (nxt( l1 ) / l + nxt( c1 ) / l) % 2 );
    }

    return cost;
}

signed main() {
    int n, k;
    long long cost, minCost;

    cin >> n >> k;
    for ( int i = 0; i < k; i++ ) {
        cin >> black[i].l1 >> black[i].c1 >> black[i].l2 >> black[i].c2;
        black[i].l1--;
        black[i].c1--;
        black[i].l2--;
        black[i].c2--;
    }

    minCost = n * n;
    for ( l = 1; l < n; l++ ) {
        if ( n % l == 0 ) {
            int x = (n / l + 1) / 2, y = n / l / 2;

            cost = (l * l) * (x * x + y * y);
            for ( int i = 0; i < k; i++ )
                cost -= getCost( black[i] );
            minCost = min( minCost, cost );

            cost = 2 * x * y * l * l;
            for ( int i = 0; i < k; i++ )
                cost += getCost( black[i] );
            minCost = min( minCost, cost );
        }
    }

    cout << minCost;

    return 0;
}

Subtask #1
8.0 / 8.0

#	결과	메모리	Grader output
1	Correct	212 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	212 KB	Output is correct
4	Correct	212 KB	Output is correct
5	Correct	212 KB	Output is correct
6	Correct	212 KB	Output is correct
7	Correct	212 KB	Output is correct
8	Correct	212 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	66 ms	2224 KB	Output is correct
2	Correct	17 ms	1100 KB	Output is correct
3	Correct	48 ms	2380 KB	Output is correct
4	Correct	42 ms	2560 KB	Output is correct
5	Correct	61 ms	3280 KB	Output is correct
6	Correct	37 ms	2124 KB	Output is correct
7	Correct	8 ms	656 KB	Output is correct
8	Correct	37 ms	2088 KB	Output is correct
9	Correct	93 ms	5156 KB	Output is correct
10	Correct	52 ms	3024 KB	Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	312 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	316 KB	Output is correct
8	Correct	1 ms	260 KB	Output is correct
9	Correct	1 ms	308 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	25 ms	1556 KB	Output is correct
17	Correct	67 ms	4196 KB	Output is correct
18	Correct	91 ms	5052 KB	Output is correct
19	Correct	164 ms	4400 KB	Output is correct
20	Correct	180 ms	4916 KB	Output is correct
21	Correct	64 ms	4012 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	44 ms	2216 KB	Output is correct
24	Correct	80 ms	4536 KB	Output is correct
25	Correct	9 ms	596 KB	Output is correct
26	Correct	55 ms	2964 KB	Output is correct
27	Correct	64 ms	3400 KB	Output is correct
28	Correct	83 ms	4728 KB	Output is correct
29	Correct	27 ms	1804 KB	Output is correct
30	Correct	3 ms	340 KB	Output is correct

Subtask #5
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	66 ms	2224 KB	Output is correct
2	Correct	17 ms	1100 KB	Output is correct
3	Correct	48 ms	2380 KB	Output is correct
4	Correct	42 ms	2560 KB	Output is correct
5	Correct	61 ms	3280 KB	Output is correct
6	Correct	37 ms	2124 KB	Output is correct
7	Correct	8 ms	656 KB	Output is correct
8	Correct	37 ms	2088 KB	Output is correct
9	Correct	93 ms	5156 KB	Output is correct
10	Correct	52 ms	3024 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	312 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	316 KB	Output is correct
18	Correct	1 ms	260 KB	Output is correct
19	Correct	1 ms	308 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	25 ms	1556 KB	Output is correct
27	Correct	67 ms	4196 KB	Output is correct
28	Correct	91 ms	5052 KB	Output is correct
29	Correct	164 ms	4400 KB	Output is correct
30	Correct	180 ms	4916 KB	Output is correct
31	Correct	64 ms	4012 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	44 ms	2216 KB	Output is correct
34	Correct	80 ms	4536 KB	Output is correct
35	Correct	9 ms	596 KB	Output is correct
36	Correct	55 ms	2964 KB	Output is correct
37	Correct	64 ms	3400 KB	Output is correct
38	Correct	83 ms	4728 KB	Output is correct
39	Correct	27 ms	1804 KB	Output is correct
40	Correct	3 ms	340 KB	Output is correct
41	Correct	168 ms	4980 KB	Output is correct
42	Correct	110 ms	5472 KB	Output is correct
43	Correct	125 ms	4812 KB	Output is correct
44	Correct	105 ms	5316 KB	Output is correct
45	Correct	102 ms	5632 KB	Output is correct
46	Correct	189 ms	5324 KB	Output is correct
47	Correct	89 ms	5004 KB	Output is correct
48	Correct	115 ms	5032 KB	Output is correct
49	Correct	95 ms	4812 KB	Output is correct
50	Correct	603 ms	5288 KB	Output is correct
51	Correct	637 ms	5640 KB	Output is correct
52	Correct	599 ms	5196 KB	Output is correct
53	Correct	634 ms	5680 KB	Output is correct
54	Correct	586 ms	5196 KB	Output is correct
55	Correct	660 ms	5864 KB	Output is correct
56	Correct	569 ms	5036 KB	Output is correct

Subtask #6
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	66 ms	2224 KB	Output is correct
10	Correct	17 ms	1100 KB	Output is correct
11	Correct	48 ms	2380 KB	Output is correct
12	Correct	42 ms	2560 KB	Output is correct
13	Correct	61 ms	3280 KB	Output is correct
14	Correct	37 ms	2124 KB	Output is correct
15	Correct	8 ms	656 KB	Output is correct
16	Correct	37 ms	2088 KB	Output is correct
17	Correct	93 ms	5156 KB	Output is correct
18	Correct	52 ms	3024 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	312 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	316 KB	Output is correct
26	Correct	1 ms	260 KB	Output is correct
27	Correct	1 ms	308 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	25 ms	1556 KB	Output is correct
35	Correct	67 ms	4196 KB	Output is correct
36	Correct	91 ms	5052 KB	Output is correct
37	Correct	164 ms	4400 KB	Output is correct
38	Correct	180 ms	4916 KB	Output is correct
39	Correct	64 ms	4012 KB	Output is correct
40	Correct	1 ms	212 KB	Output is correct
41	Correct	44 ms	2216 KB	Output is correct
42	Correct	80 ms	4536 KB	Output is correct
43	Correct	9 ms	596 KB	Output is correct
44	Correct	55 ms	2964 KB	Output is correct
45	Correct	64 ms	3400 KB	Output is correct
46	Correct	83 ms	4728 KB	Output is correct
47	Correct	27 ms	1804 KB	Output is correct
48	Correct	3 ms	340 KB	Output is correct
49	Correct	168 ms	4980 KB	Output is correct
50	Correct	110 ms	5472 KB	Output is correct
51	Correct	125 ms	4812 KB	Output is correct
52	Correct	105 ms	5316 KB	Output is correct
53	Correct	102 ms	5632 KB	Output is correct
54	Correct	189 ms	5324 KB	Output is correct
55	Correct	89 ms	5004 KB	Output is correct
56	Correct	115 ms	5032 KB	Output is correct
57	Correct	95 ms	4812 KB	Output is correct
58	Correct	603 ms	5288 KB	Output is correct
59	Correct	637 ms	5640 KB	Output is correct
60	Correct	599 ms	5196 KB	Output is correct
61	Correct	634 ms	5680 KB	Output is correct
62	Correct	586 ms	5196 KB	Output is correct
63	Correct	660 ms	5864 KB	Output is correct
64	Correct	569 ms	5036 KB	Output is correct
65	Correct	0 ms	212 KB	Output is correct
66	Correct	0 ms	212 KB	Output is correct
67	Incorrect	703 ms	5380 KB	Output isn't correct
68	Halted	0 ms	0 KB	-

답안 #674964

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 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
0 / 30.0