oj.uz

Submission #342667

# Submission time Handle Problem Language Result Execution time Memory
342667 2021-01-02T15:48:14 Z IZhO_2021_I_want_Silver Chessboard (IZhO18_chessboard) C++14
100 / 100
 687 ms 5996 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>-

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//  order_of_key (k) : Number of items strictly smaller than k .
//  find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
#define int ll

const int N = 2e5 + 5;
const int oo = 1e18 + 5;

int line(int len, int sz) {
    return (len / (sz * 2)) * sz + min(len % (sz * 2), sz);
}

int calc(int n, int m, int sz) {
    if (n < 0 || m < 0) { return 0; }
    int ln = n - line(n, sz), lm = m - line(m, sz);
    return line(n, sz) * line(m, sz) + ln * lm;
}

int n, k, ans = oo, x[N], y[N], x2[N], y2[N];
vector <int> vec;

void solve() {
    cin >> n >> k;
    for (int i = 1; i <= k; ++i) {
        cin >> x[i] >> y[i] >> x2[i] >> y2[i];
    }
    for (int sz = 1; sz < n; ++sz) {
        if (n % sz == 0) { vec.pb(sz); }
    }
    for (int sz : vec) {
        int res1 = calc(n, n, sz), res2 = (n * n) - res1;
        for (int i = 1; i <= k; ++i) {
            int b = calc(x2[i], y2[i], sz) - calc(x[i]-1, y2[i], sz) - calc(x2[i], y[i]-1, sz) + calc(x[i]-1, y[i]-1, sz);
            int w = (x2[i] - x[i] + 1) * (y2[i] - y[i] + 1) - b;
            res1 = res1 - b + w;
            res2 = res2 - w + b;
        }
        ans = min({ans, res1, res2});
    }
    cout << ans;
}

 main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tests = 1;
	//cin >> tests;
	while (tests --) {
		solve();
	}
	return 0;
}
/*
    Just Chalish!
6 8
3 3 3 3
1 2 1 2
3 4 3 4
5 5 5 5
4 3 4 3
4 4 4 4
2 1 2 1
3 6 3 6
*/

Compilation message

