oj.uz

Submission #43747

# Submission time Handle Problem Language Result Execution time Memory
43747 2018-03-22T03:44:24 Z nickyrio Chessboard (IZhO18_chessboard) C++14
70 / 100
 2000 ms 262144 KB 
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define DEBUG(x) { cerr << #x << '=' << x << endl; }
#define Arr(a, l, r) { cerr << #a << " = {"; FOR(_, l, r) cerr << ' ' << a[_]; cerr << "}\n"; }
#define N 1001000
#define pp pair<int, int>
#define endl '\n'
#define IO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define taskname ""
#define bit(S, i) (((S) >> (i)) & 1)
using namespace std;
long long n, k, xx1[N], xx2[N], xy1[N], xy2[N];

long long cal(int l, int color, int x1, int y1, int x2, int y2) {
    if (x2 < x1 || y2 < y1) return 0;
    int mx1 = (x1 - 1 + l) / l * l, mx2 = (x2 + 1) / l * l - 1;
    int my1 = (y1 - 1 + l) / l * l, my2 = (y2 + 1) / l * l - 1;
    if (x1 / l == x2 / l) {
        if (y1 / l == y2 / l) {
            if (color ^ (((x1 / l) % 2) == (y1 / l) % 2)) return - 1ll * (x2 - x1 + 1) * (y2 - y1 + 1);
            return 1ll * (x2 - x1 + 1) * (y2 - y1 + 1);
        }
        if (my1 == y1 && my2 == y2) {
            int sz = (y2 + 1 - y1) / l;
            if (sz % 2 == 0) return 0;
            if (color ^ (((x1 / l) % 2) == (y1 / l) % 2)) return - 1ll * (x2 - x1 + 1) * l;
            return 1ll * (x2 - x1 + 1) * l;;
        }
        return cal(l, color, x1, y1, x2, my1 - 1)
            +  cal(l, color, x1, my1, x2, my2)
            +  cal(l, color, x1, my2 + 1, x2, y2);
    }
    if (mx1 == x1 && mx2 == x2 && y1 == my1 && y2 == my2) {
        int sz = (y2 + 1 - y1) / l * (x2 + 1 - x1) / l;
        if (sz % 2 == 0) return 0;
        if (color ^ (((x1 / l) % 2) == (y1 / l) % 2)) return - 1ll * l * l;
        return l * l;    
    }
    return cal(l, color, x1, y1, mx1 - 1, y2)
        + cal(l, color, mx1, y1, mx2, y2) 
        + cal(l, color, mx2 + 1, y1, x2, y2);
}
long long solve(int l, int color) {// color = 0 -> Top-left is black
    long long ans = ((1ll * (n / l) * (n / l) + 1 - color) / 2) * l * l ;
    /*REP(i, k) {
        if (color ^ (((xx1[i] / l) % 2) == (xy1[i] / l) % 2)) ans--;
        else ans++;
    }*/
    REP(i, k) {
        ans += cal(l, color, xx1[i], xy1[i], xx2[i], xy2[i]);
    }
    return ans;
} 
int main() {
    #ifdef NERO
    freopen("test.inp","r",stdin);
    freopen("test.out","w",stdout);
    clock_t stime = clock();
    #endif //NERO
    IO;
    cin >> n >> k;
    long long ans = 1e10;
    REP(i, k) cin >> xx1[i] >> xy1[i] >> xx2[i] >> xy2[i];
    REP(i, k) xx1[i]--,xx2[i]--,xy1[i]--,xy2[i]--;
    FOR(i, 1, sqrt(n)) if (n % i == 0) {
        ans = min(ans, solve(i, 0));
        ans = min(ans, solve(i, 1));
        if (i != 1) ans = min(ans, solve(n / i, 0));
        if (i != 1) ans = min(ans, solve(n / i, 1));
    }
    cout << ans;
    #ifdef NERO
    clock_t etime = clock();
    cerr << "Execution time: " << (etime - stime) / CLOCKS_PER_SEC * 1000 << " ms.";
    #endif // NERO
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
3 Correct 2 ms 552 KB Output is correct
4 Correct 2 ms 552 KB Output is correct
5 Correct 2 ms 552 KB Output is correct
6 Correct 2 ms 608 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 2 ms 608 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2460 KB Output is correct
2 Correct 10 ms 2460 KB Output is correct
3 Correct 34 ms 2460 KB Output is correct
4 Correct 28 ms 2460 KB Output is correct
5 Correct 28 ms 2460 KB Output is correct
6 Correct 19 ms 2460 KB Output is correct
7 Correct 5 ms 2460 KB Output is correct
8 Correct 23 ms 2460 KB Output is correct
9 Correct 44 ms 3436 KB Output is correct
10 Correct 28 ms 3436 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3436 KB Output is correct
2 Correct 1 ms 3436 KB Output is correct
3 Correct 2 ms 3436 KB Output is correct
4 Correct 2 ms 3436 KB Output is correct
5 Correct 2 ms 3436 KB Output is correct
6 Correct 3 ms 3436 KB Output is correct
7 Correct 2 ms 3436 KB Output is correct
8 Correct 2 ms 3436 KB Output is correct
9 Correct 2 ms 3436 KB Output is correct
10 Correct 2 ms 3436 KB Output is correct
11 Correct 2 ms 3436 KB Output is correct
12 Correct 2 ms 3436 KB Output is correct
13 Correct 2 ms 3436 KB Output is correct
14 Correct 2 ms 3436 KB Output is correct
15 Correct 2 ms 3436 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3436 KB Output is correct
2 Correct 1 ms 3436 KB Output is correct
3 Correct 2 ms 3436 KB Output is correct
4 Correct 2 ms 3436 KB Output is correct
5 Correct 2 ms 3436 KB Output is correct
6 Correct 3 ms 3436 KB Output is correct
7 Correct 2 ms 3436 KB Output is correct
8 Correct 2 ms 3436 KB Output is correct
9 Correct 2 ms 3436 KB Output is correct
10 Correct 2 ms 3436 KB Output is correct
11 Correct 2 ms 3436 KB Output is correct
12 Correct 2 ms 3436 KB Output is correct
13 Correct 2 ms 3436 KB Output is correct
14 Correct 2 ms 3436 KB Output is correct
15 Correct 2 ms 3436 KB Output is correct
16 Correct 16 ms 3436 KB Output is correct
17 Correct 34 ms 3436 KB Output is correct
18 Correct 61 ms 3820 KB Output is correct
19 Correct 205 ms 3820 KB Output is correct
20 Correct 233 ms 3820 KB Output is correct
21 Correct 35 ms 3820 KB Output is correct
22 Correct 2 ms 3820 KB Output is correct
23 Correct 36 ms 3820 KB Output is correct
24 Correct 49 ms 3820 KB Output is correct
25 Correct 8 ms 3820 KB Output is correct
26 Correct 31 ms 3820 KB Output is correct
27 Correct 55 ms 3820 KB Output is correct
28 Correct 55 ms 3820 KB Output is correct
29 Correct 25 ms 3820 KB Output is correct
30 Correct 4 ms 3820 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2460 KB Output is correct
2 Correct 10 ms 2460 KB Output is correct
3 Correct 34 ms 2460 KB Output is correct
4 Correct 28 ms 2460 KB Output is correct
5 Correct 28 ms 2460 KB Output is correct
6 Correct 19 ms 2460 KB Output is correct
7 Correct 5 ms 2460 KB Output is correct
8 Correct 23 ms 2460 KB Output is correct
9 Correct 44 ms 3436 KB Output is correct
10 Correct 28 ms 3436 KB Output is correct
11 Correct 2 ms 3436 KB Output is correct
12 Correct 1 ms 3436 KB Output is correct
13 Correct 2 ms 3436 KB Output is correct
14 Correct 2 ms 3436 KB Output is correct
15 Correct 2 ms 3436 KB Output is correct
16 Correct 3 ms 3436 KB Output is correct
17 Correct 2 ms 3436 KB Output is correct
18 Correct 2 ms 3436 KB Output is correct
19 Correct 2 ms 3436 KB Output is correct
20 Correct 2 ms 3436 KB Output is correct
21 Correct 2 ms 3436 KB Output is correct
22 Correct 2 ms 3436 KB Output is correct
23 Correct 2 ms 3436 KB Output is correct
24 Correct 2 ms 3436 KB Output is correct
25 Correct 2 ms 3436 KB Output is correct
26 Correct 16 ms 3436 KB Output is correct
27 Correct 34 ms 3436 KB Output is correct
28 Correct 61 ms 3820 KB Output is correct
29 Correct 205 ms 3820 KB Output is correct
30 Correct 233 ms 3820 KB Output is correct
31 Correct 35 ms 3820 KB Output is correct
32 Correct 2 ms 3820 KB Output is correct
33 Correct 36 ms 3820 KB Output is correct
34 Correct 49 ms 3820 KB Output is correct
35 Correct 8 ms 3820 KB Output is correct
36 Correct 31 ms 3820 KB Output is correct
37 Correct 55 ms 3820 KB Output is correct
38 Correct 55 ms 3820 KB Output is correct
39 Correct 25 ms 3820 KB Output is correct
40 Correct 4 ms 3820 KB Output is correct
41 Correct 178 ms 3820 KB Output is correct
42 Correct 56 ms 3820 KB Output is correct
43 Correct 96 ms 3820 KB Output is correct
44 Correct 57 ms 3820 KB Output is correct
45 Correct 50 ms 3820 KB Output is correct
46 Correct 184 ms 3820 KB Output is correct
47 Correct 39 ms 3820 KB Output is correct
48 Correct 77 ms 3820 KB Output is correct
49 Correct 50 ms 3820 KB Output is correct
50 Correct 849 ms 3820 KB Output is correct
51 Correct 929 ms 3820 KB Output is correct
52 Correct 878 ms 3820 KB Output is correct
53 Correct 940 ms 3820 KB Output is correct
54 Correct 829 ms 3820 KB Output is correct
55 Correct 925 ms 3820 KB Output is correct
56 Correct 801 ms 3820 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
3 Correct 2 ms 552 KB Output is correct
4 Correct 2 ms 552 KB Output is correct
5 Correct 2 ms 552 KB Output is correct
6 Correct 2 ms 608 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 2 ms 608 KB Output is correct
9 Correct 31 ms 2460 KB Output is correct
10 Correct 10 ms 2460 KB Output is correct
11 Correct 34 ms 2460 KB Output is correct
12 Correct 28 ms 2460 KB Output is correct
13 Correct 28 ms 2460 KB Output is correct
14 Correct 19 ms 2460 KB Output is correct
15 Correct 5 ms 2460 KB Output is correct
16 Correct 23 ms 2460 KB Output is correct
17 Correct 44 ms 3436 KB Output is correct
18 Correct 28 ms 3436 KB Output is correct
19 Correct 2 ms 3436 KB Output is correct
20 Correct 1 ms 3436 KB Output is correct
21 Correct 2 ms 3436 KB Output is correct
22 Correct 2 ms 3436 KB Output is correct
23 Correct 2 ms 3436 KB Output is correct
24 Correct 3 ms 3436 KB Output is correct
25 Correct 2 ms 3436 KB Output is correct
26 Correct 2 ms 3436 KB Output is correct
27 Correct 2 ms 3436 KB Output is correct
28 Correct 2 ms 3436 KB Output is correct
29 Correct 2 ms 3436 KB Output is correct
30 Correct 2 ms 3436 KB Output is correct
31 Correct 2 ms 3436 KB Output is correct
32 Correct 2 ms 3436 KB Output is correct
33 Correct 2 ms 3436 KB Output is correct
34 Correct 16 ms 3436 KB Output is correct
35 Correct 34 ms 3436 KB Output is correct
36 Correct 61 ms 3820 KB Output is correct
37 Correct 205 ms 3820 KB Output is correct
38 Correct 233 ms 3820 KB Output is correct
39 Correct 35 ms 3820 KB Output is correct
40 Correct 2 ms 3820 KB Output is correct
41 Correct 36 ms 3820 KB Output is correct
42 Correct 49 ms 3820 KB Output is correct
43 Correct 8 ms 3820 KB Output is correct
44 Correct 31 ms 3820 KB Output is correct
45 Correct 55 ms 3820 KB Output is correct
46 Correct 55 ms 3820 KB Output is correct
47 Correct 25 ms 3820 KB Output is correct
48 Correct 4 ms 3820 KB Output is correct
49 Correct 178 ms 3820 KB Output is correct
50 Correct 56 ms 3820 KB Output is correct
51 Correct 96 ms 3820 KB Output is correct
52 Correct 57 ms 3820 KB Output is correct
53 Correct 50 ms 3820 KB Output is correct
54 Correct 184 ms 3820 KB Output is correct
55 Correct 39 ms 3820 KB Output is correct
56 Correct 77 ms 3820 KB Output is correct
57 Correct 50 ms 3820 KB Output is correct
58 Correct 849 ms 3820 KB Output is correct
59 Correct 929 ms 3820 KB Output is correct
60 Correct 878 ms 3820 KB Output is correct
61 Correct 940 ms 3820 KB Output is correct
62 Correct 829 ms 3820 KB Output is correct
63 Correct 925 ms 3820 KB Output is correct
64 Correct 801 ms 3820 KB Output is correct
65 Correct 1 ms 3820 KB Output is correct
66 Correct 2 ms 3820 KB Output is correct
67 Execution timed out 2118 ms 262144 KB Time limit exceeded
68 Halted 0 ms 0 KB -