oj.uz

Submission #696178

# Submission time Handle Problem Language Result Execution time Memory
696178 2023-02-05T17:31:22 Z amirhoseinfar1385 Measures (CEOI22_measures) C++17
35 / 100
 173 ms 4512 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(20)<<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 108 ms 2188 KB Output is correct
2 Correct 165 ms 4184 KB Output is correct
3 Correct 161 ms 4040 KB Output is correct
4 Correct 109 ms 2072 KB Output is correct
5 Correct 137 ms 3276 KB Output is correct
6 Correct 115 ms 2372 KB Output is correct
7 Correct 137 ms 3348 KB Output is correct
8 Correct 103 ms 2064 KB Output is correct
9 Correct 144 ms 1940 KB Output is correct
10 Correct 173 ms 4512 KB Output is correct
11 Correct 127 ms 2772 KB Output is correct
12 Correct 149 ms 3748 KB Output is correct
13 Correct 138 ms 1996 KB Output is correct
14 Correct 164 ms 3944 KB Output is correct
15 Correct 155 ms 3796 KB Output is correct
16 Correct 135 ms 2128 KB Output is correct
17 Correct 137 ms 3320 KB Output is correct

Subtask #4
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 2188 KB Output is correct
2 Correct 165 ms 4184 KB Output is correct
3 Correct 161 ms 4040 KB Output is correct
4 Correct 109 ms 2072 KB Output is correct
5 Correct 137 ms 3276 KB Output is correct
6 Correct 115 ms 2372 KB Output is correct
7 Correct 137 ms 3348 KB Output is correct
8 Correct 103 ms 2064 KB Output is correct
9 Correct 144 ms 1940 KB Output is correct
10 Correct 173 ms 4512 KB Output is correct
11 Correct 127 ms 2772 KB Output is correct
12 Correct 149 ms 3748 KB Output is correct
13 Correct 138 ms 1996 KB Output is correct
14 Correct 164 ms 3944 KB Output is correct
15 Correct 155 ms 3796 KB Output is correct
16 Correct 135 ms 2128 KB Output is correct
17 Correct 137 ms 3320 KB Output is correct
18 Incorrect 124 ms 2512 KB Output isn't correct
19 Halted 0 ms 0 KB -