Submission #241106

#	Time	Username	Problem	Language	Result	Execution time	Memory
241106		AGRU	Just Long Neckties (JOI20_ho_t1)	C++17	9 / 100	1089 ms	12024 KiB

ho_t1

#include<bits/stdc++.h>

using namespace std;
 
/// ----------------------------- (Debug) ------------------------------
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; }; sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0); sim > char dud(...);
struct debug {
#ifndef ONLINE_JUDGE
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i));}
sim, class b dor(pair < b, c > d) {ris << "(" << d.first << ", " << d.second << ")";}
sim dor(rge<c> d) {*this << "["; for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it; ris << "]";}
#else
sim dor(const c&) { ris; }
#endif
};
vector<char*> tokenizer(const char* args) {
	char *token = new char[111]; strcpy(token, args); token = strtok(token, ", ");
	vector<char*> v({token});
	while(token = strtok(NULL,", ")) v.push_back(token);
	return reverse(v.begin(), v.end()), v;
}
void debugg(vector<char*> args) { cerr << "\b\b "; }
template <typename Head, typename... Tail>
void debugg(vector<char*> args, Head H, Tail... T) {
	debug() << " [" << args.back() << ": " << H << "] ";
	args.pop_back(); debugg(args, T...);
}
#define harg(...) #__VA_ARGS__
#ifndef ONLINE_JUDGE
#define dbg(...) { debugg(tokenizer(harg(__VA_ARGS__, \b\t-->Line)), __VA_ARGS__, __LINE__); cerr << endl;}
#else
#define dbg(...) { }
#endif
/// -----------------------------------------------------------------------
 
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef vector<pi> vpi; 
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)    
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define print(x) cout << x << "\n";
#define REP(i,a,b) for(i=a;i<=b;i++)
#define RAP(i,a,b) for(i=a;i>=b;i--)
#define spa <<" "<<
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)x.size()
ll mod=998244353;
const int MX=0x3f3f3f3f;

int main(){
	IOS;
	int n,i;
	cin>>n;
	int b[n];
	vpi a(n+1);
	REP(i,0,n) cin>>a[i].F,a[i].S=i;
	REP(i,0,n-1) cin>>b[i];
	sort(all(a));
	sort(b,b+n);
	int mi[n+1],ans[n+1];
	mi[0]=max(a[0].F-b[0],0);
	REP(i,1,n-1) mi[i]=max({mi[i-1],a[i].F-b[i],0});
	mi[n]=mi[n-1];
	ans[a[n].S]=mi[n];
	dbg(a);
	RAP(i,n-1,0){
		if(i>=1)
			mi[i]=max({mi[i+1],a[i+1].F-b[i],0,mi[i-1]});
		else  mi[i]=max({mi[i+1],a[i+1].F-b[i],0});
		ans[a[i].S]=mi[i];
		dbg(mi[i]);
	}
	REP(i,0,n) cout<<ans[i]<<" ";
	// cout<<mi[n-1];
	return 0; 
}

Compilation message (stderr)

ho_t1.cpp: In function 'std::vector<char*> tokenizer(const char*)':
ho_t1.cpp:25:14: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
  while(token = strtok(NULL,", ")) v.push_back(token);
        ~~~~~~^~~~~~~~~~~~~~~~~~~

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