# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
463816 | Mamedov | Triangles (CEOI18_tri) | C++17 | 23 ms | 2140 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.
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include "trilib.h"
#define ll long long
#define ui unsigned int
#define pii pair<int, int>
#define piii pair<int, pii>
#define pb push_back
#define f first
#define s second
#define oo (1ll << 60)
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
bool cmpD(int p1, int p2) {
return is_clockwise(1, p1, p2);
}
bool cmpU(int p1, int p2) {
return !is_clockwise(1, p1, p2);
}
void Find_CH(vector<int> &v, int dr) {
v.pb(1);
int ptr = 2;
int i = 3;
for(int i = 3; i < (int)v.size(); ++i) {
while((dr ^ is_clockwise(v[ptr - 1], v[ptr], v[i]))) {
--ptr;
}
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... |