oj.uz

답안 #334529

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
334529 2020-12-09T10:27:29 Z talant117408 Chessboard (IZhO18_chessboard) C++17
39 / 100
 485 ms 1952 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(int x11, int y1, int x22, int y22){
    return ll(x22-x11+1)*ll(y22-y1+1);
}

ll pref(int x, int y, int div){
    ll res = 0;
    int x_1_mod_div = (x+1)%div, y_1_mod_div = (y+1)%div;
    int x_full = x-x_1_mod_div, y_full = y-y_1_mod_div;
    int full_s1 = (x_full+1)/div, full_s2 = (y_full+1)/div;
    int x_full_div = (x_full+1)/div, y_full_div = (y_full+1)/div;
    
    res += ll((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 += ll(x_1_mod_div)*ll(y_full_div/2)*div;
        }
        else{
            res += ll(x_1_mod_div)*ll(y_full_div/2+1)*div;
        }
    }
    else{
        tmp = ll(y_full+1)/2*ll(x_1_mod_div);
        res += tmp;
    }
    if((x_full_div)&1){
        int flag = y/div+x_full/div;
        if(flag&1){
            res += ll(y_1_mod_div)*ll(x_full_div/2)*div;
        }
        else{
            res += ll(y_1_mod_div)*ll(x_full_div/2+1)*div;
        }
    }
    else{
        tmp = ll(x_full+1)/2*ll(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(int div){
    ll to_white = 0, to_black = ll((n*n/div/div)&1 ? ll(n*n/div/div/2+1)*div*div : ll(n*n/2));
    for(int 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;
    cin >> n >> k;
    
    for(i = 0; i < k; i++){
        cin >> 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));
            }
        }
    }
    
    cout << ans << endl;
    
    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 37 ms 1408 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 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 2 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 376 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 2 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 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 2 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 376 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 2 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 23 ms 748 KB Output is correct
17 Correct 44 ms 1644 KB Output is correct
18 Correct 82 ms 1900 KB Output is correct
19 Correct 429 ms 1812 KB Output is correct
20 Correct 485 ms 1952 KB Output is correct
21 Correct 41 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 75 ms 1772 KB Output is correct
25 Correct 13 ms 492 KB Output is correct
26 Correct 47 ms 1388 KB Output is correct
27 Correct 80 ms 1388 KB Output is correct
28 Correct 80 ms 1900 KB Output is correct
29 Correct 17 ms 876 KB Output is correct
30 Correct 3 ms 364 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 37 ms 1408 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Incorrect 37 ms 1408 KB Output isn't correct
10 Halted 0 ms 0 KB -