제출 #1099891

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1099891		model_code	모자이크 (IOI24_mosaic)	C++17	12 / 100	1104 ms	2097152 KiB

mosaic

// time_limit/hazem_n2_plus_nq.cpp

#include "bits/stdc++.h"
#include "mosaic.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 = (int)X.size();

    vector<vector<long long>> m(N, vector<long long>(N));
    for(int i = 0; i < N; i++)
    for(int j = 0; j < N; j++){
        if(i == 0)      m[i][j] = X[j];
        else if(j == 0) m[i][j] = Y[i];
        else            m[i][j] = !(m[i][j-1] | m[i-1][j]);
    }

    for(int i = 0; i < N; i++)
    for(int j = 1; j < N; j++)
        m[i][j] += m[i][j-1];

    vector<long long> C(T.size());
    for(int q = 0; q < (int)C.size(); q++){
        auto [t, b, l, r] = tie(T[q], B[q], L[q], R[q]);
        for(int i = t; i <= b; i++)
            C[q] += m[i][r] - (l? m[i][l-1] : 0);
    }
    return C;
}

• 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