oj.uz

Submission #112572

# Submission time Handle Problem Language Result Execution time Memory
112572 2019-05-20T16:22:41 Z zoooma13 Mobile (BOI12_mobile) C++14
0 / 100
 1000 ms 8284 KB 
#include <bits/stdc++.h>
using namespace std;

#define MAX_N 1000006

int n ,l;
int x[MAX_N] ,y[MAX_N];

bool can(double X)
{
    double mx = 0;
    for(int i=0; i<n; i++){
        if(X < y[i])
            continue;
        double len = sqrt((X*X)-(1.0*y[i]*y[i]));
        if(mx < x[i]-len)
            return 0;
        mx = max(mx ,x[i]+len);
    }
    return (mx >= l);
}

int main()
{
    scanf("%d%d",&n,&l);
    for(int i=0; i<n; i++)
        scanf("%d%d",&x[i],&y[i]) ,y[i] = abs(y[i]);

    double st = 0 ,en = 1e12 ,mid;
    for(int ee=200; ee; ee--){
        mid = (st+en)/2;
        if(can(mid))
            en = mid;
        else
            st = mid;
    }

    cout << fixed << setprecision(6) << en << endl;
}

Compilation message

mobile.cpp: In function 'int main()':
mobile.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&l);
     ~~~~~^~~~~~~~~~~~~~
mobile.cpp:27:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&x[i],&y[i]) ,y[i] = abs(y[i]);
         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Incorrect 2 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Incorrect 2 ms 384 KB Output isn't correct

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 10 ms 384 KB Output is correct
3 Incorrect 9 ms 460 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 102 ms 1228 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 42 ms 1232 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 1324 KB Output is correct
2 Incorrect 42 ms 1280 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 51 ms 1528 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 1408 KB Output is correct
2 Incorrect 158 ms 1500 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 820 ms 4616 KB Output is correct
2 Correct 751 ms 4572 KB Output is correct
3 Correct 723 ms 4728 KB Output is correct
4 Incorrect 296 ms 4572 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 786 ms 4472 KB Output is correct
2 Incorrect 795 ms 4572 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 994 ms 5312 KB Output is correct
2 Incorrect 304 ms 5484 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 314 ms 5240 KB Output is correct
2 Incorrect 888 ms 5372 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1070 ms 6028 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 334 ms 6176 KB Output is correct
2 Execution timed out 1006 ms 6108 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1054 ms 6820 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1081 ms 6904 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1072 ms 8284 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1052 ms 8184 KB Time limit exceeded
2 Halted 0 ms 0 KB -