oj.uz

답안 #893011

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
893011 2023-12-26T10:21:02 Z vjudge1 Chessboard (IZhO18_chessboard) C++17
70 / 100
 2000 ms 12636 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) {
                for (int j = y1 ; j <= y2 ; j++) {
                    if ((j / block) & 1) {
                        odd++ ;
                    } else {
                        even++ ;
                    }
                }
            } 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 ;
                    }
                }
                for (int j = y1 ; j < (bL + 1) * block ; j++) {
                    if ((j / block) & 1) {
                        odd++ ;
                    } else {
                        even++ ;
                    }
                }
                for (int j = bR * block ; j <= y2 ; j++) {
                    if ((j / block) & 1) {
                        odd++ ;
                    } else {
                        even++ ;
                    }
                }
            }
            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:114:13: note: in expansion of macro 'dbg'
  114 |             dbg(even , odd) ;
      |             ^~~
chessboard.cpp:76:16: warning: unused variable 'leny' [-Wunused-variable]
   76 |             ll leny = (y2 - y1 + 1) ;
      |                ^~~~
chessboard.cpp:77:16: warning: unused variable 'lenx' [-Wunused-variable]
   77 |             ll lenx = (x2 - x1 + 1) ;
      |                ^~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 7260 KB Output is correct
2 Correct 6 ms 1884 KB Output is correct
3 Correct 23 ms 8100 KB Output is correct
4 Correct 13 ms 1884 KB Output is correct
5 Correct 20 ms 6492 KB Output is correct
6 Correct 15 ms 5464 KB Output is correct
7 Correct 4 ms 2396 KB Output is correct
8 Correct 14 ms 5212 KB Output is correct
9 Correct 32 ms 5588 KB Output is correct
10 Correct 18 ms 4952 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 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 1624 KB Output is correct
17 Correct 21 ms 4188 KB Output is correct
18 Correct 32 ms 4428 KB Output is correct
19 Correct 115 ms 4188 KB Output is correct
20 Correct 128 ms 4444 KB Output is correct
21 Correct 19 ms 4024 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 22 ms 2140 KB Output is correct
24 Correct 29 ms 4188 KB Output is correct
25 Correct 5 ms 856 KB Output is correct
26 Correct 18 ms 2908 KB Output is correct
27 Correct 28 ms 3332 KB Output is correct
28 Correct 31 ms 4444 KB Output is correct
29 Correct 9 ms 1880 KB Output is correct
30 Correct 1 ms 604 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 7260 KB Output is correct
2 Correct 6 ms 1884 KB Output is correct
3 Correct 23 ms 8100 KB Output is correct
4 Correct 13 ms 1884 KB Output is correct
5 Correct 20 ms 6492 KB Output is correct
6 Correct 15 ms 5464 KB Output is correct
7 Correct 4 ms 2396 KB Output is correct
8 Correct 14 ms 5212 KB Output is correct
9 Correct 32 ms 5588 KB Output is correct
10 Correct 18 ms 4952 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 460 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 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 1624 KB Output is correct
27 Correct 21 ms 4188 KB Output is correct
28 Correct 32 ms 4428 KB Output is correct
29 Correct 115 ms 4188 KB Output is correct
30 Correct 128 ms 4444 KB Output is correct
31 Correct 19 ms 4024 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 22 ms 2140 KB Output is correct
34 Correct 29 ms 4188 KB Output is correct
35 Correct 5 ms 856 KB Output is correct
36 Correct 18 ms 2908 KB Output is correct
37 Correct 28 ms 3332 KB Output is correct
38 Correct 31 ms 4444 KB Output is correct
39 Correct 9 ms 1880 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 184 ms 12016 KB Output is correct
42 Correct 50 ms 12340 KB Output is correct
43 Correct 99 ms 12112 KB Output is correct
44 Correct 56 ms 12372 KB Output is correct
45 Correct 36 ms 12636 KB Output is correct
46 Correct 188 ms 12320 KB Output is correct
47 Correct 32 ms 12156 KB Output is correct
48 Correct 74 ms 12116 KB Output is correct
49 Correct 45 ms 12116 KB Output is correct
50 Correct 868 ms 10936 KB Output is correct
51 Correct 899 ms 11348 KB Output is correct
52 Correct 852 ms 10836 KB Output is correct
53 Correct 910 ms 11144 KB Output is correct
54 Correct 848 ms 10872 KB Output is correct
55 Correct 941 ms 11524 KB Output is correct
56 Correct 827 ms 10940 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 24 ms 7260 KB Output is correct
10 Correct 6 ms 1884 KB Output is correct
11 Correct 23 ms 8100 KB Output is correct
12 Correct 13 ms 1884 KB Output is correct
13 Correct 20 ms 6492 KB Output is correct
14 Correct 15 ms 5464 KB Output is correct
15 Correct 4 ms 2396 KB Output is correct
16 Correct 14 ms 5212 KB Output is correct
17 Correct 32 ms 5588 KB Output is correct
18 Correct 18 ms 4952 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 460 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 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 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 1624 KB Output is correct
35 Correct 21 ms 4188 KB Output is correct
36 Correct 32 ms 4428 KB Output is correct
37 Correct 115 ms 4188 KB Output is correct
38 Correct 128 ms 4444 KB Output is correct
39 Correct 19 ms 4024 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 22 ms 2140 KB Output is correct
42 Correct 29 ms 4188 KB Output is correct
43 Correct 5 ms 856 KB Output is correct
44 Correct 18 ms 2908 KB Output is correct
45 Correct 28 ms 3332 KB Output is correct
46 Correct 31 ms 4444 KB Output is correct
47 Correct 9 ms 1880 KB Output is correct
48 Correct 1 ms 604 KB Output is correct
49 Correct 184 ms 12016 KB Output is correct
50 Correct 50 ms 12340 KB Output is correct
51 Correct 99 ms 12112 KB Output is correct
52 Correct 56 ms 12372 KB Output is correct
53 Correct 36 ms 12636 KB Output is correct
54 Correct 188 ms 12320 KB Output is correct
55 Correct 32 ms 12156 KB Output is correct
56 Correct 74 ms 12116 KB Output is correct
57 Correct 45 ms 12116 KB Output is correct
58 Correct 868 ms 10936 KB Output is correct
59 Correct 899 ms 11348 KB Output is correct
60 Correct 852 ms 10836 KB Output is correct
61 Correct 910 ms 11144 KB Output is correct
62 Correct 848 ms 10872 KB Output is correct
63 Correct 941 ms 11524 KB Output is correct
64 Correct 827 ms 10940 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Execution timed out 2084 ms 12124 KB Time limit exceeded
68 Halted 0 ms 0 KB -