Submission #1211464

#TimeUsernameProblemLanguageResultExecution timeMemory
1211464sula2Mosaic (IOI24_mosaic)C++20
0 / 100
72 ms11332 KiB
#include <bits/stdc++.h> #define all(a) a.begin(), a.end() #define popcount(x) __builtin_popcountll(x) using namespace std; using namespace chrono; 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<long long> ans(q); for (int i = 0; i < q; i++) { int r1 = T[i]; int c1 = L[i]; int r2 = B[i]; int c2 = R[i]; if (r1 == 0) r1++; if (c1 == 0) c1++; if (r1 > r2 || c1 > c2) { ans[i] = 0; continue; } long long area = max(0LL, 1LL*(r2 - r1 + 1)*(c2 - c1 + 1)); area /= 2; if (r1 % 2 == c1 % 2 && area % 2) area++; ans[i] = area; } 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...