oj.uz

Submission #819708

# Submission time Handle Problem Language Result Execution time Memory
819708 2023-08-10T12:46:33 Z TB_ Measures (CEOI22_measures) C++17
35 / 100
 121 ms 5416 KB 
#include <bits/stdc++.h>
using namespace std;
 
// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")
 
// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD
 
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;
 
#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(ll i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;
 
 
 
int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);
 
    ll n, m, d, val;
    cin >> n >> m >> d;
    vl v(n);
    fo(i, n){
        cin >> v[i];
    }
    ll highest = 0, ans = 0; 
    fo(x, m){
        cin >> val;
        highest = max(val-x*d, highest);
        ans = max(ans, highest-(val-x*d));
        
        
        if(ans%2 == 1) cout << fixed << setprecision(1) << ans/2.0 << " ";
        else cout << ans/2 << " ";
        
    }
 
    return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 14.0

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

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 1260 KB Output is correct
2 Correct 86 ms 5080 KB Output is correct
3 Correct 101 ms 5120 KB Output is correct
4 Correct 31 ms 2900 KB Output is correct
5 Correct 68 ms 4236 KB Output is correct
6 Correct 60 ms 3304 KB Output is correct
7 Correct 121 ms 4288 KB Output is correct
8 Correct 69 ms 3016 KB Output is correct
9 Correct 72 ms 2972 KB Output is correct
10 Correct 91 ms 5416 KB Output is correct
11 Correct 103 ms 3752 KB Output is correct
12 Correct 83 ms 4688 KB Output is correct
13 Correct 76 ms 3008 KB Output is correct
14 Correct 59 ms 4908 KB Output is correct
15 Correct 82 ms 4792 KB Output is correct
16 Correct 73 ms 2524 KB Output is correct
17 Correct 55 ms 4316 KB Output is correct

Subtask #4
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 1260 KB Output is correct
2 Correct 86 ms 5080 KB Output is correct
3 Correct 101 ms 5120 KB Output is correct
4 Correct 31 ms 2900 KB Output is correct
5 Correct 68 ms 4236 KB Output is correct
6 Correct 60 ms 3304 KB Output is correct
7 Correct 121 ms 4288 KB Output is correct
8 Correct 69 ms 3016 KB Output is correct
9 Correct 72 ms 2972 KB Output is correct
10 Correct 91 ms 5416 KB Output is correct
11 Correct 103 ms 3752 KB Output is correct
12 Correct 83 ms 4688 KB Output is correct
13 Correct 76 ms 3008 KB Output is correct
14 Correct 59 ms 4908 KB Output is correct
15 Correct 82 ms 4792 KB Output is correct
16 Correct 73 ms 2524 KB Output is correct
17 Correct 55 ms 4316 KB Output is correct
18 Incorrect 80 ms 4404 KB Output isn't correct
19 Halted 0 ms 0 KB -