oj.uz

답안 #674973

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
674973 2022-12-26T18:02:13 Z LucaIlie Chessboard (IZhO18_chessboard) C++17
70 / 100
 962 ms 26728 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 ) {
    if ( lin == 0 || col == 0 )
        return 0;
    return ((lin / 2) * ((col + 1) / 2) + ((lin + 1) / 2) * (col / 2) - ((lin + 1) / 2) * ((col + 1) / 2) - ((lin / 2) * (col / 2))) * (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 );
        printf( "%d %d %d %d %d\n", l1, c1, l2, c2, cost );
        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;
}

Compilation message

chessboard.cpp: In function 'long long int getCost(rectangle)':
chessboard.cpp:54:19: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
   54 |         printf( "%d %d %d %d %d\n", l1, c1, l2, c2, cost );
      |                  ~^                 ~~
      |                   |                 |
      |                   int               long long int
      |                  %lld
chessboard.cpp:54:22: warning: format '%d' expects argument of type 'int', but argument 3 has type 'long long int' [-Wformat=]
   54 |         printf( "%d %d %d %d %d\n", l1, c1, l2, c2, cost );
      |                     ~^                  ~~
      |                      |                  |
      |                      int                long long int
      |                     %lld
chessboard.cpp:54:25: warning: format '%d' expects argument of type 'int', but argument 4 has type 'long long int' [-Wformat=]
   54 |         printf( "%d %d %d %d %d\n", l1, c1, l2, c2, cost );
      |                        ~^                   ~~
      |                         |                   |
      |                         int                 long long int
      |                        %lld
chessboard.cpp:54:28: warning: format '%d' expects argument of type 'int', but argument 5 has type 'long long int' [-Wformat=]
   54 |         printf( "%d %d %d %d %d\n", l1, c1, l2, c2, cost );
      |                           ~^                    ~~
      |                            |                    |
      |                            int                  long long int
      |                           %lld
