답안 #935063

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
935063 2024-02-28T13:23:42 Z Ludissey Measures (CEOI22_measures) C++14
24 / 100
1500 ms 4844 KB
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1e9+7;
 
signed main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
	int n,m,D; cin >> n >> m >> D;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int _i = 0; _i < m; _i++)
    {
        int x; cin >> x;
        a.push_back(x);
        sort(a.begin(),a.end());
        double l=0,r=2000000000000000;
        double ans=0;
        while(r-l>=0.1){
            double mid=(l+r)/(double)2;
            double lb=a[0]-mid;
            bool br=false;
            for (int i = 1; i < a.size(); i++)
            {
                double bc=max(lb+(double)D, (double)a[i]-mid);
                if(bc>(double)a[i]+mid) {
                    br=true;
                    break;
                }
                lb=bc;
            }
            if(br){
                l=mid;
            }else{
                ans=mid;
                r=mid;
            }
        }
        int roundAns=ans;

        if((double)ans-roundAns<0.25) cout << roundAns << " ";
        else if ((double)ans-roundAns<0.75) cout << roundAns << ".5 ";
        else cout << roundAns+1 << " ";

    }
    cout << "\n";
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:22:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |             for (int i = 1; i < a.size(); i++)
      |                             ~~^~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 348 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 4 ms 496 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 348 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 4 ms 496 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 357 ms 3420 KB Output is correct
10 Correct 398 ms 3416 KB Output is correct
11 Correct 283 ms 4444 KB Output is correct
12 Correct 414 ms 3928 KB Output is correct
13 Correct 289 ms 4844 KB Output is correct
14 Correct 327 ms 3420 KB Output is correct
15 Correct 340 ms 3416 KB Output is correct
16 Correct 293 ms 4440 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1561 ms 572 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1561 ms 572 KB Time limit exceeded
2 Halted 0 ms 0 KB -