Submission #1117433

#TimeUsernameProblemLanguageResultExecution timeMemory
1117433Tenis0206Nicelines (RMI20_nicelines)C++11
86.03 / 100
71 ms1344 KiB
#include <bits/stdc++.h> #include "nice_lines.h" using namespace std; int cmax = 1e4; long double eps; vector<int> a, b; map<pair<long double, long double>, bool> sel; map<pair<long double, long double>, long double> rez_query; long double my_query(long double A, long double B) { if(!sel[ {A,B}]) { sel[ {A, B}] = true; rez_query[ {A, B}] = query(A, B); } return rez_query[ {A, B}]; } int aprox(long double val) { return (int)(val + 0.5); } void solve(int subtask_id, int n) { if(subtask_id == 4) { cmax = 500; } long long A = cmax + 9; long long B = (A + 1) * cmax + 1; eps = (my_query(A, B) - my_query(A, B - 1)) * 0.001; for(int i=0; i<n; i++) { long double dif = my_query(A, B) - my_query(A, B - 1); long long st = -(A + 1) * cmax - 1 + (n - 1); long long dr = B - 1; long double dif_B = 0; long long poz = 0; while(st <= dr) { long long mij = (st + dr) >> 1LL; long double dif_mij = my_query(A, B) - my_query(A, mij - 1); if(abs(dif_mij - (B - mij + 1) * dif) > eps) { poz = mij; st = mij + 1; } else { dr = mij - 1; } } B = poz; dif_B = my_query(A, B) - my_query(A, B - 1); long double val_cos = 0.5 * (dif - dif_B); int cur_a = aprox(sqrt(1 - val_cos * val_cos) / val_cos); int cur_b = B - cur_a * A; if(cur_b < -cmax || cur_b > cmax) { cur_a *= (-1); cur_b = B - cur_a * A; } a.push_back(cur_a); b.push_back(cur_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...