oj.uz

답안 #341201

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
341201 2020-12-29T06:14:42 Z IZhO_2021_I_want_Silver Chessboard (IZhO18_chessboard) C++14
70 / 100
 253 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 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];
        --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 = 0, res2 = 0;
        if ((n / sz) %  2 == 0) {
            res1 = n * sz * (n / sz / 2);
            res2 = (n * n) - res1;
            assert(res1 == res2);
        }
        else {
            res1 = n * sz * (n / sz / 2) + sz * sz * (n / sz / 2); // белый - черный - ...
            res2 = (n * n) - res1;
        }
        for (int i = 1; i <= k; ++i) {
            int bw = (x[i] / sz) + (y[i] / sz);
            if (bw % 2 == 0) {
                ++res1;
                --res2;
            }
            else {
                --res1;
                ++res2;
            }
        }
        ans = min(ans, min(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:80:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   80 |  main () {
      |        ^

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 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 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
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 2284 KB Output is correct
2 Correct 7 ms 1260 KB Output is correct
3 Correct 18 ms 2540 KB Output is correct
4 Correct 17 ms 2668 KB Output is correct
5 Correct 22 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 2304 KB Output is correct
9 Correct 46 ms 5356 KB Output is correct
10 Correct 22 ms 3052 KB Output is correct

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 384 KB Output is correct
4 Correct 1 ms 384 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

# 결과 실행 시간 메모리 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 1 ms 384 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 10 ms 1260 KB Output is correct
17 Correct 28 ms 3052 KB Output is correct
18 Correct 36 ms 3436 KB Output is correct
19 Correct 66 ms 3308 KB Output is correct
20 Correct 73 ms 3436 KB Output is correct
21 Correct 28 ms 2924 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 18 ms 1644 KB Output is correct
24 Correct 33 ms 3180 KB Output is correct
25 Correct 4 ms 620 KB Output is correct
26 Correct 20 ms 2156 KB Output is correct
27 Correct 27 ms 2540 KB Output is correct
28 Correct 35 ms 3308 KB Output is correct
29 Correct 11 ms 1388 KB Output is correct
30 Correct 2 ms 492 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 2284 KB Output is correct
2 Correct 7 ms 1260 KB Output is correct
3 Correct 18 ms 2540 KB Output is correct
4 Correct 17 ms 2668 KB Output is correct
5 Correct 22 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 2304 KB Output is correct
9 Correct 46 ms 5356 KB Output is correct
10 Correct 22 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 384 KB Output is correct
14 Correct 1 ms 384 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 10 ms 1260 KB Output is correct
27 Correct 28 ms 3052 KB Output is correct
28 Correct 36 ms 3436 KB Output is correct
29 Correct 66 ms 3308 KB Output is correct
30 Correct 73 ms 3436 KB Output is correct
31 Correct 28 ms 2924 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 18 ms 1644 KB Output is correct
34 Correct 33 ms 3180 KB Output is correct
35 Correct 4 ms 620 KB Output is correct
36 Correct 20 ms 2156 KB Output is correct
37 Correct 27 ms 2540 KB Output is correct
38 Correct 35 ms 3308 KB Output is correct
39 Correct 11 ms 1388 KB Output is correct
40 Correct 2 ms 492 KB Output is correct
41 Correct 64 ms 4972 KB Output is correct
42 Correct 40 ms 5612 KB Output is correct
43 Correct 47 ms 4972 KB Output is correct
44 Correct 40 ms 5356 KB Output is correct
45 Correct 44 ms 5740 KB Output is correct
46 Correct 73 ms 5544 KB Output is correct
47 Correct 34 ms 5100 KB Output is correct
48 Correct 43 ms 5228 KB Output is correct
49 Correct 36 ms 4992 KB Output is correct
50 Correct 234 ms 5484 KB Output is correct
51 Correct 245 ms 5740 KB Output is correct
52 Correct 230 ms 5356 KB Output is correct
53 Correct 245 ms 5728 KB Output is correct
54 Correct 225 ms 5356 KB Output is correct
55 Correct 253 ms 5996 KB Output is correct
56 Correct 222 ms 5228 KB Output is correct

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 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 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 Correct 26 ms 2284 KB Output is correct
10 Correct 7 ms 1260 KB Output is correct
11 Correct 18 ms 2540 KB Output is correct
12 Correct 17 ms 2668 KB Output is correct
13 Correct 22 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 2304 KB Output is correct
17 Correct 46 ms 5356 KB Output is correct
18 Correct 22 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 384 KB Output is correct
22 Correct 1 ms 384 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 10 ms 1260 KB Output is correct
35 Correct 28 ms 3052 KB Output is correct
36 Correct 36 ms 3436 KB Output is correct
37 Correct 66 ms 3308 KB Output is correct
38 Correct 73 ms 3436 KB Output is correct
39 Correct 28 ms 2924 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 18 ms 1644 KB Output is correct
42 Correct 33 ms 3180 KB Output is correct
43 Correct 4 ms 620 KB Output is correct
44 Correct 20 ms 2156 KB Output is correct
45 Correct 27 ms 2540 KB Output is correct
46 Correct 35 ms 3308 KB Output is correct
47 Correct 11 ms 1388 KB Output is correct
48 Correct 2 ms 492 KB Output is correct
49 Correct 64 ms 4972 KB Output is correct
50 Correct 40 ms 5612 KB Output is correct
51 Correct 47 ms 4972 KB Output is correct
52 Correct 40 ms 5356 KB Output is correct
53 Correct 44 ms 5740 KB Output is correct
54 Correct 73 ms 5544 KB Output is correct
55 Correct 34 ms 5100 KB Output is correct
56 Correct 43 ms 5228 KB Output is correct
57 Correct 36 ms 4992 KB Output is correct
58 Correct 234 ms 5484 KB Output is correct
59 Correct 245 ms 5740 KB Output is correct
60 Correct 230 ms 5356 KB Output is correct
61 Correct 245 ms 5728 KB Output is correct
62 Correct 225 ms 5356 KB Output is correct
63 Correct 253 ms 5996 KB Output is correct
64 Correct 222 ms 5228 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Incorrect 1 ms 364 KB Output isn't correct
67 Halted 0 ms 0 KB -