# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
776577 | jamezzz | Dragon 2 (JOI17_dragon2) | C++17 | 188 ms | 25784 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 sf scanf
#define pf printf
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define LINF 1023456789123456789
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ll,int> li;
typedef long double ld;
#define maxn 3005
int n,m,a[maxn],b[maxn],c[maxn],ans[maxn][maxn];
int d1,e1,d2,e2;
ld get(ll a1,ll b1,ll a2,ll b2,ll d1,ll e1,ll d2,ll e2){
return (ld)((a2-a1)*(b1-e1)+(b2-b1)*(d1-a1))/((e2-e1)*(a2-a1)-(b2-b1)*(d2-d1));
}
int main(){
sf("%d%d",&n,&m);
for(int i=1;i<=n;++i){
sf("%d%d%d",&a[i],&b[i],&c[i]);
}
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... |