# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97760 | Anai | trapezoid (balkan11_trapezoid) | C++14 | 225 ms | 15224 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>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44
using namespace std;
const int MOD = 30013;
const int MAXN = (int) 1e5;
inline void mod(int &x) {
if(x >= MOD)
x -= MOD;
}
struct Data {
int a, b, c, d;
}arr[MAXN + 1];
int ord1[MAXN + 1], ord2[MAXN + 1];
bool cmp1(int a, int b) {
return arr[a].b < arr[b].b;
}
bool cmp2(int a, int b) {
return arr[a].a < arr[b].a;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |