Submission #1238628

#TimeUsernameProblemLanguageResultExecution timeMemory
1238628ricardsjansonsMosaic (IOI24_mosaic)C++20
0 / 100
74 ms11336 KiB
#include "mosaic.h" #include <bits/stdc++.h> #define ll long long 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){ int n=x.size(); int q=t.size(); vector<ll>c(q, 0); for(int i=0;i<q;i++){ t[i]=max(t[i],1); b[i]=max(b[i],1); l[i]=max(l[i],1); r[i]=max(r[i],1); ll w=r[i]-l[i]+1; ll h=b[i]-t[i]+1; if(w%2&&h%2){ c[i]=w/2+h/2+w/2*(h-1)+(b[i]+r[i]+1)%2; }else if(w%2){ c[i]=h/2*w; }else{ c[i]=w/2*h; } } return c; }
#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...