oj.uz

답안 #334477

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
334477 2020-12-09T08:01:15 Z amunduzbaev Chessboard (IZhO18_chessboard) C++14
0 / 100
 25 ms 1008 KB 
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long 
#define ld long double 
#define pii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define prc(n) fixed << setprecision(n)
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1);
const int inf = 1e9+7;
const int N = 1;

vector<pii>vv;
ll ans, n, k;
 
void check(ll size){
	ll rem1 = ((n/size) * (n/size) +1)/2ll * size * size, er1 = 0;
	for(int i=0;i<sz(vv);i++){
		ll x = vv[i].ff / size, y = vv[i].ss / size;
		if((x + y) %2 == 0) rem1--;
		else er1++;
	}
	ans = min(ans, er1 + rem1);
	
	rem1 = ((n/size)* (n/size))/2ll * size * size, er1 = 0;
	for(int i=0;i<sz(vv);i++){
		ll x = vv[i].ff / size, y = vv[i].ss / size;
		if((x + y) % 2) rem1--;
		else er1++;
	}
	ans = min(ans, er1 + rem1);
}
 
void solve(){
	fastios
	ans = inf * inf;
	cin>>n>>k;
	for(int i=0;i<k;i++){
		ll a, b, c, d;
		cin>>a>>b>>c>>d;
		vv.pb({--a, --b});
	}
	check(1);
	for(ll i=2;i *1ll * i<=n;i++){
		if(n % i == 0){
			check(i);
			check(n/i);
		}
	}
	cout<<ans<<"\n";
	return;
}
/*
 
6 8
1 2 1 2
2 1 2 1
3 3 3 3
3 4 3 4
4 3 4 3
4 4 4 4
3 6 3 6
5 5 5 5
 
*/
int main(){
	fastios
	int t = 1;
	//cin>>t;
	while(t--) solve();
	return 0;
}

Compilation message

chessboard.cpp: In function 'void solve()':
chessboard.cpp:44:12: warning: integer overflow in expression of type 'int' results in '-371520463' [-Woverflow]
   44 |  ans = inf * inf;
      |        ~~~~^~~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 1008 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 1008 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -