oj.uz

Submission #174031

# Submission time Handle Problem Language Result Execution time Memory
174031 2020-01-06T07:23:49 Z anakib1 Chessboard (IZhO18_chessboard) C++17
70 / 100
 2000 ms 5880 KB 
/*

Sviatoslav Bidzilia 2019
CF: anakib1

*/

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <deque>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdarg.h>
#include <utility>

using namespace std;

#define pb push_back
#define mp make_pair
#define ll long long
#define ull unisgned long long
#define ld long double
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define pii pair<int, int>
#define tii triple<int, int, int>
#define e 1e-7
#define PI acos(-1)
#define inf 1e17
#define vi vector<int>
#define F first
#define S second
#define rng(x) for(int _ = 0; _ < (x); _++)
#define rngi(i, x) for(int i = 0; i < (x); i++)
#define rngsi(s, i, x) for(int i = (s); i <(x); i++)
#define int long long
template<typename A, typename B, typename C>
struct triple
{
	A X;
	B Y;
	C Z;
	triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {}
};
template<typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0)
{
	return triple<A, B, C>(a, b, c);
}
template<typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b)
{
	if (a.X != b.X)
		return a.X < b.X;
	if (a.Y != b.Y)
		return a.Y < b.Y;
	return a.Z < b.Z;
}
template<typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p)
{
	ofs << "( " << p.F << " , " << p.S << " )";
	return ofs;
}
template<typename T>
void print(T a)
{
	for (auto i : a)
		cout << i << ' ';
	cout << '\n';
}
template<typename T>
T max(T a, T b, T c)
{
	return max(a, max(b, c));
}
template<typename T>
T min(T a, T b, T c)
{
	return min(a, min(b, c));
}
struct custom_hash
{
	static uint64_t splitmix64(uint64_t x)
	{
		x += 0x9e3779b97f4a7c15;
		x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
		x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
		return x ^ (x >> 31);
	}

	size_t operator()(uint64_t x) const
	{
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		return splitmix64(x + FIXED_RANDOM);
	}
};
int sz, flx, fly, d, s, d1, d2;
int n;
vector<pair<pii, pii> > rect;
inline int sum1(int x, int y, int k)
{
	y--, x--;
	sz = k * k;
	flx = (x + 1) / k;
	fly = (y + 1) / k;
	int ans = fly / 2 * sz * flx;
	if (fly & 1)
	{
		ans += flx / 2 * sz;
		if (flx & 1)
			ans += sz;
	}
	if ((x + 1) % k)
	{
		d = (x + 1) % k;
		s = (flx + 1) & 1;
		ans += fly / 2 * k * d;
		if (fly & 1 && s)
			ans += k * d;
	}
	if ((y + 1) % k != 0)
	{
		d = (y + 1) % k;
		s = (fly + 1) & 1;
		ans += flx / 2 * k * d;
		if (flx & 1 && s)
			ans += k * d;
	}
	if ((x + 1) % k && (y + 1) % k)
	{
		d1 = (x + 1) % k;
		d2 = (y + 1) % k;
		s = (fly + flx) & 1;
		s ^= 1;
		if (s)
			ans += d1 * d2;
	}
	return ans;
}
inline int sum(int x, int y, int t, int k)
{
	if (t)
		return sum1(x, y, k);
	else
		return x * y - sum1(x, y, k);
}
inline int sumr(int x1, int y1, int x2, int y2, int t, int k)
{
	if (x1 == x2 && y1 == y2)
	{
		int x = x1 / k - 1;
		int y = y1 / k - 1;
		if (x1 % k)
			x++;
		if (y1 % k)
			y++;
		if (!t)
			return (x + y) & 1;
		else
			return (x + y + 1) & 1;
	}
	return sum(x2, y2, t, k) - (x1 > 1 ? sum(x1 - 1, y2, t, k) : 0) - (y1 > 1 ? sum(x2, y1 - 1, t, k) : 0) + (x1 > 1 && y1 > 1 ? sum(x1 - 1, y1 - 1, t, k) : 0);
}
inline int solve(int k, int t)
{
	int ans = 0;
	int cntb = 0;
	int cntw = 0;
	for (auto &i : rect)
	{
		int r = sumr(i.first.first, i.first.second, i.second.first, i.second.second, t, k);
		cntb += r;
		cntw += (i.second.second - i.first.second + 1) * (i.second.first - i.first.first + 1) - r;
	}
	int allb = sumr(1, 1, n, n, t, k);
	cntw += allb - cntb;
	return cntw;
}
signed main()
{
	//freopen(".in", "r", stdin);
	//freopen(".out", "w", stdout);
	srand(time(NULL));
	cin.tie(0);
	cout.tie(0);
	ios_base::sync_with_stdio(false);
	/*rng(20)
	{
		int a, b, c, d;
		cin >> a >> b >> c >> d;
		cout << sumr(a, b, c, d, 0, 3) << '\n';
	}*/
	int k;
	scanf("%d%d", &n, &k);
	rect.resize(k);
	for (auto& i : rect)
		scanf("%d%d%d%d", &i.first.second, &i.first.first, &i.second.second, &i.second.first);
	vi divs;
	for (int d = 2; d * d <= n; d++)
		if (n % d == 0)
		{
			divs.pb(d);
			divs.pb(n / d);
		}
	divs.pb(1);
	SORT(divs);
	divs.erase(unique(all(divs)), divs.end());
	int ans = inf;
	for (int m : divs)
		ans = min(ans, solve(m, 0), solve(m, 1));
	if (!rect.size())
		for (auto m : divs)
			ans = min(ans, sumr(1, 1, n, n, 1, m), sumr(1, 1, n, n, 0, m));
	cout << ans << '\n';
}

