oj.uz

답안 #1109151

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1109151 2024-11-06T06:11:47 Z Kerim 모자이크 (IOI24_mosaic) C++17
78 / 100
 1000 ms 103172 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 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());
    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);
            for (int j = 0; j < k; j++){
                res += cnt[b] - cnt[a-1];
                // for (int h = a; h <= b; h++)
                //     res += cnt[h];
                a += 1;
                b += 1;
            }
            // 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

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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 520 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 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 520 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 504 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 759 ms 97212 KB Output is correct
2 Correct 769 ms 97396 KB Output is correct
3 Correct 759 ms 97212 KB Output is correct
4 Correct 771 ms 97360 KB Output is correct
5 Correct 391 ms 53184 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 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 520 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 504 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 351 ms 11932 KB Output is correct
19 Correct 574 ms 14896 KB Output is correct
20 Correct 721 ms 13508 KB Output is correct
21 Correct 636 ms 13252 KB Output is correct
22 Correct 439 ms 11976 KB Output is correct
23 Correct 173 ms 10692 KB Output is correct
24 Correct 64 ms 14276 KB Output is correct
25 Correct 176 ms 13508 KB Output is correct

Subtask #5
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 9916 KB Output is correct
2 Correct 91 ms 12996 KB Output is correct
3 Correct 99 ms 12988 KB Output is correct
4 Correct 89 ms 12948 KB Output is correct
5 Correct 86 ms 12944 KB Output is correct
6 Correct 82 ms 12988 KB Output is correct
7 Correct 82 ms 12988 KB Output is correct
8 Correct 81 ms 12988 KB Output is correct
9 Correct 78 ms 11452 KB Output is correct
10 Correct 100 ms 11456 KB Output is correct
11 Correct 75 ms 11464 KB Output is correct

Subtask #6
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 833 ms 97212 KB Output is correct
2 Correct 796 ms 97240 KB Output is correct
3 Correct 800 ms 97212 KB Output is correct
4 Correct 832 ms 97288 KB Output is correct
5 Correct 785 ms 97412 KB Output is correct
6 Correct 398 ms 53048 KB Output is correct
7 Correct 247 ms 35580 KB Output is correct

Subtask #7
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 759 ms 97212 KB Output is correct
2 Correct 769 ms 97396 KB Output is correct
3 Correct 759 ms 97212 KB Output is correct
4 Correct 771 ms 97360 KB Output is correct
5 Correct 391 ms 53184 KB Output is correct
6 Correct 833 ms 97212 KB Output is correct
7 Correct 796 ms 97240 KB Output is correct
8 Correct 800 ms 97212 KB Output is correct
9 Correct 832 ms 97288 KB Output is correct
10 Correct 785 ms 97412 KB Output is correct
11 Correct 398 ms 53048 KB Output is correct
12 Correct 247 ms 35580 KB Output is correct
13 Correct 793 ms 97212 KB Output is correct
14 Correct 769 ms 102332 KB Output is correct
15 Correct 747 ms 100452 KB Output is correct
16 Correct 745 ms 97260 KB Output is correct
17 Correct 824 ms 101328 KB Output is correct
18 Correct 824 ms 103172 KB Output is correct
19 Correct 343 ms 46788 KB Output is correct

Subtask #8
0.0 / 22.0

# 결과 실행 시간 메모리 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 520 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 1 ms 504 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 759 ms 97212 KB Output is correct
20 Correct 769 ms 97396 KB Output is correct
21 Correct 759 ms 97212 KB Output is correct
22 Correct 771 ms 97360 KB Output is correct
23 Correct 391 ms 53184 KB Output is correct
24 Correct 351 ms 11932 KB Output is correct
25 Correct 574 ms 14896 KB Output is correct
26 Correct 721 ms 13508 KB Output is correct
27 Correct 636 ms 13252 KB Output is correct
28 Correct 439 ms 11976 KB Output is correct
29 Correct 173 ms 10692 KB Output is correct
30 Correct 64 ms 14276 KB Output is correct
31 Correct 176 ms 13508 KB Output is correct
32 Correct 48 ms 9916 KB Output is correct
33 Correct 91 ms 12996 KB Output is correct
34 Correct 99 ms 12988 KB Output is correct
35 Correct 89 ms 12948 KB Output is correct
36 Correct 86 ms 12944 KB Output is correct
37 Correct 82 ms 12988 KB Output is correct
38 Correct 82 ms 12988 KB Output is correct
39 Correct 81 ms 12988 KB Output is correct
40 Correct 78 ms 11452 KB Output is correct
41 Correct 100 ms 11456 KB Output is correct
42 Correct 75 ms 11464 KB Output is correct
43 Correct 833 ms 97212 KB Output is correct
44 Correct 796 ms 97240 KB Output is correct
45 Correct 800 ms 97212 KB Output is correct
46 Correct 832 ms 97288 KB Output is correct
47 Correct 785 ms 97412 KB Output is correct
48 Correct 398 ms 53048 KB Output is correct
49 Correct 247 ms 35580 KB Output is correct
50 Correct 793 ms 97212 KB Output is correct
51 Correct 769 ms 102332 KB Output is correct
52 Correct 747 ms 100452 KB Output is correct
53 Correct 745 ms 97260 KB Output is correct
54 Correct 824 ms 101328 KB Output is correct
55 Correct 824 ms 103172 KB Output is correct
56 Correct 343 ms 46788 KB Output is correct
57 Execution timed out 1054 ms 99980 KB Time limit exceeded
58 Halted 0 ms 0 KB -