# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
660626 | Dec0Dedd | Dominance (CEOI08_dominance) | C++14 | 14 ms | 496 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 <bits/stdc++.h>
using namespace std;
#define pii pair<ll, ll>
#define ll long long
const int N = 1e5+1;
ll sm[N];
struct Ev {
ll x, lf, rf;
bool add;
};
vector<Ev> v;
bool cmp(Ev a, Ev b) {
if (a.x == b.x) return a.add < b.add;
return a.x < b.x;
}
ll calc(ll x1, ll y1, ll x2, ll y2) {
if ((x2-x1)*(y2-y1)%2 == 0) return (x2-x1)*(y2-y1)/2;
return (x2-x1)*(y2-y1)/2+(((x1^y1)&1) == 0);
}
int main() {
int n, h, w; cin>>h>>w>>n;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |