oj.uz

Submission #334485

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

#define vl vector <ll> 

const int N = 1e5+7;
ll n, k;

ll calc1(ll div, vl x1, vl y1, vl x2, vl y2){
    ll to_white = 0, to_black = ((n*n/div/div)&1 ? (n*n/div/div/2+1)*div*div : (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/div+o/div;
                   if(cnt%2 == 0)   to_black--;
                   else             to_white++;
            }
        }
    }
    
    return to_white+to_black;
}

int main(){
    do_not_disturb
    
    ll ans = 9e18, i;
    cin >> n >> k;
    vector <ll> x1(k), y1(k), x2(k), y2(k);
    
    for(i = 0; i < k; i++){
        cin >> x1[i] >> y1[i] >> x2[i] >> y2[i];
        x1[i]--; y1[i]--; x2[i]--; y2[i]--;
    }
    
    for(i = 1; i*i <= n; i++){
        if(n%i == 0){
            auto tmp = calc1(i, x1, y1, x2, y2);
            ans = min(ans, min(tmp, n*n-tmp));
            if(i > 1){
                tmp = calc1(n/i, x1, y1, x2, y2);
                ans = min(ans, min(tmp, n*n-tmp));
            }
        }
    }
    
    cout << ans << endl;
    
    return 0;
}

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 384 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 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 26 ms 4332 KB Output is correct
2 Correct 7 ms 1408 KB Output is correct
3 Correct 16 ms 2796 KB Output is correct
4 Correct 18 ms 3180 KB Output is correct
5 Correct 22 ms 3820 KB Output is correct
6 Correct 15 ms 2540 KB Output is correct
7 Correct 4 ms 768 KB Output is correct
8 Correct 15 ms 2560 KB Output is correct
9 Correct 37 ms 6016 KB Output is correct
10 Correct 21 ms 3436 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 20 ms 2100 KB Output is correct
17 Correct 29 ms 5612 KB Output is correct
18 Correct 41 ms 6604 KB Output is correct
19 Correct 104 ms 5964 KB Output is correct
20 Correct 120 ms 6600 KB Output is correct
21 Correct 28 ms 5484 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 23 ms 3044 KB Output is correct
24 Correct 37 ms 5996 KB Output is correct
25 Correct 5 ms 896 KB Output is correct
26 Correct 35 ms 3948 KB Output is correct
27 Correct 32 ms 4636 KB Output is correct
28 Correct 40 ms 6380 KB Output is correct
29 Correct 12 ms 2412 KB Output is correct
30 Correct 2 ms 492 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 4332 KB Output is correct
2 Correct 7 ms 1408 KB Output is correct
3 Correct 16 ms 2796 KB Output is correct
4 Correct 18 ms 3180 KB Output is correct
5 Correct 22 ms 3820 KB Output is correct
6 Correct 15 ms 2540 KB Output is correct
7 Correct 4 ms 768 KB Output is correct
8 Correct 15 ms 2560 KB Output is correct
9 Correct 37 ms 6016 KB Output is correct
10 Correct 21 ms 3436 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 20 ms 2100 KB Output is correct
27 Correct 29 ms 5612 KB Output is correct
28 Correct 41 ms 6604 KB Output is correct
29 Correct 104 ms 5964 KB Output is correct
30 Correct 120 ms 6600 KB Output is correct
31 Correct 28 ms 5484 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 23 ms 3044 KB Output is correct
34 Correct 37 ms 5996 KB Output is correct
35 Correct 5 ms 896 KB Output is correct
36 Correct 35 ms 3948 KB Output is correct
37 Correct 32 ms 4636 KB Output is correct
38 Correct 40 ms 6380 KB Output is correct
39 Correct 12 ms 2412 KB Output is correct
40 Correct 2 ms 492 KB Output is correct
41 Correct 93 ms 5592 KB Output is correct
42 Correct 44 ms 6260 KB Output is correct
43 Correct 65 ms 5620 KB Output is correct
44 Correct 44 ms 6092 KB Output is correct
45 Correct 42 ms 6508 KB Output is correct
46 Correct 107 ms 6216 KB Output is correct
47 Correct 35 ms 5740 KB Output is correct
48 Correct 53 ms 5852 KB Output is correct
49 Correct 40 ms 5616 KB Output is correct
50 Correct 421 ms 6196 KB Output is correct
51 Correct 459 ms 6484 KB Output is correct
52 Correct 416 ms 6080 KB Output is correct
53 Correct 444 ms 6544 KB Output is correct
54 Correct 415 ms 6008 KB Output is correct
55 Correct 467 ms 6892 KB Output is correct
56 Correct 403 ms 5840 KB Output is correct

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 384 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 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 26 ms 4332 KB Output is correct
10 Correct 7 ms 1408 KB Output is correct
11 Correct 16 ms 2796 KB Output is correct
12 Correct 18 ms 3180 KB Output is correct
13 Correct 22 ms 3820 KB Output is correct
14 Correct 15 ms 2540 KB Output is correct
15 Correct 4 ms 768 KB Output is correct
16 Correct 15 ms 2560 KB Output is correct
17 Correct 37 ms 6016 KB Output is correct
18 Correct 21 ms 3436 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 20 ms 2100 KB Output is correct
35 Correct 29 ms 5612 KB Output is correct
36 Correct 41 ms 6604 KB Output is correct
37 Correct 104 ms 5964 KB Output is correct
38 Correct 120 ms 6600 KB Output is correct
39 Correct 28 ms 5484 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 23 ms 3044 KB Output is correct
42 Correct 37 ms 5996 KB Output is correct
43 Correct 5 ms 896 KB Output is correct
44 Correct 35 ms 3948 KB Output is correct
45 Correct 32 ms 4636 KB Output is correct
46 Correct 40 ms 6380 KB Output is correct
47 Correct 12 ms 2412 KB Output is correct
48 Correct 2 ms 492 KB Output is correct
49 Correct 93 ms 5592 KB Output is correct
50 Correct 44 ms 6260 KB Output is correct
51 Correct 65 ms 5620 KB Output is correct
52 Correct 44 ms 6092 KB Output is correct
53 Correct 42 ms 6508 KB Output is correct
54 Correct 107 ms 6216 KB Output is correct
55 Correct 35 ms 5740 KB Output is correct
56 Correct 53 ms 5852 KB Output is correct
57 Correct 40 ms 5616 KB Output is correct
58 Correct 421 ms 6196 KB Output is correct
59 Correct 459 ms 6484 KB Output is correct
60 Correct 416 ms 6080 KB Output is correct
61 Correct 444 ms 6544 KB Output is correct
62 Correct 415 ms 6008 KB Output is correct
63 Correct 467 ms 6892 KB Output is correct
64 Correct 403 ms 5840 KB Output is correct
65 Correct 0 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Execution timed out 2071 ms 8044 KB Time limit exceeded
68 Halted 0 ms 0 KB -