제출 #1238608

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

mosaic

#include "mosaic.h"
#include <bits/stdc++.h>
#define ll long long
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();
    int g[n+1][n+1]{};
    for(int i=1;i<=n;i++){
        g[1][i]=x[i-1];
        g[i][1]=y[i-1];
    }
    for(int i=2;i<=n;i++){
        for(int j=2;j<=n;j++){
            g[i][j]=(g[i-1][j]==0&&g[i][j-1]==0);
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            g[i][j]+=g[i-1][j]+g[i][j-1]-g[i-1][j-1];
        }
    }
    int q=t.size();
    vector<ll>c(q, 0);
    for(int i=0;i<q;i++){
        t[i]++;
        b[i]++;
        l[i]++;
        r[i]++;
        c[i]=g[b[i]][r[i]]-g[t[i]-1][r[i]]-g[b[i]][l[i]-1]+g[t[i]-1][l[i]-1];
    }
    return c;
}

• 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