oj.uz

답안 #685330

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
685330 2023-01-24T04:44:52 Z dostigator Chessboard (IZhO18_chessboard) C++17
39 / 100
 76 ms 9268 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(a) a.begin(),a.end()
#define pb push_back
#define vt vector
#define endl '\n'
#define Y second
#define X first
typedef long long ll;
typedef long double ld;
const ll mod=1e9+7;
const ll INF=1e18;
const int inf=1e9;
const int N=2e5+505;
const int M=3e3+10;
const int dx[]={0,0,1,-1};
const int dy[]={1,-1,0,0};

/*From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH*/

int n,k,used[3000][3000];
pair<int,int>vls[N];

void solve(){
	cin>>n>>k;
	for(int i=1; i<=k; ++i){
		int x1,y1,x2,y2;
		cin>>x1>>y1>>x2>>y2;
		used[x1][y1]++;
		vls[i]={x1,y1};
	}vt<int>lst;
	for(int d=1; d*d<=n; ++d){
		if(n%d==0){
			lst.pb(d);
			if(n/d!=d)lst.pb(n/d);
		}
	}int ans=inf;
	for(int del:lst){
		int heh=n/del;
		heh*=heh;
		int cnt=heh-(heh/2),cnt2=heh/2;
		cnt*=del*del;
		cnt2*=del*del;
		//cout<<del<<' '<<cnt<<' '<<cnt2<<endl;
		for(int i=1; i<=k; ++i){
			int x,y;
			x=vls[i].X;
			y=vls[i].Y;
			x=(x+(del-1))/del;
			y=(y+(del-1))/del;
			if(((x+y)%2)==0) {
				cnt--;
				cnt2++;
			}else{
				cnt++;
				cnt2--;
			}
		}if(del==n){
			ans=min(ans,cnt);
			continue;
		}
		ans=min({ans,cnt,cnt2});
		//cout<<del<<' '<<cnt<<' '<<cnt2<<endl;
	}cout<<ans<<endl;
}

int main(){
	//srand(time(0));
	//freopen("hotel.in","r",stdin);
	//freopen("hotel.out","w",stdout);
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int tt=1,lolol=0;
//	cin>>tt;
	while(tt--) {
		//cout<<"Case "<<++lolol<<": ";
		solve();
	}
}

Compilation message

chessboard.cpp: In function 'int main()':
chessboard.cpp:80:11: warning: unused variable 'lolol' [-Wunused-variable]
   80 |  int tt=1,lolol=0;
      |           ^~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 328 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 328 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 584 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 584 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 468 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 584 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 584 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 12 ms 7636 KB Output is correct
17 Correct 28 ms 8824 KB Output is correct
18 Correct 38 ms 8932 KB Output is correct
19 Correct 64 ms 8448 KB Output is correct
20 Correct 76 ms 8556 KB Output is correct
21 Correct 41 ms 8776 KB Output is correct
22 Correct 1 ms 1876 KB Output is correct
23 Correct 21 ms 8032 KB Output is correct
24 Correct 33 ms 8824 KB Output is correct
25 Correct 6 ms 7124 KB Output is correct
26 Correct 21 ms 8016 KB Output is correct
27 Correct 31 ms 9268 KB Output is correct
28 Correct 31 ms 8512 KB Output is correct
29 Correct 13 ms 8276 KB Output is correct
30 Correct 5 ms 5460 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 328 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Runtime error 1 ms 468 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -