Submission #1160297

#	Time	Username	Problem	Language	Result	Execution time	Memory
1160297		SmuggingSpun	모자이크 (IOI24_mosaic)	C++20	22 / 100	215 ms	106424 KiB

mosaic

#include<bits/stdc++.h>
#include "mosaic.h"
using namespace std;
typedef long long ll;
vector<ll>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<ll>ans(q);
    if(n <= 5000){
        vector<vector<int>>f(n + 1, vector<int>(n + 1, 0));
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; j++){
                if(i == 1){
                    f[i][j] = X[j - 1];
                }
                else if(j == 1){
                    f[i][j] = Y[i - 1];
                }
                else{
                    f[i][j] = (f[i][j - 1] | f[i - 1][j]) ^ 1;
                }
            }
        }
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; j++){
                f[i][j] += f[i][j - 1] + f[i - 1][j] - f[i - 1][j - 1]; 
            }
        }
        for(int i = 0; i < q; i++){
            ans[i] = f[B[i] + 1][R[i] + 1] - f[B[i] + 1][L[i]] - f[T[i]][R[i] + 1] + f[T[i]][L[i]];
        }
    }
    else{

    }
    return ans;
}

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