oj.uz

Submission #1116198

# Submission time Handle Problem Language Result Execution time Memory
1116198 2024-11-21T10:30:07 Z thelegendary08 Measures (CEOI22_measures) C++17
35 / 100
 39 ms 5468 KB 
#include<bits/stdc++.h>
#define pb push_back
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) cout<<#v<<' '; for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in3(n,m,d);
	vin(v,n);
	//int ans = 0;
	int mx = 0;
	//int mn = 4e18;
	int ans = 0;
	f0r(i,m){
		in(x);
		int cur = (x - i * d);
		mx = max(mx, cur);
		ans = max(ans, mx - cur);
		
		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 2 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 336 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 25 ms 1360 KB Output is correct
2 Correct 32 ms 5204 KB Output is correct
3 Correct 30 ms 5192 KB Output is correct
4 Correct 32 ms 3144 KB Output is correct
5 Correct 30 ms 4596 KB Output is correct
6 Correct 34 ms 3396 KB Output is correct
7 Correct 28 ms 4508 KB Output is correct
8 Correct 33 ms 3144 KB Output is correct
9 Correct 26 ms 3324 KB Output is correct
10 Correct 32 ms 5468 KB Output is correct
11 Correct 28 ms 3972 KB Output is correct
12 Correct 39 ms 4936 KB Output is correct
13 Correct 24 ms 3152 KB Output is correct
14 Correct 30 ms 4944 KB Output is correct
15 Correct 29 ms 4936 KB Output is correct
16 Correct 25 ms 2640 KB Output is correct
17 Correct 31 ms 4440 KB Output is correct

Subtask #4
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 1360 KB Output is correct
2 Correct 32 ms 5204 KB Output is correct
3 Correct 30 ms 5192 KB Output is correct
4 Correct 32 ms 3144 KB Output is correct
5 Correct 30 ms 4596 KB Output is correct
6 Correct 34 ms 3396 KB Output is correct
7 Correct 28 ms 4508 KB Output is correct
8 Correct 33 ms 3144 KB Output is correct
9 Correct 26 ms 3324 KB Output is correct
10 Correct 32 ms 5468 KB Output is correct
11 Correct 28 ms 3972 KB Output is correct
12 Correct 39 ms 4936 KB Output is correct
13 Correct 24 ms 3152 KB Output is correct
14 Correct 30 ms 4944 KB Output is correct
15 Correct 29 ms 4936 KB Output is correct
16 Correct 25 ms 2640 KB Output is correct
17 Correct 31 ms 4440 KB Output is correct
18 Incorrect 30 ms 4424 KB Output isn't correct
19 Halted 0 ms 0 KB -