oj.uz

Submission #893012

# Submission time Handle Problem Language Result Execution time Memory
893012 2023-12-26T10:24:02 Z vjudge1 Chessboard (IZhO18_chessboard) C++17
70 / 100
 847 ms 11216 KB 
// 以上帝的名义
// 候选硕士
#include <bits/stdc++.h>

#ifdef local
#include "algo/debug.h"
#else
#define dbg(x...) 0
#endif

using namespace std ;
using ll = long long ;

#define int ll

bool isPrime(int x) {
    if (x < 2) return 0 ;
    for (int i = 2 ; i * i <= x ; i++) {
        if (x  % i == 0) {
            return 0 ;
        }
    }
    return 1 ;
}

struct Fenwick {
   vector<ll> t ;
   int n;
   Fenwick(int len) {
      n = len ;
      t.assign(n + 1, 0) ;
   }
   void upd(int i, ll x) {
      while (i <= n) {
         t[i] += x;
         i += (i & (-i)) ;
      }
   }
   ll get(int i) {
      ll sum = 0 ;
      while (i) {
         sum += t[i] ;
         i -= (i & (-i)) ;
      }
      return sum ;
   }
   ll get(int l, int r) {
      return get(r) - get(l - 1) ;
   }
};

int32_t main() {
    cin.tie(0)->sync_with_stdio(false) ;
    ll n, k ; cin >> n >> k ;
    struct rect {
        int x1, y1, x2, y2;
        void read() {
            cin >> x1 >> y1 >> x2 >> y2 ;
            x1-- , y1-- , x2-- , y2-- ;
        }
    };
    vector<rect> a(k) ;
    for (int i = 0 ; i < k ; i++) a[i].read() ;
    vector<int> d;
    for (int i = 1 ; i * i <= n ; i++) {
        if (n % i) continue ;
        d.push_back(i) ;
        if (n / i != i) d.push_back(n / i) ;
    }
    auto calc = [&](ll del) -> ll{
        vector<vector<ll>> cnt(del + 1, vector<ll>(2, 0)) ;
        int block = n / del ;
        vector<Fenwick> f(2, Fenwick(n + 2)) ;
        for (int i = 0 ; i < k ; i++) {
            int x1 = a[i].x1 , y1 = a[i].y1 , x2 = a[i].x2, y2 = a[i].y2 ;
            ll leny = (y2 - y1 + 1) ;
            ll lenx = (x2 - x1 + 1) ;
            ll bL = y1 / block , bR = y2 / block ;
            ll even = 0 , odd = 0 ;
            if (bL == bR) {
                if (bL & 1) {
                    odd += leny;
                } else {
                    even += leny ;
                }
            } else {
                ll ost = bR - bL - 1 ;
                if (ost > 0) {
                    if ((bL + 1) & 1) {
                        even += (ost / 2) * block ;
                        odd += (ost + 1) / 2 * block ;
                    } else {
                        even += (ost + 1) / 2 * block ;
                        odd += (ost / 2) * block ;
                    }
                }
                ll L = y1, R = (bL + 1) * block - 1 ;
                ll LN = (R - L + 1) ;
                if (bL & 1) {
                    odd += LN ;
                } else {
                    even += LN ;
                }
                L = bR * block , R = y2 ;
                LN = (R - L + 1) ;
                if (bL & 1) {
                    odd += LN ;
                } else {
                    even += LN ;
                }
            }
            dbg(even , odd) ;
            f[0].upd(x1 + 1, even) ;
            f[0].upd(x2 + 2, -even) ;
            f[1].upd(x1 + 1, odd) ;
            f[1].upd(x2 + 2, -odd) ;
        }
        for (int i = 1 ; i <= n ; i++) {
//            dbg(f[0].get(i), f[1].get(i)) ;
            cnt[(i - 1) / block][0] += f[0].get(i) ;
            cnt[(i - 1) / block][1] += f[1].get(i) ;
        }
//        dbg(del, cnt) ;
        ll ret = 0 , sum = 0 ;
        for (int i = 0 ; i < del ; i++) {
//            for (int j = 0 ; j < del ; j++) {
                if (i % 2 == 0) {
                    ll c = ((del + 1) / 2) * (block * block) ;
                    ll cur = c - cnt[i][0] + cnt[i][1] ;
                    sum += cur ;
                } else {
                    ll c = (del / 2) * (block * block) ;
                    ll cur = c - cnt[i][1] + cnt[i][0] ;
                    sum += cur ;
                }
//            }
        }
        ret = sum ;
        sum = 0 ;
        for (int i = 0 ; i < del ; i++) {
//            for (int j = 0 ; j < del ; j++) {
                if (i % 2 != 0) {
                    ll c = ((del + 1) / 2) * (block * block) ;
                    ll cur = c - cnt[i][0] + cnt[i][1] ;
                    sum += cur ;
                } else {
                    ll c = (del / 2) * (block * block) ;
                    ll cur = c - cnt[i][1] + cnt[i][0] ;
                    sum += cur ;
                }
//            }
        }
        ret = min(ret, sum) ;
        return ret ;
    };
    ll ret = LLONG_MAX ;
    for (int i : d) {
        if (i > 1) {
            ret = min(ret, calc(i)) ;
        }
    }
    cout << ret ;
    return 0 ;
}

// 希望白银

Compilation message

chessboard.cpp: In lambda function:
chessboard.cpp:8:19: warning: statement has no effect [-Wunused-value]
    8 | #define dbg(x...) 0
      |                   ^
chessboard.cpp:112:13: note: in expansion of macro 'dbg'
  112 |             dbg(even , odd) ;
      |             ^~~
