제출 #1292524

#제출 시각아이디문제언어결과실행 시간메모리
1292524thaibeo123Just Long Neckties (JOI20_ho_t1)C++20
100 / 100
65 ms6884 KiB
#include <bits/stdc++.h> using namespace std; #define NAME "A" #define ll long long #define fi first #define se second #define pb push_back #define all(x) x.begin(), x.end() #define MASK(x) (1ll << (x)) #define BIT(x, i) (((x) >> (i)) & 1) const int N = 2e5 + 5; int n; int b[N], ans[N], pre[N], suf[N]; pair<int, int> a[N]; void input() { cin >> n; for (int i = 1; i <= n + 1; i++) { cin >> a[i].fi; a[i].se = i; } for (int i = 1; i <= n; i++) { cin >> b[i]; } sort(a + 1, a + 2 + n); sort(b + 1, b + 1 + n); } void solve() { for (int i = 1; i <= n; i++) { pre[i] = max(pre[i - 1], a[i].fi - b[i]); } for (int i = n + 1; i >= 1; i--) { suf[i] = max(suf[i + 1], a[i].fi - b[i - 1]); } for (int i = 1; i <= n + 1; i++) { ans[a[i].se] = max(pre[i - 1], suf[i + 1]); } for (int i = 1; i <= n + 1; i++) { cout << ans[i] << " "; } } signed main() { if (fopen(NAME".INP", "r")) { freopen(NAME".INP", "r", stdin); freopen(NAME".OUT", "w", stdout); } cin.tie(0)->sync_with_stdio(0); int t = 1; //cin >> t; while (t--) { input(); solve(); } return 0; }

컴파일 시 표준 에러 (stderr) 메시지

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:49:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |         freopen(NAME".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
ho_t1.cpp:50:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |         freopen(NAME".OUT", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...