제출 #1171822

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

mosaic

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

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();
    vector<vector<int>> l(N, vector<int> (N, -1));
    l[0] = X;
    for (int i = 0; i < N; i++) l[i][0] = Y[i];
    for (int i = 1; i < N; i++) {
        for (int j = 1; j < N; j++) l[i][j] = !(l[i][j-1]||l[i-1][j]);
    }

    int M = T.size();
    vector<long long> ans(M);
    for (int i = 0; i < M; i++) {
        for (int x = L[i]; x <= R[i]; x++) {
            for (int y = T[i]; y <= B[i]; y++) ans[i] += l[y][x];
        }
    }
    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