oj.uz

Submission #1109270

# Submission time Handle Problem Language Result Execution time Memory
1109270 2024-11-06T10:04:49 Z Kerim Mosaic (IOI24_mosaic) C++17
70 / 100
 1000 ms 112440 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];
ll pre[N], suf[N], cep[N], sag[N];
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();
    for (int i = 0; i < n+n; i++)
        cnt[i] = 0;
    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 i = 3;
    for(int j = 3; j <= n; ++j)
        cnt[i-j+n] = mp[{i, j}];
    int j = 3;
    for(int i = 3; i <= n; ++i)
        cnt[i-j+n] = mp[{i, j}];

    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++)
        pre[i] = pre[i-1] + cnt[i];

    suf[n+n] = cep[n+n] = 0;

    for (int i = n+n-1; i >= 0; i--){
        suf[i] = suf[i+1] + cnt[i];
        cep[i] = cep[i+1] + suf[i+1] + cnt[i];
    }

    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);
            int len = b-a+1;
            b += k-1;
            k = min(k, len);
            res += cep[a] - (cep[a+k]+k*suf[a+k]);

            for (int j = 0; j < k; j++){
                // res += cnt[a++] * 1LL * (j+1);
                res += cnt[b--] * 1LL * (j+1);
            }
            a += k;
            if (a > b)
                res -= cnt[++b] * 1LL * k;
            res += (pre[b]-pre[a-1])*1LL*k;
        }
        ans.pb(res);
    }
    return ans;
}

// int main(){
//     freopen("file.in", "r", stdin);
//     srand((unsigned)time(NULL));
//     // while (1){
//         int n = rand()%10+2;
//         scanf("%d", &n);
//         vector<int> X, Y;
//         for(int i = 1; i <= n; ++i){
//             int x = rand()%2;
//             scanf("%d", &x);
//             X.pb(x);
//         }
//         for(int i = 1; i <= n; ++i){
//             int x = rand()%2;
//             scanf("%d", &x);
//             Y.pb(x);
//         }
//         Y[0] = X[0];
//         int q = 1000;
//         scanf("%d", &q);
//         vector<int> T, B, L, R;
//         while(q--){
//             int a = rand()%n, b = rand()%n, c = rand()%n, d = rand()%n;
//             scanf("%d%d%d%d", &a, &b, &c, &d);
//             if (a > b) swap(a, b);
//             if (c > d) swap(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 2 ms 6480 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Correct 1 ms 6480 KB Output is correct
3 Correct 1 ms 6648 KB Output is correct
4 Correct 1 ms 6480 KB Output is correct
5 Correct 1 ms 6480 KB Output is correct
6 Correct 1 ms 6480 KB Output is correct
7 Correct 1 ms 6480 KB Output is correct
8 Correct 1 ms 6480 KB Output is correct
9 Correct 2 ms 6480 KB Output is correct
10 Correct 1 ms 6480 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Correct 1 ms 6480 KB Output is correct
3 Correct 1 ms 6648 KB Output is correct
4 Correct 1 ms 6480 KB Output is correct
5 Correct 1 ms 6480 KB Output is correct
6 Correct 1 ms 6480 KB Output is correct
7 Correct 1 ms 6480 KB Output is correct
8 Correct 1 ms 6480 KB Output is correct
9 Correct 2 ms 6480 KB Output is correct
10 Correct 1 ms 6480 KB Output is correct
11 Correct 2 ms 6480 KB Output is correct
12 Correct 2 ms 6480 KB Output is correct
13 Correct 2 ms 6480 KB Output is correct
14 Correct 2 ms 6480 KB Output is correct
15 Correct 1 ms 6480 KB Output is correct
16 Correct 1 ms 6480 KB Output is correct
17 Correct 2 ms 6480 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 739 ms 107388 KB Output is correct
2 Correct 763 ms 107376 KB Output is correct
3 Correct 866 ms 107332 KB Output is correct
4 Correct 864 ms 107520 KB Output is correct
5 Correct 438 ms 62652 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Correct 1 ms 6480 KB Output is correct
3 Correct 1 ms 6648 KB Output is correct
4 Correct 1 ms 6480 KB Output is correct
5 Correct 1 ms 6480 KB Output is correct
6 Correct 1 ms 6480 KB Output is correct
7 Correct 1 ms 6480 KB Output is correct
8 Correct 1 ms 6480 KB Output is correct
9 Correct 2 ms 6480 KB Output is correct
10 Correct 1 ms 6480 KB Output is correct
11 Correct 2 ms 6480 KB Output is correct
12 Correct 2 ms 6480 KB Output is correct
13 Correct 2 ms 6480 KB Output is correct
14 Correct 2 ms 6480 KB Output is correct
15 Correct 1 ms 6480 KB Output is correct
16 Correct 1 ms 6480 KB Output is correct
17 Correct 2 ms 6480 KB Output is correct
18 Correct 241 ms 18372 KB Output is correct
19 Correct 459 ms 20932 KB Output is correct
20 Correct 632 ms 19908 KB Output is correct
21 Correct 416 ms 19908 KB Output is correct
22 Correct 353 ms 18116 KB Output is correct
23 Correct 116 ms 16836 KB Output is correct
24 Correct 67 ms 20536 KB Output is correct
25 Correct 70 ms 19396 KB Output is correct

