제출 #1235984

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1235984		repsak	모자이크 (IOI24_mosaic)	C++20	0 / 100	74 ms	25416 KiB

mosaic

#include "mosaic.h"
#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 = (int)X.size();
	int Q = (int)T.size();

    int MAX = min(5, N);
    vector<vector<int>> top(N, vector<int>(MAX));
    vector<vector<int>> left(MAX, vector<int>(N));

	for(int i = 0; i < N; i++){
        top[0][i] = X[i];

        if(i < MAX){
            top[i][0] == Y[i];
            left[0][i] = X[i];
        }

        left[i][0] = Y[i];
	}

    for(int y = 1; y < MAX; y++){
        for(int x = 1; x < N; x++){
            int col = top[y][x - 1] == 0 && top[y - 1][x] == 0 ? 1 : 0;
            top[y][x] = col;
        }
    }

    for(int y = 1; y < N; y++){
        for(int x = 1; x < MAX; x++){
            int col = left[y][x - 1] == 0 && left[y - 1][x] == 0 ? 1 : 0;
            left[y][x] = col;
        }
    }
	vector<ll> r(Q);

    for(int i = 0; i < Q; i++){
        if(B[i] < MAX){
            r[i] = top[B[i]][L[i]];
            continue;
        }
        if(L[i] < MAX){
           r[i] = left[B[i]][L[i]]; 
           continue;
        }

        int col = B[i] % 2 == L[i] % 2;
        r[i] = col;
    }

  	return r;
}

// #include "grader.cpp"

• 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