oj.uz

Submission #93969

# Submission time Handle Problem Language Result Execution time Memory
93969 2019-01-13T19:22:30 Z qkxwsm Chessboard (IZhO18_chessboard) C++14
100 / 100
 1732 ms 5880 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();

struct custom_hash
{
	template<class T>
	unsigned long long operator()(T v) const
	{
		unsigned long long x = v;
		x += FIXED_RANDOM;
		// x += 11400714819323198485ull;
		// x = (x ^ (x >> 30)) * 13787848793156543929ull;
		x = (x ^ (x >> 27)) * 10723151780598845931ull;
		return x ^ (x >> 31);
	}
};

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;

template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
template<class T>
void readi(T &x)
{
	x = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		x = x * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		x = -x;
	}
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int buf[20], n = 0;
	while(output)
	{
		buf[n] = ((output % 10));
		output /= 10;
		n++;
	}
	for (n--; n >= 0; n--)
	{
		putchar(buf[n] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
	return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
void nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
	return (b ? gcd(b, a % b) : a);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define SZ(x) ((int) ((x).size()))
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 100013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;
typedef pair<pll, pll> ppp;

int N, K;
vi factors;
ppp coor[MAXN];
ll ans = LLINF;

ll cn1(ll x, ll c)
{
	//how many in 0...x are ODD when divided by c
	if (x < 0) return 0;
	ll num = (x / c);
	if (num % 2)
	{
		return c * (num / 2) + (x + 1 - num * c);
	}
	else
	{
		return c * (num / 2);
	}
}
ll cn(ll x, ll y, ll c)
{
	//how many in (x, y) are ODD when divided by c?
	return cn1(y, c) - cn1(x - 1, c);
}
ll get(ll x1, ll x2, ll y1, ll y2, ll c, bool flag)
{
	ll res = 0;
	ll x[2], y[2];
	x[1] = cn(x1, x2, c);
	x[0] = (x2 - x1 + 1) - x[1];
	y[1] = cn(y1, y2, c);
	y[0] = (y2 - y1 + 1) - y[1];
	FOR(i, 0, 2)
	{
		res += x[i] * y[1 ^ i ^ flag];
	}
	return res;
	// for (int i = x1; i <= x2; i++)
	// {
	// 	for (int j = y1; j <= y2; j++)
	// 	{
	// 		if (((flag) + (i / c) + (j / c)) % 2) res++;
	// 	}
	// }
}


int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// if (fopen("file.in", "r"))
	// {
	// 	freopen ("file.in", "r", stdin);
	// 	freopen ("file.out", "w", stdout);
	// }
	cin >> N >> K;
	FOR(i, 1, N)
	{
		if (N % i == 0) factors.PB(i);
	}
	FOR(i, 0, K)
	{
		cin >> coor[i].fi.fi >> coor[i].fi.se >> coor[i].se.fi >> coor[i].se.se;
		coor[i].fi.fi--; coor[i].fi.se--; coor[i].se.fi--; coor[i].se.se--;
	}
	for (int c : factors)
	{
		//try having each square have side length x!
		FOR(flag, 0, 2)
		{
			//flag is whether the top left is black or white!
			ll res = (1ll * (N / c) * (N / c) + flag) / 2 * c * c;
			// DBG(res);
			FOR(i, 0, K)
			{
				ll x1 = coor[i].fi.fi, x2 = coor[i].se.fi, y1 = coor[i].fi.se, y2 = coor[i].se.se;
				// DBG(x1); DBG(x2); DBG(y1); DBG(y2);
				ll num = get(x1, x2, y1, y2, c, flag);
				// DBG(num);
				res += (x2 - x1 + 1) * (y2 - y1 + 1) - 2 * num;
				// DBG((x2 - x1 + 1) * (y2 - y1 + 1));
			}
			// cerr << c << ' ' << flag << ' ' << res << endl;
			ckmin(ans, res);
		}
	}
	cout << ans << '\n';
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}
/* READ READ READ
* int overflow, maxn too small, special cases (n=1?, two distinct?), cin.tie() interactive
* reread the problem, try small cases
* note down possible sources of error as you go
* do smth instead of nothing
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2296 KB Output is correct
2 Correct 10 ms 888 KB Output is correct
3 Correct 20 ms 1552 KB Output is correct
4 Correct 24 ms 1784 KB Output is correct
5 Correct 28 ms 2040 KB Output is correct
6 Correct 19 ms 1404 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 19 ms 1400 KB Output is correct
9 Correct 43 ms 3192 KB Output is correct
10 Correct 25 ms 1940 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 296 KB Output is correct
15 Correct 2 ms 376 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 296 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 20 ms 1144 KB Output is correct
17 Correct 37 ms 3064 KB Output is correct
18 Correct 68 ms 3448 KB Output is correct
19 Correct 344 ms 3156 KB Output is correct
20 Correct 376 ms 3576 KB Output is correct
21 Correct 35 ms 2940 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 53 ms 1656 KB Output is correct
24 Correct 61 ms 3320 KB Output is correct
25 Correct 12 ms 632 KB Output is correct
26 Correct 40 ms 2040 KB Output is correct
27 Correct 65 ms 2512 KB Output is correct
28 Correct 66 ms 3320 KB Output is correct
29 Correct 15 ms 1400 KB Output is correct
30 Correct 3 ms 504 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2296 KB Output is correct
2 Correct 10 ms 888 KB Output is correct
3 Correct 20 ms 1552 KB Output is correct
4 Correct 24 ms 1784 KB Output is correct
5 Correct 28 ms 2040 KB Output is correct
6 Correct 19 ms 1404 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 19 ms 1400 KB Output is correct
9 Correct 43 ms 3192 KB Output is correct
10 Correct 25 ms 1940 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 2 ms 296 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 20 ms 1144 KB Output is correct
27 Correct 37 ms 3064 KB Output is correct
28 Correct 68 ms 3448 KB Output is correct
29 Correct 344 ms 3156 KB Output is correct
30 Correct 376 ms 3576 KB Output is correct
31 Correct 35 ms 2940 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 53 ms 1656 KB Output is correct
34 Correct 61 ms 3320 KB Output is correct
35 Correct 12 ms 632 KB Output is correct
36 Correct 40 ms 2040 KB Output is correct
37 Correct 65 ms 2512 KB Output is correct
38 Correct 66 ms 3320 KB Output is correct
39 Correct 15 ms 1400 KB Output is correct
40 Correct 3 ms 504 KB Output is correct
41 Correct 266 ms 2980 KB Output is correct
42 Correct 67 ms 3320 KB Output is correct
43 Correct 144 ms 2992 KB Output is correct
44 Correct 68 ms 3320 KB Output is correct
45 Correct 47 ms 3448 KB Output is correct
46 Correct 297 ms 3192 KB Output is correct
47 Correct 42 ms 3064 KB Output is correct
48 Correct 111 ms 3064 KB Output is correct
49 Correct 62 ms 2936 KB Output is correct
50 Correct 1505 ms 3276 KB Output is correct
51 Correct 1591 ms 3448 KB Output is correct
52 Correct 1473 ms 3320 KB Output is correct
53 Correct 1577 ms 3448 KB Output is correct
54 Correct 1471 ms 3192 KB Output is correct
55 Correct 1642 ms 3448 KB Output is correct
56 Correct 1425 ms 3192 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 31 ms 2296 KB Output is correct
10 Correct 10 ms 888 KB Output is correct
11 Correct 20 ms 1552 KB Output is correct
12 Correct 24 ms 1784 KB Output is correct
13 Correct 28 ms 2040 KB Output is correct
14 Correct 19 ms 1404 KB Output is correct
15 Correct 5 ms 632 KB Output is correct
16 Correct 19 ms 1400 KB Output is correct
17 Correct 43 ms 3192 KB Output is correct
18 Correct 25 ms 1940 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 3 ms 376 KB Output is correct
32 Correct 2 ms 296 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 20 ms 1144 KB Output is correct
35 Correct 37 ms 3064 KB Output is correct
36 Correct 68 ms 3448 KB Output is correct
37 Correct 344 ms 3156 KB Output is correct
38 Correct 376 ms 3576 KB Output is correct
39 Correct 35 ms 2940 KB Output is correct
40 Correct 3 ms 376 KB Output is correct
41 Correct 53 ms 1656 KB Output is correct
42 Correct 61 ms 3320 KB Output is correct
43 Correct 12 ms 632 KB Output is correct
44 Correct 40 ms 2040 KB Output is correct
45 Correct 65 ms 2512 KB Output is correct
46 Correct 66 ms 3320 KB Output is correct
47 Correct 15 ms 1400 KB Output is correct
48 Correct 3 ms 504 KB Output is correct
49 Correct 266 ms 2980 KB Output is correct
50 Correct 67 ms 3320 KB Output is correct
51 Correct 144 ms 2992 KB Output is correct
52 Correct 68 ms 3320 KB Output is correct
53 Correct 47 ms 3448 KB Output is correct
54 Correct 297 ms 3192 KB Output is correct
55 Correct 42 ms 3064 KB Output is correct
56 Correct 111 ms 3064 KB Output is correct
57 Correct 62 ms 2936 KB Output is correct
58 Correct 1505 ms 3276 KB Output is correct
59 Correct 1591 ms 3448 KB Output is correct
60 Correct 1473 ms 3320 KB Output is correct
61 Correct 1577 ms 3448 KB Output is correct
62 Correct 1471 ms 3192 KB Output is correct
63 Correct 1642 ms 3448 KB Output is correct
64 Correct 1425 ms 3192 KB Output is correct
65 Correct 2 ms 376 KB Output is correct
66 Correct 2 ms 376 KB Output is correct
67 Correct 1572 ms 3320 KB Output is correct
68 Correct 1568 ms 5496 KB Output is correct
69 Correct 1352 ms 4856 KB Output is correct
70 Correct 1450 ms 5368 KB Output is correct
71 Correct 1477 ms 5240 KB Output is correct
72 Correct 1449 ms 5256 KB Output is correct
73 Correct 1425 ms 5212 KB Output is correct
74 Correct 1545 ms 5596 KB Output is correct
75 Correct 1474 ms 5240 KB Output is correct
76 Correct 1586 ms 5624 KB Output is correct
77 Correct 227 ms 5880 KB Output is correct
78 Correct 71 ms 5212 KB Output is correct
79 Correct 159 ms 5084 KB Output is correct
80 Correct 159 ms 5372 KB Output is correct
81 Correct 146 ms 4856 KB Output is correct
82 Correct 121 ms 5496 KB Output is correct
83 Correct 89 ms 5240 KB Output is correct
84 Correct 957 ms 5752 KB Output is correct
85 Correct 1732 ms 5752 KB Output is correct
86 Correct 3 ms 376 KB Output is correct
87 Correct 2 ms 376 KB Output is correct
88 Correct 1649 ms 5880 KB Output is correct
89 Correct 311 ms 1400 KB Output is correct
90 Correct 2 ms 376 KB Output is correct