oj.uz

Submission #742966

# Submission time Handle Problem Language Result Execution time Memory
742966 2023-05-17T07:03:31 Z jamezzz Nicelines (RMI20_nicelines) C++17
0 / 100
 1 ms 208 KB 
#include <bits/stdc++.h>
using namespace std;
#include "nice_lines.h"

#define maxn 10000

typedef long double ld;

#define dist(a,b,x,y) (ld)abs(y-a*x-b)/pow(1+a*a,0.5)

void solve(int subtask_id,int N){
	ld x1=query(0,10000),x2=query(0,10001);
	int a=(int)pow(1/((x2-x1)*(x2-x1))-1,0.5);//+-a
	int b=(int)(10001-x2*pow(a*a+1,0.5));
	if(dist(a,b,1,b+1)!=query(1,b+1))a=-a;
	the_lines_are({a},{b});
}

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Incorrect 0 ms 208 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -