oj.uz

답안 #155160

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
155160 2019-09-26T17:39:52 Z srvlt Chessboard (IZhO18_chessboard) C++14
47 / 100
 2000 ms 5220 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;

struct rect {
    int x = 0, y = 0, x2 = 0, y2 = 0;
};

int k, p[2][N];
ll n, ans = inf, A, Z, S, W, B, L;
vector <rect> v;

int color(int x, int y) {
    int z = (x - 1) / A;
    int w = (y - 1) / A;
    return ((z + w + Z) & 1);
}

int num(int x) {
    int z = (x - 1) / A;
    return (z & 1);
}

ll getL() {
    int x = n / A;
    ll a = ((x + 1) / 2) * A * A;
    ll b = (x / 2) * A * A;
    ll res = ((x + 1) / 2) * a + (x / 2) * 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 last = ((x - 1) / A) * A + 1;
    if (num(last) == 0) {
        res += (x - last + 1) * a;
    }   else {
        res += (x - last + 1) * b;
    }
    int q = (last - 1) / A;
    res += ((q + 1) / 2) * A * a;
    res += (q / 2) * A * b;
    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 (auto i : v) {
        int x = i.x, y = i.y, x2 = i.x2, y2 = i.y2;
        int v1 = p[0][x2] - p[0][x - 1];
        int v2 = p[1][x2] - p[1][x - 1];
        res += getval(y2, v1, v2) - getval(y - 1, v1, v2);
    }
    return res;
}

void solve(int tc) {
    cin >> n >> k;
    for (int i = 0; i < k; i++) {
        rect tmp;
        cin >> tmp.x >> tmp.y >> tmp.x2 >> tmp.y2;
        S += (ll)(tmp.x2 - tmp.x + 1) * (tmp.y2 - tmp.y + 1);
        v.pb(tmp);
    }
    vector <int> factors = {};
    for (int i = 1; i < n; i++) {
        if (n % i == 0) {
            factors.pb(i);
        }
    }
    for (auto i : factors) {
        A = i;
        for (int j = 0; j < 2; j++) {
            Z = j;
            L = getL();
            W = getans();
            B = L - (S - W);
            ans = min(ans, W + B);
        }
    }
    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 376 KB Output is correct
6 Correct 2 ms 380 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 48 ms 3436 KB Output is correct
2 Correct 13 ms 1400 KB Output is correct
3 Correct 30 ms 2672 KB Output is correct
4 Correct 29 ms 2292 KB Output is correct
5 Correct 40 ms 3052 KB Output is correct
6 Correct 27 ms 2292 KB Output is correct
7 Correct 8 ms 888 KB Output is correct
8 Correct 28 ms 2472 KB Output is correct
9 Correct 61 ms 4208 KB Output is correct
10 Correct 35 ms 2796 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 3 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 3 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 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 3 ms 432 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 396 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 3 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 3 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 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 3 ms 432 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 396 KB Output is correct
16 Correct 25 ms 1400 KB Output is correct
17 Correct 46 ms 3952 KB Output is correct
18 Correct 87 ms 3824 KB Output is correct
19 Correct 413 ms 3948 KB Output is correct
20 Correct 459 ms 3824 KB Output is correct
21 Correct 45 ms 3824 KB Output is correct
22 Correct 4 ms 376 KB Output is correct
23 Correct 66 ms 2292 KB Output is correct
24 Correct 81 ms 3824 KB Output is correct
25 Correct 15 ms 888 KB Output is correct
26 Correct 49 ms 2324 KB Output is correct
27 Correct 82 ms 3696 KB Output is correct
28 Correct 84 ms 3796 KB Output is correct
29 Correct 20 ms 2036 KB Output is correct
30 Correct 5 ms 504 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 3436 KB Output is correct
2 Correct 13 ms 1400 KB Output is correct
3 Correct 30 ms 2672 KB Output is correct
4 Correct 29 ms 2292 KB Output is correct
5 Correct 40 ms 3052 KB Output is correct
6 Correct 27 ms 2292 KB Output is correct
7 Correct 8 ms 888 KB Output is correct
8 Correct 28 ms 2472 KB Output is correct
9 Correct 61 ms 4208 KB Output is correct
10 Correct 35 ms 2796 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 3 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 3 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 2 ms 380 KB Output is correct
23 Correct 3 ms 432 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 396 KB Output is correct
26 Correct 25 ms 1400 KB Output is correct
27 Correct 46 ms 3952 KB Output is correct
28 Correct 87 ms 3824 KB Output is correct
29 Correct 413 ms 3948 KB Output is correct
30 Correct 459 ms 3824 KB Output is correct
31 Correct 45 ms 3824 KB Output is correct
32 Correct 4 ms 376 KB Output is correct
33 Correct 66 ms 2292 KB Output is correct
34 Correct 81 ms 3824 KB Output is correct
35 Correct 15 ms 888 KB Output is correct
36 Correct 49 ms 2324 KB Output is correct
37 Correct 82 ms 3696 KB Output is correct
38 Correct 84 ms 3796 KB Output is correct
39 Correct 20 ms 2036 KB Output is correct
40 Correct 5 ms 504 KB Output is correct
41 Correct 410 ms 4712 KB Output is correct
42 Correct 98 ms 4972 KB Output is correct
43 Correct 218 ms 4604 KB Output is correct
44 Correct 96 ms 4840 KB Output is correct
45 Correct 68 ms 5220 KB Output is correct
46 Correct 464 ms 4968 KB Output is correct
47 Correct 54 ms 4716 KB Output is correct
48 Correct 161 ms 4852 KB Output is correct
49 Correct 96 ms 4712 KB Output is correct
50 Execution timed out 2058 ms 4788 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 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 48 ms 3436 KB Output is correct
10 Correct 13 ms 1400 KB Output is correct
11 Correct 30 ms 2672 KB Output is correct
12 Correct 29 ms 2292 KB Output is correct
13 Correct 40 ms 3052 KB Output is correct
14 Correct 27 ms 2292 KB Output is correct
15 Correct 8 ms 888 KB Output is correct
16 Correct 28 ms 2472 KB Output is correct
17 Correct 61 ms 4208 KB Output is correct
18 Correct 35 ms 2796 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 4 ms 376 KB Output is correct
23 Correct 3 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 3 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 380 KB Output is correct
31 Correct 3 ms 432 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 3 ms 396 KB Output is correct
34 Correct 25 ms 1400 KB Output is correct
35 Correct 46 ms 3952 KB Output is correct
36 Correct 87 ms 3824 KB Output is correct
37 Correct 413 ms 3948 KB Output is correct
38 Correct 459 ms 3824 KB Output is correct
39 Correct 45 ms 3824 KB Output is correct
40 Correct 4 ms 376 KB Output is correct
41 Correct 66 ms 2292 KB Output is correct
42 Correct 81 ms 3824 KB Output is correct
43 Correct 15 ms 888 KB Output is correct
44 Correct 49 ms 2324 KB Output is correct
45 Correct 82 ms 3696 KB Output is correct
46 Correct 84 ms 3796 KB Output is correct
47 Correct 20 ms 2036 KB Output is correct
48 Correct 5 ms 504 KB Output is correct
49 Correct 410 ms 4712 KB Output is correct
50 Correct 98 ms 4972 KB Output is correct
51 Correct 218 ms 4604 KB Output is correct
52 Correct 96 ms 4840 KB Output is correct
53 Correct 68 ms 5220 KB Output is correct
54 Correct 464 ms 4968 KB Output is correct
55 Correct 54 ms 4716 KB Output is correct
56 Correct 161 ms 4852 KB Output is correct
57 Correct 96 ms 4712 KB Output is correct
58 Execution timed out 2058 ms 4788 KB Time limit exceeded
59 Halted 0 ms 0 KB -