| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1332903 | retarde | Just Long Neckties (JOI20_ho_t1) | C++20 | 70 ms | 11748 KiB |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()
typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;
int fabs(int x) {
if (x >= 0) return x;
return (int)0;
}
inline void solve() {
int n; cin >> n;
vector<pii> a(n + 1); for (int i = 0; i < n + 1; i++) {cin >> a[i].fi; a[i].se = i;}
vi b(n); for (int i = 0; i < n; i++) cin >> b[i];
sort(all(a)); sort(all(b));
vi c(n), d(n);
for (int i = 0; i < n; i++) {c[i] = fabs(a[i].fi - b[i]); d[i] = fabs(a[i + 1].fi - b[i]);}
for (int i = 1; i < n; i++) c[i] = max(c[i], c[i - 1]);
for (int i = n - 2; i >= 0; i--) d[i] = max(d[i], d[i + 1]);
vi ans(n + 1);
ans[a[0].se] = d[0];
for (int i = 1; i < n; i++) {
ans[a[i].se] = max(c[i - 1], d[i]);
}
ans[a[n].se] = c[n - 1];
for (auto &x : ans) cout << x << " ";
cout << '\n';
}
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
//setIO();
int t = 1;
if (tc) {
cin >> t;
}
while (t--) {
solve();
}
}컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
