oj.uz

답안 #554821

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
554821 2022-04-29T13:18:01 Z endy Just Long Neckties (JOI20_ho_t1) C++14
0 / 100
 1 ms 256 KB 
#include <bits/stdc++.h>

using namespace std;

int n;
vector <long long int > b;
vector < pair<long long int, int> > a;

int main(){
	
	//freopen("in.in", "r", stdin);
	ios::sync_with_stdio(false); cin.tie(0);

	cin >> n;

	for(int i=0 ; i<=n ; i++){

		long long int x;
		cin >> x;

		a.push_back(make_pair(x, i));
	}

	for(int i=0 ; i<n ; i++){

		long long int x;
		cin >> x;

		b.push_back(x);
	}

	sort(a.begin(), a.end());
	sort(b.begin(), b.end());

	int cont=0;

	while(cont <= n){

		int t=0, ans=0;

		for(int i=0 ; i<n ; i++){

			if(a[t].second == cont){

				t++;
			}

			int k;

			if(a[t].first < b[i]) k = b[i] - a[t].first;

			if(a[t].first >= b[i]) k = a[t].first - b[i];

			//cout << a[t].first << " " << b[i] << " " << k << " ";

			if(ans < k) ans=k;

			t++;
		}

		cout << ans << " ";

		cont++;


	}

	return 0;
}

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -