Submission #645181

#	Time	Username	Problem	Language	Result	Execution time	Memory
645181		TimDee	Nicelines (RMI20_nicelines)	C++17	0 / 100	1 ms	352 KiB

nicelines

#include "nice_lines.h"
#include <bits/stdc++.h>
using namespace std;
#define ld long double

int n;

void p1() {
    int l=-1e4, r=1e4;
    while (l<r) {
        int mid=(l+r+1)>>1;
        ld x=query(0,mid-1);
        ld y=query(0,mid);
        ld z=query(0,mid+1);
        if (x>=y && y<=z) {
            r=mid; break;
        }
        if (x<=y && y<=z) r=mid-1;
        else l=mid;
    }
    int b=r;
    l=-1e4, r=1e4;
    while (l<r) {
        int mid=(l+r+1)>>1;
        ld x=query(mid-1,0);
        ld y=query(mid,0);
        ld z=query(mid+1,0);
        if (x>=y && y<=z) {
            r=mid; break;
        }
        if (x<=y && y<=z) r=mid-1;
        else l=mid;
    }
    int x=query(0,b), y=query(1,b);
    assert(x==0);
    if (x==y) {
        the_lines_are({0},{b});
        return;
    }
    exit(1);
    int a;
    if (r) {
        assert(b!=0);
        a=-b/r;
    }
    else {
        if (query(1,1)==0) a=1;
        else if (query(1,-1)==0) a=-1;
        else a=0;
    }
    the_lines_are({a},{b});
}

void solve(int id, int N) {
    n=N;

    if (n==1) {
        p1(); return;
    }
    exit(1);

}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 13
• Subtask 3: 0 / 7
• Subtask 4: 0 / 19
• Subtask 5: 0 / 23
• Subtask 6: 0 / 27