chessboard.cpp:54:31: warning: format '%d' expects argument of type 'int', but argument 6 has type 'long long int' [-Wformat=]
   54 |         printf( "%d %d %d %d %d\n", l1, c1, l2, c2, cost );
      |                              ~^                     ~~~~
      |                               |                     |
      |                               int                   long long int
      |                              %lld

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 0 ms 212 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 2472 KB Output is correct
2 Correct 17 ms 972 KB Output is correct
3 Correct 43 ms 1744 KB Output is correct
4 Correct 41 ms 1968 KB Output is correct
5 Correct 60 ms 2252 KB Output is correct
6 Correct 37 ms 1740 KB Output is correct
7 Correct 8 ms 596 KB Output is correct
8 Correct 38 ms 1592 KB Output is correct
9 Correct 92 ms 3364 KB Output is correct
10 Correct 52 ms 1996 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 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 316 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 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 316 KB Output is correct
16 Correct 26 ms 1340 KB Output is correct
17 Correct 69 ms 3072 KB Output is correct
18 Correct 87 ms 3596 KB Output is correct
19 Correct 162 ms 3276 KB Output is correct
20 Correct 189 ms 3624 KB Output is correct
21 Correct 69 ms 3052 KB Output is correct
22 Correct 2 ms 212 KB Output is correct
23 Correct 45 ms 1856 KB Output is correct
24 Correct 80 ms 3296 KB Output is correct
25 Correct 9 ms 696 KB Output is correct
26 Correct 59 ms 2212 KB Output is correct
27 Correct 80 ms 2588 KB Output is correct
28 Correct 88 ms 3404 KB Output is correct
29 Correct 30 ms 1484 KB Output is correct
30 Correct 3 ms 340 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 2472 KB Output is correct
2 Correct 17 ms 972 KB Output is correct
3 Correct 43 ms 1744 KB Output is correct
4 Correct 41 ms 1968 KB Output is correct
5 Correct 60 ms 2252 KB Output is correct
6 Correct 37 ms 1740 KB Output is correct
7 Correct 8 ms 596 KB Output is correct
8 Correct 38 ms 1592 KB Output is correct
9 Correct 92 ms 3364 KB Output is correct
10 Correct 52 ms 1996 KB Output is correct
11 Correct 1 ms 304 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 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 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 316 KB Output is correct
26 Correct 26 ms 1340 KB Output is correct
27 Correct 69 ms 3072 KB Output is correct
28 Correct 87 ms 3596 KB Output is correct
29 Correct 162 ms 3276 KB Output is correct
30 Correct 189 ms 3624 KB Output is correct
31 Correct 69 ms 3052 KB Output is correct
32 Correct 2 ms 212 KB Output is correct
33 Correct 45 ms 1856 KB Output is correct
34 Correct 80 ms 3296 KB Output is correct
35 Correct 9 ms 696 KB Output is correct
36 Correct 59 ms 2212 KB Output is correct
37 Correct 80 ms 2588 KB Output is correct
38 Correct 88 ms 3404 KB Output is correct
39 Correct 30 ms 1484 KB Output is correct
40 Correct 3 ms 340 KB Output is correct
41 Correct 166 ms 3020 KB Output is correct
42 Correct 108 ms 3428 KB Output is correct
43 Correct 123 ms 3100 KB Output is correct
44 Correct 110 ms 3360 KB Output is correct
45 Correct 101 ms 3604 KB Output is correct
46 Correct 188 ms 3416 KB Output is correct
47 Correct 93 ms 3168 KB Output is correct
48 Correct 125 ms 3152 KB Output is correct
49 Correct 96 ms 3092 KB Output is correct
50 Correct 599 ms 3508 KB Output is correct
51 Correct 641 ms 3564 KB Output is correct
52 Correct 603 ms 3352 KB Output is correct
53 Correct 644 ms 3544 KB Output is correct
54 Correct 581 ms 3408 KB Output is correct
55 Correct 657 ms 3652 KB Output is correct
56 Correct 574 ms 3232 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 0 ms 212 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 65 ms 2472 KB Output is correct
10 Correct 17 ms 972 KB Output is correct
11 Correct 43 ms 1744 KB Output is correct
12 Correct 41 ms 1968 KB Output is correct
13 Correct 60 ms 2252 KB Output is correct
14 Correct 37 ms 1740 KB Output is correct
15 Correct 8 ms 596 KB Output is correct
16 Correct 38 ms 1592 KB Output is correct
17 Correct 92 ms 3364 KB Output is correct
18 Correct 52 ms 1996 KB Output is correct
19 Correct 1 ms 304 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 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 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 316 KB Output is correct
34 Correct 26 ms 1340 KB Output is correct
35 Correct 69 ms 3072 KB Output is correct
36 Correct 87 ms 3596 KB Output is correct
37 Correct 162 ms 3276 KB Output is correct
38 Correct 189 ms 3624 KB Output is correct
39 Correct 69 ms 3052 KB Output is correct
40 Correct 2 ms 212 KB Output is correct
41 Correct 45 ms 1856 KB Output is correct
42 Correct 80 ms 3296 KB Output is correct
43 Correct 9 ms 696 KB Output is correct
44 Correct 59 ms 2212 KB Output is correct
45 Correct 80 ms 2588 KB Output is correct
46 Correct 88 ms 3404 KB Output is correct
47 Correct 30 ms 1484 KB Output is correct
48 Correct 3 ms 340 KB Output is correct
49 Correct 166 ms 3020 KB Output is correct
50 Correct 108 ms 3428 KB Output is correct
51 Correct 123 ms 3100 KB Output is correct
52 Correct 110 ms 3360 KB Output is correct
53 Correct 101 ms 3604 KB Output is correct
54 Correct 188 ms 3416 KB Output is correct
55 Correct 93 ms 3168 KB Output is correct
56 Correct 125 ms 3152 KB Output is correct
57 Correct 96 ms 3092 KB Output is correct
58 Correct 599 ms 3508 KB Output is correct
59 Correct 641 ms 3564 KB Output is correct
60 Correct 603 ms 3352 KB Output is correct
61 Correct 644 ms 3544 KB Output is correct
62 Correct 581 ms 3408 KB Output is correct
63 Correct 657 ms 3652 KB Output is correct
64 Correct 574 ms 3232 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Incorrect 962 ms 26728 KB Output isn't correct
68 Halted 0 ms 0 KB -