oj.uz

Submission #172750

# Submission time Handle Problem Language Result Execution time Memory
172750 2020-01-02T14:15:10 Z muhammad_hokimiyon Chessboard (IZhO18_chessboard) C++14
47 / 100
 173 ms 6844 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 = 2e5 + 7;
const int M = 23;
const int mod = 998244353;

ll n,k;
ll A[N];
ll B[N];
ll C[N];
ll D[N];

void solve1()
{
    cin >> n >> k;
    vector < int > 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 B1 = (nn + 1) / 2;
        ll B2 = nn / 2;
        B1 *= div[i] * div[i];
        B2 *= div[i] * div[i];
        B1 *= (nn + 1) / 2;
        B2 *= nn / 2;
        B1 += B2;
        ll B3 = (nn) / 2;
        ll B4 = (nn + 1) / 2;
        B3 *= div[i] * div[i];
        B4 *= div[i] * div[i];
        B3 *= (nn + 1) / 2;
        B4 *= (nn) / 2;
        B3 += B4;
        vector < ll > w(k , 0);
        vector < ll > b(k , 0);
        for( int j = 0; j < k; j++ ){
            //ll 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]);
            //ll y = (C[j] - A[j]) * (D[j] - B[j]);
            ll x = 0;
            ll y = 1;
            if( (A[j] - 1) / div[i] % 2 == 0 && (B[j] - 1) / div[i] % 2 == 0 ){
                x = 1;
            }
            if( (A[j] - 1) / div[i] % 2 == 1 && (B[j] - 1) / div[i] % 2 == 1 ){
                x = 1;
            }
            w[j] = y - x;
            b[j] = x;
        }
        ll x = 0;
        ll y = 0;
        //cout << B1 << " " << B3 << " ";
        for( int j = 0; j < k; j++ ){
            B1 -= b[j];
            x += 1 - b[j];
            y += b[j];
            B3 -= 1 - b[j];
        }
        //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 34 ms 4828 KB Output is correct
2 Correct 10 ms 1528 KB Output is correct
3 Correct 22 ms 3192 KB Output is correct
4 Correct 23 ms 3576 KB Output is correct
5 Correct 29 ms 4216 KB Output is correct
6 Correct 20 ms 2808 KB Output is correct
7 Correct 6 ms 888 KB Output is correct
8 Correct 21 ms 2784 KB Output is correct
9 Correct 49 ms 6776 KB Output is correct
10 Correct 28 ms 3960 KB Output is correct

Subtask #3
15.0 / 15.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 3 ms 380 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 504 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 248 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 3 ms 352 KB Output is correct
15 Correct 2 ms 376 KB Output is correct

Subtask #4
16.0 / 16.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 3 ms 380 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 504 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 248 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 3 ms 352 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 18 ms 2108 KB Output is correct
17 Correct 38 ms 5724 KB Output is correct
18 Correct 53 ms 6648 KB Output is correct
19 Correct 154 ms 6012 KB Output is correct
20 Correct 173 ms 6844 KB Output is correct
21 Correct 31 ms 5624 KB Output is correct
22 Correct 3 ms 380 KB Output is correct
23 Correct 33 ms 3108 KB Output is correct
24 Correct 49 ms 6092 KB Output is correct
25 Correct 9 ms 1016 KB Output is correct
26 Correct 36 ms 3964 KB Output is correct
27 Correct 44 ms 4728 KB Output is correct
28 Correct 48 ms 6428 KB Output is correct
29 Correct 16 ms 2424 KB Output is correct
30 Correct 4 ms 504 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 4828 KB Output is correct
2 Correct 10 ms 1528 KB Output is correct
3 Correct 22 ms 3192 KB Output is correct
4 Correct 23 ms 3576 KB Output is correct
5 Correct 29 ms 4216 KB Output is correct
6 Correct 20 ms 2808 KB Output is correct
7 Correct 6 ms 888 KB Output is correct
8 Correct 21 ms 2784 KB Output is correct
9 Correct 49 ms 6776 KB Output is correct
10 Correct 28 ms 3960 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 380 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 504 KB Output is correct
18 Correct 4 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 248 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 3 ms 352 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 18 ms 2108 KB Output is correct
27 Correct 38 ms 5724 KB Output is correct
28 Correct 53 ms 6648 KB Output is correct
29 Correct 154 ms 6012 KB Output is correct
30 Correct 173 ms 6844 KB Output is correct
31 Correct 31 ms 5624 KB Output is correct
32 Correct 3 ms 380 KB Output is correct
33 Correct 33 ms 3108 KB Output is correct
34 Correct 49 ms 6092 KB Output is correct
35 Correct 9 ms 1016 KB Output is correct
36 Correct 36 ms 3964 KB Output is correct
37 Correct 44 ms 4728 KB Output is correct
38 Correct 48 ms 6428 KB Output is correct
39 Correct 16 ms 2424 KB Output is correct
40 Correct 4 ms 504 KB Output is correct
41 Incorrect 134 ms 6296 KB Output isn't correct
42 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 34 ms 4828 KB Output is correct
10 Correct 10 ms 1528 KB Output is correct
11 Correct 22 ms 3192 KB Output is correct
12 Correct 23 ms 3576 KB Output is correct
13 Correct 29 ms 4216 KB Output is correct
14 Correct 20 ms 2808 KB Output is correct
15 Correct 6 ms 888 KB Output is correct
16 Correct 21 ms 2784 KB Output is correct
17 Correct 49 ms 6776 KB Output is correct
18 Correct 28 ms 3960 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 380 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 504 KB Output is correct
26 Correct 4 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 248 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 3 ms 376 KB Output is correct
32 Correct 3 ms 352 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 18 ms 2108 KB Output is correct
35 Correct 38 ms 5724 KB Output is correct
36 Correct 53 ms 6648 KB Output is correct
37 Correct 154 ms 6012 KB Output is correct
38 Correct 173 ms 6844 KB Output is correct
39 Correct 31 ms 5624 KB Output is correct
40 Correct 3 ms 380 KB Output is correct
41 Correct 33 ms 3108 KB Output is correct
42 Correct 49 ms 6092 KB Output is correct
43 Correct 9 ms 1016 KB Output is correct
44 Correct 36 ms 3964 KB Output is correct
45 Correct 44 ms 4728 KB Output is correct
46 Correct 48 ms 6428 KB Output is correct
47 Correct 16 ms 2424 KB Output is correct
48 Correct 4 ms 504 KB Output is correct
49 Incorrect 134 ms 6296 KB Output isn't correct
50 Halted 0 ms 0 KB -