oj.uz

Submission #484883

# Submission time Handle Problem Language Result Execution time Memory
484883 2021-11-05T17:05:57 Z dxz05 Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 92 ms 10820 KB 
#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

#define MP make_pair

typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.000001;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;
const int M = 2222;

int b[N];
pair<int, int> a[N];
int pr[N], sf[N];

void solve(int TC) {
    int n;
    cin >> n;

    for (int i = 1; i <= n + 1; i++){
        cin >> a[i].first;
        a[i].second = i;
    }

    sort(a + 1, a + n + 2);

    for (int i = 1; i <= n; i++){
        cin >> b[i];
    }

    sort(b + 1, b + n + 1);

    for (int i = 1; i <= n + 1; i++){
        pr[i] = max(pr[i - 1], a[i].first - b[i]);
    }

    for (int i = n + 1; i >= 1; i--){
        sf[i] = max(sf[i + 1], a[i].first - b[i - 1]);
    }

    vector<int> ans(n + 1);
    for (int i = 1; i <= n + 1; i++){
        ans[a[i].second - 1] = max(pr[i - 1], sf[i + 1]);
    }

    for (int x : ans) cout << x << ' ';

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int TC = 1;
//    cin >> TC;

    for (int test = 1; test <= TC; test++) {
        debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

    cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;

    return 0;
}

Compilation message

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:19:20: warning: statement has no effect [-Wunused-value]
   19 | #define debug(...) 42
      |                    ^~
ho_t1.cpp:94:9: note: in expansion of macro 'debug'
   94 |         debug(test);
      |         ^~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 316 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 316 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 372 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 376 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 316 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 372 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 376 KB Output is correct
33 Correct 79 ms 10016 KB Output is correct
34 Correct 83 ms 10308 KB Output is correct
35 Correct 86 ms 10052 KB Output is correct
36 Correct 82 ms 10520 KB Output is correct
37 Correct 81 ms 10820 KB Output is correct
38 Correct 88 ms 10764 KB Output is correct
39 Correct 79 ms 9796 KB Output is correct
40 Correct 78 ms 9672 KB Output is correct
41 Correct 78 ms 9796 KB Output is correct
42 Correct 79 ms 9752 KB Output is correct
43 Correct 79 ms 9776 KB Output is correct
44 Correct 84 ms 9372 KB Output is correct
45 Correct 87 ms 9436 KB Output is correct
46 Correct 83 ms 9412 KB Output is correct
47 Correct 76 ms 9456 KB Output is correct
48 Correct 76 ms 9380 KB Output is correct
49 Correct 81 ms 10052 KB Output is correct
50 Correct 81 ms 10040 KB Output is correct
51 Correct 92 ms 10052 KB Output is correct
52 Correct 84 ms 10064 KB Output is correct
53 Correct 81 ms 10064 KB Output is correct