oj.uz

Submission #341200

# Submission time Handle Problem Language Result Execution time Memory
341200 2020-12-29T06:13:08 Z IZhO_2021_I_want_Silver Chessboard (IZhO18_chessboard) C++14
39 / 100
 80 ms 3436 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 = 1e9 + 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

# 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 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 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 2816 KB Output isn't correct
2 Halted 0 ms 0 KB -

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 384 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 384 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 11 ms 1260 KB Output is correct
17 Correct 29 ms 3080 KB Output is correct
18 Correct 36 ms 3436 KB Output is correct
19 Correct 67 ms 3200 KB Output is correct
20 Correct 80 ms 3436 KB Output is correct
21 Correct 27 ms 2944 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 19 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 21 ms 2156 KB Output is correct
27 Correct 28 ms 2540 KB Output is correct
28 Correct 35 ms 3436 KB Output is correct
29 Correct 12 ms 1388 KB Output is correct
30 Correct 2 ms 492 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 2816 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
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 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 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Incorrect 25 ms 2816 KB Output isn't correct
10 Halted 0 ms 0 KB -