제출 #378532

#제출 시각아이디문제언어결과실행 시간메모리
378532rk42745417Chessboard (IZhO18_chessboard)C++17
8 / 100
32 ms620 KiB
#include <bits/stdc++.h> using namespace std; using ll = int64_t; using ull = uint64_t; using uint = uint32_t; using ld = long double; const int MOD = 1e9 + 7; const int INF = 0x3f3f3f3f; const ll LINF = 2e18; const double EPS = 1e-9; #define EMT ios::sync_with_stdio(0); cin.tie(0); bool prime_test(int n) { for(int i = 2; i < n; i++) if(n % i == 0) return false; return true; } void solve(int n) { int k; cin >> k; } void solve_2(int n) { int cnt[2] = {0}, k; cin >> k; for(int i = 0, a, b, c, d; i < k; i++) { cin >> a >> b >> c >> d; cnt[(a + b) % 2]++; } ll a = 1LL * n * n / 2, b = 1LL * n * n - a; cout << min(cnt[1] + b - cnt[0], cnt[0] + a - cnt[1]) << '\n'; } signed main() { EMT int n; cin >> n; if(prime_test(n)) solve_2(n); else solve(n); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...