제출 #1271674

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

mosaic

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

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<long long> ans(q,0);
    if(n == 1){
        for(int i=0;i<q;i++) ans[i] = x[0];
        return ans;
    }
    vector<vector<int>> grid(n,vector<int>(n));
    for(int i=0;i<n;i++)
        grid[0][i] = x[i];
    for(int i=0;i<n;i++)
        grid[i][0] = y[i];
    if(grid[0][1] == 0 && grid[1][0] == 0) grid[1][1] = 1;
    else grid[1][1] = 0;
    for(int qrs=0;qrs<q;qrs++){
        int t = T[qrs],b = B[qrs],l = L[qrs],r = R[qrs];
        for(int i=t;i<=b;i++){
            for(int j=l;j<=r;j++){
                if(grid[i][j] == 1){
                    ans[qrs]++;
                }
            }
        }
    }
    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 0 / 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