oj.uz

답안 #1109093

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1109093 2024-11-06T02:47:08 Z Kerim 모자이크 (IOI24_mosaic) C++17
59 / 100
 834 ms 109800 KB 
#include "bits/stdc++.h"
#define ll long long
#define pb push_back
#define pii pair<int, int>
using namespace std;
const int N = 4e5+5;
int cnt[N], arcalyk[4][N], tarhun[N][4];
const int M = 5005;
int dp[M][M];
int wow(int a, int b){
    return (!(a|b)?1:0);
}

vector<ll> mosaic(vector<int> X, vector<int> Y, vector<int> T, vector<int> B, vector<int> L, vector<int> R){
    int n = (int)X.size();
    assert(X.front()==Y.front());
    if (n <= 5000){
        for (int i = 0; i < n; i++)
            dp[1][i+1] = X[i];
        for (int i = 0; i < n; i++)
            dp[i+1][1] = Y[i];
        for (int i = 2; i <= n; i++)
            for (int j = 2; j <= n; j++)
                dp[i][j] = wow(dp[i-1][j], dp[i][j-1]);
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                dp[i][j] += dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1];
        vector<ll> ans;
        for(int i = 0; i < (int)L.size(); ++i){
            int x = T[i]+1, y = L[i]+1, yy = R[i]+1, xx = B[i]+1;
            ans.push_back(dp[xx][yy] - dp[x-1][yy] - dp[xx][y-1] + dp[x-1][y-1]);
        }
        return ans;
    }
    bool ok = true;
    for (int i = 0; i < n; i++)
        ok &= X[i] == 0, ok &= Y[i] == 0;
    if (ok){
        vector<ll> ans;
        for(int i = 0; i < (int)L.size(); ++i){
            int x = T[i]+1, y = L[i]+1, yy = R[i]+1, xx = B[i]+1;
            if (x == 1)
                x += 1;
            if (y == 1)
                y += 1;
            ll rec = (xx-x+1)*1LL*(yy-y+1);
            if (rec % 2 == 0)
                ans.push_back(rec/2);
            else{
                if ((xx+yy)%2)
                    ans.push_back(rec/2);
                else
                    ans.push_back(rec/2+1);
            }
        }
        return ans;
    }
    map<pii, int> mp;
    for(int i = 1; i <= n; ++i)
        mp[{1, i}] = X[i-1], mp[{i, 1}] = Y[i-1];
    for(int i = 2; i <= n; ++i)
        for(int j = 2; j <= 3; ++j)
            mp[{i, j}] = wow(mp[{i-1, j}], mp[{i, j-1}]);
    for(int i = 2; i <= 3; ++i)
        for(int j = 2; j <= n; ++j)
            mp[{i, j}] = wow(mp[{i-1, j}], mp[{i, j-1}]);
    // int ii = 3;
    // for(int jj = 3; jj <= n; ++jj)
    //     cnt[ii-jj+n] = mp[{ii, jj}];
    for (auto [key, value]: mp)
        cnt[key.first-key.second+n] = value;
    for (int i = 1; i <= 3; i++)
        for (int j = 1; j <= n; j++)
            arcalyk[i][j] = mp[{i,j}] + arcalyk[i][j-1];
    for (int j = 1; j <= 3; j++)
        for (int i = 1; i <= n; i++)
            tarhun[i][j] = mp[{i,j}] + tarhun[i-1][j];
    // for (int i = 1; i < n+n; i++)
    //     cnt[i] += cnt[i-1];
    vector<ll> ans;
    for(int i = 0; i < (int)L.size(); ++i){
        int x = T[i]+1, y = L[i]+1, yy = R[i]+1, xx = B[i]+1;
        ll res = 0;
        while (x <= 3 and x <= xx)
            res += arcalyk[x][yy]-arcalyk[x][y-1], x += 1;
        if (x <= xx){
            while (y <= 3 and y <= yy)
                res += tarhun[xx][y]-tarhun[x-1][y], y += 1;
        }
        if (x <= xx and y <= yy){
            int a = x-y+n, b = x-yy+n, k = xx-x;
            swap(a, b);
            for (int j = 0; j <= k; j++){
                res += cnt[a++] * 1LL * (j+1);
                if (a <= b)
                    res += cnt[b--] * 1LL * (j+1);
            }
            res += (b-a+1)*1LL*(k+1);
            // for (int i = 0; i <= ; i++){
            //     res += cnt[a] - cnt[b-1];
            //     a += 1;
            //     b += 1;
            // }
        }
        ans.pb(res);
    }
    return ans;
}




