oj.uz

답안 #674967

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
674967 2022-12-26T17:42:53 Z LucaIlie Chessboard (IZhO18_chessboard) C++17
70 / 100
 676 ms 3376 KB 
#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 += l * (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 += l * (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 += l * (nxt( l1 ) - l1) * wbSq( 1, c2 / l - c1 / l - 1, (l1 / l + nxt( c1 ) / l) % 2 );
        cost += l * (nxt( c1 ) - c1) * wbSq( l2 / l - l1 / l - 1, 1, (nxt( l1 ) / l + c1 / l) % 2 );
        cost += l * (l2 - prv( l2 )) * wbSq( 1, c2 / l - c1 / l - 1, (l2 / l + nxt( c1 ) / l) % 2 );
        cost += l * (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 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 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 2168 KB Output is correct
2 Correct 16 ms 796 KB Output is correct
3 Correct 40 ms 1452 KB Output is correct
4 Correct 40 ms 1668 KB Output is correct
5 Correct 59 ms 1912 KB Output is correct
6 Correct 36 ms 1388 KB Output is correct
7 Correct 8 ms 464 KB Output is correct
8 Correct 36 ms 1280 KB Output is correct
9 Correct 90 ms 3100 KB Output is correct
10 Correct 51 ms 1740 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 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 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 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 212 KB Output is correct
14 Correct 1 ms 212 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 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 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 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 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 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 25 ms 1108 KB Output is correct
17 Correct 69 ms 2848 KB Output is correct
18 Correct 92 ms 3352 KB Output is correct
19 Correct 164 ms 3024 KB Output is correct
20 Correct 180 ms 3372 KB Output is correct
21 Correct 65 ms 2736 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 44 ms 1616 KB Output is correct
24 Correct 79 ms 3008 KB Output is correct
25 Correct 9 ms 572 KB Output is correct
26 Correct 51 ms 2076 KB Output is correct
27 Correct 66 ms 2404 KB Output is correct
28 Correct 84 ms 3180 KB Output is correct
29 Correct 26 ms 1240 KB Output is correct
30 Correct 3 ms 340 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 2168 KB Output is correct
2 Correct 16 ms 796 KB Output is correct
3 Correct 40 ms 1452 KB Output is correct
4 Correct 40 ms 1668 KB Output is correct
5 Correct 59 ms 1912 KB Output is correct
6 Correct 36 ms 1388 KB Output is correct
7 Correct 8 ms 464 KB Output is correct
8 Correct 36 ms 1280 KB Output is correct
9 Correct 90 ms 3100 KB Output is correct
10 Correct 51 ms 1740 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 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 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 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 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 25 ms 1108 KB Output is correct
27 Correct 69 ms 2848 KB Output is correct
28 Correct 92 ms 3352 KB Output is correct
29 Correct 164 ms 3024 KB Output is correct
30 Correct 180 ms 3372 KB Output is correct
31 Correct 65 ms 2736 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 44 ms 1616 KB Output is correct
34 Correct 79 ms 3008 KB Output is correct
35 Correct 9 ms 572 KB Output is correct
36 Correct 51 ms 2076 KB Output is correct
37 Correct 66 ms 2404 KB Output is correct
38 Correct 84 ms 3180 KB Output is correct
39 Correct 26 ms 1240 KB Output is correct
40 Correct 3 ms 340 KB Output is correct
41 Correct 168 ms 2868 KB Output is correct
42 Correct 109 ms 3224 KB Output is correct
43 Correct 125 ms 2800 KB Output is correct
44 Correct 105 ms 3128 KB Output is correct
45 Correct 100 ms 3276 KB Output is correct
46 Correct 196 ms 3176 KB Output is correct
47 Correct 88 ms 2912 KB Output is correct
48 Correct 113 ms 2884 KB Output is correct
49 Correct 100 ms 2888 KB Output is correct
50 Correct 595 ms 3124 KB Output is correct
51 Correct 634 ms 3376 KB Output is correct
52 Correct 594 ms 3096 KB Output is correct
53 Correct 635 ms 3204 KB Output is correct
54 Correct 581 ms 3148 KB Output is correct
55 Correct 656 ms 3344 KB Output is correct
56 Correct 565 ms 3000 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 1 ms 212 KB Output is correct
6 Correct 1 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 69 ms 2168 KB Output is correct
10 Correct 16 ms 796 KB Output is correct
11 Correct 40 ms 1452 KB Output is correct
12 Correct 40 ms 1668 KB Output is correct
13 Correct 59 ms 1912 KB Output is correct
14 Correct 36 ms 1388 KB Output is correct
15 Correct 8 ms 464 KB Output is correct
16 Correct 36 ms 1280 KB Output is correct
17 Correct 90 ms 3100 KB Output is correct
18 Correct 51 ms 1740 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 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 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 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 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 25 ms 1108 KB Output is correct
35 Correct 69 ms 2848 KB Output is correct
36 Correct 92 ms 3352 KB Output is correct
37 Correct 164 ms 3024 KB Output is correct
38 Correct 180 ms 3372 KB Output is correct
39 Correct 65 ms 2736 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 44 ms 1616 KB Output is correct
42 Correct 79 ms 3008 KB Output is correct
43 Correct 9 ms 572 KB Output is correct
44 Correct 51 ms 2076 KB Output is correct
45 Correct 66 ms 2404 KB Output is correct
46 Correct 84 ms 3180 KB Output is correct
47 Correct 26 ms 1240 KB Output is correct
48 Correct 3 ms 340 KB Output is correct
49 Correct 168 ms 2868 KB Output is correct
50 Correct 109 ms 3224 KB Output is correct
51 Correct 125 ms 2800 KB Output is correct
52 Correct 105 ms 3128 KB Output is correct
53 Correct 100 ms 3276 KB Output is correct
54 Correct 196 ms 3176 KB Output is correct
55 Correct 88 ms 2912 KB Output is correct
56 Correct 113 ms 2884 KB Output is correct
57 Correct 100 ms 2888 KB Output is correct
58 Correct 595 ms 3124 KB Output is correct
59 Correct 634 ms 3376 KB Output is correct
60 Correct 594 ms 3096 KB Output is correct
61 Correct 635 ms 3204 KB Output is correct
62 Correct 581 ms 3148 KB Output is correct
63 Correct 656 ms 3344 KB Output is correct
64 Correct 565 ms 3000 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Incorrect 676 ms 3200 KB Output isn't correct
68 Halted 0 ms 0 KB -