oj.uz

답안 #93968

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
93968 2019-01-13T19:11:06 Z qkxwsm Chessboard (IZhO18_chessboard) C++14
70 / 100
 2000 ms 5980 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 get(ll x1, ll x2, ll y1, ll y2, ll c, bool flag)
{
	ll res = 0;
	for (int i = x1; i <= x2; i++)
	{
		for (int j = y1; j <= y2; j++)
		{
			if (((flag) + (i / c) + (j / c)) % 2) res++;
		}
	}
	return 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

# 결과 실행 시간 메모리 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 380 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

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 3832 KB Output is correct
2 Correct 9 ms 1272 KB Output is correct
3 Correct 19 ms 2424 KB Output is correct
4 Correct 20 ms 2552 KB Output is correct
5 Correct 25 ms 3192 KB Output is correct
6 Correct 17 ms 2296 KB Output is correct
7 Correct 6 ms 632 KB Output is correct
8 Correct 17 ms 2140 KB Output is correct
9 Correct 40 ms 5116 KB Output is correct
10 Correct 23 ms 3128 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 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 420 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 376 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 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 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 420 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 376 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 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 15 ms 1528 KB Output is correct
17 Correct 31 ms 4216 KB Output is correct
18 Correct 45 ms 5044 KB Output is correct
19 Correct 143 ms 4468 KB Output is correct
20 Correct 165 ms 4984 KB Output is correct
21 Correct 30 ms 4088 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 29 ms 2296 KB Output is correct
24 Correct 40 ms 4472 KB Output is correct
25 Correct 7 ms 632 KB Output is correct
26 Correct 67 ms 2936 KB Output is correct
27 Correct 38 ms 3448 KB Output is correct
28 Correct 43 ms 4728 KB Output is correct
29 Correct 13 ms 1788 KB Output is correct
30 Correct 3 ms 504 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 3832 KB Output is correct
2 Correct 9 ms 1272 KB Output is correct
3 Correct 19 ms 2424 KB Output is correct
4 Correct 20 ms 2552 KB Output is correct
5 Correct 25 ms 3192 KB Output is correct
6 Correct 17 ms 2296 KB Output is correct
7 Correct 6 ms 632 KB Output is correct
8 Correct 17 ms 2140 KB Output is correct
9 Correct 40 ms 5116 KB Output is correct
10 Correct 23 ms 3128 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 420 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 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 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 15 ms 1528 KB Output is correct
27 Correct 31 ms 4216 KB Output is correct
28 Correct 45 ms 5044 KB Output is correct
29 Correct 143 ms 4468 KB Output is correct
30 Correct 165 ms 4984 KB Output is correct
31 Correct 30 ms 4088 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 29 ms 2296 KB Output is correct
34 Correct 40 ms 4472 KB Output is correct
35 Correct 7 ms 632 KB Output is correct
36 Correct 67 ms 2936 KB Output is correct
37 Correct 38 ms 3448 KB Output is correct
38 Correct 43 ms 4728 KB Output is correct
39 Correct 13 ms 1788 KB Output is correct
40 Correct 3 ms 504 KB Output is correct
41 Correct 121 ms 4872 KB Output is correct
42 Correct 48 ms 5496 KB Output is correct
43 Correct 73 ms 4836 KB Output is correct
44 Correct 46 ms 5368 KB Output is correct
45 Correct 40 ms 5752 KB Output is correct
46 Correct 137 ms 5496 KB Output is correct
47 Correct 35 ms 4984 KB Output is correct
48 Correct 62 ms 5240 KB Output is correct
49 Correct 43 ms 4856 KB Output is correct
50 Correct 580 ms 5396 KB Output is correct
51 Correct 713 ms 5752 KB Output is correct
52 Correct 583 ms 5388 KB Output is correct
53 Correct 623 ms 5752 KB Output is correct
54 Correct 574 ms 5240 KB Output is correct
55 Correct 652 ms 5980 KB Output is correct
56 Correct 573 ms 5112 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 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 380 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 28 ms 3832 KB Output is correct
10 Correct 9 ms 1272 KB Output is correct
11 Correct 19 ms 2424 KB Output is correct
12 Correct 20 ms 2552 KB Output is correct
13 Correct 25 ms 3192 KB Output is correct
14 Correct 17 ms 2296 KB Output is correct
15 Correct 6 ms 632 KB Output is correct
16 Correct 17 ms 2140 KB Output is correct
17 Correct 40 ms 5116 KB Output is correct
18 Correct 23 ms 3128 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 420 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 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 15 ms 1528 KB Output is correct
35 Correct 31 ms 4216 KB Output is correct
36 Correct 45 ms 5044 KB Output is correct
37 Correct 143 ms 4468 KB Output is correct
38 Correct 165 ms 4984 KB Output is correct
39 Correct 30 ms 4088 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 29 ms 2296 KB Output is correct
42 Correct 40 ms 4472 KB Output is correct
43 Correct 7 ms 632 KB Output is correct
44 Correct 67 ms 2936 KB Output is correct
45 Correct 38 ms 3448 KB Output is correct
46 Correct 43 ms 4728 KB Output is correct
47 Correct 13 ms 1788 KB Output is correct
48 Correct 3 ms 504 KB Output is correct
49 Correct 121 ms 4872 KB Output is correct
50 Correct 48 ms 5496 KB Output is correct
51 Correct 73 ms 4836 KB Output is correct
52 Correct 46 ms 5368 KB Output is correct
53 Correct 40 ms 5752 KB Output is correct
54 Correct 137 ms 5496 KB Output is correct
55 Correct 35 ms 4984 KB Output is correct
56 Correct 62 ms 5240 KB Output is correct
57 Correct 43 ms 4856 KB Output is correct
58 Correct 580 ms 5396 KB Output is correct
59 Correct 713 ms 5752 KB Output is correct
60 Correct 583 ms 5388 KB Output is correct
61 Correct 623 ms 5752 KB Output is correct
62 Correct 574 ms 5240 KB Output is correct
63 Correct 652 ms 5980 KB Output is correct
64 Correct 573 ms 5112 KB Output is correct
65 Correct 2 ms 376 KB Output is correct
66 Correct 2 ms 376 KB Output is correct
67 Execution timed out 2066 ms 5624 KB Time limit exceeded
68 Halted 0 ms 0 KB -