제출 #1281455

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1281455		tuongll	모자이크 (IOI24_mosaic)	C++20	12 / 100	1175 ms	2162688 KiB

mosaic

#include <bits/stdc++.h>
using namespace std;

int add(int a, int b){
    return a == 0 && b == 0;
}

vector<long long> mosaic(vector<int> X, vector<int> Y, vector<int> T, vector<int> B, vector<int> L, vector<int> R){
    int n = X.size(), q = T.size();

    vector<vector<int>> grid(n, vector<int>(n));
    for (int i = 0; i < n; ++i)
        grid[0][i] = X[i];
    for (int j = 0; j < n; ++j)
        grid[j][0] = Y[j];
    for (int i = 1; i < n; ++i){
        for (int j = 1; j < n; ++j)
            grid[i][j] = add(grid[i - 1][j], grid[i][j - 1]);
    }
    
    vector<long long> ans(q);
    for (int i = 0; i < q; ++i){
        for (int x = T[i]; x <= B[i]; ++x){
            for (int y = L[i]; y <= R[i]; ++y)
                ans[i] += grid[x][y];
        }
    }

    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 0 / 7
• Subtask 4: 0 / 10
• Subtask 5: 0 / 8
• Subtask 6: 0 / 22
• Subtask 7: 0 / 19
• Subtask 8: 0 / 22