oj.uz

Submission #334524

# Submission time Handle Problem Language Result Execution time Memory
334524 2020-12-09T10:11:06 Z talant117408 Chessboard (IZhO18_chessboard) C++17
47 / 100
 2000 ms 2028 KB 
/*
    Code written by Talant I.D.
*/
  
#include <bits/stdc++.h>
  
using namespace std;
  
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
  
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
  
inline bool isvowel(char ch){
    ch = tolower(ch);
    return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
  
inline bool isprime(int n){
    if(n < 2 || (n%2 == 0 && n != 2)) return false;
    for(int i = 3; i*i <= n; i++)
        if(n%i == 0) return false;
    return true;
}
 
class Union{
    private:
        vector <int> saizu, link;
    public:
        Union(int n){
            saizu.assign(n, 1); link.resize(n); 
            iota(all(link), 0);
        }
        int find(int n){
            if(link[n] == n) return n;
            return link[n] = find(link[n]);
        }
        int same(int a, int b){
            return find(a) == find(b);
        }
        void unite(int a, int b){
            if(same(a, b)) return;
             
            a = find(a); b = find(b);
            if(saizu[a] < saizu[b]) swap(a, b);
             
            saizu[a] += saizu[b];
            link[b] = a;
        }
        int getsize(int a){
            return saizu[find(a)];
        }
};
 
const int mod = 1e9+7;
 
ll mode(ll a){
    a %= mod;
    if(a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b){
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b){
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b){
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

const int N = 1e5+7;
ll n, k;
int y11[N], x1[N], x2[N], y2[N];

ll rect_size(ll x1, ll y1, ll x2, ll y2){
    return (x2-x1+1)*(y2-y1+1);
}

ll pref(ll x, ll y, ll div){
    ll res = 0;
    ll x_1_mod_div = (x+1)%div, y_1_mod_div = (y+1)%div;
    ll x_full = x-x_1_mod_div, y_full = y-y_1_mod_div;
    ll full_s1 = (x_full+1)/div, full_s2 = (y_full+1)/div;
    ll x_full_div = (x_full+1)/div, y_full_div = (y_full+1)/div;
    
    res += ((full_s1*full_s2)&1 ? full_s1*full_s2/2+1 : full_s1*full_s2/2)*div*div;
    
    ll tmp;
    if((y_full_div)&1){
        int flag = x/div+y_full/div;
        if(flag&1){
            res += (x_1_mod_div)*(y_full_div/2)*div;
        }
        else{
            res += (x_1_mod_div)*(y_full_div/2+1)*div;
        }
    }
    else{
        tmp = (y_full+1)/2*(x_1_mod_div);
        res += tmp;
    }
    if((x_full_div)&1){
        int flag = y/div+x_full/div;
        if(flag&1){
            res += (y_1_mod_div)*(x_full_div/2)*div;
        }
        else{
            res += (y_1_mod_div)*(x_full_div/2+1)*div;
        }
    }
    else{
        tmp = (x_full+1)/2*(y_1_mod_div);
        res += tmp;
    }
    
    int flag = x/div+y/div;
    if(!(flag&1)){
        res += rect_size(x_full+1, y_full+1, x, y);
    }
    
    return res;
}

ll calc1(ll div){
    ll to_white = 0, to_black = ((n*n/div/div)&1 ? (n*n/div/div/2+1)*div*div : (n*n/2));
    for(ll i = 0; i < k; i++){
        ll blacks_in = pref(x2[i], y2[i], div)-(x1[i]-1 > -1 ? pref(x1[i]-1, y2[i], div) : 0)-(y11[i]-1 > -1 ? pref(x2[i], y11[i]-1, div) : 0)+
                      ((x1[i]-1 > -1) && (y11[i]-1 > -1) ? pref(x1[i]-1, y11[i]-1, div) : 0);
        to_black -= blacks_in;
        to_white += rect_size(x1[i], y11[i], x2[i], y2[i])-blacks_in;
    }
    
    return to_white+to_black;
}

int main(){
    //do_not_disturb
    
    ll ans = 2e18, i;
    scanf("%lld%lld", &n, &k);
    
    for(i = 0; i < k; i++){
        scanf("%d%d%d%d", &x1[i], &y11[i], &x2[i], &y2[i]);
        x1[i]--; y11[i]--; x2[i]--; y2[i]--;
    }
    
    for(i = 1; i*i <= n; i++){
        if(n%i == 0){
            auto tmp = calc1(i);
            ans = min(ans, min(tmp, n*n-tmp));
            if(i > 1){
                tmp = calc1(n/i);
                ans = min(ans, min(tmp, n*n-tmp));
            }
        }
    }
    
    printf("%lld", ans);
    
    return 0;
}

Compilation message

chessboard.cpp: In function 'int main()':
chessboard.cpp:167:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  167 |     scanf("%lld%lld", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~
chessboard.cpp:170:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  170 |         scanf("%d%d%d%d", &x1[i], &y11[i], &x2[i], &y2[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 1256 KB Output is correct
2 Correct 10 ms 620 KB Output is correct
3 Correct 24 ms 1004 KB Output is correct
4 Correct 26 ms 1004 KB Output is correct
5 Correct 33 ms 1132 KB Output is correct
6 Correct 21 ms 876 KB Output is correct
7 Correct 5 ms 492 KB Output is correct
8 Correct 21 ms 876 KB Output is correct
9 Correct 54 ms 1772 KB Output is correct
10 Correct 30 ms 1132 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 3 ms 364 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 3 ms 364 KB Output is correct
16 Correct 24 ms 748 KB Output is correct
17 Correct 43 ms 1644 KB Output is correct
18 Correct 88 ms 1900 KB Output is correct
19 Correct 447 ms 1772 KB Output is correct
20 Correct 483 ms 2028 KB Output is correct
21 Correct 42 ms 1644 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 65 ms 1004 KB Output is correct
24 Correct 76 ms 1772 KB Output is correct
25 Correct 14 ms 492 KB Output is correct
26 Correct 49 ms 1260 KB Output is correct
27 Correct 81 ms 1448 KB Output is correct
28 Correct 82 ms 1900 KB Output is correct
29 Correct 19 ms 876 KB Output is correct
30 Correct 3 ms 364 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 1256 KB Output is correct
2 Correct 10 ms 620 KB Output is correct
3 Correct 24 ms 1004 KB Output is correct
4 Correct 26 ms 1004 KB Output is correct
5 Correct 33 ms 1132 KB Output is correct
6 Correct 21 ms 876 KB Output is correct
7 Correct 5 ms 492 KB Output is correct
8 Correct 21 ms 876 KB Output is correct
9 Correct 54 ms 1772 KB Output is correct
10 Correct 30 ms 1132 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 3 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 2 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 3 ms 364 KB Output is correct
24 Correct 3 ms 512 KB Output is correct
25 Correct 3 ms 364 KB Output is correct
26 Correct 24 ms 748 KB Output is correct
27 Correct 43 ms 1644 KB Output is correct
28 Correct 88 ms 1900 KB Output is correct
29 Correct 447 ms 1772 KB Output is correct
30 Correct 483 ms 2028 KB Output is correct
31 Correct 42 ms 1644 KB Output is correct
32 Correct 2 ms 364 KB Output is correct
33 Correct 65 ms 1004 KB Output is correct
34 Correct 76 ms 1772 KB Output is correct
35 Correct 14 ms 492 KB Output is correct
36 Correct 49 ms 1260 KB Output is correct
37 Correct 81 ms 1448 KB Output is correct
38 Correct 82 ms 1900 KB Output is correct
39 Correct 19 ms 876 KB Output is correct
40 Correct 3 ms 364 KB Output is correct
41 Correct 385 ms 1680 KB Output is correct
42 Correct 94 ms 1848 KB Output is correct
43 Correct 209 ms 1644 KB Output is correct
44 Correct 115 ms 1772 KB Output is correct
45 Correct 106 ms 1900 KB Output is correct
46 Correct 436 ms 1772 KB Output is correct
47 Correct 56 ms 1720 KB Output is correct
48 Correct 150 ms 1772 KB Output is correct
49 Correct 82 ms 1644 KB Output is correct
50 Execution timed out 2061 ms 1900 KB Time limit exceeded
51 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 38 ms 1256 KB Output is correct
10 Correct 10 ms 620 KB Output is correct
11 Correct 24 ms 1004 KB Output is correct
12 Correct 26 ms 1004 KB Output is correct
13 Correct 33 ms 1132 KB Output is correct
14 Correct 21 ms 876 KB Output is correct
15 Correct 5 ms 492 KB Output is correct
16 Correct 21 ms 876 KB Output is correct
17 Correct 54 ms 1772 KB Output is correct
18 Correct 30 ms 1132 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 3 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 2 ms 364 KB Output is correct
26 Correct 2 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 3 ms 364 KB Output is correct
32 Correct 3 ms 512 KB Output is correct
33 Correct 3 ms 364 KB Output is correct
34 Correct 24 ms 748 KB Output is correct
35 Correct 43 ms 1644 KB Output is correct
36 Correct 88 ms 1900 KB Output is correct
37 Correct 447 ms 1772 KB Output is correct
38 Correct 483 ms 2028 KB Output is correct
39 Correct 42 ms 1644 KB Output is correct
40 Correct 2 ms 364 KB Output is correct
41 Correct 65 ms 1004 KB Output is correct
42 Correct 76 ms 1772 KB Output is correct
43 Correct 14 ms 492 KB Output is correct
44 Correct 49 ms 1260 KB Output is correct
45 Correct 81 ms 1448 KB Output is correct
46 Correct 82 ms 1900 KB Output is correct
47 Correct 19 ms 876 KB Output is correct
48 Correct 3 ms 364 KB Output is correct
49 Correct 385 ms 1680 KB Output is correct
50 Correct 94 ms 1848 KB Output is correct
51 Correct 209 ms 1644 KB Output is correct
52 Correct 115 ms 1772 KB Output is correct
53 Correct 106 ms 1900 KB Output is correct
54 Correct 436 ms 1772 KB Output is correct
55 Correct 56 ms 1720 KB Output is correct
56 Correct 150 ms 1772 KB Output is correct
57 Correct 82 ms 1644 KB Output is correct
58 Execution timed out 2061 ms 1900 KB Time limit exceeded
59 Halted 0 ms 0 KB -