oj.uz

답안 #172843

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
172843 2020-01-02T16:41:16 Z muhammad_hokimiyon Chessboard (IZhO18_chessboard) C++17
70 / 100
 1625 ms 6052 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 , int div )
{
    x1 = y / div;
    y2 = x / div;
    x1 = x1 * y2 + 1;
    x1 /= 2;
    x1 *= div * 1ll * div;
    a = y % div;
    b = x % div;
    if( ((y - 1) / div % 2 == 0 && div > 1) ){
        x1 += ((x / div + 1) / 2) * 1ll * div * a;
    }else{
        x1 += x / div / 2 * 1ll * div * a;
    }
    if( ((x - 1) / div % 2 == 0) ){
        x1 += (y / div + 1) / 2 * 1ll * div * b;
    }else{
        x1 += y / div / 2 * 1ll * 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) * 1ll * (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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 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 37 ms 2876 KB Output is correct
2 Correct 13 ms 1144 KB Output is correct
3 Correct 26 ms 2172 KB Output is correct
4 Correct 26 ms 2296 KB Output is correct
5 Correct 32 ms 2652 KB Output is correct
6 Correct 22 ms 1912 KB Output is correct
7 Correct 7 ms 1016 KB Output is correct
8 Correct 22 ms 1912 KB Output is correct
9 Correct 52 ms 3704 KB Output is correct
10 Correct 30 ms 2424 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 2 ms 376 KB Output is correct
4 Correct 3 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 380 KB Output is correct
9 Correct 2 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 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

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 2 ms 376 KB Output is correct
4 Correct 3 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 380 KB Output is correct
9 Correct 2 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 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 22 ms 1528 KB Output is correct
17 Correct 39 ms 3448 KB Output is correct
18 Correct 74 ms 4104 KB Output is correct
19 Correct 326 ms 3776 KB Output is correct
20 Correct 365 ms 4116 KB Output is correct
21 Correct 39 ms 2936 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 53 ms 1720 KB Output is correct
24 Correct 66 ms 3220 KB Output is correct
25 Correct 12 ms 632 KB Output is correct
26 Correct 43 ms 2144 KB Output is correct
27 Correct 68 ms 2552 KB Output is correct
28 Correct 72 ms 3492 KB Output is correct
29 Correct 17 ms 1404 KB Output is correct
30 Correct 4 ms 504 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 2876 KB Output is correct
2 Correct 13 ms 1144 KB Output is correct
3 Correct 26 ms 2172 KB Output is correct
4 Correct 26 ms 2296 KB Output is correct
5 Correct 32 ms 2652 KB Output is correct
6 Correct 22 ms 1912 KB Output is correct
7 Correct 7 ms 1016 KB Output is correct
8 Correct 22 ms 1912 KB Output is correct
9 Correct 52 ms 3704 KB Output is correct
10 Correct 30 ms 2424 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 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 380 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 2 ms 376 KB Output is correct
23 Correct 3 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 22 ms 1528 KB Output is correct
27 Correct 39 ms 3448 KB Output is correct
28 Correct 74 ms 4104 KB Output is correct
29 Correct 326 ms 3776 KB Output is correct
30 Correct 365 ms 4116 KB Output is correct
31 Correct 39 ms 2936 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 53 ms 1720 KB Output is correct
34 Correct 66 ms 3220 KB Output is correct
35 Correct 12 ms 632 KB Output is correct
36 Correct 43 ms 2144 KB Output is correct
37 Correct 68 ms 2552 KB Output is correct
38 Correct 72 ms 3492 KB Output is correct
39 Correct 17 ms 1404 KB Output is correct
40 Correct 4 ms 504 KB Output is correct
41 Correct 283 ms 2992 KB Output is correct
42 Correct 81 ms 3320 KB Output is correct
43 Correct 155 ms 3052 KB Output is correct
44 Correct 74 ms 3192 KB Output is correct
45 Correct 55 ms 3448 KB Output is correct
46 Correct 306 ms 3296 KB Output is correct
47 Correct 50 ms 3192 KB Output is correct
48 Correct 118 ms 3112 KB Output is correct
49 Correct 71 ms 2988 KB Output is correct
50 Correct 1434 ms 3476 KB Output is correct
51 Correct 1529 ms 3728 KB Output is correct
52 Correct 1426 ms 3424 KB Output is correct
53 Correct 1535 ms 4516 KB Output is correct
54 Correct 1417 ms 4240 KB Output is correct
55 Correct 1593 ms 4508 KB Output is correct
56 Correct 1367 ms 3920 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 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 37 ms 2876 KB Output is correct
10 Correct 13 ms 1144 KB Output is correct
11 Correct 26 ms 2172 KB Output is correct
12 Correct 26 ms 2296 KB Output is correct
13 Correct 32 ms 2652 KB Output is correct
14 Correct 22 ms 1912 KB Output is correct
15 Correct 7 ms 1016 KB Output is correct
16 Correct 22 ms 1912 KB Output is correct
17 Correct 52 ms 3704 KB Output is correct
18 Correct 30 ms 2424 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 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 380 KB Output is correct
27 Correct 2 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 376 KB Output is correct
31 Correct 3 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 22 ms 1528 KB Output is correct
35 Correct 39 ms 3448 KB Output is correct
36 Correct 74 ms 4104 KB Output is correct
37 Correct 326 ms 3776 KB Output is correct
38 Correct 365 ms 4116 KB Output is correct
39 Correct 39 ms 2936 KB Output is correct
40 Correct 3 ms 376 KB Output is correct
41 Correct 53 ms 1720 KB Output is correct
42 Correct 66 ms 3220 KB Output is correct
43 Correct 12 ms 632 KB Output is correct
44 Correct 43 ms 2144 KB Output is correct
45 Correct 68 ms 2552 KB Output is correct
46 Correct 72 ms 3492 KB Output is correct
47 Correct 17 ms 1404 KB Output is correct
48 Correct 4 ms 504 KB Output is correct
49 Correct 283 ms 2992 KB Output is correct
50 Correct 81 ms 3320 KB Output is correct
51 Correct 155 ms 3052 KB Output is correct
52 Correct 74 ms 3192 KB Output is correct
53 Correct 55 ms 3448 KB Output is correct
54 Correct 306 ms 3296 KB Output is correct
55 Correct 50 ms 3192 KB Output is correct
56 Correct 118 ms 3112 KB Output is correct
57 Correct 71 ms 2988 KB Output is correct
58 Correct 1434 ms 3476 KB Output is correct
59 Correct 1529 ms 3728 KB Output is correct
60 Correct 1426 ms 3424 KB Output is correct
61 Correct 1535 ms 4516 KB Output is correct
62 Correct 1417 ms 4240 KB Output is correct
63 Correct 1593 ms 4508 KB Output is correct
64 Correct 1367 ms 3920 KB Output is correct
65 Correct 2 ms 376 KB Output is correct
66 Correct 2 ms 376 KB Output is correct
67 Correct 1511 ms 4144 KB Output is correct
68 Correct 1506 ms 4132 KB Output is correct
69 Correct 1311 ms 3732 KB Output is correct
70 Correct 1416 ms 4008 KB Output is correct
71 Correct 1460 ms 4284 KB Output is correct
72 Correct 1373 ms 3988 KB Output is correct
73 Correct 1369 ms 3968 KB Output is correct
74 Correct 1494 ms 4252 KB Output is correct
75 Correct 1401 ms 3900 KB Output is correct
76 Correct 1523 ms 4128 KB Output is correct
77 Correct 223 ms 4192 KB Output is correct
78 Correct 75 ms 5340 KB Output is correct
79 Correct 156 ms 5112 KB Output is correct
80 Correct 159 ms 5324 KB Output is correct
81 Correct 151 ms 4984 KB Output is correct
82 Correct 125 ms 5576 KB Output is correct
83 Correct 93 ms 5164 KB Output is correct
84 Correct 916 ms 6012 KB Output is correct
85 Correct 1625 ms 6052 KB Output is correct
86 Correct 4 ms 376 KB Output is correct
87 Incorrect 3 ms 376 KB Output isn't correct
88 Halted 0 ms 0 KB -