oj.uz

답안 #379034

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
379034 2021-03-17T08:42:34 Z fhvirus Chessboard (IZhO18_chessboard) C++17
100 / 100
 839 ms 2796 KB 
// Knapsack DP is harder than FFT.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii; typedef pair<ll, ll> pll;
#define ff first
#define ss second
#define pb emplace_back
#define FOR(i,n) for(int i = 0; i < (n); ++i)
#define FOO(i,a,b) for(int i = (a); i <= (b); ++i)
#define AI(x) begin(x),end(x)
template<class I> bool chmax(I &a, I b){ return a < b ? (a = b, true) : false;}
template<class I> bool chmin(I &a, I b){ return a > b ? (a = b, true) : false;}
#ifdef OWO
#define debug(args...) LKJ("[ " + string(#args) + " ]", args)
void LKJ(){ cerr << endl;}
template<class I, class...T> void LKJ(I&&x, T&&...t){ cerr<<x<<", ", LKJ(t...);}
template<class I> void DE(I a, I b){ while(a < b) cerr << *a << " \n"[next(a) == b], ++a;}
#else
#define debug(...) 0
#define DE(...) 0
#endif
const int N = 1e5 + 1;
int n, k;

void findfac(int n, vector<int> &fac){
	for(int i = 1; i * i <= n; ++i){
		if(n % i != 0) continue;
		fac.pb(i);
		fac.pb(n / i);
	}
	sort(AI(fac));
	fac.erase(unique(AI(fac)), end(fac));
	if(fac.back() == n) fac.pop_back();
}

ll calc(int l, int r, int f){
	int len = (r - l + 1);
	l %= f;
	len %= 2 * f;
	if(len == 0) return 0;
	r = l + len - 1;

	int lb = l / f;
	int rb = r / f;

	if(lb == rb) return r - l + 1;
	if(rb - lb == 1) return (f - l) - (r - f + 1);
	return (f - l) + (r - 2 * f + 1) - f;
}

int32_t main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n >> k;

	vector<int> facs;
	findfac(n, facs);

	// ca : has top left corner
	// cb : does not
	vector<ll> ca(facs.size());
	vector<ll> cb(facs.size());
	FOR(i,facs.size()){
		int f = facs[i];
		ll nn = n / f;
		ll bc = (nn * nn + 1) / 2;
		ca[i] = bc * f * f;
		cb[i] = 1ll * n * n - ca[i];
	}

	FOR(_,k){
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		--x1, --y1, --x2, --y2;
		FOR(i, facs.size()){
			int f = facs[i];

			ll vx = calc(x1, x2, f);
			ll vy = calc(y1, y2, f);

			if((x1 / f) + (y1 / f) & 1) vx *= 1;
			else vx *= -1;

			ca[i] += vx * vy;
			cb[i] -= vx * vy;
		}
	}

	DE(AI(facs));
	DE(AI(ca));
	DE(AI(cb));

	cout << min(
		*min_element(AI(ca)),
		*min_element(AI(cb))
	);
	return 0;
}

Compilation message

chessboard.cpp: In function 'int32_t main()':
chessboard.cpp:9:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 | #define FOR(i,n) for(int i = 0; i < (n); ++i)
      |                                   ^
