# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1066188 | Unforgettablepl | Dragon 2 (JOI17_dragon2) | C++17 | 1501 ms | 11732 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 int long long
typedef complex<int> point;
int cross_product(point a,const point &b) {
a.imag(-a.imag());
return (a*b).imag();
}
int cross_product_int(point a,const point &b) {
if(cross_product(a,b)<0)return -1;
return +1;
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int N,M;
cin >> N >> M;
vector<pair<point,int>> dragons(N);
for(auto&[a,b]:dragons) {
int u,v;cin>>u>>v>>b;
a = {u,v};
}
point d1,d2;
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |