Submission #883318

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
883318	2023-12-05T07:08:10 Z	marvinthang	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	75 ms	10064 KB

ho_t1

/*************************************
*    author: marvinthang             *
*    created: 05.12.2023 11:05:18    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

void process(void) {
	int n; cin >> n;
	vector <pair <int, int>> a(n + 1);
	REP(i, n + 1) {
		cin >> a[i].fi;
		a[i].se = i;
	}
	sort(ALL(a));
	vector <int> b(n); cin >> b;
	sort(ALL(b));
	vector <int> pref(n + 1);
	REP(i, n) pref[i + 1] = max(pref[i], a[i].fi - b[i]);
	vector <int> res(n + 1);
	res[a[n].se] = pref[n];
	int suff = 0;
	REPD(i, n) {
		suff = max(suff, a[i + 1].fi - b[i]);
		res[a[i].se] = max(suff, pref[i]);
	}
	REP(i, n + 1) cout << res[i] << ' ';
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("JOI20_ho_t1");
	// int t; cin >> t; while (t--)
	process();
	// cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
ho_t1.cpp:69:2: note: in expansion of macro 'file'
   69 |  file("JOI20_ho_t1");
      |  ^~~~
ho_t1.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
ho_t1.cpp:69:2: note: in expansion of macro 'file'
   69 |  file("JOI20_ho_t1");
      |  ^~~~

Subtask #1
1.0 / 1.0

#	Verdict	Memory	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	456 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	344 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	460 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	348 KB	Output is correct

Subtask #2
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	456 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	460 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	504 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	1 ms	504 KB	Output is correct
23	Correct	1 ms	476 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	468 KB	Output is correct
29	Correct	1 ms	344 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct

Subtask #3
91.0 / 91.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	456 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	460 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	504 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	1 ms	504 KB	Output is correct
23	Correct	1 ms	476 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	468 KB	Output is correct
29	Correct	1 ms	344 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	71 ms	9264 KB	Output is correct
34	Correct	75 ms	9552 KB	Output is correct
35	Correct	70 ms	9372 KB	Output is correct
36	Correct	70 ms	9900 KB	Output is correct
37	Correct	73 ms	10060 KB	Output is correct
38	Correct	72 ms	10064 KB	Output is correct
39	Correct	70 ms	9040 KB	Output is correct
40	Correct	74 ms	9108 KB	Output is correct
41	Correct	69 ms	9040 KB	Output is correct
42	Correct	69 ms	9044 KB	Output is correct
43	Correct	69 ms	9128 KB	Output is correct
44	Correct	72 ms	8724 KB	Output is correct
45	Correct	68 ms	8572 KB	Output is correct
46	Correct	68 ms	8652 KB	Output is correct
47	Correct	65 ms	8664 KB	Output is correct
48	Correct	68 ms	8772 KB	Output is correct
49	Correct	71 ms	9308 KB	Output is correct
50	Correct	72 ms	9308 KB	Output is correct
51	Correct	74 ms	9296 KB	Output is correct
52	Correct	72 ms	9296 KB	Output is correct
53	Correct	71 ms	9296 KB	Output is correct

Submission #883318

Compilation message

Subtask #1 1.0 / 1.0

Subtask #2 8.0 / 8.0

Subtask #3 91.0 / 91.0

Subtask #1
1.0 / 1.0

Subtask #2
8.0 / 8.0

Subtask #3
91.0 / 91.0