Submission #1312143

#TimeUsernameProblemLanguageResultExecution timeMemory
1312143eri16Mosaic (IOI24_mosaic)C++20
0 / 100
72 ms11820 KiB
#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){
    vector <ll> ans;
    
    ll q = T.size();
    
    ll t,b,l,r;
    
    for (int i=0; i<q; i++){
        
        t=T[i];
        b=B[i];
        l=L[i];
        r=R[i];
        
        t--;
        b--;
        l--;
        r--;
        
        l=max(l,0LL);
        t=max(t,0LL);
        
        ll sm = (r-l+1)*(b-t+1);
        
        if (sm%2==0){ans.push_back(sm/2);}
        else if (t%2==l%2){ans.push_back(sm/2);}
        else{ans.push_back(sm/2+1);}
    } 
    return ans;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...