oj.uz

Submission #696179

# Submission time Handle Problem Language Result Execution time Memory
696179 2023-02-05T17:33:10 Z amirhoseinfar1385 Measures (CEOI22_measures) C++17
35 / 100
 177 ms 4396 KB 
#include<bits/stdc++.h>
using namespace std;

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n,m,d;
	cin>>n>>m>>d;
	if(n>0){
		vector<int>allm(n);
		for(int i=0;i<n;i++){
			cin>>allm[i];
		}
		for(int asd=0;asd<m;asd++){
			int d;
			cin>>d;
			allm.push_back(d);
			sort(allm.begin(),allm.end());
			long double res=0;
			long double last=allm[0];
			for(int i=1;i<n+asd+1;i++){
				long double dp=last+d;
				if(dp>allm[i]){
					if(abs(dp-allm[i])>res){
						long double fz=abs(dp-allm[i])-res;
						res+=fz/2;
						last=allm[i]+res;
					}
					else{
						last=dp;
					}
				}
				else{
					last=max(dp,allm[i]-res);
				}
			}
			cout<<setprecision(30)<<res<<" ";
		}	
		cout<<"\n";
		return 0;
	}
	vector<int>allm(m);
	for(int i=0;i<m;i++){
		cin>>allm[i];
	}
	sort(allm.begin(),allm.end());
	long double res=0;
	long double last=allm[0];
	cout<<setprecision(30)<<res<<" ";
	for(int i=1;i<m;i++){
		long double dp=last+d;
		if(dp>allm[i]){
			if(abs(dp-allm[i])>res){
				long double fz=abs(dp-allm[i])-res;
				res+=fz/2;
				last=allm[i]+res;
			}
			else{
				last=dp;
			}
		}
		else{
			last=max(dp,allm[i]-res);
		}
		cout<<res<<" ";
	}
	cout<<"\n";
}

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 119 ms 2048 KB Output is correct
2 Correct 158 ms 4060 KB Output is correct
3 Correct 164 ms 3996 KB Output is correct
4 Correct 101 ms 1892 KB Output is correct
5 Correct 140 ms 3116 KB Output is correct
6 Correct 112 ms 2252 KB Output is correct
7 Correct 143 ms 3208 KB Output is correct
8 Correct 102 ms 1892 KB Output is correct
9 Correct 130 ms 1752 KB Output is correct
10 Correct 177 ms 4396 KB Output is correct
11 Correct 125 ms 2640 KB Output is correct
12 Correct 149 ms 3588 KB Output is correct
13 Correct 133 ms 1864 KB Output is correct
14 Correct 153 ms 3796 KB Output is correct
15 Correct 151 ms 3672 KB Output is correct
16 Correct 134 ms 1856 KB Output is correct
17 Correct 140 ms 3080 KB Output is correct

Subtask #4
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 2048 KB Output is correct
2 Correct 158 ms 4060 KB Output is correct
3 Correct 164 ms 3996 KB Output is correct
4 Correct 101 ms 1892 KB Output is correct
5 Correct 140 ms 3116 KB Output is correct
6 Correct 112 ms 2252 KB Output is correct
7 Correct 143 ms 3208 KB Output is correct
8 Correct 102 ms 1892 KB Output is correct
9 Correct 130 ms 1752 KB Output is correct
10 Correct 177 ms 4396 KB Output is correct
11 Correct 125 ms 2640 KB Output is correct
12 Correct 149 ms 3588 KB Output is correct
13 Correct 133 ms 1864 KB Output is correct
14 Correct 153 ms 3796 KB Output is correct
15 Correct 151 ms 3672 KB Output is correct
16 Correct 134 ms 1856 KB Output is correct
17 Correct 140 ms 3080 KB Output is correct
18 Incorrect 123 ms 2396 KB Output isn't correct
19 Halted 0 ms 0 KB -