oj.uz

답안 #555274

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
555274 2022-04-30T11:04:16 Z ngpin04 Chessboard (IZhO18_chessboard) C++14
70 / 100
 2000 ms 4620 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[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);
	if (dx > dy)
		swap(dx, dy);

	if (dx < l) {
		if (dy < l) 
			res = (long long) dx * dy * getv(x, y, l, val);
		else {
			if ((dy / l) & 1)
				res = (long long) dx * l * getv(x, y, l, val); 
		}
	} else {
		if (par[dx] & par[dy] & 1)
			res = (long long) l * l * getv(x, y, l, val);
	}
	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 < n; i++)
			par[i] = (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 = (x + l - 1) / l * l;
			int j = (y + l - 1) / l * l;
			int s = (u + 1) / l * l - 1;
			int t = (v + 1) / l * l - 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));
				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));
				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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 1508 KB Output is correct
2 Correct 9 ms 636 KB Output is correct
3 Correct 18 ms 1228 KB Output is correct
4 Correct 16 ms 1056 KB Output is correct
5 Correct 25 ms 1364 KB Output is correct
6 Correct 15 ms 980 KB Output is correct
7 Correct 4 ms 468 KB Output is correct
8 Correct 15 ms 1020 KB Output is correct
9 Correct 35 ms 1740 KB Output is correct
10 Correct 20 ms 1188 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 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 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 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 340 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 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 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 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 340 KB Output is correct
16 Correct 14 ms 764 KB Output is correct
17 Correct 29 ms 1548 KB Output is correct
18 Correct 55 ms 1828 KB Output is correct
19 Correct 250 ms 1700 KB Output is correct
20 Correct 280 ms 1876 KB Output is correct
21 Correct 28 ms 1592 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 38 ms 980 KB Output is correct
24 Correct 48 ms 1728 KB Output is correct
25 Correct 8 ms 344 KB Output is correct
26 Correct 34 ms 1108 KB Output is correct
27 Correct 50 ms 1376 KB Output is correct
28 Correct 49 ms 1748 KB Output is correct
29 Correct 12 ms 852 KB Output is correct
30 Correct 2 ms 340 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 1508 KB Output is correct
2 Correct 9 ms 636 KB Output is correct
3 Correct 18 ms 1228 KB Output is correct
4 Correct 16 ms 1056 KB Output is correct
5 Correct 25 ms 1364 KB Output is correct
6 Correct 15 ms 980 KB Output is correct
7 Correct 4 ms 468 KB Output is correct
8 Correct 15 ms 1020 KB Output is correct
9 Correct 35 ms 1740 KB Output is correct
10 Correct 20 ms 1188 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 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 0 ms 212 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 340 KB Output is correct
26 Correct 14 ms 764 KB Output is correct
27 Correct 29 ms 1548 KB Output is correct
28 Correct 55 ms 1828 KB Output is correct
29 Correct 250 ms 1700 KB Output is correct
30 Correct 280 ms 1876 KB Output is correct
31 Correct 28 ms 1592 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 38 ms 980 KB Output is correct
34 Correct 48 ms 1728 KB Output is correct
35 Correct 8 ms 344 KB Output is correct
36 Correct 34 ms 1108 KB Output is correct
37 Correct 50 ms 1376 KB Output is correct
38 Correct 49 ms 1748 KB Output is correct
39 Correct 12 ms 852 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 256 ms 1992 KB Output is correct
42 Correct 58 ms 2172 KB Output is correct
43 Correct 129 ms 2000 KB Output is correct
44 Correct 58 ms 2124 KB Output is correct
45 Correct 41 ms 2232 KB Output is correct
46 Correct 273 ms 2248 KB Output is correct
47 Correct 35 ms 2044 KB Output is correct
48 Correct 100 ms 2060 KB Output is correct
49 Correct 54 ms 1936 KB Output is correct
50 Correct 1277 ms 2176 KB Output is correct
51 Correct 1380 ms 2156 KB Output is correct
52 Correct 1283 ms 1948 KB Output is correct
53 Correct 1364 ms 2148 KB Output is correct
54 Correct 1297 ms 2024 KB Output is correct
55 Correct 1405 ms 2240 KB Output is correct
56 Correct 1269 ms 1988 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 25 ms 1508 KB Output is correct
10 Correct 9 ms 636 KB Output is correct
11 Correct 18 ms 1228 KB Output is correct
12 Correct 16 ms 1056 KB Output is correct
13 Correct 25 ms 1364 KB Output is correct
14 Correct 15 ms 980 KB Output is correct
15 Correct 4 ms 468 KB Output is correct
16 Correct 15 ms 1020 KB Output is correct
17 Correct 35 ms 1740 KB Output is correct
18 Correct 20 ms 1188 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 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 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 0 ms 212 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 340 KB Output is correct
34 Correct 14 ms 764 KB Output is correct
35 Correct 29 ms 1548 KB Output is correct
36 Correct 55 ms 1828 KB Output is correct
37 Correct 250 ms 1700 KB Output is correct
38 Correct 280 ms 1876 KB Output is correct
39 Correct 28 ms 1592 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 38 ms 980 KB Output is correct
42 Correct 48 ms 1728 KB Output is correct
43 Correct 8 ms 344 KB Output is correct
44 Correct 34 ms 1108 KB Output is correct
45 Correct 50 ms 1376 KB Output is correct
46 Correct 49 ms 1748 KB Output is correct
47 Correct 12 ms 852 KB Output is correct
48 Correct 2 ms 340 KB Output is correct
49 Correct 256 ms 1992 KB Output is correct
50 Correct 58 ms 2172 KB Output is correct
51 Correct 129 ms 2000 KB Output is correct
52 Correct 58 ms 2124 KB Output is correct
53 Correct 41 ms 2232 KB Output is correct
54 Correct 273 ms 2248 KB Output is correct
55 Correct 35 ms 2044 KB Output is correct
56 Correct 100 ms 2060 KB Output is correct
57 Correct 54 ms 1936 KB Output is correct
58 Correct 1277 ms 2176 KB Output is correct
59 Correct 1380 ms 2156 KB Output is correct
60 Correct 1283 ms 1948 KB Output is correct
61 Correct 1364 ms 2148 KB Output is correct
62 Correct 1297 ms 2024 KB Output is correct
63 Correct 1405 ms 2240 KB Output is correct
64 Correct 1269 ms 1988 KB Output is correct
65 Correct 0 ms 340 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 1989 ms 2100 KB Output is correct
68 Correct 1944 ms 2100 KB Output is correct
69 Correct 1665 ms 1900 KB Output is correct
70 Correct 1720 ms 2036 KB Output is correct
71 Correct 1783 ms 2024 KB Output is correct
72 Correct 1735 ms 2004 KB Output is correct
73 Correct 1816 ms 1992 KB Output is correct
74 Correct 1896 ms 2088 KB Output is correct
75 Correct 1770 ms 1944 KB Output is correct
76 Correct 1935 ms 2104 KB Output is correct
77 Correct 301 ms 4620 KB Output is correct
78 Correct 87 ms 4152 KB Output is correct
79 Correct 207 ms 4048 KB Output is correct
80 Correct 212 ms 4172 KB Output is correct
81 Correct 205 ms 3852 KB Output is correct
82 Correct 152 ms 4300 KB Output is correct
83 Correct 135 ms 4228 KB Output is correct
84 Correct 1165 ms 4528 KB Output is correct
85 Execution timed out 2001 ms 4512 KB Time limit exceeded
86 Halted 0 ms 0 KB -