oj.uz

Submission #1109095

# Submission time Handle Problem Language Result Execution time Memory
1109095 2024-11-06T02:54:14 Z Kerim Mosaic (IOI24_mosaic) C++17
59 / 100
 868 ms 108228 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+1;
            swap(a, b);
            b += k-1;
            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;
            // for (int i = 0; i <= ; i++){
            //     res += cnt[a] - cnt[b-1];
            //     a += 1;
            //     b += 1;
            // }
        }
        ans.pb(res);
    }
    return ans;
}

// l = 1, r = 2, k = 5

// 1 2 3 4 5 6 7 8
// 1 1
//   1 1
//     1 1
//       1 1
//         1 1
// 1 2 2 2 2 1



// 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 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 508 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 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 508 KB Output is correct
11 Correct 2 ms 4432 KB Output is correct
12 Correct 2 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

# Verdict Execution time Memory Grader output
1 Correct 868 ms 97648 KB Output is correct
2 Correct 781 ms 97644 KB Output is correct
3 Correct 774 ms 97688 KB Output is correct
4 Correct 759 ms 97504 KB Output is correct
5 Correct 408 ms 54716 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 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 508 KB Output is correct
11 Correct 2 ms 4432 KB Output is correct
12 Correct 2 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 194 ms 106916 KB Output is correct
19 Correct 196 ms 106692 KB Output is correct
20 Correct 197 ms 106692 KB Output is correct
21 Correct 210 ms 108228 KB Output is correct
22 Correct 199 ms 106908 KB Output is correct
23 Correct 81 ms 48828 KB Output is correct
24 Correct 149 ms 48836 KB Output is correct
25 Correct 88 ms 48840 KB Output is correct

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 11964 KB Output is correct
2 Correct 99 ms 12992 KB Output is correct
3 Correct 92 ms 12988 KB Output is correct
4 Correct 98 ms 12988 KB Output is correct
5 Correct 103 ms 12988 KB Output is correct
6 Correct 89 ms 12988 KB Output is correct
7 Correct 89 ms 12988 KB Output is correct
8 Correct 101 ms 14524 KB Output is correct
9 Correct 81 ms 11400 KB Output is correct
10 Correct 76 ms 12476 KB Output is correct
11 Correct 81 ms 12864 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 831 ms 97620 KB Output is correct
2 Correct 752 ms 98280 KB Output is correct
3 Correct 740 ms 97720 KB Output is correct
4 Correct 724 ms 97732 KB Output is correct
5 Correct 813 ms 100004 KB Output is correct
6 Correct 389 ms 56032 KB Output is correct
7 Correct 240 ms 37312 KB Output is correct

Subtask #7
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 868 ms 97648 KB Output is correct
2 Correct 781 ms 97644 KB Output is correct
3 Correct 774 ms 97688 KB Output is correct
4 Correct 759 ms 97504 KB Output is correct
5 Correct 408 ms 54716 KB Output is correct
6 Correct 831 ms 97620 KB Output is correct
7 Correct 752 ms 98280 KB Output is correct
8 Correct 740 ms 97720 KB Output is correct
9 Correct 724 ms 97732 KB Output is correct
10 Correct 813 ms 100004 KB Output is correct
11 Correct 389 ms 56032 KB Output is correct
12 Correct 240 ms 37312 KB Output is correct
13 Incorrect 789 ms 97776 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #8
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 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 1 ms 508 KB Output is correct
12 Correct 2 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 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 868 ms 97648 KB Output is correct
20 Correct 781 ms 97644 KB Output is correct
21 Correct 774 ms 97688 KB Output is correct
22 Correct 759 ms 97504 KB Output is correct
23 Correct 408 ms 54716 KB Output is correct
24 Correct 194 ms 106916 KB Output is correct
25 Correct 196 ms 106692 KB Output is correct
26 Correct 197 ms 106692 KB Output is correct
27 Correct 210 ms 108228 KB Output is correct
28 Correct 199 ms 106908 KB Output is correct
29 Correct 81 ms 48828 KB Output is correct
30 Correct 149 ms 48836 KB Output is correct
31 Correct 88 ms 48840 KB Output is correct
32 Correct 44 ms 11964 KB Output is correct
33 Correct 99 ms 12992 KB Output is correct
34 Correct 92 ms 12988 KB Output is correct
35 Correct 98 ms 12988 KB Output is correct
36 Correct 103 ms 12988 KB Output is correct
37 Correct 89 ms 12988 KB Output is correct
38 Correct 89 ms 12988 KB Output is correct
39 Correct 101 ms 14524 KB Output is correct
40 Correct 81 ms 11400 KB Output is correct
41 Correct 76 ms 12476 KB Output is correct
42 Correct 81 ms 12864 KB Output is correct
43 Correct 831 ms 97620 KB Output is correct
44 Correct 752 ms 98280 KB Output is correct
45 Correct 740 ms 97720 KB Output is correct
46 Correct 724 ms 97732 KB Output is correct
47 Correct 813 ms 100004 KB Output is correct
48 Correct 389 ms 56032 KB Output is correct
49 Correct 240 ms 37312 KB Output is correct
50 Incorrect 789 ms 97776 KB Output isn't correct
51 Halted 0 ms 0 KB -