oj.uz

Submission #172832

# Submission time Handle Problem Language Result Execution time Memory
172832 2020-01-02T16:36:28 Z muhammad_hokimiyon Chessboard (IZhO18_chessboard) C++17
47 / 100
 2000 ms 4424 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")

#define fi first
#define se second
#define ll long long

using namespace std;

const int N = 1e5 + 7;
const int M = 23;
const int mod = 998244353;

ll n,k;
int A[N];
int B[N];
int C[N];
int D[N];
ll x1, y2, a, b;

ll f( int x , int y , ll div )
{
    x1 = y / div;
    y2 = x / div;
    x1 = x1 * y2 + 1;
    x1 /= 2;
    x1 *= div * div;
    a = y % div;
    b = x % div;
    if( ((y - 1) / div % 2 == 0 && div > 1) ){
        x1 += ((x / div + 1) / 2) * div * a;
    }else{
        x1 += x / div / 2 * div * a;
    }
    if( ((x - 1) / div % 2 == 0) ){
        x1 += (y / div + 1) / 2 * div * b;
    }else{
        x1 += y / div / 2 * div * b;
    }
    if( ((x - 1) / div % 2 == 1 && (y - 1) / div % 2 == 1) || ((x - 1) / div % 2 == 0 && (y - 1) / div % 2 == 0) ){
        x1 += (x % div) * (y % div);
    }
    //cout << x << " " << y << " " << div << " " << x1 << " " << fg[x][y] << "\n";
    return x1;
}

