Submission #1133646

#	Time	Username	Problem	Language	Result	Execution time	Memory
1133646		Luvidi	Mosaic (IOI24_mosaic)	C++20	5 / 100	1048 ms	2162688 KiB

mosaic

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

std::vector<long long> mosaic(std::vector<int> x, std::vector<int> y,
                              std::vector<int> t, std::vector<int> b,
                              std::vector<int> l, std::vector<int> r) {
    int n=x.size();
    long long a[n+1][n+1];
    memset(a,0,sizeof(a));
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(i==1)a[i][j]=x[j-1];
            else if(j==1)a[i][j]=y[i-1];
            else{
                a[i][j]=!a[i-1][j]&&!a[i][j-1];
            }
        }
    }
    for(int i=3;i<=n;i++){
        for(int j=3;j<=n;j++){
            assert(a[i][j]==a[i-1][j-1]);
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            a[i][j]+=a[i-1][j]+a[i][j-1]-a[i-1][j-1];
        }
    }
    int q=t.size();
    vector<long long> ans(q);
    for(int i=0;i<q;i++){
        r[i]++;
        b[i]++;
        ans[i]=a[b[i]][r[i]]+a[t[i]][l[i]]-a[t[i]][r[i]]-a[b[i]][l[i]];
    }
    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