# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99203 | dsg213 | Relay (COI16_relay) | C++14 | 238 ms | 9436 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 mp make_pair
#define st first
#define nd second
#define ll long long
using namespace std;
struct pkt{
ll x;
ll y;
};
ll det(pkt a,pkt b,pkt c){
return a.x*b.y+b.x*c.y+c.x*a.y-a.x*c.y-b.x*a.y-c.x*b.y;
}
int nalewo(pkt pds1,pkt pds2,pkt spr){
return det(pds1,pds2,spr)>0;
}
int naprawo(pkt pds1,pkt pds2,pkt spr){
return det(pds1,pds2,spr)<0;
}
pkt sta[110000];
pkt wys[210000];
int zaz[110000];
int n,m;
pair<int,int> odpal(int x){
int mxl=0,mxp=0;
for(int i=0;i<m;i++){
if(naprawo(sta[x],wys[mxp],wys[i])){
mxp=i;
}
}
# | 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... |