oj.uz

답안 #172828

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
172828 2020-01-02T16:33:33 Z muhammad_hokimiyon Chessboard (IZhO18_chessboard) C++17
70 / 100
 1587 ms 6368 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 * 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 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 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 3832 KB Output is correct
2 Correct 11 ms 1272 KB Output is correct
3 Correct 24 ms 2552 KB Output is correct
4 Correct 28 ms 2700 KB Output is correct
5 Correct 34 ms 3448 KB Output is correct
6 Correct 22 ms 2296 KB Output is correct
7 Correct 7 ms 892 KB Output is correct
8 Correct 23 ms 2424 KB Output is correct
9 Correct 52 ms 5240 KB Output is correct
10 Correct 33 ms 3064 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 3 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 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 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 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 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 22 ms 1660 KB Output is correct
17 Correct 41 ms 3328 KB Output is correct
18 Correct 72 ms 5112 KB Output is correct
19 Correct 326 ms 4752 KB Output is correct
20 Correct 379 ms 5280 KB Output is correct
21 Correct 41 ms 4196 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 56 ms 2388 KB Output is correct
24 Correct 66 ms 4600 KB Output is correct
25 Correct 12 ms 760 KB Output is correct
26 Correct 42 ms 3064 KB Output is correct
27 Correct 67 ms 3192 KB Output is correct
28 Correct 71 ms 4896 KB Output is correct
29 Correct 18 ms 1912 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 3832 KB Output is correct
2 Correct 11 ms 1272 KB Output is correct
3 Correct 24 ms 2552 KB Output is correct
4 Correct 28 ms 2700 KB Output is correct
5 Correct 34 ms 3448 KB Output is correct
6 Correct 22 ms 2296 KB Output is correct
7 Correct 7 ms 892 KB Output is correct
8 Correct 23 ms 2424 KB Output is correct
9 Correct 52 ms 5240 KB Output is correct
10 Correct 33 ms 3064 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 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 3 ms 376 KB Output is correct
20 Correct 5 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 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 22 ms 1660 KB Output is correct
27 Correct 41 ms 3328 KB Output is correct
28 Correct 72 ms 5112 KB Output is correct
29 Correct 326 ms 4752 KB Output is correct
30 Correct 379 ms 5280 KB Output is correct
31 Correct 41 ms 4196 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 56 ms 2388 KB Output is correct
34 Correct 66 ms 4600 KB Output is correct
35 Correct 12 ms 760 KB Output is correct
36 Correct 42 ms 3064 KB Output is correct
37 Correct 67 ms 3192 KB Output is correct
38 Correct 71 ms 4896 KB Output is correct
39 Correct 18 ms 1912 KB Output is correct
40 Correct 4 ms 504 KB Output is correct
41 Correct 266 ms 4952 KB Output is correct
42 Correct 76 ms 5240 KB Output is correct
43 Correct 153 ms 5136 KB Output is correct
44 Correct 80 ms 5240 KB Output is correct
45 Correct 59 ms 5464 KB Output is correct
46 Correct 299 ms 5340 KB Output is correct
47 Correct 49 ms 5152 KB Output is correct
48 Correct 113 ms 5300 KB Output is correct
49 Correct 69 ms 5020 KB Output is correct
50 Correct 1429 ms 5548 KB Output is correct
51 Correct 1518 ms 5924 KB Output is correct
52 Correct 1427 ms 5444 KB Output is correct
53 Correct 1521 ms 6104 KB Output is correct
54 Correct 1395 ms 5692 KB Output is correct
55 Correct 1587 ms 6368 KB Output is correct
56 Correct 1353 ms 5272 KB Output is correct

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 380 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 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 3832 KB Output is correct
10 Correct 11 ms 1272 KB Output is correct
11 Correct 24 ms 2552 KB Output is correct
12 Correct 28 ms 2700 KB Output is correct
13 Correct 34 ms 3448 KB Output is correct
14 Correct 22 ms 2296 KB Output is correct
15 Correct 7 ms 892 KB Output is correct
16 Correct 23 ms 2424 KB Output is correct
17 Correct 52 ms 5240 KB Output is correct
18 Correct 33 ms 3064 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 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 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 3 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 22 ms 1660 KB Output is correct
35 Correct 41 ms 3328 KB Output is correct
36 Correct 72 ms 5112 KB Output is correct
37 Correct 326 ms 4752 KB Output is correct
38 Correct 379 ms 5280 KB Output is correct
39 Correct 41 ms 4196 KB Output is correct
40 Correct 3 ms 376 KB Output is correct
41 Correct 56 ms 2388 KB Output is correct
42 Correct 66 ms 4600 KB Output is correct
43 Correct 12 ms 760 KB Output is correct
44 Correct 42 ms 3064 KB Output is correct
45 Correct 67 ms 3192 KB Output is correct
46 Correct 71 ms 4896 KB Output is correct
47 Correct 18 ms 1912 KB Output is correct
48 Correct 4 ms 504 KB Output is correct
49 Correct 266 ms 4952 KB Output is correct
50 Correct 76 ms 5240 KB Output is correct
51 Correct 153 ms 5136 KB Output is correct
52 Correct 80 ms 5240 KB Output is correct
53 Correct 59 ms 5464 KB Output is correct
54 Correct 299 ms 5340 KB Output is correct
55 Correct 49 ms 5152 KB Output is correct
56 Correct 113 ms 5300 KB Output is correct
57 Correct 69 ms 5020 KB Output is correct
58 Correct 1429 ms 5548 KB Output is correct
59 Correct 1518 ms 5924 KB Output is correct
60 Correct 1427 ms 5444 KB Output is correct
61 Correct 1521 ms 6104 KB Output is correct
62 Correct 1395 ms 5692 KB Output is correct
63 Correct 1587 ms 6368 KB Output is correct
64 Correct 1353 ms 5272 KB Output is correct
65 Correct 2 ms 376 KB Output is correct
66 Correct 2 ms 376 KB Output is correct
67 Correct 1529 ms 5728 KB Output is correct
68 Correct 1487 ms 5780 KB Output is correct
69 Correct 1292 ms 5168 KB Output is correct
70 Correct 1406 ms 5564 KB Output is correct
71 Correct 1402 ms 5624 KB Output is correct
72 Correct 1424 ms 5484 KB Output is correct
73 Correct 1391 ms 5488 KB Output is correct
74 Correct 1475 ms 5784 KB Output is correct
75 Correct 1430 ms 5540 KB Output is correct
76 Correct 1506 ms 5848 KB Output is correct
77 Incorrect 225 ms 5880 KB Output isn't correct
78 Halted 0 ms 0 KB -