chessboard.cpp:75:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   75 |  main () {
      |        ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 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 30 ms 2284 KB Output is correct
2 Correct 9 ms 1260 KB Output is correct
3 Correct 18 ms 2540 KB Output is correct
4 Correct 19 ms 2668 KB Output is correct
5 Correct 24 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 16 ms 2284 KB Output is correct
9 Correct 40 ms 5228 KB Output is correct
10 Correct 24 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 372 KB Output is correct
11 Correct 1 ms 384 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 372 KB Output is correct
11 Correct 1 ms 384 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 13 ms 1644 KB Output is correct
17 Correct 33 ms 4336 KB Output is correct
18 Correct 46 ms 5100 KB Output is correct
19 Correct 138 ms 4588 KB Output is correct
20 Correct 154 ms 5100 KB Output is correct
21 Correct 30 ms 4332 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 28 ms 2412 KB Output is correct
24 Correct 42 ms 4716 KB Output is correct
25 Correct 6 ms 876 KB Output is correct
26 Correct 26 ms 3028 KB Output is correct
27 Correct 37 ms 3564 KB Output is correct
28 Correct 44 ms 4844 KB Output is correct
29 Correct 13 ms 1920 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 30 ms 2284 KB Output is correct
2 Correct 9 ms 1260 KB Output is correct
3 Correct 18 ms 2540 KB Output is correct
4 Correct 19 ms 2668 KB Output is correct
5 Correct 24 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 16 ms 2284 KB Output is correct
9 Correct 40 ms 5228 KB Output is correct
10 Correct 24 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 372 KB Output is correct
21 Correct 1 ms 384 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 13 ms 1644 KB Output is correct
27 Correct 33 ms 4336 KB Output is correct
28 Correct 46 ms 5100 KB Output is correct
29 Correct 138 ms 4588 KB Output is correct
30 Correct 154 ms 5100 KB Output is correct
31 Correct 30 ms 4332 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 28 ms 2412 KB Output is correct
34 Correct 42 ms 4716 KB Output is correct
35 Correct 6 ms 876 KB Output is correct
36 Correct 26 ms 3028 KB Output is correct
37 Correct 37 ms 3564 KB Output is correct
38 Correct 44 ms 4844 KB Output is correct
39 Correct 13 ms 1920 KB Output is correct
40 Correct 2 ms 492 KB Output is correct
41 Correct 129 ms 4972 KB Output is correct
42 Correct 52 ms 5612 KB Output is correct
43 Correct 79 ms 5100 KB Output is correct
44 Correct 49 ms 5356 KB Output is correct
45 Correct 42 ms 5740 KB Output is correct
46 Correct 147 ms 5504 KB Output is correct
47 Correct 38 ms 5100 KB Output is correct
48 Correct 65 ms 5356 KB Output is correct
49 Correct 46 ms 4988 KB Output is correct
50 Correct 620 ms 5504 KB Output is correct
51 Correct 665 ms 5764 KB Output is correct
52 Correct 617 ms 5484 KB Output is correct
53 Correct 660 ms 5728 KB Output is correct
54 Correct 609 ms 5356 KB Output is correct
55 Correct 687 ms 5996 KB Output is correct
56 Correct 593 ms 5228 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 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 30 ms 2284 KB Output is correct
10 Correct 9 ms 1260 KB Output is correct
11 Correct 18 ms 2540 KB Output is correct
12 Correct 19 ms 2668 KB Output is correct
13 Correct 24 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 16 ms 2284 KB Output is correct
17 Correct 40 ms 5228 KB Output is correct
18 Correct 24 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 372 KB Output is correct
29 Correct 1 ms 384 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 13 ms 1644 KB Output is correct
35 Correct 33 ms 4336 KB Output is correct
36 Correct 46 ms 5100 KB Output is correct
37 Correct 138 ms 4588 KB Output is correct
38 Correct 154 ms 5100 KB Output is correct
39 Correct 30 ms 4332 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 28 ms 2412 KB Output is correct
42 Correct 42 ms 4716 KB Output is correct
43 Correct 6 ms 876 KB Output is correct
44 Correct 26 ms 3028 KB Output is correct
45 Correct 37 ms 3564 KB Output is correct
46 Correct 44 ms 4844 KB Output is correct
47 Correct 13 ms 1920 KB Output is correct
48 Correct 2 ms 492 KB Output is correct
49 Correct 129 ms 4972 KB Output is correct
50 Correct 52 ms 5612 KB Output is correct
51 Correct 79 ms 5100 KB Output is correct
52 Correct 49 ms 5356 KB Output is correct
53 Correct 42 ms 5740 KB Output is correct
54 Correct 147 ms 5504 KB Output is correct
55 Correct 38 ms 5100 KB Output is correct
56 Correct 65 ms 5356 KB Output is correct
57 Correct 46 ms 4988 KB Output is correct
58 Correct 620 ms 5504 KB Output is correct
59 Correct 665 ms 5764 KB Output is correct
60 Correct 617 ms 5484 KB Output is correct
61 Correct 660 ms 5728 KB Output is correct
62 Correct 609 ms 5356 KB Output is correct
63 Correct 687 ms 5996 KB Output is correct
64 Correct 593 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 Correct 640 ms 5584 KB Output is correct
68 Correct 638 ms 5560 KB Output is correct
69 Correct 560 ms 4992 KB Output is correct
70 Correct 632 ms 5484 KB Output is correct
71 Correct 620 ms 5356 KB Output is correct
72 Correct 607 ms 5356 KB Output is correct
73 Correct 586 ms 5228 KB Output is correct
74 Correct 645 ms 5484 KB Output is correct
75 Correct 620 ms 5356 KB Output is correct
76 Correct 654 ms 5620 KB Output is correct
77 Correct 115 ms 5888 KB Output is correct
78 Correct 49 ms 5228 KB Output is correct
79 Correct 81 ms 4972 KB Output is correct
80 Correct 85 ms 5228 KB Output is correct
81 Correct 78 ms 4844 KB Output is correct
82 Correct 71 ms 5484 KB Output is correct
83 Correct 55 ms 5100 KB Output is correct
84 Correct 387 ms 5748 KB Output is correct
85 Correct 672 ms 5740 KB Output is correct
86 Correct 1 ms 364 KB Output is correct
87 Correct 1 ms 364 KB Output is correct
88 Correct 686 ms 5928 KB Output is correct
89 Correct 129 ms 1388 KB Output is correct
90 Correct 1 ms 364 KB Output is correct