# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
378655 | Seanliu | Chessboard (IZhO18_chessboard) | C++14 | 24 ms | 2796 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <cassert>
#define int long long int
#define ericxiao ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
const int maxN = 1e5 + 326;
struct Rect{
int l, r, d, u, A;
Rect(){}
Rect(int l, int r, int d, int u): l(l), r(r), d(d), u(u){
A = (r - l + 1) * (u - d + 1);
}
} rects[maxN];
inline bool onDiag(int x, int y, int d){
return (((x % (2 * d)) < d) == ((y % (2 * d)) < d));
}
inline int id(int x, int y, int d){
return x / d * maxN + y / d;
}
inline int getArea(int a, int b){
if(a < 0 || b < 0) return 0;
return a * b;
}
inline int Area(int l, int r, int d, int u, int div){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |