oj.uz

답안 #495038

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
495038 2021-12-18T03:40:13 Z mansur Chessboard (IZhO18_chessboard) C++14
16 / 100
 32 ms 2376 KB 
#include<bits/stdc++.h>	
 
/*
#pragma optimize ("g",on)
#pragma GCC optimize("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
*/

//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
#define int long long
 
const int inf = 1e9, N = 2e5 + 1, mod = 998244353;                    

vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

main() {                                                         
	//freopen("cowrect.in", "r", stdin);                                                                                     
	//freopen("cowrect.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                        
	cin.tie(NULL);
	int n, k;
	cin >> n >> k;
	int cnt0 = 0, cnt1 = 0;
	for (int i = 1; i <= k; i++) {
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		if (x1 % 2 == y1 % 2) {
			cnt0++;
		}else {
			cnt1++;
        }
	}
	if (k == 0) {
		int mn = inf;
		for (int val = 1; val < n; val++) {
			if (n % val) continue;
			int x = n * n / val / val;
			mn = min(mn, x / 2 * val * val);		
		}
		cout << mn;
	}else {
		cout << min(cnt0 + n * n / 2 - cnt1, cnt1 + n * n / 2 + 1 - cnt0);
	}
}

Compilation message

chessboard.cpp:36:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   36 | main() {
      | ^~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 368 KB Output is correct
2 Correct 6 ms 580 KB Output is correct
3 Correct 14 ms 1188 KB Output is correct
4 Correct 19 ms 1072 KB Output is correct
5 Correct 18 ms 1480 KB Output is correct
6 Correct 10 ms 1088 KB Output is correct
7 Correct 3 ms 444 KB Output is correct
8 Correct 12 ms 1088 KB Output is correct
9 Correct 32 ms 2376 KB Output is correct
10 Correct 24 ms 1444 KB Output is correct

Subtask #3
0 / 15.0

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

Subtask #4
0 / 16.0

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

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 368 KB Output is correct
2 Correct 6 ms 580 KB Output is correct
3 Correct 14 ms 1188 KB Output is correct
4 Correct 19 ms 1072 KB Output is correct
5 Correct 18 ms 1480 KB Output is correct
6 Correct 10 ms 1088 KB Output is correct
7 Correct 3 ms 444 KB Output is correct
8 Correct 12 ms 1088 KB Output is correct
9 Correct 32 ms 2376 KB Output is correct
10 Correct 24 ms 1444 KB Output is correct
11 Incorrect 0 ms 204 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 19 ms 368 KB Output is correct
10 Correct 6 ms 580 KB Output is correct
11 Correct 14 ms 1188 KB Output is correct
12 Correct 19 ms 1072 KB Output is correct
13 Correct 18 ms 1480 KB Output is correct
14 Correct 10 ms 1088 KB Output is correct
15 Correct 3 ms 444 KB Output is correct
16 Correct 12 ms 1088 KB Output is correct
17 Correct 32 ms 2376 KB Output is correct
18 Correct 24 ms 1444 KB Output is correct
19 Incorrect 0 ms 204 KB Output isn't correct
20 Halted 0 ms 0 KB -