// int main(){
//     int n;
//     scanf("%d", &n);
//     vector<int> X, Y;
//     for(int i = 1; i <= n; ++i){
//         int x;
//         scanf("%d", &x);
//         X.pb(x);
//     }
//     for(int i = 1; i <= n; ++i){
//         int x;
//         scanf("%d", &x);
//         Y.pb(x);
//     }
//     int q;
//     scanf("%d", &q);
//     vector<int> T, B, L, R;
//     while(q--){
//         int a, b, c, d;
//         scanf("%d%d%d%d", &a, &b, &c, &d);
//         T.pb(a), B.pb(b), L.pb(c), R.pb(d);
//     }
//     vector<ll> ans = mosaic(X, Y, T, B, L, R);
//     for(ll i : ans)
//         printf("%lld ", i);
//     puts("");
//     return 0;
// }

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 508 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 508 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 2 ms 4432 KB Output is correct
12 Correct 1 ms 4432 KB Output is correct
13 Correct 2 ms 4432 KB Output is correct
14 Correct 2 ms 4432 KB Output is correct
15 Correct 1 ms 2384 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct
17 Correct 1 ms 2384 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 789 ms 97848 KB Output is correct
2 Correct 752 ms 97592 KB Output is correct
3 Correct 776 ms 97724 KB Output is correct
4 Correct 750 ms 97700 KB Output is correct
5 Correct 407 ms 55056 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 508 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 2 ms 4432 KB Output is correct
12 Correct 1 ms 4432 KB Output is correct
13 Correct 2 ms 4432 KB Output is correct
14 Correct 2 ms 4432 KB Output is correct
15 Correct 1 ms 2384 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct
17 Correct 1 ms 2384 KB Output is correct
18 Correct 192 ms 106692 KB Output is correct
19 Correct 191 ms 109800 KB Output is correct
20 Correct 217 ms 109232 KB Output is correct
21 Correct 189 ms 108740 KB Output is correct
22 Correct 196 ms 106920 KB Output is correct
23 Correct 84 ms 49028 KB Output is correct
24 Correct 96 ms 50880 KB Output is correct
25 Correct 83 ms 51444 KB Output is correct

Subtask #5
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 11972 KB Output is correct
2 Correct 97 ms 16828 KB Output is correct
3 Correct 104 ms 17208 KB Output is correct
4 Correct 107 ms 13500 KB Output is correct
5 Correct 92 ms 12988 KB Output is correct
6 Correct 91 ms 14976 KB Output is correct
7 Correct 120 ms 13468 KB Output is correct
8 Correct 92 ms 15548 KB Output is correct
9 Correct 79 ms 13756 KB Output is correct
10 Correct 78 ms 13244 KB Output is correct
11 Correct 80 ms 13756 KB Output is correct

Subtask #6
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 775 ms 98260 KB Output is correct
2 Correct 739 ms 99516 KB Output is correct
3 Correct 770 ms 97704 KB Output is correct
4 Correct 770 ms 97468 KB Output is correct
5 Correct 834 ms 101616 KB Output is correct
6 Correct 404 ms 56196 KB Output is correct
7 Correct 260 ms 37312 KB Output is correct

Subtask #7
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 789 ms 97848 KB Output is correct
2 Correct 752 ms 97592 KB Output is correct
3 Correct 776 ms 97724 KB Output is correct
4 Correct 750 ms 97700 KB Output is correct
5 Correct 407 ms 55056 KB Output is correct
6 Correct 775 ms 98260 KB Output is correct
7 Correct 739 ms 99516 KB Output is correct
8 Correct 770 ms 97704 KB Output is correct
9 Correct 770 ms 97468 KB Output is correct
10 Correct 834 ms 101616 KB Output is correct
11 Correct 404 ms 56196 KB Output is correct
12 Correct 260 ms 37312 KB Output is correct
13 Incorrect 793 ms 97516 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #8
0.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 500 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 508 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 2 ms 4432 KB Output is correct
13 Correct 1 ms 4432 KB Output is correct
14 Correct 2 ms 4432 KB Output is correct
15 Correct 2 ms 4432 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct
17 Correct 1 ms 2384 KB Output is correct
18 Correct 1 ms 2384 KB Output is correct
19 Correct 789 ms 97848 KB Output is correct
20 Correct 752 ms 97592 KB Output is correct
21 Correct 776 ms 97724 KB Output is correct
22 Correct 750 ms 97700 KB Output is correct
23 Correct 407 ms 55056 KB Output is correct
24 Correct 192 ms 106692 KB Output is correct
25 Correct 191 ms 109800 KB Output is correct
26 Correct 217 ms 109232 KB Output is correct
27 Correct 189 ms 108740 KB Output is correct
28 Correct 196 ms 106920 KB Output is correct
29 Correct 84 ms 49028 KB Output is correct
30 Correct 96 ms 50880 KB Output is correct
31 Correct 83 ms 51444 KB Output is correct
32 Correct 47 ms 11972 KB Output is correct
33 Correct 97 ms 16828 KB Output is correct
34 Correct 104 ms 17208 KB Output is correct
35 Correct 107 ms 13500 KB Output is correct
36 Correct 92 ms 12988 KB Output is correct
37 Correct 91 ms 14976 KB Output is correct
38 Correct 120 ms 13468 KB Output is correct
39 Correct 92 ms 15548 KB Output is correct
40 Correct 79 ms 13756 KB Output is correct
41 Correct 78 ms 13244 KB Output is correct
42 Correct 80 ms 13756 KB Output is correct
43 Correct 775 ms 98260 KB Output is correct
44 Correct 739 ms 99516 KB Output is correct
45 Correct 770 ms 97704 KB Output is correct
46 Correct 770 ms 97468 KB Output is correct
47 Correct 834 ms 101616 KB Output is correct
48 Correct 404 ms 56196 KB Output is correct
49 Correct 260 ms 37312 KB Output is correct
50 Incorrect 793 ms 97516 KB Output isn't correct
51 Halted 0 ms 0 KB -