oj.uz

답안 #495234

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
495234 2021-12-18T07:32:15 Z ergagan Chessboard (IZhO18_chessboard) C++17
16 / 100
 25 ms 316 KB 
//я так много думал, что опять попал
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define f first
#define s second
#define left(v) v + v
#define right(v) v + v + 1
#define ub upper_bound
#define lb lower_bound

using namespace std;
typedef long long ll;

//17 SEVENTEEN
const long double Pi = acos(-1.0);
const ll dx[] = {0,0,1,-1};
const ll dy[] = {1,-1,0,0};
const ll N = (ll) 1e6 + 17;
const ll M = (ll) 5e3 + 69;
const ll inf = (ll) 1e18 + 3;
const ll mod = (ll) 1e9 + 7;
ll sq(ll x) { return x * x; }

ll zxc = 1, cnt[5];

void solve() {
    ll n, k;
    cin >> n >> k;

    if(!k) {
        ll ans = (n / 2 * (n + 1) / 2) * 2;

        for(ll i = 2; i * i <= n; i++) {
            if(!(n % i)) {
                ans = min(ans, (i / 2 * (i + 1) / 2) * 2 * sq(n / i));
                ll j = n / i;
                ans = min(ans, (j / 2 * (j + 1) / 2) * 2 * sq(n / j));
            }
        }
        cout << ans;
        return;
    }

    while(k--) {
        ll x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        cnt[(x1 + y1) % 2]++;
    }
    ll x = (n + 1) / 2 * ((n + 1) / 2) + (n / 2) * (n / 2);
    cout << min(x - cnt[0] + cnt[1], (sq(n) - x) - cnt[1] + cnt[0]);
}

int main(/*Уверенно*/) {
ios_base::sync_with_stdio(0);
    cin.tie(0);
/*
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
*/
//    cin >> zxc;
    while(zxc--) {
        solve();
    }
  	return 0;
}
// さよならさ いかなくちゃ

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 204 KB Output is correct
2 Correct 5 ms 308 KB Output is correct
3 Correct 11 ms 312 KB Output is correct
4 Correct 11 ms 308 KB Output is correct
5 Correct 16 ms 304 KB Output is correct
6 Correct 10 ms 204 KB Output is correct
7 Correct 3 ms 204 KB Output is correct
8 Correct 10 ms 204 KB Output is correct
9 Correct 25 ms 288 KB Output is correct
10 Correct 14 ms 316 KB Output is correct

Subtask #3
0 / 15.0

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

Subtask #4
0 / 16.0

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

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 204 KB Output is correct
2 Correct 5 ms 308 KB Output is correct
3 Correct 11 ms 312 KB Output is correct
4 Correct 11 ms 308 KB Output is correct
5 Correct 16 ms 304 KB Output is correct
6 Correct 10 ms 204 KB Output is correct
7 Correct 3 ms 204 KB Output is correct
8 Correct 10 ms 204 KB Output is correct
9 Correct 25 ms 288 KB Output is correct
10 Correct 14 ms 316 KB Output is correct
11 Incorrect 1 ms 204 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 18 ms 204 KB Output is correct
10 Correct 5 ms 308 KB Output is correct
11 Correct 11 ms 312 KB Output is correct
12 Correct 11 ms 308 KB Output is correct
13 Correct 16 ms 304 KB Output is correct
14 Correct 10 ms 204 KB Output is correct
15 Correct 3 ms 204 KB Output is correct
16 Correct 10 ms 204 KB Output is correct
17 Correct 25 ms 288 KB Output is correct
18 Correct 14 ms 316 KB Output is correct
19 Incorrect 1 ms 204 KB Output isn't correct
20 Halted 0 ms 0 KB -