oj.uz

Submission #684194

# Submission time Handle Problem Language Result Execution time Memory
684194 2023-01-20T15:56:32 Z mychecksedad Chessboard (IZhO18_chessboard) C++17
16 / 100
 93 ms 2392 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define all(x) x.begin() x.end()
#define MOD (1e9+7)
const int N = 1e6;

ll n, k, ans = 1e18;
vector<array<int, 4>> vv;
void solve(){
	cin >> n >> k;
	int a = 0;
	for(int i = 0; i < k; ++i){
		int x1, x2, y1, y2; cin >> x1 >> y1 >> x2 >> y2;
		vv.pb({x1-1,y1-1,x2-1,y2-1});
	}
	for(ll i = 1; i < n; ++i){
		if(n % i == 0){
			for(int rep = 0; rep < 2; ++rep){
				ll c = 0;
				i *= 2;
				ll ii = i/2;
				for(auto v: vv){
					ll up = (v[0] + i - 1) / i * i - v[0];
					ll down = v[2] - (v[2] / i * i - 1);

					if(down == i) down = 0;
					
					if((v[0] + i - 1) / i * i > v[2]) up = v[2] - v[0] + 1, down = 0;
					
					ll left = (v[1] + i - 1) / i * i - v[1];
					ll right = v[3] - (v[3] / i * i - 1);
					
					if(right == i) right = 0;
					
					if((v[1] + i - 1) / i * i > v[3]) left = v[3] - v[1] + 1, right = 0;

					up -= 2 * (up % ii);
					down -= 2 * (down % ii);
					left -= 2 * (left % ii);
					right -= 2 * (right % ii);

					ll val = up * left - up * right + down * right - down * left;
					
					if(!rep) c -= val;
					else c += val;
					// cout << down << ' ' << up << ' ' << left << ' ' << right << '\n';
				}
				i /= 2;
				ans = min(ans, c + (rep ? (n/i)*(n/i)/2*i*i : ((n/i)*(n/i) + 1)/2*i*i));
			}

		}
	}
	cout << ans;
}

int main(){
	solve();
	return 0;
}

Compilation message

chessboard.cpp: In function 'void solve()':
chessboard.cpp:13:6: warning: unused variable 'a' [-Wunused-variable]
   13 |  int a = 0;
      |      ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory 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 1 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

# Verdict Execution time Memory Grader output
1 Correct 66 ms 1396 KB Output is correct
2 Correct 17 ms 848 KB Output is correct
3 Correct 44 ms 1428 KB Output is correct
4 Correct 45 ms 1348 KB Output is correct
5 Correct 61 ms 1400 KB Output is correct
6 Correct 39 ms 1320 KB Output is correct
7 Correct 8 ms 524 KB Output is correct
8 Correct 37 ms 1348 KB Output is correct
9 Correct 93 ms 2392 KB Output is correct
10 Correct 54 ms 1416 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 1396 KB Output is correct
2 Correct 17 ms 848 KB Output is correct
3 Correct 44 ms 1428 KB Output is correct
4 Correct 45 ms 1348 KB Output is correct
5 Correct 61 ms 1400 KB Output is correct
6 Correct 39 ms 1320 KB Output is correct
7 Correct 8 ms 524 KB Output is correct
8 Correct 37 ms 1348 KB Output is correct
9 Correct 93 ms 2392 KB Output is correct
10 Correct 54 ms 1416 KB Output is correct
11 Incorrect 1 ms 212 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory 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 1 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 66 ms 1396 KB Output is correct
10 Correct 17 ms 848 KB Output is correct
11 Correct 44 ms 1428 KB Output is correct
12 Correct 45 ms 1348 KB Output is correct
13 Correct 61 ms 1400 KB Output is correct
14 Correct 39 ms 1320 KB Output is correct
15 Correct 8 ms 524 KB Output is correct
16 Correct 37 ms 1348 KB Output is correct
17 Correct 93 ms 2392 KB Output is correct
18 Correct 54 ms 1416 KB Output is correct
19 Incorrect 1 ms 212 KB Output isn't correct
20 Halted 0 ms 0 KB -