Subtask #5
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 15888 KB Output is correct
2 Execution timed out 1052 ms 108828 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 802 ms 107344 KB Output is correct
2 Correct 802 ms 109352 KB Output is correct
3 Correct 747 ms 109452 KB Output is correct
4 Correct 810 ms 107456 KB Output is correct
5 Correct 884 ms 109212 KB Output is correct
6 Correct 421 ms 65044 KB Output is correct
7 Correct 244 ms 44480 KB Output is correct

Subtask #7
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 739 ms 107388 KB Output is correct
2 Correct 763 ms 107376 KB Output is correct
3 Correct 866 ms 107332 KB Output is correct
4 Correct 864 ms 107520 KB Output is correct
5 Correct 438 ms 62652 KB Output is correct
6 Correct 802 ms 107344 KB Output is correct
7 Correct 802 ms 109352 KB Output is correct
8 Correct 747 ms 109452 KB Output is correct
9 Correct 810 ms 107456 KB Output is correct
10 Correct 884 ms 109212 KB Output is correct
11 Correct 421 ms 65044 KB Output is correct
12 Correct 244 ms 44480 KB Output is correct
13 Correct 819 ms 107964 KB Output is correct
14 Correct 828 ms 110772 KB Output is correct
15 Correct 805 ms 109272 KB Output is correct
16 Correct 814 ms 107452 KB Output is correct
17 Correct 780 ms 107708 KB Output is correct
18 Correct 766 ms 112440 KB Output is correct
19 Correct 306 ms 55584 KB Output is correct

Subtask #8
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Correct 2 ms 6480 KB Output is correct
3 Correct 1 ms 6480 KB Output is correct
4 Correct 1 ms 6648 KB Output is correct
5 Correct 1 ms 6480 KB Output is correct
6 Correct 1 ms 6480 KB Output is correct
7 Correct 1 ms 6480 KB Output is correct
8 Correct 1 ms 6480 KB Output is correct
9 Correct 1 ms 6480 KB Output is correct
10 Correct 2 ms 6480 KB Output is correct
11 Correct 1 ms 6480 KB Output is correct
12 Correct 2 ms 6480 KB Output is correct
13 Correct 2 ms 6480 KB Output is correct
14 Correct 2 ms 6480 KB Output is correct
15 Correct 2 ms 6480 KB Output is correct
16 Correct 1 ms 6480 KB Output is correct
17 Correct 1 ms 6480 KB Output is correct
18 Correct 2 ms 6480 KB Output is correct
19 Correct 739 ms 107388 KB Output is correct
20 Correct 763 ms 107376 KB Output is correct
21 Correct 866 ms 107332 KB Output is correct
22 Correct 864 ms 107520 KB Output is correct
23 Correct 438 ms 62652 KB Output is correct
24 Correct 241 ms 18372 KB Output is correct
25 Correct 459 ms 20932 KB Output is correct
26 Correct 632 ms 19908 KB Output is correct
27 Correct 416 ms 19908 KB Output is correct
28 Correct 353 ms 18116 KB Output is correct
29 Correct 116 ms 16836 KB Output is correct
30 Correct 67 ms 20536 KB Output is correct
31 Correct 70 ms 19396 KB Output is correct
32 Correct 53 ms 15888 KB Output is correct
33 Execution timed out 1052 ms 108828 KB Time limit exceeded
34 Halted 0 ms 0 KB -