제출 #1204599

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1204599		aritro_	Mosaic (IOI24_mosaic)	C++20	8 / 100	80 ms	11336 KiB

mosaic

#include<bits/stdc++.h>
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){
    //subtask 5
    int n=x.size();
    int q=t.size();
    vector<long long> ans(q,0);
    for(int query=0;query<q;query++){
        if(r[query]==0||b[query]==0){
            ans[query]=0;
            continue;
        }
        bool f1=0,f2=0;
        if(t[query]==0){
            t[query]++;
            f1=1;
        }
        if(l[query]==0){
            l[query]++;
            f2=1;
        }
        long long cnt=(1LL*(r[query]-l[query]+1))*(1LL*(b[query]-t[query]+1));
        ans[query]=cnt/2;
        if(cnt%2==1){
            if((t[query]%2)==(l[query]%2)) ans[query]++;
        }
        if(f1) t[query]--;
        if(f2) l[query]--;
    }
    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 7
• Subtask 4: 0 / 10
• Subtask 5: 8 / 8
• Subtask 6: 0 / 22
• Subtask 7: 0 / 19
• Subtask 8: 0 / 22