# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
743235 | jamielim | Nicelines (RMI20_nicelines) | C++14 | 0 ms | 0 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 "nice_lines.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ii,ii> i4;
typedef vector<int> vi;
const int MOD=1000000007;
const int INF=1012345678;
const ll LLINF=1012345678012345678LL;
const double PI=3.1415926536;
const double EPS=1e-14;
typedef long double ld;
void solve(int subtask_id, int N) {
if(N==1){
ld s=query(0,1000000);
ld t=query(0,1000001);
ld angle=asin(abs(t-s))
ld absa=tan(angle);
int b=1000000-round(s*absa);
int a=round(absa);
if(query(1,a+b)>EPS)a=-a;
the_lines_are({a},{b});
}
}