oj.uz

Submission #592512

# Submission time Handle Problem Language Result Execution time Memory
592512 2022-07-09T09:16:14 Z dantoh000 Nicelines (RMI20_nicelines) C++14
82.2509 / 100
 71 ms 668 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#include "nice_lines.h"

map<ll, map<ll, ld> > cache;

ld Q(ll x, ll y){
	if (cache[x].count(y)) return cache[x][y];
	else return cache[x][y] = query((ld)x, (ld)y);
}

ld getdiff(ll x, ll y){
	return Q(x, y+1) - Q(x, y);
}

vector<ll> ans;
ll X = 1000000;
void dnc(ll L, ll R, ld S, ld E){
	///printf("DNC %lld %lld %Lf %Lf\n",L,R,S,E);
	if (abs(S-E) < 1e-5){
		return;
	}
	if (L >= R) return;
	if (L+1 == R){
		ans.push_back(L+1);
		return;
	}
	ll mid = (L+R)/2;
	ld Q = getdiff(X, mid);
	dnc(L, mid, S, Q);
	dnc(mid, R, Q, E);
	
}

void solve(int subtask_id, int N) {
    ///printf("subtask_id = %d, N = %d\n", subtask_id, N);
    ll L = -100000000000;
    ll R = 100000000000;
    long double Q1 = getdiff(X, L);
    long double Q2 = getdiff(X, R);
    dnc(L, R, Q1, Q2);
    vector<int> a,b;
    for (auto x : ans){
		///printf("%lld\n",x);
		int A = round((ld)x/1000000);
		int B = x - A*1000000;
		a.push_back(A); b.push_back(B);
	}
    the_lines_are(a,b);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 208 KB Output is correct
2 Correct 2 ms 208 KB Output is correct
3 Correct 2 ms 208 KB Output is correct
4 Correct 3 ms 208 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 208 KB Output is correct
2 Correct 2 ms 208 KB Output is correct
3 Correct 3 ms 208 KB Output is correct
4 Correct 3 ms 208 KB Output is correct

Subtask #4
13.2770368831 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 61 ms 580 KB Output is partially correct
2 Partially correct 65 ms 604 KB Output is partially correct
3 Partially correct 66 ms 584 KB Output is partially correct
4 Partially correct 60 ms 624 KB Output is partially correct

Subtask #5
20.7606272134 / 23.0

# Verdict Execution time Memory Grader output
1 Partially correct 25 ms 404 KB Output is partially correct
2 Partially correct 28 ms 352 KB Output is partially correct
3 Partially correct 22 ms 336 KB Output is partially correct
4 Partially correct 21 ms 404 KB Output is partially correct

Subtask #6
17.2132735986 / 27.0

# Verdict Execution time Memory Grader output
1 Partially correct 61 ms 580 KB Output is partially correct
2 Partially correct 65 ms 604 KB Output is partially correct
3 Partially correct 66 ms 584 KB Output is partially correct
4 Partially correct 60 ms 624 KB Output is partially correct
5 Partially correct 25 ms 404 KB Output is partially correct
6 Partially correct 28 ms 352 KB Output is partially correct
7 Partially correct 22 ms 336 KB Output is partially correct
8 Partially correct 21 ms 404 KB Output is partially correct
9 Partially correct 71 ms 668 KB Output is partially correct
10 Partially correct 68 ms 640 KB Output is partially correct
11 Partially correct 71 ms 628 KB Output is partially correct
12 Partially correct 62 ms 608 KB Output is partially correct