Submission #244236

#	Time	Username	Problem	Language	Result	Execution time	Memory
244236		WhipppedCream	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	394 ms	19424 KiB

ho_t1

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> ii;
typedef vector<int> vi;
typedef long long ll;

#define f first
#define s second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize

const int md = 1e9+7;
const ll inf = 1e18;
const int maxn = 2e5+5;

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

ii arr[maxn];

int b[maxn];

int cur[maxn];

int ans[maxn];

multiset<int> bst;

int main()
{
	int n; scanf("%d", &n);
	for(int i = 1; i<= n+1; i++)
	{
		scanf("%d", &arr[i].f);
		arr[i].s = i;
	}
	sort(arr+1, arr+n+2);
	for(int i = 1; i<= n; i++)
	{
		scanf("%d", &b[i]);
	}
	sort(b+1, b+n+1);

	for(int i = 2; i<= n+1; i++)
	{
		cur[i-1] = arr[i].f;
		bst.insert(cur[i-1]-b[i-1]);
	}

	ans[arr[1].s] = *(--bst.end());

	for(int i = 1; i<= n; i++)
	{
		bst.erase(bst.find(cur[i]-b[i]));
		cur[i] = arr[i].f;
		bst.insert(cur[i]-b[i]);

		ans[arr[i+1].s] = *(--bst.end());
	}

	for(int i = 1; i<= n+1; i++) printf("%d ", ans[i]);
	printf("\n");
}

Compilation message (stderr)

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:40:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  int n; scanf("%d", &n);
         ~~~~~^~~~~~~~~~
ho_t1.cpp:43:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &arr[i].f);
   ~~~~~^~~~~~~~~~~~~~~~~
ho_t1.cpp:49:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &b[i]);
   ~~~~~^~~~~~~~~~~~~

• Subtask 1: 1 / 1
• Subtask 2: 8 / 8
• Subtask 3: 91 / 91