oj.uz

답안 #683527

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
683527 2023-01-18T16:27:47 Z Ronin13 Chessboard (IZhO18_chessboard) C++14
47 / 100
 137 ms 3380 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<ll,ll>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
using namespace std;
/*
6 8
3 3 3 3
1 2 1 2
3 4 3 4
5 5 5 5
4 3 4 3
4 4 4 4
2 1 2 1
3 6 3 6
*/

int pos[100001][2];

ll compute_line(ll x1, ll y1, ll x2, ll y2, ll k){
    ll u = (x1 / k + y1 / k);
    ll v = (x2 / k + y2 / k);
    ll a = (x2 - x1 + 1);
    ll b = (y2 - y1 + 1);
    ll cnt = 0;
    if(u % 2 == v % 2){
        if(u & 1){
            cnt +=  k * a;
        }
        else cnt -= k * a;
    }
    ll c = k - (y2 % k);
    if(u & 1){
        cnt -= c * a;
    }
    else cnt += c * a;
    ll d = y1 % k;
    d++;
    if(v & 1) cnt -= d * a;
    else cnt += d * a;
    return cnt;
}

ll C(ll x1, ll y1, ll x2, ll y2, ll k){
    if(x1 == x2){
        if(y1 == y2){
            ll x = (x1 / k) + (y1 / k);
            if(x & 1) return -1;
            return 1;
        }
    }
    if((x1 / k) == (x2 / k)){
        if((y1 / k) == (y2 / k)){
            ll x = (x1 / k) + (y1 / k);
            if(x % 2) return 0-(x2 - x1 + 1) * (y2 - y1 + 1);
            return (x2 - x1 + 1) * (y2 - y1 + 1);
        }
        return compute_line(x1, y1, x2, y2, k);
    }
    if(y1 / k == y2 / k)
        return compute_line(y1, x2, y2, x2, k);
    ll cnt = 0;
    cnt += compute_line(x1, y1, x1 / k * k + (k - 1), y2, k);
    cnt += compute_line(x2 / k * k, y1, x2, y2, k);
    ll v = x2 / k;
    v -= x1 / k;
    v--;
    if(v){
        ll j = x1 / k * k + k;
        ll nw = compute_line(j, y1, j + k, y2, k);
        if(v & 1) cnt += nw;
    }
    return cnt;
}

int main(){
  //  freopen("school.in", "r", stdin);
 // freopen("school.out", "w", stdout);
    ll n, k;
    cin >> n >> k;
    ll x1[k + 1], x2[k + 1], y1[k + 1], y2[k + 1];
    for(int i =  1; i <= k; ++i){
        cin >> x1[i] >> y1[i] >> x2[i] >> y2[i];
        x1[i]--;
        y1[i]--;
        x2[i]--;
        y2[i]--;
    }
    ll ans = 1e18 + 1;
    for(int a = 1; a <n; a++){
        if(n % a) continue;
        ll v = n / a;
        ll cnt = 0;
        if(v % 2 == 1)
            cnt += v * (v / 2) + (v + 1)  / 2;
        else cnt = v * v / 2;
        cnt *= a * a;
        for(int i = 1; i <= k; i++){
            cnt -= C(x1[i], y1[i], x2[i], y2[i], a);
        }
        ans = min(ans, cnt);
    }
    for(ll a = 1; a <n; a++){
        if(n % a) continue;
        ll v = n / a;
        ll cnt = -1;
        if(v % 2 == 1)
            cnt += v * (v / 2) + (v + 1) / 2;
        else cnt = v * v / 2;
        cnt *= a * a;
        for(int i = 1; i <= k; i++)
            cnt += C(x1[i], y1[i], x2[i], y2[i], a);
        ans = min(ans, cnt);
    }
    cout << ans;
    return 0;
}

Compilation message

chessboard.cpp: In function 'long long int compute_line(long long int, long long int, long long int, long long int, long long int)':
chessboard.cpp:29:8: warning: unused variable 'b' [-Wunused-variable]
   29 |     ll b = (y2 - y1 + 1);
      |        ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 2240 KB Output is correct
