oj.uz

Submission #334325

# Submission time Handle Problem Language Result Execution time Memory
334325 2020-12-09T03:17:17 Z talant117408 Chessboard (IZhO18_chessboard) C++17
70 / 100
 2000 ms 5972 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;
}

int main(){
    do_not_disturb
    
    ll n, k, ans = 9e18;
    cin >> n >> k;
    ll x1[k], y1[k], x2[k], y2[k];
    for(ll i = 0; i < k; i++){
        cin >> x1[i] >> y1[i] >> x2[i] >> y2[i];
        x1[i]--; y1[i]--; x2[i]--; y2[i]--;
    }
    
    for(ll i = 1; i*i <= n; i++){
        if(n%i == 0){
            ll to_white = 0, to_black = ((n*n/i/i)&1 ? (n*n/i/i/2+1)*i*i : (n*n/2));
            
            for(ll j = 0; j < k; j++){
                for(ll w = x1[j]; w <= x2[j]; w++){
                    for(ll o = y1[j]; o <= y2[j]; o++){
                           ll cnt = w/i+o/i;
                           if(cnt%2 == 0){
                               to_black--;
                           }
                           else{
                               to_white++;
                           }
                    }
                }
            }
            ans = min(ans, to_black+to_white);
            
            to_white = 0, to_black = (n*n/i/i/2);
            to_black *= i*i;
            
            for(ll j = 0; j < k; j++){
                for(ll w = x1[j]; w <= x2[j]; w++){
                    for(ll o = y1[j]; o <= y2[j]; o++){
                           ll cnt = w/i+o/i;
                           if(cnt%2 == 0){
                               to_white++;
                           }
                           else{
                               to_black--;
                           }
                    }
                }
            }
            ans = min(ans, to_black+to_white);
            
            if(i == 1) continue;
            ll q = i; 
            i = n/i;
            
            to_white = 0, to_black = ((n*n/i/i)&1 ? (n*n/i/i/2+1)*i*i : (n*n/2));
            
            for(ll j = 0; j < k; j++){
                for(ll w = x1[j]; w <= x2[j]; w++){
                    for(ll o = y1[j]; o <= y2[j]; o++){
                           ll cnt = w/i+o/i;
                           if(cnt%2 == 0){
                               to_black--;
                           }
                           else{
                               to_white++;
                           }
                    }
                }
            }
            ans = min(ans, to_black+to_white);
            
            to_white = 0, to_black = (n*n/i/i/2);
            to_black *= i*i;
            
            for(ll j = 0; j < k; j++){
                for(ll w = x1[j]; w <= x2[j]; w++){
                    for(ll o = y1[j]; o <= y2[j]; o++){
                           ll cnt = w/i+o/i;
                           if(cnt%2 == 0){
                               to_white++;
                           }
                           else{
                               to_black--;
                           }
                    }
                }
            }
            ans = min(ans, to_black+to_white);
            i = q;
        }
    }
    
    cout << ans << endl;
    
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 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 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 3820 KB Output is correct
2 Correct 7 ms 1260 KB Output is correct
3 Correct 17 ms 2540 KB Output is correct
4 Correct 19 ms 2668 KB Output is correct
5 Correct 23 ms 3308 KB Output is correct
6 Correct 16 ms 2284 KB Output is correct
7 Correct 4 ms 748 KB Output is correct
8 Correct 15 ms 2284 KB Output is correct
9 Correct 39 ms 5228 KB Output is correct
10 Correct 21 ms 3052 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 1 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 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 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 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 1 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 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 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 12 ms 1132 KB Output is correct
17 Correct 32 ms 2924 KB Output is correct
18 Correct 44 ms 3436 KB Output is correct
19 Correct 108 ms 3072 KB Output is correct
20 Correct 121 ms 3436 KB Output is correct
21 Correct 28 ms 2796 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 24 ms 1712 KB Output is correct
24 Correct 38 ms 3092 KB Output is correct
25 Correct 5 ms 620 KB Output is correct
26 Correct 29 ms 2028 KB Output is correct
27 Correct 33 ms 2412 KB Output is correct
28 Correct 40 ms 3308 KB Output is correct
29 Correct 12 ms 1392 KB Output is correct
30 Correct 2 ms 364 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 3820 KB Output is correct
2 Correct 7 ms 1260 KB Output is correct
3 Correct 17 ms 2540 KB Output is correct
4 Correct 19 ms 2668 KB Output is correct
5 Correct 23 ms 3308 KB Output is correct
6 Correct 16 ms 2284 KB Output is correct
7 Correct 4 ms 748 KB Output is correct
8 Correct 15 ms 2284 KB Output is correct
9 Correct 39 ms 5228 KB Output is correct
10 Correct 21 ms 3052 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 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 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 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 12 ms 1132 KB Output is correct
27 Correct 32 ms 2924 KB Output is correct
28 Correct 44 ms 3436 KB Output is correct
29 Correct 108 ms 3072 KB Output is correct
30 Correct 121 ms 3436 KB Output is correct
31 Correct 28 ms 2796 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 24 ms 1712 KB Output is correct
34 Correct 38 ms 3092 KB Output is correct
35 Correct 5 ms 620 KB Output is correct
36 Correct 29 ms 2028 KB Output is correct
37 Correct 33 ms 2412 KB Output is correct
38 Correct 40 ms 3308 KB Output is correct
39 Correct 12 ms 1392 KB Output is correct
40 Correct 2 ms 364 KB Output is correct
41 Correct 101 ms 4972 KB Output is correct
42 Correct 62 ms 5484 KB Output is correct
43 Correct 64 ms 4972 KB Output is correct
44 Correct 55 ms 5356 KB Output is correct
45 Correct 40 ms 5740 KB Output is correct
46 Correct 113 ms 5484 KB Output is correct
47 Correct 37 ms 5100 KB Output is correct
48 Correct 56 ms 5100 KB Output is correct
49 Correct 45 ms 4972 KB Output is correct
50 Correct 456 ms 5504 KB Output is correct
51 Correct 485 ms 5740 KB Output is correct
52 Correct 451 ms 5484 KB Output is correct
53 Correct 480 ms 5612 KB Output is correct
54 Correct 441 ms 5356 KB Output is correct
55 Correct 505 ms 5972 KB Output is correct
56 Correct 430 ms 5228 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 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 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 26 ms 3820 KB Output is correct
10 Correct 7 ms 1260 KB Output is correct
11 Correct 17 ms 2540 KB Output is correct
12 Correct 19 ms 2668 KB Output is correct
13 Correct 23 ms 3308 KB Output is correct
14 Correct 16 ms 2284 KB Output is correct
15 Correct 4 ms 748 KB Output is correct
16 Correct 15 ms 2284 KB Output is correct
17 Correct 39 ms 5228 KB Output is correct
18 Correct 21 ms 3052 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 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 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 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 12 ms 1132 KB Output is correct
35 Correct 32 ms 2924 KB Output is correct
36 Correct 44 ms 3436 KB Output is correct
37 Correct 108 ms 3072 KB Output is correct
38 Correct 121 ms 3436 KB Output is correct
39 Correct 28 ms 2796 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 24 ms 1712 KB Output is correct
42 Correct 38 ms 3092 KB Output is correct
43 Correct 5 ms 620 KB Output is correct
44 Correct 29 ms 2028 KB Output is correct
45 Correct 33 ms 2412 KB Output is correct
46 Correct 40 ms 3308 KB Output is correct
47 Correct 12 ms 1392 KB Output is correct
48 Correct 2 ms 364 KB Output is correct
49 Correct 101 ms 4972 KB Output is correct
50 Correct 62 ms 5484 KB Output is correct
51 Correct 64 ms 4972 KB Output is correct
52 Correct 55 ms 5356 KB Output is correct
53 Correct 40 ms 5740 KB Output is correct
54 Correct 113 ms 5484 KB Output is correct
55 Correct 37 ms 5100 KB Output is correct
56 Correct 56 ms 5100 KB Output is correct
57 Correct 45 ms 4972 KB Output is correct
58 Correct 456 ms 5504 KB Output is correct
59 Correct 485 ms 5740 KB Output is correct
60 Correct 451 ms 5484 KB Output is correct
61 Correct 480 ms 5612 KB Output is correct
62 Correct 441 ms 5356 KB Output is correct
63 Correct 505 ms 5972 KB Output is correct
64 Correct 430 ms 5228 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Execution timed out 2089 ms 5484 KB Time limit exceeded
68 Halted 0 ms 0 KB -