oj.uz

답안 #638813

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
638813 2022-09-07T14:36:58 Z ghostwriter Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 95 ms 10764 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#endif
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
    Tran The Bao
    CTL - Da Lat
    Cay ngay cay dem nhung deo duoc cong nhan
*/
const int N = 2e5 + 5;
int n, b[N], d[N], d1[N], ans[N];
pi a[N];
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    cin >> n;
    FOR(i, 1, n + 1) {
    	cin >> a[i].st;
    	a[i].nd = i;
    }
    FOR(i, 1, n) cin >> b[i];
    sort(a + 1, a + 2 + n);
    sort(b + 1, b + 1 + n);
    FOR(i, 1, n + 1) d[i] = max(d[i - 1], a[i].st - b[i]);
    FOS(i, n + 1, 1) d1[i] = max(d1[i + 1], a[i].st - b[i - 1]);
    FOR(i, 1, n + 1) ans[a[i].nd] = max(d[i - 1], d1[i + 1]);
    FOR(i, 1, n + 1) cout << ans[i] << ' ';
    return 0;
}

Compilation message

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
ho_t1.cpp:44:5: note: in expansion of macro 'FOR'
   44 |     FOR(i, 1, n + 1) {
      |     ^~~
ho_t1.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
ho_t1.cpp:48:5: note: in expansion of macro 'FOR'
   48 |     FOR(i, 1, n) cin >> b[i];
      |     ^~~
ho_t1.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
ho_t1.cpp:51:5: note: in expansion of macro 'FOR'
   51 |     FOR(i, 1, n + 1) d[i] = max(d[i - 1], a[i].st - b[i]);
      |     ^~~
ho_t1.cpp:25:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   25 | #define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
      |                               ^
ho_t1.cpp:52:5: note: in expansion of macro 'FOS'
   52 |     FOS(i, n + 1, 1) d1[i] = max(d1[i + 1], a[i].st - b[i - 1]);
      |     ^~~
ho_t1.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
ho_t1.cpp:53:5: note: in expansion of macro 'FOR'
   53 |     FOR(i, 1, n + 1) ans[a[i].nd] = max(d[i - 1], d1[i + 1]);
      |     ^~~
ho_t1.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
ho_t1.cpp:54:5: note: in expansion of macro 'FOR'
   54 |     FOR(i, 1, n + 1) cout << ans[i] << ' ';
      |     ^~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 368 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 376 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 2 ms 344 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 368 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 376 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 2 ms 344 KB Output is correct
33 Correct 81 ms 9896 KB Output is correct
34 Correct 89 ms 10352 KB Output is correct
35 Correct 89 ms 10044 KB Output is correct
36 Correct 88 ms 10420 KB Output is correct
37 Correct 85 ms 10764 KB Output is correct
38 Correct 86 ms 10724 KB Output is correct
39 Correct 83 ms 9692 KB Output is correct
40 Correct 91 ms 9660 KB Output is correct
41 Correct 82 ms 9860 KB Output is correct
42 Correct 87 ms 9776 KB Output is correct
43 Correct 91 ms 9732 KB Output is correct
44 Correct 83 ms 9308 KB Output is correct
45 Correct 80 ms 9348 KB Output is correct
46 Correct 80 ms 9328 KB Output is correct
47 Correct 83 ms 9448 KB Output is correct
48 Correct 84 ms 9476 KB Output is correct
49 Correct 84 ms 9984 KB Output is correct
50 Correct 87 ms 10060 KB Output is correct
51 Correct 95 ms 10000 KB Output is correct
52 Correct 87 ms 10028 KB Output is correct
53 Correct 89 ms 10004 KB Output is correct