oj.uz

Submission #43886

# Submission time Handle Problem Language Result Execution time Memory
43886 2018-03-27T06:23:12 Z Tenuun Chessboard (IZhO18_chessboard) C++17
39 / 100
 197 ms 1296 KB 
#include<bits/stdc++.h>

using namespace std;

int main(){
	int n, k, x, y, x1, y1, res=INT_MAX;
	cin >> n >> k;
	vector<int>fac;
	map<int, int>map;
	for(int i=1; i<n; i++){
		if(n%i==0){
			fac.push_back(i);
		}
	}
	if(k==0){
		int res=(n*n)/2;
		int i=fac.size()-1;
		for(int i=fac.size()-1; i>=0; i--){
			if((n/fac[i])%2){	
				res=(n*n-fac[i]*fac[i])/2;	
				cout << res; return 0;
			}
		}
		cout << res;
		return 0;
	}
	for(int j=0; j<k; j++){
		cin >> x >> y >> x1 >> y1;
		for(int i=0; i<fac.size(); i++){
			if((x%(2*fac[i])>=1 && x%(2*fac[i])<=fac[i] && y%(2*fac[i])<=fac[i]&&y%(2*fac[i])>=1) ||((x%(2*fac[i])==0 || x%(2*fac[i])>fac[i]) && (y%(2*fac[i])>fac[i]||y%(2*fac[i])==0)) )map[i+1]++;
		}
	}
	int i=0;
	for (auto it=map.begin(); it!=map.end(); ++it){
		int res1, res2;
		i=it->first-1;
		//cout << it->first << it->second << endl;
		if(n/fac[i]%2){	
			res1=(n*n-fac[i]*fac[i])/2+fac[i]*fac[i]-it->second+k-it->second;
			res2=it->second+(n*n-fac[i]*fac[i])/2-(k-it->second);
			res2=n*n-res1;
			//cout << it->second << " " << res1 << " " << res2 << endl;	
		}
		else{
			res1=(n*n)/2-it->second+k-it->second;
			res2=n*n-res1;
		}
		res=min(res, res1);
		res=min(res, res2);
		i++;
	}
	cout << res;
    return 0;
}

Compilation message

chessboard.cpp: In function 'int main()':
chessboard.cpp:17:7: warning: unused variable 'i' [-Wunused-variable]
   int i=fac.size()-1;
       ^
chessboard.cpp:29:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0; i<fac.size(); i++){
                ~^~~~~~~~~~~

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 440 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 2 ms 440 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 564 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1120 KB Output is correct
2 Correct 2 ms 1192 KB Output is correct
3 Correct 2 ms 1192 KB Output is correct
4 Correct 3 ms 1192 KB Output is correct
5 Correct 2 ms 1256 KB Output is correct
6 Correct 2 ms 1256 KB Output is correct
7 Correct 3 ms 1256 KB Output is correct
8 Correct 2 ms 1256 KB Output is correct
9 Correct 2 ms 1256 KB Output is correct
10 Correct 2 ms 1276 KB Output is correct
11 Correct 2 ms 1276 KB Output is correct
12 Correct 2 ms 1276 KB Output is correct
13 Correct 3 ms 1276 KB Output is correct
14 Correct 3 ms 1276 KB Output is correct
15 Correct 3 ms 1276 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1120 KB Output is correct
2 Correct 2 ms 1192 KB Output is correct
3 Correct 2 ms 1192 KB Output is correct
4 Correct 3 ms 1192 KB Output is correct
5 Correct 2 ms 1256 KB Output is correct
6 Correct 2 ms 1256 KB Output is correct
7 Correct 3 ms 1256 KB Output is correct
8 Correct 2 ms 1256 KB Output is correct
9 Correct 2 ms 1256 KB Output is correct
10 Correct 2 ms 1276 KB Output is correct
11 Correct 2 ms 1276 KB Output is correct
12 Correct 2 ms 1276 KB Output is correct
13 Correct 3 ms 1276 KB Output is correct
14 Correct 3 ms 1276 KB Output is correct
15 Correct 3 ms 1276 KB Output is correct
16 Correct 33 ms 1276 KB Output is correct
17 Correct 95 ms 1276 KB Output is correct
18 Correct 120 ms 1276 KB Output is correct
19 Correct 181 ms 1276 KB Output is correct
20 Correct 197 ms 1276 KB Output is correct
21 Correct 93 ms 1276 KB Output is correct
22 Correct 3 ms 1276 KB Output is correct
23 Correct 61 ms 1276 KB Output is correct
24 Correct 104 ms 1276 KB Output is correct
25 Correct 13 ms 1296 KB Output is correct
26 Correct 72 ms 1296 KB Output is correct
27 Correct 83 ms 1296 KB Output is correct
28 Correct 145 ms 1296 KB Output is correct
29 Correct 40 ms 1296 KB Output is correct
30 Correct 5 ms 1296 KB Output is correct

Subtask #5
0 / 23.0

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

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 440 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 2 ms 440 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 564 KB Output is correct
9 Incorrect 95 ms 1120 KB Output isn't correct
10 Halted 0 ms 0 KB -