oj.uz

답안 #555279

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
555279 2022-04-30T11:11:00 Z ngpin04 Chessboard (IZhO18_chessboard) C++14
70 / 100
 2000 ms 3424 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define TASK ""
#define ALL(x) (x).begin(), (x).end() 
using namespace std;
template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}
const int N = 1e5 + 5; 
const int oo = 1e9;
const long long ooo = 1e18;
const int mod = 1e9 + 7; // 998244353;
const long double pi = acos(-1);

pair <int, int> a[N], b[N];

int par[2 * N];
int lim[2 * N];
int n,k;

int getc(int i, int j, int l, int val) {
	return ((par[i] ^ par[j]) & 1) ^ val;
}

int getv(int i, int j, int l, int val) {
	return (getc(i, j, l, val) > 0) ? -1 : 1;
}

long long calc(int x, int y, int u, int v, int l, int val) {
	if (x > u || y > v)
		return 0;	

	long long res = 0;
	int dx = (u - x + 1);
	int dy = (v - y + 1);
	int base = getv(x, y, l, val);
	if (dx > dy)
		swap(dx, dy);

	if (dx < l) {
		if (dy < l) 
			res = (long long) dx * dy;
		else {
			if (par[dy] & 1)
				res = (long long) dx * l; 
		}
	} else {
		if (par[dx] & par[dy] & 1)
			res = (long long) l * l;
	}
	if (base < 0)
		res = -res;
	return res;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	#ifdef ONLINE_JUDGE
	// freopen(TASK".inp","r",stdin);
	// freopen(TASK".out","w",stdout);
	#endif
	cin >> n >> k;

	for (int i = 1; i <= k; i++) {
		cin >> a[i].fi >> a[i].se >> b[i].fi >> b[i].se;
		a[i].fi--; a[i].se--;
		b[i].fi--; b[i].se--;
	}

	long long ans = ooo;
	for (int l = 1; l < n; l++) if (n % l == 0) 
	for (int val = 0; val < 2; val++) {
		int d = (n / l);
		long long res = ((1LL * d * d + val) >> 1) * l * l;
		for (int i = 0; i < 2 * n; i++) {
			par[i] = (i / l);
			lim[i] = par[i] * l;
		}

		for (int id = 1; id <= k; id++) {
			int x = a[id].fi;
			int y = a[id].se;
			int u = b[id].fi;
			int v = b[id].se;

			int i = lim[x + l - 1];
			int j = lim[y + l - 1];
			int s = lim[u + 1] - 1;
			int t = lim[v + 1] - 1;
			vector <pair <int, int>> r, c;
			if (par[x] == par[u])
				r.push_back(mp(x, u));
			else {
				r.push_back(mp(x, i - 1));
				if (i <= s) 
					r.push_back(mp(i, s));
				r.push_back(mp(s + 1, u));
			}
			if (par[y] == par[v])
				c.push_back(mp(y, v));
			else {
				c.push_back(mp(y, j - 1));
				if (j <= t) 
					c.push_back(mp(j, t));
				c.push_back(mp(t + 1, v));
			}

			for (pair <int, int> a : r)
			for (pair <int, int> b : c)
				res += calc(a.fi, b.fi, a.se, b.se, l, val);
		}
		// cerr << "split: " << l << " " << val << " " << res << "\n";
		mini(ans, res);
	}

	cout << ans;
	return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 2376 KB Output is correct
2 Correct 8 ms 852 KB Output is correct
3 Correct 38 ms 2264 KB Output is correct
4 Correct 19 ms 1140 KB Output is correct
5 Correct 35 ms 2140 KB Output is correct
6 Correct 17 ms 1720 KB Output is correct
7 Correct 6 ms 788 KB Output is correct
8 Correct 23 ms 1600 KB Output is correct
9 Correct 43 ms 2280 KB Output is correct
10 Correct 31 ms 1700 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 18 ms 856 KB Output is correct
17 Correct 31 ms 1632 KB Output is correct
18 Correct 57 ms 1956 KB Output is correct
19 Correct 287 ms 1788 KB Output is correct
20 Correct 317 ms 1952 KB Output is correct
21 Correct 30 ms 1612 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 46 ms 980 KB Output is correct
24 Correct 51 ms 1820 KB Output is correct
25 Correct 10 ms 556 KB Output is correct
26 Correct 33 ms 1224 KB Output is correct
27 Correct 54 ms 1456 KB Output is correct
28 Correct 55 ms 1904 KB Output is correct
29 Correct 13 ms 952 KB Output is correct
30 Correct 5 ms 340 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 2376 KB Output is correct
2 Correct 8 ms 852 KB Output is correct
3 Correct 38 ms 2264 KB Output is correct
4 Correct 19 ms 1140 KB Output is correct
5 Correct 35 ms 2140 KB Output is correct
6 Correct 17 ms 1720 KB Output is correct
7 Correct 6 ms 788 KB Output is correct
8 Correct 23 ms 1600 KB Output is correct
9 Correct 43 ms 2280 KB Output is correct
10 Correct 31 ms 1700 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 18 ms 856 KB Output is correct
27 Correct 31 ms 1632 KB Output is correct
28 Correct 57 ms 1956 KB Output is correct
29 Correct 287 ms 1788 KB Output is correct
30 Correct 317 ms 1952 KB Output is correct
31 Correct 30 ms 1612 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 46 ms 980 KB Output is correct
34 Correct 51 ms 1820 KB Output is correct
35 Correct 10 ms 556 KB Output is correct
36 Correct 33 ms 1224 KB Output is correct
37 Correct 54 ms 1456 KB Output is correct
38 Correct 55 ms 1904 KB Output is correct
39 Correct 13 ms 952 KB Output is correct
40 Correct 5 ms 340 KB Output is correct
41 Correct 402 ms 3248 KB Output is correct
42 Correct 77 ms 3420 KB Output is correct
43 Correct 177 ms 3248 KB Output is correct
44 Correct 73 ms 3300 KB Output is correct
45 Correct 44 ms 3424 KB Output is correct
46 Correct 357 ms 3276 KB Output is correct
47 Correct 40 ms 3180 KB Output is correct
48 Correct 124 ms 3316 KB Output is correct
49 Correct 67 ms 3220 KB Output is correct
50 Correct 1787 ms 3112 KB Output is correct
51 Correct 1912 ms 3204 KB Output is correct
52 Correct 1773 ms 3108 KB Output is correct
53 Correct 1885 ms 3200 KB Output is correct
54 Correct 1829 ms 3080 KB Output is correct
55 Correct 1924 ms 3248 KB Output is correct
56 Correct 1678 ms 3044 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 48 ms 2376 KB Output is correct
10 Correct 8 ms 852 KB Output is correct
11 Correct 38 ms 2264 KB Output is correct
12 Correct 19 ms 1140 KB Output is correct
13 Correct 35 ms 2140 KB Output is correct
14 Correct 17 ms 1720 KB Output is correct
15 Correct 6 ms 788 KB Output is correct
16 Correct 23 ms 1600 KB Output is correct
17 Correct 43 ms 2280 KB Output is correct
18 Correct 31 ms 1700 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 18 ms 856 KB Output is correct
35 Correct 31 ms 1632 KB Output is correct
36 Correct 57 ms 1956 KB Output is correct
37 Correct 287 ms 1788 KB Output is correct
38 Correct 317 ms 1952 KB Output is correct
39 Correct 30 ms 1612 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 46 ms 980 KB Output is correct
42 Correct 51 ms 1820 KB Output is correct
43 Correct 10 ms 556 KB Output is correct
44 Correct 33 ms 1224 KB Output is correct
45 Correct 54 ms 1456 KB Output is correct
46 Correct 55 ms 1904 KB Output is correct
47 Correct 13 ms 952 KB Output is correct
48 Correct 5 ms 340 KB Output is correct
49 Correct 402 ms 3248 KB Output is correct
50 Correct 77 ms 3420 KB Output is correct
51 Correct 177 ms 3248 KB Output is correct
52 Correct 73 ms 3300 KB Output is correct
53 Correct 44 ms 3424 KB Output is correct
54 Correct 357 ms 3276 KB Output is correct
55 Correct 40 ms 3180 KB Output is correct
56 Correct 124 ms 3316 KB Output is correct
57 Correct 67 ms 3220 KB Output is correct
58 Correct 1787 ms 3112 KB Output is correct
59 Correct 1912 ms 3204 KB Output is correct
60 Correct 1773 ms 3108 KB Output is correct
61 Correct 1885 ms 3200 KB Output is correct
62 Correct 1829 ms 3080 KB Output is correct
63 Correct 1924 ms 3248 KB Output is correct
64 Correct 1678 ms 3044 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Execution timed out 2091 ms 3152 KB Time limit exceeded
68 Halted 0 ms 0 KB -