제출 #1312121

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

mosaic

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

using ll = long long;

vector<ll> mosaic(vector<int> X, vector<int> Y,vector<int> T, vector<int> B,vector<int> L, vector<int> R){
    
    ll n = X.size();
    
    ll row[3][200005];
    ll column[3][200005];
    
    for (int i=0; i<n; i++){row[0][i]=X[i];}
    for (int i=0; i<n; i++){column[0][i]=Y[i];}
    
    if (n>1){
        row[1][0]=column[0][1];
        column[1][0]=row[0][1];
        for (int i=1; i<n; i++){row[1][i]=1-(row[1][i-1] | row[0][i]);}
        for (int i=1; i<n; i++){column[1][i]=1-(column[1][i-1] | column[0][i]);}
    }
    if (n>2){
        row[2][0]=column[0][2];
        column[2][0]=row[0][2];
        for (int i=1; i<n; i++){row[2][i]=1-(row[2][i-1] | row[1][i]);}
        for (int i=1; i<n; i++){column[2][i]=1-(column[2][i-1] | column[1][i]);}
    }
    
    ll q = T.size();
    
    vector <ll> ans;
    
    ll t,b,l,r;
    
    for (int i=0; i<q; i++){
        
        t=T[i];
        b=B[i];
        l=L[i];
        r=R[i];
        
        if (t<=2){
            ans.push_back(row[t][l]);
        }
        else if (l<=2){
            ans.push_back(column[t][l]);
        }
        else{
            if (l>=t){
                ans.push_back(column[2][l-t+2]);
            }
            else{
                ans.push_back(row[2][t-l+2]);                
            }
        }        
    
    }
    return ans;
}   

• 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