void solve1()
{
    cin >> n >> k;
    vector < ll > div;
    for( int i = 1; i < n; i++ ){
        if( n % i == 0 )div.push_back(i);
    }
    for( int i = 0; i < k; i++ ){
        cin >> A[i] >> B[i] >> C[i] >> D[i];
    }
    ll ans = 1e14;
    for( int i = 0; i < (int)div.size(); i++ ){
        ll nn = n / div[i];
        ll fg = div[i] * div[i];
        ll B1 = (nn + 1) / 2;
        ll B2 = nn / 2;
        B1 *= fg;
        B2 *= fg;
        B1 *= (nn + 1) / 2;
        B2 *= nn / 2;
        B1 += B2;
        ll B3 = (nn) / 2;
        ll B4 = (nn + 1) / 2;
        B3 *= fg;
        B4 *= fg;
        B3 *= (nn + 1) / 2;
        B4 *= (nn) / 2;
        B3 += B4;
        vector < ll > w(k , 0);
        vector < ll > b(k , 0);
        ll x, y;
        for( int j = 0; j < k; j++ ){
            x = f(C[j] , D[j] , div[i]) - f(C[j] , B[j] - 1 , div[i]) -
            f(A[j] - 1, D[j] , div[i]) + f(A[j] - 1 , B[j] - 1 , div[i]);
            y = (C[j] - A[j] + 1) * (D[j] - B[j] + 1);
            w[j] = y - x;
            b[j] = x;
        }
        x = 0;
        y = 0;
        //cout << B1 << " " << B3 << "\n";
        for( int j = 0; j < k; j++ ){
            B1 -= b[j];
            x += w[j];
            y += b[j];
            B3 -= w[j];
            //if( div[i] == 1 )cout << b[j] << " ";
        }
        //cout << "\n";
        //cout << B1 + x << " " << B3 + y << " " << div[i] << "\n";
        ans = min(ans , B1 + x);
        ans = min(ans , B3 + y);
    }
    cout << ans;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    //freopen( "input.txt" , "r" , stdin );
    //freopen( "output.txt" , "w" , stdout );

    int cghf = 1;//cin >> cghf;
    while( cghf-- ){
        solve1();
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory 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 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

# Verdict Execution time Memory Grader output
1 Correct 45 ms 3064 KB Output is correct
2 Correct 13 ms 1276 KB Output is correct
3 Correct 30 ms 2228 KB Output is correct
4 Correct 34 ms 2424 KB Output is correct
5 Correct 40 ms 2680 KB Output is correct
6 Correct 26 ms 2040 KB Output is correct
7 Correct 7 ms 760 KB Output is correct
8 Correct 26 ms 2040 KB Output is correct
9 Correct 65 ms 3800 KB Output is correct
10 Correct 37 ms 2552 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 2 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 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 380 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 1 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 4 ms 376 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

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 2 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 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 380 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 1 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 33 ms 1808 KB Output is correct
17 Correct 52 ms 3192 KB Output is correct
18 Correct 111 ms 4088 KB Output is correct
19 Correct 641 ms 3808 KB Output is correct
20 Correct 719 ms 4152 KB Output is correct
21 Correct 53 ms 3576 KB Output is correct
22 Correct 4 ms 376 KB Output is correct
23 Correct 92 ms 2348 KB Output is correct
24 Correct 102 ms 3948 KB Output is correct
25 Correct 20 ms 816 KB Output is correct
26 Correct 65 ms 2808 KB Output is correct
27 Correct 113 ms 3260 KB Output is correct
28 Correct 105 ms 4012 KB Output is correct
29 Correct 23 ms 1916 KB Output is correct
30 Correct 5 ms 476 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 3064 KB Output is correct
2 Correct 13 ms 1276 KB Output is correct
3 Correct 30 ms 2228 KB Output is correct
4 Correct 34 ms 2424 KB Output is correct
5 Correct 40 ms 2680 KB Output is correct
6 Correct 26 ms 2040 KB Output is correct
7 Correct 7 ms 760 KB Output is correct
8 Correct 26 ms 2040 KB Output is correct
9 Correct 65 ms 3800 KB Output is correct
10 Correct 37 ms 2552 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 372 KB Output is correct
13 Correct 2 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 3 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 380 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 1 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 4 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 33 ms 1808 KB Output is correct
27 Correct 52 ms 3192 KB Output is correct
28 Correct 111 ms 4088 KB Output is correct
29 Correct 641 ms 3808 KB Output is correct
30 Correct 719 ms 4152 KB Output is correct
31 Correct 53 ms 3576 KB Output is correct
32 Correct 4 ms 376 KB Output is correct
33 Correct 92 ms 2348 KB Output is correct
34 Correct 102 ms 3948 KB Output is correct
35 Correct 20 ms 816 KB Output is correct
36 Correct 65 ms 2808 KB Output is correct
37 Correct 113 ms 3260 KB Output is correct
38 Correct 105 ms 4012 KB Output is correct
39 Correct 23 ms 1916 KB Output is correct
40 Correct 5 ms 476 KB Output is correct
41 Correct 522 ms 3804 KB Output is correct
42 Correct 115 ms 3996 KB Output is correct
43 Correct 280 ms 3760 KB Output is correct
44 Correct 112 ms 4024 KB Output is correct
45 Correct 68 ms 4424 KB Output is correct
46 Correct 591 ms 3996 KB Output is correct
47 Correct 61 ms 3608 KB Output is correct
48 Correct 198 ms 3612 KB Output is correct
49 Correct 104 ms 3548 KB Output is correct
50 Execution timed out 2008 ms 3968 KB Time limit exceeded
51 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory 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 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 45 ms 3064 KB Output is correct
10 Correct 13 ms 1276 KB Output is correct
11 Correct 30 ms 2228 KB Output is correct
12 Correct 34 ms 2424 KB Output is correct
13 Correct 40 ms 2680 KB Output is correct
14 Correct 26 ms 2040 KB Output is correct
15 Correct 7 ms 760 KB Output is correct
16 Correct 26 ms 2040 KB Output is correct
17 Correct 65 ms 3800 KB Output is correct
18 Correct 37 ms 2552 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 2 ms 372 KB Output is correct
21 Correct 2 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 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 380 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 1 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 4 ms 376 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 33 ms 1808 KB Output is correct
35 Correct 52 ms 3192 KB Output is correct
36 Correct 111 ms 4088 KB Output is correct
37 Correct 641 ms 3808 KB Output is correct
38 Correct 719 ms 4152 KB Output is correct
39 Correct 53 ms 3576 KB Output is correct
40 Correct 4 ms 376 KB Output is correct
41 Correct 92 ms 2348 KB Output is correct
42 Correct 102 ms 3948 KB Output is correct
43 Correct 20 ms 816 KB Output is correct
44 Correct 65 ms 2808 KB Output is correct
45 Correct 113 ms 3260 KB Output is correct
46 Correct 105 ms 4012 KB Output is correct
47 Correct 23 ms 1916 KB Output is correct
48 Correct 5 ms 476 KB Output is correct
49 Correct 522 ms 3804 KB Output is correct
50 Correct 115 ms 3996 KB Output is correct
51 Correct 280 ms 3760 KB Output is correct
52 Correct 112 ms 4024 KB Output is correct
53 Correct 68 ms 4424 KB Output is correct
54 Correct 591 ms 3996 KB Output is correct
55 Correct 61 ms 3608 KB Output is correct
56 Correct 198 ms 3612 KB Output is correct
57 Correct 104 ms 3548 KB Output is correct
58 Execution timed out 2008 ms 3968 KB Time limit exceeded
59 Halted 0 ms 0 KB -