Submission #743264

#TimeUsernameProblemLanguageResultExecution timeMemory
743264jamielimNicelines (RMI20_nicelines)C++14
11 / 100
1 ms300 KiB
#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=1/tan(angle);
		int a=round(absa);
		int b=1000000-round(s/abs(t-s));
		if(query(1,a+b)>EPS)a=-a;
		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...