chessboard.cpp:77:16: warning: unused variable 'lenx' [-Wunused-variable]
   77 |             ll lenx = (x2 - x1 + 1) ;
      |                ^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 7260 KB Output is correct
2 Correct 6 ms 1880 KB Output is correct
3 Correct 18 ms 8028 KB Output is correct
4 Correct 12 ms 1900 KB Output is correct
5 Correct 20 ms 6492 KB Output is correct
6 Correct 13 ms 5196 KB Output is correct
7 Correct 4 ms 2396 KB Output is correct
8 Correct 14 ms 5404 KB Output is correct
9 Correct 33 ms 5600 KB Output is correct
10 Correct 17 ms 4956 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 9 ms 1324 KB Output is correct
17 Correct 19 ms 3160 KB Output is correct
18 Correct 30 ms 3552 KB Output is correct
19 Correct 101 ms 3164 KB Output is correct
20 Correct 113 ms 3416 KB Output is correct
21 Correct 18 ms 3000 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 19 ms 1800 KB Output is correct
24 Correct 26 ms 3164 KB Output is correct
25 Correct 4 ms 600 KB Output is correct
26 Correct 17 ms 2140 KB Output is correct
27 Correct 26 ms 2592 KB Output is correct
28 Correct 29 ms 3416 KB Output is correct
29 Correct 8 ms 1504 KB Output is correct
30 Correct 1 ms 604 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 7260 KB Output is correct
2 Correct 6 ms 1880 KB Output is correct
3 Correct 18 ms 8028 KB Output is correct
4 Correct 12 ms 1900 KB Output is correct
5 Correct 20 ms 6492 KB Output is correct
6 Correct 13 ms 5196 KB Output is correct
7 Correct 4 ms 2396 KB Output is correct
8 Correct 14 ms 5404 KB Output is correct
9 Correct 33 ms 5600 KB Output is correct
10 Correct 17 ms 4956 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 9 ms 1324 KB Output is correct
27 Correct 19 ms 3160 KB Output is correct
28 Correct 30 ms 3552 KB Output is correct
29 Correct 101 ms 3164 KB Output is correct
30 Correct 113 ms 3416 KB Output is correct
31 Correct 18 ms 3000 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 19 ms 1800 KB Output is correct
34 Correct 26 ms 3164 KB Output is correct
35 Correct 4 ms 600 KB Output is correct
36 Correct 17 ms 2140 KB Output is correct
37 Correct 26 ms 2592 KB Output is correct
38 Correct 29 ms 3416 KB Output is correct
39 Correct 8 ms 1504 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 166 ms 10832 KB Output is correct
42 Correct 47 ms 11092 KB Output is correct
43 Correct 93 ms 10836 KB Output is correct
44 Correct 48 ms 10980 KB Output is correct
45 Correct 34 ms 11216 KB Output is correct
46 Correct 172 ms 11036 KB Output is correct
47 Correct 32 ms 10844 KB Output is correct
48 Correct 69 ms 10836 KB Output is correct
49 Correct 45 ms 10844 KB Output is correct
50 Correct 774 ms 9820 KB Output is correct
51 Correct 829 ms 9820 KB Output is correct
52 Correct 761 ms 9564 KB Output is correct
53 Correct 803 ms 9808 KB Output is correct
54 Correct 751 ms 9564 KB Output is correct
55 Correct 847 ms 10076 KB Output is correct
56 Correct 735 ms 9552 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 22 ms 7260 KB Output is correct
10 Correct 6 ms 1880 KB Output is correct
11 Correct 18 ms 8028 KB Output is correct
12 Correct 12 ms 1900 KB Output is correct
13 Correct 20 ms 6492 KB Output is correct
14 Correct 13 ms 5196 KB Output is correct
15 Correct 4 ms 2396 KB Output is correct
16 Correct 14 ms 5404 KB Output is correct
17 Correct 33 ms 5600 KB Output is correct
18 Correct 17 ms 4956 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 9 ms 1324 KB Output is correct
35 Correct 19 ms 3160 KB Output is correct
36 Correct 30 ms 3552 KB Output is correct
37 Correct 101 ms 3164 KB Output is correct
38 Correct 113 ms 3416 KB Output is correct
39 Correct 18 ms 3000 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 19 ms 1800 KB Output is correct
42 Correct 26 ms 3164 KB Output is correct
43 Correct 4 ms 600 KB Output is correct
44 Correct 17 ms 2140 KB Output is correct
45 Correct 26 ms 2592 KB Output is correct
46 Correct 29 ms 3416 KB Output is correct
47 Correct 8 ms 1504 KB Output is correct
48 Correct 1 ms 604 KB Output is correct
49 Correct 166 ms 10832 KB Output is correct
50 Correct 47 ms 11092 KB Output is correct
51 Correct 93 ms 10836 KB Output is correct
52 Correct 48 ms 10980 KB Output is correct
53 Correct 34 ms 11216 KB Output is correct
54 Correct 172 ms 11036 KB Output is correct
55 Correct 32 ms 10844 KB Output is correct
56 Correct 69 ms 10836 KB Output is correct
57 Correct 45 ms 10844 KB Output is correct
58 Correct 774 ms 9820 KB Output is correct
59 Correct 829 ms 9820 KB Output is correct
60 Correct 761 ms 9564 KB Output is correct
61 Correct 803 ms 9808 KB Output is correct
62 Correct 751 ms 9564 KB Output is correct
63 Correct 847 ms 10076 KB Output is correct
64 Correct 735 ms 9552 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Incorrect 0 ms 348 KB Output isn't correct
67 Halted 0 ms 0 KB -