oj.uz

답안 #155171

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
155171 2019-09-26T18:34:49 Z srvlt Chessboard (IZhO18_chessboard) C++14
47 / 100
 2000 ms 4984 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("sse2,avx")
#include <bits/stdc++.h>
#define ll long long
#define db long double
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
//#define int long long
using namespace std;
 
void dout() {
    cerr << endl;
}
 
template <typename Head, typename... Tail>
void dout(Head H, Tail... T) {
    cerr << H << ' ';
    dout(T...);
}
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 1e5 + 3;
const ll inf = 1e18;
 
int k, p[2][N], rx[N], ry[N], rx2[N], ry2[N];
ll n, ans = inf, A, Z, S, W, sq_A;
 
int color(int x, int y) {
    return ((x - 1) / A + (y - 1) / A + Z) & 1;
}
 
int num(int x) {
    return (x - 1) / A & 1;
}
 
ll getL() {
    int x = n / A;
    ll a = ((x + 1) >> 1LL) * sq_A;
    ll b = (x >> 1LL) * sq_A;
    ll res = ((x + 1) >> 1LL) * a + (x >> 1LL) * b;
    if (Z == 0) {
        return res;
    }   else {
        return n * n - res;
    }
}
 
ll getval(int x, int a, int b) {
    if (x < 1) {
        return 0;
    }
    ll res = 0;
    int q = (x - 1) / A;
    int last = q * A + 1;
    if (num(last) == 0) {
        res += (x - last + 1) * a;
    }   else {
        res += (x - last + 1) * b;
    }
    res += (((q + 1) >> 1LL) * a + (q >> 1LL) * b) * A;
    return res;
}
 
ll getans() {
    for (int i = 1; i <= n; i++) {
        p[0][i] = p[0][i - 1];
        p[1][i] = p[1][i - 1];
        if (color(i, 1)) {
            p[0][i]++;
        }   else {
            p[1][i]++;
        }
    }
    ll res = 0;
    for (int i = 0; i < k; i++) {
        int v1 = p[0][rx2[i]] - p[0][rx[i] - 1];
        int v2 = p[1][rx2[i]] - p[1][rx[i] - 1];
        res += getval(ry2[i], v1, v2) - getval(ry[i] - 1, v1, v2);
    }
    return res;
}
 
