Submission #1297489

#TimeUsernameProblemLanguageResultExecution timeMemory
1297489random_nameNicelines (RMI20_nicelines)C++20
11 / 100
2 ms408 KiB
#include <bits/stdc++.h>
using namespace std;    
using ll = long long;
#include "nice_lines.h"

void solve(int subtask_id, int N) {
    if(N == 1){
        ll l=-1000000000000, r=1000000000000;
        while(l < r){
            ll m1 = l + (r-l+1) / 3;
            ll m2 = r - (r-l+1) / 3;
            long double q1 = query(0, m1);
            long double q2 = query(0, m2);
            if(q1 > q2)
                l = m1+1;

            else if(q2 > q1)
                r = m2-1;
            
            else{
                l=m1; r=m2;
            }
        }

        ll b = l;

        l=-1000000000000;
        r=1000000000000;
        while(l < r){
            ll m1 = l + (r-l+1) / 3;
            ll m2 = r - (r-l+1) / 3;
            long double q1 = query(1, m1);
            long double q2 = query(1, m2);
            if(q1 > q2)
                l = m1+1;

            else if(q2 > q1)
                r = m2-1;
            
            else{
                l=m1; r=m2;
            }
        }


        ll a = l - b;
        vector<int> A{(int)a};
        vector<int> B{(int)b};
        the_lines_are(A, B);
    }
    else{
        return;
    }
}
#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...