Submission #203056

#	Time	Username	Problem	Language	Result	Execution time	Memory
203056		blacktulip	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	365 ms	17916 KiB

ho_t1

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long lo;
typedef pair< lo,lo > PII;
 
#define fi first
#define se second
#define int long long
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
 
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
 
int n,m,a[li],k,flag,t,ans[li];
int cev;
PII p[li];
string s;
multiset<int> st;
vector<int> v;
 
main(void){
	scanf("%lld",&n);
	for(int i=1;i<=n+1;i++){
		scanf("%lld",&p[i].fi);
		p[i].se=i;
	}
	FOR{
		scanf("%lld",&a[i]);
	}
	sort(a+1,a+n+1);
	sort(p+1,p+n+2);
	FOR st.insert((a[i]-p[i].fi));
	for(int i=n+1;i>=1;i--){
		if(i==n+1){
			ans[p[i].se]=*st.begin();
		}
		else{
			auto it=st.find(-(p[i].fi-a[i]));
			st.erase(it);
			st.insert(-(p[i+1].fi-a[i]));
			ans[p[i].se]=*st.begin();
		}
	}
	for(int i=1;i<=n+1;i++) printf("%lld ",-ans[i]);
	return 0;
}
 

Compilation message (stderr)

ho_t1.cpp:33:10: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(void){
          ^
ho_t1.cpp: In function 'int main()':
ho_t1.cpp:34:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&n);
  ~~~~~^~~~~~~~~~~
ho_t1.cpp:36:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&p[i].fi);
   ~~~~~^~~~~~~~~~~~~~~~~
ho_t1.cpp:40:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&a[i]);
   ~~~~~^~~~~~~~~~~~~~

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