void solve(int tc) {
    cin >> n >> k;
    for (int i = 0; i < k; i++) {
        cin >> rx[i] >> ry[i] >> rx2[i] >> ry2[i];
        S += (ll)(rx2[i] - rx[i] + 1) * (ry2[i] - ry[i] + 1);
    }
    vector <int> factors = {};
    for (int i = 1; i < n; i++) {
        if (n % i == 0) {
            factors.pb(i);
        }
    }
    for (auto i : factors) {
        A = i;
        sq_A = A * A;
        for (int j = 0; j < 2; j++) {
            Z = j;
            W = getans();
            ans = min(ans, W + W + getL() - S);
        }
    }
    cout << ans;
}
 
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    int tc = 1;
//    cin >> tc;
    for (int i = 0; i < tc; i++) {
        solve(i);
//        cleanup();
    }
}

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 1784 KB Output is correct
2 Correct 11 ms 760 KB Output is correct
3 Correct 28 ms 2552 KB Output is correct
4 Correct 27 ms 2040 KB Output is correct
5 Correct 35 ms 2936 KB Output is correct
6 Correct 25 ms 2168 KB Output is correct
7 Correct 8 ms 888 KB Output is correct
8 Correct 24 ms 2040 KB Output is correct
9 Correct 62 ms 4136 KB Output is correct
10 Correct 33 ms 2652 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 436 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 436 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 24 ms 1272 KB Output is correct
17 Correct 43 ms 3064 KB Output is correct
18 Correct 79 ms 3600 KB Output is correct
19 Correct 383 ms 3248 KB Output is correct
20 Correct 424 ms 3452 KB Output is correct
21 Correct 42 ms 2936 KB Output is correct
22 Correct 4 ms 376 KB Output is correct
23 Correct 60 ms 1656 KB Output is correct
24 Correct 75 ms 3240 KB Output is correct
25 Correct 14 ms 632 KB Output is correct
26 Correct 46 ms 2168 KB Output is correct
27 Correct 76 ms 2584 KB Output is correct
28 Correct 78 ms 3452 KB Output is correct
29 Correct 18 ms 1400 KB Output is correct
30 Correct 4 ms 504 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 1784 KB Output is correct
2 Correct 11 ms 760 KB Output is correct
3 Correct 28 ms 2552 KB Output is correct
4 Correct 27 ms 2040 KB Output is correct
5 Correct 35 ms 2936 KB Output is correct
6 Correct 25 ms 2168 KB Output is correct
7 Correct 8 ms 888 KB Output is correct
8 Correct 24 ms 2040 KB Output is correct
9 Correct 62 ms 4136 KB Output is correct
10 Correct 33 ms 2652 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 3 ms 436 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 24 ms 1272 KB Output is correct
27 Correct 43 ms 3064 KB Output is correct
28 Correct 79 ms 3600 KB Output is correct
29 Correct 383 ms 3248 KB Output is correct
30 Correct 424 ms 3452 KB Output is correct
31 Correct 42 ms 2936 KB Output is correct
32 Correct 4 ms 376 KB Output is correct
33 Correct 60 ms 1656 KB Output is correct
34 Correct 75 ms 3240 KB Output is correct
35 Correct 14 ms 632 KB Output is correct
36 Correct 46 ms 2168 KB Output is correct
37 Correct 76 ms 2584 KB Output is correct
38 Correct 78 ms 3452 KB Output is correct
39 Correct 18 ms 1400 KB Output is correct
40 Correct 4 ms 504 KB Output is correct
41 Correct 387 ms 4460 KB Output is correct
42 Correct 93 ms 4984 KB Output is correct
43 Correct 203 ms 4488 KB Output is correct
44 Correct 91 ms 4856 KB Output is correct
45 Correct 61 ms 4984 KB Output is correct
46 Correct 424 ms 4896 KB Output is correct
47 Correct 55 ms 4600 KB Output is correct
48 Correct 148 ms 4640 KB Output is correct
49 Correct 84 ms 4472 KB Output is correct
50 Execution timed out 2003 ms 4728 KB Time limit exceeded
51 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 40 ms 1784 KB Output is correct
10 Correct 11 ms 760 KB Output is correct
11 Correct 28 ms 2552 KB Output is correct
12 Correct 27 ms 2040 KB Output is correct
13 Correct 35 ms 2936 KB Output is correct
14 Correct 25 ms 2168 KB Output is correct
15 Correct 8 ms 888 KB Output is correct
16 Correct 24 ms 2040 KB Output is correct
17 Correct 62 ms 4136 KB Output is correct
18 Correct 33 ms 2652 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 3 ms 436 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 24 ms 1272 KB Output is correct
35 Correct 43 ms 3064 KB Output is correct
36 Correct 79 ms 3600 KB Output is correct
37 Correct 383 ms 3248 KB Output is correct
38 Correct 424 ms 3452 KB Output is correct
39 Correct 42 ms 2936 KB Output is correct
40 Correct 4 ms 376 KB Output is correct
41 Correct 60 ms 1656 KB Output is correct
42 Correct 75 ms 3240 KB Output is correct
43 Correct 14 ms 632 KB Output is correct
44 Correct 46 ms 2168 KB Output is correct
45 Correct 76 ms 2584 KB Output is correct
46 Correct 78 ms 3452 KB Output is correct
47 Correct 18 ms 1400 KB Output is correct
48 Correct 4 ms 504 KB Output is correct
49 Correct 387 ms 4460 KB Output is correct
50 Correct 93 ms 4984 KB Output is correct
51 Correct 203 ms 4488 KB Output is correct
52 Correct 91 ms 4856 KB Output is correct
53 Correct 61 ms 4984 KB Output is correct
54 Correct 424 ms 4896 KB Output is correct
55 Correct 55 ms 4600 KB Output is correct
56 Correct 148 ms 4640 KB Output is correct
57 Correct 84 ms 4472 KB Output is correct
58 Execution timed out 2003 ms 4728 KB Time limit exceeded
59 Halted 0 ms 0 KB -