oj.uz

답안 #172837

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
172837 2020-01-02T16:37:16 Z muhammad_hokimiyon Chessboard (IZhO18_chessboard) C++17
70 / 100
 1617 ms 4592 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) * 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 380 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 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 36 ms 2468 KB Output is correct
2 Correct 11 ms 888 KB Output is correct
3 Correct 24 ms 1528 KB Output is correct
4 Correct 26 ms 1844 KB Output is correct
5 Correct 32 ms 2040 KB Output is correct
6 Correct 21 ms 1276 KB Output is correct
7 Correct 6 ms 508 KB Output is correct
8 Correct 23 ms 1400 KB Output is correct
9 Correct 52 ms 3136 KB Output is correct
10 Correct 28 ms 1912 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 380 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 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 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 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 380 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 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 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 22 ms 1304 KB Output is correct
17 Correct 42 ms 3068 KB Output is correct
18 Correct 73 ms 3420 KB Output is correct
19 Correct 335 ms 3196 KB Output is correct
20 Correct 373 ms 3636 KB Output is correct
21 Correct 40 ms 3552 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 54 ms 2132 KB Output is correct
24 Correct 66 ms 3832 KB Output is correct
25 Correct 12 ms 800 KB Output is correct
26 Correct 43 ms 2808 KB Output is correct
27 Correct 69 ms 2988 KB Output is correct
28 Correct 73 ms 4116 KB Output is correct
29 Correct 18 ms 1784 KB Output is correct
30 Correct 4 ms 504 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 2468 KB Output is correct
2 Correct 11 ms 888 KB Output is correct
3 Correct 24 ms 1528 KB Output is correct
4 Correct 26 ms 1844 KB Output is correct
5 Correct 32 ms 2040 KB Output is correct
6 Correct 21 ms 1276 KB Output is correct
7 Correct 6 ms 508 KB Output is correct
8 Correct 23 ms 1400 KB Output is correct
9 Correct 52 ms 3136 KB Output is correct
10 Correct 28 ms 1912 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 380 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 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 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 22 ms 1304 KB Output is correct
27 Correct 42 ms 3068 KB Output is correct
28 Correct 73 ms 3420 KB Output is correct
29 Correct 335 ms 3196 KB Output is correct
30 Correct 373 ms 3636 KB Output is correct
31 Correct 40 ms 3552 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 54 ms 2132 KB Output is correct
34 Correct 66 ms 3832 KB Output is correct
35 Correct 12 ms 800 KB Output is correct
36 Correct 43 ms 2808 KB Output is correct
37 Correct 69 ms 2988 KB Output is correct
38 Correct 73 ms 4116 KB Output is correct
39 Correct 18 ms 1784 KB Output is correct
40 Correct 4 ms 504 KB Output is correct
41 Correct 275 ms 3656 KB Output is correct
42 Correct 78 ms 4072 KB Output is correct
43 Correct 153 ms 3728 KB Output is correct
44 Correct 76 ms 3832 KB Output is correct
45 Correct 58 ms 4016 KB Output is correct
46 Correct 307 ms 3916 KB Output is correct
47 Correct 50 ms 3704 KB Output is correct
48 Correct 118 ms 3884 KB Output is correct
49 Correct 70 ms 3704 KB Output is correct
50 Correct 1471 ms 4220 KB Output is correct
51 Correct 1569 ms 4592 KB Output is correct
52 Correct 1456 ms 4128 KB Output is correct
53 Correct 1566 ms 4580 KB Output is correct
54 Correct 1432 ms 4220 KB Output is correct
55 Correct 1617 ms 4428 KB Output is correct
56 Correct 1395 ms 4140 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 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 36 ms 2468 KB Output is correct
10 Correct 11 ms 888 KB Output is correct
11 Correct 24 ms 1528 KB Output is correct
12 Correct 26 ms 1844 KB Output is correct
13 Correct 32 ms 2040 KB Output is correct
14 Correct 21 ms 1276 KB Output is correct
15 Correct 6 ms 508 KB Output is correct
16 Correct 23 ms 1400 KB Output is correct
17 Correct 52 ms 3136 KB Output is correct
18 Correct 28 ms 1912 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 380 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 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 3 ms 376 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 22 ms 1304 KB Output is correct
35 Correct 42 ms 3068 KB Output is correct
36 Correct 73 ms 3420 KB Output is correct
37 Correct 335 ms 3196 KB Output is correct
38 Correct 373 ms 3636 KB Output is correct
39 Correct 40 ms 3552 KB Output is correct
40 Correct 3 ms 376 KB Output is correct
41 Correct 54 ms 2132 KB Output is correct
42 Correct 66 ms 3832 KB Output is correct
43 Correct 12 ms 800 KB Output is correct
44 Correct 43 ms 2808 KB Output is correct
45 Correct 69 ms 2988 KB Output is correct
46 Correct 73 ms 4116 KB Output is correct
47 Correct 18 ms 1784 KB Output is correct
48 Correct 4 ms 504 KB Output is correct
49 Correct 275 ms 3656 KB Output is correct
50 Correct 78 ms 4072 KB Output is correct
51 Correct 153 ms 3728 KB Output is correct
52 Correct 76 ms 3832 KB Output is correct
53 Correct 58 ms 4016 KB Output is correct
54 Correct 307 ms 3916 KB Output is correct
55 Correct 50 ms 3704 KB Output is correct
56 Correct 118 ms 3884 KB Output is correct
57 Correct 70 ms 3704 KB Output is correct
58 Correct 1471 ms 4220 KB Output is correct
59 Correct 1569 ms 4592 KB Output is correct
60 Correct 1456 ms 4128 KB Output is correct
61 Correct 1566 ms 4580 KB Output is correct
62 Correct 1432 ms 4220 KB Output is correct
63 Correct 1617 ms 4428 KB Output is correct
64 Correct 1395 ms 4140 KB Output is correct
65 Correct 2 ms 376 KB Output is correct
66 Correct 2 ms 376 KB Output is correct
67 Correct 1556 ms 4292 KB Output is correct
68 Correct 1563 ms 4200 KB Output is correct
69 Correct 1330 ms 3944 KB Output is correct
70 Correct 1453 ms 4216 KB Output is correct
71 Correct 1443 ms 4172 KB Output is correct
72 Correct 1396 ms 4072 KB Output is correct
73 Correct 1605 ms 4132 KB Output is correct
74 Correct 1527 ms 4236 KB Output is correct
75 Correct 1435 ms 4132 KB Output is correct
76 Correct 1542 ms 4220 KB Output is correct
77 Incorrect 231 ms 4196 KB Output isn't correct
78 Halted 0 ms 0 KB -