oj.uz

답안 #172803

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
172803 2020-01-02T16:18:19 Z muhammad_hokimiyon Chessboard (IZhO18_chessboard) C++14
47 / 100
 2000 ms 7416 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];
ll fg[M][M];

ll f( ll x , ll y , ll div )
{
    ll x1 = y / div;
    ll y1 = x / div;
    x1 = x1 * y1 + 1;
    x1 /= 2;
    x1 *= div * div;
    ll a = y % div;
    ll b = x % div;
    if( ((y - 1) / div % 2 == 0 && 1 / div % 2 == 0) || y < div ){
        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];
    }

    for( ll i = 1; i <= 10; i++ ){
        for( ll j = 1; j <= 10; j++ ){
            fg[i][j] = fg[i - 1][j] + fg[i][j - 1] - fg[i - 1][j - 1] + (((i) % 2 == 1 && (j) % 2 == 1) ||
                                                                ((i) % 2 == 0 && (j) % 2 == 0));
        }
    }
    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] + 1) * (D[j] - B[j] + 1);
            w[j] = y - x;
            b[j] = x;
        }
        ll x = 0;
        ll 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 4840 KB Output is correct
2 Correct 14 ms 1512 KB Output is correct
3 Correct 31 ms 3192 KB Output is correct
4 Correct 34 ms 3436 KB Output is correct
5 Correct 41 ms 4216 KB Output is correct
6 Correct 28 ms 2812 KB Output is correct
7 Correct 8 ms 888 KB Output is correct
8 Correct 28 ms 2784 KB Output is correct
9 Correct 68 ms 6776 KB Output is correct
10 Correct 38 ms 3832 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 4 ms 504 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 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 4 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 4 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 3 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 4 ms 504 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 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 4 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 4 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 35 ms 2168 KB Output is correct
17 Correct 55 ms 4600 KB Output is correct
18 Correct 120 ms 6776 KB Output is correct
19 Correct 689 ms 6072 KB Output is correct
20 Correct 786 ms 7084 KB Output is correct
21 Correct 53 ms 5496 KB Output is correct
22 Correct 4 ms 376 KB Output is correct
23 Correct 99 ms 3112 KB Output is correct
24 Correct 108 ms 6124 KB Output is correct
25 Correct 22 ms 1004 KB Output is correct
26 Correct 70 ms 3968 KB Output is correct
27 Correct 120 ms 4340 KB Output is correct
28 Correct 116 ms 6596 KB Output is correct
29 Correct 23 ms 2424 KB Output is correct
30 Correct 5 ms 504 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 4840 KB Output is correct
2 Correct 14 ms 1512 KB Output is correct
3 Correct 31 ms 3192 KB Output is correct
4 Correct 34 ms 3436 KB Output is correct
5 Correct 41 ms 4216 KB Output is correct
6 Correct 28 ms 2812 KB Output is correct
7 Correct 8 ms 888 KB Output is correct
8 Correct 28 ms 2784 KB Output is correct
9 Correct 68 ms 6776 KB Output is correct
10 Correct 38 ms 3832 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 4 ms 504 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 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 4 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 4 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 35 ms 2168 KB Output is correct
27 Correct 55 ms 4600 KB Output is correct
28 Correct 120 ms 6776 KB Output is correct
29 Correct 689 ms 6072 KB Output is correct
30 Correct 786 ms 7084 KB Output is correct
31 Correct 53 ms 5496 KB Output is correct
32 Correct 4 ms 376 KB Output is correct
33 Correct 99 ms 3112 KB Output is correct
34 Correct 108 ms 6124 KB Output is correct
35 Correct 22 ms 1004 KB Output is correct
36 Correct 70 ms 3968 KB Output is correct
37 Correct 120 ms 4340 KB Output is correct
38 Correct 116 ms 6596 KB Output is correct
39 Correct 23 ms 2424 KB Output is correct
40 Correct 5 ms 504 KB Output is correct
41 Correct 559 ms 6424 KB Output is correct
42 Correct 121 ms 6732 KB Output is correct
43 Correct 290 ms 6340 KB Output is correct
44 Correct 118 ms 6904 KB Output is correct
45 Correct 72 ms 7416 KB Output is correct
46 Correct 627 ms 6988 KB Output is correct
47 Correct 63 ms 6392 KB Output is correct
48 Correct 207 ms 6712 KB Output is correct
49 Correct 111 ms 6392 KB Output is correct
50 Execution timed out 2045 ms 6976 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 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 47 ms 4840 KB Output is correct
10 Correct 14 ms 1512 KB Output is correct
11 Correct 31 ms 3192 KB Output is correct
12 Correct 34 ms 3436 KB Output is correct
13 Correct 41 ms 4216 KB Output is correct
14 Correct 28 ms 2812 KB Output is correct
15 Correct 8 ms 888 KB Output is correct
16 Correct 28 ms 2784 KB Output is correct
17 Correct 68 ms 6776 KB Output is correct
18 Correct 38 ms 3832 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 2 ms 380 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 4 ms 504 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 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 4 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 4 ms 376 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 35 ms 2168 KB Output is correct
35 Correct 55 ms 4600 KB Output is correct
36 Correct 120 ms 6776 KB Output is correct
37 Correct 689 ms 6072 KB Output is correct
38 Correct 786 ms 7084 KB Output is correct
39 Correct 53 ms 5496 KB Output is correct
40 Correct 4 ms 376 KB Output is correct
41 Correct 99 ms 3112 KB Output is correct
42 Correct 108 ms 6124 KB Output is correct
43 Correct 22 ms 1004 KB Output is correct
44 Correct 70 ms 3968 KB Output is correct
45 Correct 120 ms 4340 KB Output is correct
46 Correct 116 ms 6596 KB Output is correct
47 Correct 23 ms 2424 KB Output is correct
48 Correct 5 ms 504 KB Output is correct
49 Correct 559 ms 6424 KB Output is correct
50 Correct 121 ms 6732 KB Output is correct
51 Correct 290 ms 6340 KB Output is correct
52 Correct 118 ms 6904 KB Output is correct
53 Correct 72 ms 7416 KB Output is correct
54 Correct 627 ms 6988 KB Output is correct
55 Correct 63 ms 6392 KB Output is correct
56 Correct 207 ms 6712 KB Output is correct
57 Correct 111 ms 6392 KB Output is correct
58 Execution timed out 2045 ms 6976 KB Time limit exceeded
59 Halted 0 ms 0 KB -