Submission #1243628

#	Time	Username	Problem	Language	Result	Execution time	Memory
1243628		alexander707070	모자이크 (IOI24_mosaic)	C++20	0 / 100	144 ms	107836 KiB

mosaic

#include<bits/stdc++.h>
#define MAXN 200007
using namespace std;

int n,q;
int t[5007][5007];

int row[5][MAXN],col[5][MAXN];

vector<long long> mosaic(vector<int> X, vector<int> Y,vector<int> T, vector<int> B,vector<int> L, vector<int> R){
	n=int(X.size());
	q=int(T.size());

    n=min(n,5000);

	for(int i=1;i<=n;i++){
        row[1][i]=X[i-1];
        col[1][i]=Y[i-1];

        t[1][i]=X[i-1]; t[i][1]=Y[i-1];
    }

    for(int i=2;i<=n;i++){
        for(int f=2;f<=n;f++){
            if(t[i-1][f]==0 and t[i][f-1]==0)t[i][f]=1;
        }
    }

    for(int i=4;i<=n;i++){
        for(int f=4;f<=n;f++){
            assert(t[i][f]==t[i-1][f-1]);   
        }
    }

    return {};
}

/*int main(){

	mosaic({1,1,1,0,0,0,1,1,0,1,0,1,1,1,0},{1,1,1,0,0,0,1,1,0,1,0,1,1,1,0},{},{},{},{});

	//auto yo=mosaic({0,0,0,0,0}, {0,0,0,0,0}, {1, 0}, {4, 3}, {2,0}, {4,3});
	//for(auto s:yo)cout<<s<<" ";

	return 0;
}*/

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