chessboard.cpp:63:2: note: in expansion of macro 'FOR'
   63 |  FOR(i,facs.size()){
      |  ^~~
chessboard.cpp:9:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 | #define FOR(i,n) for(int i = 0; i < (n); ++i)
      |                                   ^
chessboard.cpp:75:3: note: in expansion of macro 'FOR'
   75 |   FOR(i, facs.size()){
      |   ^~~
chessboard.cpp:81:16: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
   81 |    if((x1 / f) + (y1 / f) & 1) vx *= 1;
      |       ~~~~~~~~~^~~~~~~~~~
chessboard.cpp:21:17: warning: statement has no effect [-Wunused-value]
   21 | #define DE(...) 0
      |                 ^
chessboard.cpp:89:2: note: in expansion of macro 'DE'
   89 |  DE(AI(facs));
      |  ^~
chessboard.cpp:21:17: warning: statement has no effect [-Wunused-value]
   21 | #define DE(...) 0
      |                 ^
chessboard.cpp:90:2: note: in expansion of macro 'DE'
   90 |  DE(AI(ca));
      |  ^~
chessboard.cpp:21:17: warning: statement has no effect [-Wunused-value]
   21 | #define DE(...) 0
      |                 ^
chessboard.cpp:91:2: note: in expansion of macro 'DE'
   91 |  DE(AI(cb));
      |  ^~

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 1388 KB Output is correct
2 Correct 8 ms 620 KB Output is correct
3 Correct 17 ms 1260 KB Output is correct
4 Correct 19 ms 1132 KB Output is correct
5 Correct 27 ms 1400 KB Output is correct
6 Correct 15 ms 1132 KB Output is correct
7 Correct 4 ms 492 KB Output is correct
8 Correct 20 ms 1132 KB Output is correct
9 Correct 38 ms 1388 KB Output is correct
10 Correct 22 ms 1388 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 16 ms 748 KB Output is correct
17 Correct 30 ms 1388 KB Output is correct
18 Correct 47 ms 1388 KB Output is correct
19 Correct 184 ms 1388 KB Output is correct
20 Correct 178 ms 1388 KB Output is correct
21 Correct 29 ms 1388 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 31 ms 1004 KB Output is correct
24 Correct 53 ms 1388 KB Output is correct
25 Correct 7 ms 492 KB Output is correct
26 Correct 27 ms 1260 KB Output is correct
27 Correct 40 ms 1388 KB Output is correct
28 Correct 45 ms 1388 KB Output is correct
29 Correct 12 ms 876 KB Output is correct
30 Correct 2 ms 364 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 1388 KB Output is correct
2 Correct 8 ms 620 KB Output is correct
3 Correct 17 ms 1260 KB Output is correct
4 Correct 19 ms 1132 KB Output is correct
5 Correct 27 ms 1400 KB Output is correct
6 Correct 15 ms 1132 KB Output is correct
7 Correct 4 ms 492 KB Output is correct
8 Correct 20 ms 1132 KB Output is correct
9 Correct 38 ms 1388 KB Output is correct
10 Correct 22 ms 1388 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 2 ms 364 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 16 ms 748 KB Output is correct
27 Correct 30 ms 1388 KB Output is correct
28 Correct 47 ms 1388 KB Output is correct
29 Correct 184 ms 1388 KB Output is correct
30 Correct 178 ms 1388 KB Output is correct
31 Correct 29 ms 1388 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 31 ms 1004 KB Output is correct
34 Correct 53 ms 1388 KB Output is correct
35 Correct 7 ms 492 KB Output is correct
36 Correct 27 ms 1260 KB Output is correct
37 Correct 40 ms 1388 KB Output is correct
38 Correct 45 ms 1388 KB Output is correct
39 Correct 12 ms 876 KB Output is correct
40 Correct 2 ms 364 KB Output is correct
41 Correct 142 ms 1388 KB Output is correct
42 Correct 49 ms 1388 KB Output is correct
43 Correct 83 ms 1388 KB Output is correct
44 Correct 48 ms 1388 KB Output is correct
45 Correct 40 ms 1388 KB Output is correct
46 Correct 157 ms 1396 KB Output is correct
47 Correct 57 ms 1388 KB Output is correct
48 Correct 77 ms 1388 KB Output is correct
49 Correct 44 ms 1388 KB Output is correct
50 Correct 694 ms 1516 KB Output is correct
51 Correct 747 ms 1516 KB Output is correct
52 Correct 693 ms 1520 KB Output is correct
53 Correct 749 ms 1516 KB Output is correct
54 Correct 683 ms 1388 KB Output is correct
55 Correct 769 ms 1508 KB Output is correct
56 Correct 663 ms 1644 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 26 ms 1388 KB Output is correct
10 Correct 8 ms 620 KB Output is correct
11 Correct 17 ms 1260 KB Output is correct
12 Correct 19 ms 1132 KB Output is correct
13 Correct 27 ms 1400 KB Output is correct
14 Correct 15 ms 1132 KB Output is correct
15 Correct 4 ms 492 KB Output is correct
16 Correct 20 ms 1132 KB Output is correct
17 Correct 38 ms 1388 KB Output is correct
18 Correct 22 ms 1388 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 2 ms 364 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 16 ms 748 KB Output is correct
35 Correct 30 ms 1388 KB Output is correct
36 Correct 47 ms 1388 KB Output is correct
37 Correct 184 ms 1388 KB Output is correct
38 Correct 178 ms 1388 KB Output is correct
39 Correct 29 ms 1388 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 31 ms 1004 KB Output is correct
42 Correct 53 ms 1388 KB Output is correct
43 Correct 7 ms 492 KB Output is correct
44 Correct 27 ms 1260 KB Output is correct
45 Correct 40 ms 1388 KB Output is correct
46 Correct 45 ms 1388 KB Output is correct
47 Correct 12 ms 876 KB Output is correct
48 Correct 2 ms 364 KB Output is correct
49 Correct 142 ms 1388 KB Output is correct
50 Correct 49 ms 1388 KB Output is correct
51 Correct 83 ms 1388 KB Output is correct
52 Correct 48 ms 1388 KB Output is correct
53 Correct 40 ms 1388 KB Output is correct
54 Correct 157 ms 1396 KB Output is correct
55 Correct 57 ms 1388 KB Output is correct
56 Correct 77 ms 1388 KB Output is correct
57 Correct 44 ms 1388 KB Output is correct
58 Correct 694 ms 1516 KB Output is correct
59 Correct 747 ms 1516 KB Output is correct
60 Correct 693 ms 1520 KB Output is correct
61 Correct 749 ms 1516 KB Output is correct
62 Correct 683 ms 1388 KB Output is correct
63 Correct 769 ms 1508 KB Output is correct
64 Correct 663 ms 1644 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 739 ms 2540 KB Output is correct
68 Correct 732 ms 2668 KB Output is correct
69 Correct 642 ms 2284 KB Output is correct
70 Correct 710 ms 2540 KB Output is correct
71 Correct 714 ms 2540 KB Output is correct
72 Correct 686 ms 2540 KB Output is correct
73 Correct 676 ms 2412 KB Output is correct
74 Correct 739 ms 2556 KB Output is correct
75 Correct 704 ms 2412 KB Output is correct
76 Correct 747 ms 2556 KB Output is correct
77 Correct 139 ms 2796 KB Output is correct
78 Correct 52 ms 2452 KB Output is correct
79 Correct 88 ms 2284 KB Output is correct
80 Correct 90 ms 2668 KB Output is correct
81 Correct 86 ms 2284 KB Output is correct
82 Correct 88 ms 2540 KB Output is correct
83 Correct 59 ms 2540 KB Output is correct
84 Correct 437 ms 2668 KB Output is correct
85 Correct 781 ms 2684 KB Output is correct
86 Correct 1 ms 364 KB Output is correct
87 Correct 1 ms 364 KB Output is correct
88 Correct 839 ms 2684 KB Output is correct
89 Correct 147 ms 748 KB Output is correct
90 Correct 1 ms 364 KB Output is correct