Submission #743218

#TimeUsernameProblemLanguageResultExecution timeMemory
743218jamezzzNicelines (RMI20_nicelines)C++17
31 / 100
49 ms316 KiB
#include <bits/stdc++.h> using namespace std; #include "nice_lines.h" #define pf printf #define pb push_back #define maxn 10000 #define EPS 1e-5 #define dist(a,b,x,y) (ld)abs(y-a*x-b)/pow(1+a*a,0.5) typedef long long ll; typedef long double ld; typedef pair<int,int> ii; map<ii,ld> memo; vector<ii> know; ld ask(ld x,ld y){ ld res; if(x==0){ if(memo.find({(int)x,(int)y})!=memo.end())res=memo[{(int)x,(int)y}]; else res=memo[{(int)x,(int)y}]=query(x,y); } else res=query(x,y); for(auto[a,b]:know)res-=dist(a,b,x,y); return res; } void solve(int subtask_id,int N){ for(int i=0;i<N-1;++i){ int lo=-10000,hi=10000,mid,res; if(subtask_id==4)lo=-500,hi=500; while(lo<=hi){ mid=lo+((hi-lo)>>1); if(ask(0,mid)>ask(0,mid+1))lo=mid+1; else res=mid,hi=mid-1; } int b=(int)res; lo=-10000,hi=10000; if(subtask_id==4)lo=-500,hi=500; while(lo<=hi){ mid=lo+((hi-lo)>>1); if(ask(EPS,mid*EPS+b)>ask(EPS,(mid+1)*EPS+b))lo=mid+1; else res=mid,hi=mid-1; } int a=(int)res; know.push_back({a,b}); } ld x1=ask(0,10000),x2=ask(0,10001); ld inv=1/(x2-x1); int a=(int)(pow(inv*inv-1,0.5)+1e-3); int b=(int)(10001-x2*pow(a*a+1,0.5)+1e-3); if(abs(dist(a,b,1,10001)-ask(1,10001))>EPS)a=-a; know.pb({a,b}); vector<int> A,B; for(auto[a,b]:know)A.pb(a),B.pb(b); the_lines_are(A,B); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...