oj.uz

Submission #334300

# Submission time Handle Problem Language Result Execution time Memory
334300 2020-12-09T01:06:07 Z limabeans Just Long Neckties (JOI20_ho_t1) C++17
0 / 100
 1 ms 364 KB 
#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;


const int maxn = 1e6 + 5;




int n;
pair<int,int> a[maxn];
int b[maxn];

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);

    cin>>n;
    for (int i=0; i<n+1; i++) {
	cin>>a[i].first;
	a[i].second=i;
    }

    for (int i=0; i<n; i++) {
	cin>>b[i];
    }

    sort(a,a+n+1);
    sort(b,b+n);

    vector<int> ans(n+1);

    for (int i=0; i<n+1; i++) {
	int p=0;
	int res = 0;
	for (int j=0; j<n; j++) {
	    if (a[i].second==p) p++;
	    res = max(res, max(0, a[p].first-b[j]));
	    p++;
	}
	ans[a[i].second] = res;
    }

    for (int i=0; i<n+1; i++) {
	cout<<ans[i]<<" ";
    }


    return 0;
}

Subtask #1
0 / 1.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 91.0

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