Compilation message

chessboard.cpp: In function 'long long int solve(long long int, long long int)':
chessboard.cpp:185:6: warning: unused variable 'ans' [-Wunused-variable]
  int ans = 0;
      ^~~
chessboard.cpp: In function 'int main()':
chessboard.cpp:213:22: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'long long int*' [-Wformat=]
  scanf("%d%d", &n, &k);
                ~~    ^
chessboard.cpp:213:22: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'long long int*' [-Wformat=]
chessboard.cpp:216:87: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'long long int*' [-Wformat=]
   scanf("%d%d%d%d", &i.first.second, &i.first.first, &i.second.second, &i.second.first);
                     ~~~~~~~~~~~~~~~                                                   ^
chessboard.cpp:216:87: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'long long int*' [-Wformat=]
chessboard.cpp:216:87: warning: format '%d' expects argument of type 'int*', but argument 4 has type 'long long int*' [-Wformat=]
chessboard.cpp:216:87: warning: format '%d' expects argument of type 'int*', but argument 5 has type 'long long int*' [-Wformat=]
chessboard.cpp:213:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &k);
  ~~~~~^~~~~~~~~~~~~~~~
chessboard.cpp:216:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d%d", &i.first.second, &i.first.first, &i.second.second, &i.second.first);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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 504 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 37 ms 3832 KB Output is correct
2 Correct 11 ms 1276 KB Output is correct
3 Correct 24 ms 2552 KB Output is correct
4 Correct 25 ms 2680 KB Output is correct
5 Correct 32 ms 3320 KB Output is correct
6 Correct 21 ms 2296 KB Output is correct
7 Correct 6 ms 760 KB Output is correct
8 Correct 21 ms 2296 KB Output is correct
9 Correct 52 ms 5240 KB Output is correct
10 Correct 30 ms 3064 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 416 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 3 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 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 416 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 3 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 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 18 ms 1656 KB Output is correct
17 Correct 42 ms 4344 KB Output is correct
18 Correct 63 ms 5112 KB Output is correct
19 Correct 173 ms 4600 KB Output is correct
20 Correct 193 ms 4984 KB Output is correct
21 Correct 41 ms 4216 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 36 ms 2424 KB Output is correct
24 Correct 55 ms 4728 KB Output is correct
25 Correct 9 ms 760 KB Output is correct
26 Correct 35 ms 3064 KB Output is correct
27 Correct 50 ms 3576 KB Output is correct
28 Correct 58 ms 4868 KB Output is correct
29 Correct 18 ms 1912 KB Output is correct
30 Correct 4 ms 504 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 3832 KB Output is correct
2 Correct 11 ms 1276 KB Output is correct
3 Correct 24 ms 2552 KB Output is correct
4 Correct 25 ms 2680 KB Output is correct
5 Correct 32 ms 3320 KB Output is correct
6 Correct 21 ms 2296 KB Output is correct
7 Correct 6 ms 760 KB Output is correct
8 Correct 21 ms 2296 KB Output is correct
9 Correct 52 ms 5240 KB Output is correct
10 Correct 30 ms 3064 KB Output is correct
11 Correct 2 ms 416 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 3 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 3 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 18 ms 1656 KB Output is correct
27 Correct 42 ms 4344 KB Output is correct
28 Correct 63 ms 5112 KB Output is correct
29 Correct 173 ms 4600 KB Output is correct
30 Correct 193 ms 4984 KB Output is correct
31 Correct 41 ms 4216 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 36 ms 2424 KB Output is correct
34 Correct 55 ms 4728 KB Output is correct
35 Correct 9 ms 760 KB Output is correct
36 Correct 35 ms 3064 KB Output is correct
37 Correct 50 ms 3576 KB Output is correct
38 Correct 58 ms 4868 KB Output is correct
39 Correct 18 ms 1912 KB Output is correct
40 Correct 4 ms 504 KB Output is correct
41 Correct 150 ms 4928 KB Output is correct
42 Correct 66 ms 5536 KB Output is correct
43 Correct 95 ms 4984 KB Output is correct
44 Correct 63 ms 5368 KB Output is correct
45 Correct 59 ms 5752 KB Output is correct
46 Correct 167 ms 5468 KB Output is correct
47 Correct 51 ms 5116 KB Output is correct
48 Correct 80 ms 5112 KB Output is correct
49 Correct 59 ms 4988 KB Output is correct
50 Correct 688 ms 5396 KB Output is correct
51 Correct 746 ms 5752 KB Output is correct
52 Correct 684 ms 5368 KB Output is correct
53 Correct 730 ms 5624 KB Output is correct
54 Correct 674 ms 5244 KB Output is correct
55 Correct 757 ms 5880 KB Output is correct
56 Correct 656 ms 5116 KB Output is correct

Subtask #6
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 504 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 37 ms 3832 KB Output is correct
10 Correct 11 ms 1276 KB Output is correct
11 Correct 24 ms 2552 KB Output is correct
12 Correct 25 ms 2680 KB Output is correct
13 Correct 32 ms 3320 KB Output is correct
14 Correct 21 ms 2296 KB Output is correct
15 Correct 6 ms 760 KB Output is correct
16 Correct 21 ms 2296 KB Output is correct
17 Correct 52 ms 5240 KB Output is correct
18 Correct 30 ms 3064 KB Output is correct
19 Correct 2 ms 416 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 3 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 3 ms 376 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 18 ms 1656 KB Output is correct
35 Correct 42 ms 4344 KB Output is correct
36 Correct 63 ms 5112 KB Output is correct
37 Correct 173 ms 4600 KB Output is correct
38 Correct 193 ms 4984 KB Output is correct
39 Correct 41 ms 4216 KB Output is correct
40 Correct 3 ms 376 KB Output is correct
41 Correct 36 ms 2424 KB Output is correct
42 Correct 55 ms 4728 KB Output is correct
43 Correct 9 ms 760 KB Output is correct
44 Correct 35 ms 3064 KB Output is correct
45 Correct 50 ms 3576 KB Output is correct
46 Correct 58 ms 4868 KB Output is correct
47 Correct 18 ms 1912 KB Output is correct
48 Correct 4 ms 504 KB Output is correct
49 Correct 150 ms 4928 KB Output is correct
50 Correct 66 ms 5536 KB Output is correct
51 Correct 95 ms 4984 KB Output is correct
52 Correct 63 ms 5368 KB Output is correct
53 Correct 59 ms 5752 KB Output is correct
54 Correct 167 ms 5468 KB Output is correct
55 Correct 51 ms 5116 KB Output is correct
56 Correct 80 ms 5112 KB Output is correct
57 Correct 59 ms 4988 KB Output is correct
58 Correct 688 ms 5396 KB Output is correct
59 Correct 746 ms 5752 KB Output is correct
60 Correct 684 ms 5368 KB Output is correct
61 Correct 730 ms 5624 KB Output is correct
62 Correct 674 ms 5244 KB Output is correct
63 Correct 757 ms 5880 KB Output is correct
64 Correct 656 ms 5116 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 2040 ms 5488 KB Time limit exceeded
68 Halted 0 ms 0 KB -