2 Correct 18 ms 724 KB Output is correct
3 Correct 49 ms 1492 KB Output is correct
4 Correct 48 ms 1716 KB Output is correct
5 Correct 64 ms 2004 KB Output is correct
6 Correct 37 ms 1384 KB Output is correct
7 Correct 8 ms 532 KB Output is correct
8 Correct 39 ms 1364 KB Output is correct
9 Correct 95 ms 3028 KB Output is correct
10 Correct 51 ms 1748 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 1 ms 284 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 1 ms 284 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 25 ms 1108 KB Output is correct
17 Correct 69 ms 2900 KB Output is correct
18 Correct 87 ms 3380 KB Output is correct
19 Correct 124 ms 3048 KB Output is correct
20 Correct 133 ms 3376 KB Output is correct
21 Correct 70 ms 2772 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 48 ms 1620 KB Output is correct
24 Correct 78 ms 3104 KB Output is correct
25 Correct 8 ms 468 KB Output is correct
26 Correct 50 ms 2048 KB Output is correct
27 Correct 60 ms 2388 KB Output is correct
28 Correct 85 ms 3284 KB Output is correct
29 Correct 28 ms 1328 KB Output is correct
30 Correct 2 ms 340 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 2240 KB Output is correct
2 Correct 18 ms 724 KB Output is correct
3 Correct 49 ms 1492 KB Output is correct
4 Correct 48 ms 1716 KB Output is correct
5 Correct 64 ms 2004 KB Output is correct
6 Correct 37 ms 1384 KB Output is correct
7 Correct 8 ms 532 KB Output is correct
8 Correct 39 ms 1364 KB Output is correct
9 Correct 95 ms 3028 KB Output is correct
10 Correct 51 ms 1748 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 2 ms 212 KB Output is correct
15 Correct 1 ms 284 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 25 ms 1108 KB Output is correct
27 Correct 69 ms 2900 KB Output is correct
28 Correct 87 ms 3380 KB Output is correct
29 Correct 124 ms 3048 KB Output is correct
30 Correct 133 ms 3376 KB Output is correct
31 Correct 70 ms 2772 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 48 ms 1620 KB Output is correct
34 Correct 78 ms 3104 KB Output is correct
35 Correct 8 ms 468 KB Output is correct
36 Correct 50 ms 2048 KB Output is correct
37 Correct 60 ms 2388 KB Output is correct
38 Correct 85 ms 3284 KB Output is correct
39 Correct 28 ms 1328 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Incorrect 137 ms 2876 KB Output isn't correct
42 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 65 ms 2240 KB Output is correct
10 Correct 18 ms 724 KB Output is correct
11 Correct 49 ms 1492 KB Output is correct
12 Correct 48 ms 1716 KB Output is correct
13 Correct 64 ms 2004 KB Output is correct
14 Correct 37 ms 1384 KB Output is correct
15 Correct 8 ms 532 KB Output is correct
16 Correct 39 ms 1364 KB Output is correct
17 Correct 95 ms 3028 KB Output is correct
18 Correct 51 ms 1748 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 2 ms 212 KB Output is correct
23 Correct 1 ms 284 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 25 ms 1108 KB Output is correct
35 Correct 69 ms 2900 KB Output is correct
36 Correct 87 ms 3380 KB Output is correct
37 Correct 124 ms 3048 KB Output is correct
38 Correct 133 ms 3376 KB Output is correct
39 Correct 70 ms 2772 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 48 ms 1620 KB Output is correct
42 Correct 78 ms 3104 KB Output is correct
43 Correct 8 ms 468 KB Output is correct
44 Correct 50 ms 2048 KB Output is correct
45 Correct 60 ms 2388 KB Output is correct
46 Correct 85 ms 3284 KB Output is correct
47 Correct 28 ms 1328 KB Output is correct
48 Correct 2 ms 340 KB Output is correct
49 Incorrect 137 ms 2876 KB Output isn't correct
50 Halted 0 ms 0 KB -