oj.uz

답안 #817629

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
817629 2023-08-09T14:15:30 Z t6twotwo Measures (CEOI22_measures) C++17
24 / 100
 1500 ms 1888 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FFOR(i,a,b,c) for(int i=(a);(c)>0?i<=(b):i>=(b);i+=(c))
#define FOOR(i,a,b) FFOR(i,a,(b)-1,1)
#define ROOF(i,a,b) FFOR(i,(b)-1,a,-1)
#define FOR(i,n) FOOR(i,0,n)
#define ROF(i,n) ROOF(i,0,n)
#define FORR(x,v) for(auto &x:v)
#define vc vector
#define sz(v) (int)((v).size())
#define bg begin()
#define en end()
#define em empty()
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define ppb pop_back()
#define eb emplace_back
#define bk back()
#define fr front()
#define pp pop()
#define all(v) (v).begin(),(v).end()
#define lla(v) (v).rbegin(),(v).rend()
#define f first
#define s second
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N,M,D;
    cin>>N>>M>>D;
    vc<int> a(N);
    FORR(x,a)cin>>x;
    FOR(i,M){
        int b;
        cin>>b;
        a.pb(b);
        sort(all(a));
        ll mx=0,ans=0,s=0;
        FOOR(j,1,sz(a)){
            int k=a[j]-a[j-1]-D;
            ans=max(ans,-(s+k-mx));
            mx=max(mx,s+=k);
        }
        if(ans%2==1){
            cout<<ans/2<<"."<<5<<" ";
        }else{
            cout<<ans/2<<" ";
        }
    }
    return 6/22;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 102 ms 1880 KB Output is correct
10 Correct 145 ms 1788 KB Output is correct
11 Correct 53 ms 1880 KB Output is correct
12 Correct 150 ms 1876 KB Output is correct
13 Correct 53 ms 1888 KB Output is correct
14 Correct 101 ms 1884 KB Output is correct
15 Correct 104 ms 1888 KB Output is correct
16 Correct 43 ms 1876 KB Output is correct

Subtask #3
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1571 ms 624 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1571 ms 624 KB Time limit exceeded
2 Halted 0 ms 0 KB -