oj.uz

Submission #654324

# Submission time Handle Problem Language Result Execution time Memory
654324 2022-10-31T02:16:21 Z sunwukong123 Measures (CEOI22_measures) C++14
35 / 100
 52 ms 7840 KB 
#include <bits/stdc++.h>
using namespace std;
#define int ll 
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#else
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long 
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first 	
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
#define reach cerr << "LINE: " << __LINE__ << "\n";
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
typedef tuple<ll,ll,ll,ll> ti4;
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> bool chmax(T& a, const T b) { return a<b ? a = b, 1 : 0; }
template <typename T> bool chmin(T& a, const T b) { return a>b ? a = b, 1 : 0; }
const int MAXN = 200015;
int n,m,d;
int A[MAXN];
int B[MAXN];
int D[MAXN];

int32_t main() 
{
	IAMSPEED
	cin >> n >> m >> d;
	int mx=0;
	int ans=0;
	/*
	FOR(i,1,n-1) {
		D[i]=A[i+1]-A[i];
		D[i] = d-D[i];
	}
	
	FOR(i,1,n-1) {
		mx=max(mx+D[i],D[i]);
		chmax(ans,mx);
	} */
	FOR(i,1,m){
		cin >> A[i];
		D[i]=d - (A[i]-A[i-1]);
		if(i==1)D[i]=0;
		mx=max(mx+D[i],D[i]);
		chmax(ans,mx);
		
		if(ans%2==0)cout<<ans/2<<' ';
		else cout << ans/2 << ".5 ";
	}
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 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 46 ms 5648 KB Output is correct
2 Correct 52 ms 7840 KB Output is correct
3 Correct 46 ms 7448 KB Output is correct
4 Correct 44 ms 4972 KB Output is correct
5 Correct 43 ms 6932 KB Output is correct
6 Correct 51 ms 5768 KB Output is correct
7 Correct 47 ms 6988 KB Output is correct
8 Correct 44 ms 6096 KB Output is correct
9 Correct 48 ms 5452 KB Output is correct
10 Correct 47 ms 7836 KB Output is correct
11 Correct 42 ms 6128 KB Output is correct
12 Correct 45 ms 7248 KB Output is correct
13 Correct 43 ms 5264 KB Output is correct
14 Correct 44 ms 7516 KB Output is correct
15 Correct 47 ms 7056 KB Output is correct
16 Correct 33 ms 5428 KB Output is correct
17 Correct 41 ms 6816 KB Output is correct

Subtask #4
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 5648 KB Output is correct
2 Correct 52 ms 7840 KB Output is correct
3 Correct 46 ms 7448 KB Output is correct
4 Correct 44 ms 4972 KB Output is correct
5 Correct 43 ms 6932 KB Output is correct
6 Correct 51 ms 5768 KB Output is correct
7 Correct 47 ms 6988 KB Output is correct
8 Correct 44 ms 6096 KB Output is correct
9 Correct 48 ms 5452 KB Output is correct
10 Correct 47 ms 7836 KB Output is correct
11 Correct 42 ms 6128 KB Output is correct
12 Correct 45 ms 7248 KB Output is correct
13 Correct 43 ms 5264 KB Output is correct
14 Correct 44 ms 7516 KB Output is correct
15 Correct 47 ms 7056 KB Output is correct
16 Correct 33 ms 5428 KB Output is correct
17 Correct 41 ms 6816 KB Output is correct
18 Incorrect 38 ms 7376 KB Output isn't correct
19 Halted 0 ms 0 KB -