oj.uz

Submission #556831

# Submission time Handle Problem Language Result Execution time Memory
556831 2022-05-04T02:56:23 Z Tien_Noob Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 115 ms 10004 KB 
//Make CSP great again
//Vengeance
#include <bits/stdc++.h>
#define TASK "TESTCODE"
#define Log2(x) 31 - __builtin_clz(x)
using namespace std;
const int N = 2e5 + 1;
int a[N + 1], b[N + 1], id[N + 1], dp[N + 1], res[N + 1], n;
void read()
{
    cin >> n;
    for (int i = 1; i <= n + 1; ++ i)
    {
        cin >> a[i];
        id[i] = i;
    }
    sort(id + 1, id + n + 2, [&](const int &x, const int &y)
         {
             return a[x] < a[y];
         });
    sort(a + 1, a + n + 2);
    for (int i = 1; i <= n; ++ i)
    {
        cin >> b[i];
    }
    sort(b + 1, b + n + 1);
}
void solve()
{
    for (int i = 1; i <= n; ++ i)
    {
        dp[i] = max(dp[i - 1], max(0, a[i] - b[i]));
    }
    for (int i = n + 1, k = 0; i >= 1; -- i)
    {
        res[id[i]] = max(dp[i - 1], k);
        k = max(k, max(0, a[i] - b[i - 1]));
    }
    for (int i = 1; i <= n + 1; ++ i)
    {
        cout << res[i] << ' ';
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(TASK".INP", "r"))
    {
        freopen(TASK".INP", "r", stdin);
        //freopen(TASK".OUT", "w", stdout);
    }
    int t = 1;
    bool typetest = false;
    if (typetest)
    {
        cin >> t;
    }
    for (int __ = 1; __ <= t; ++ __)
    {
        //cout << "Case " << __ << ": ";
        read();
        solve();
    }
}

Compilation message

ho_t1.cpp: In function 'int main()':
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(TASK".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 340 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 396 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 2 ms 380 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 376 KB Output is correct
25 Correct 1 ms 388 KB Output is correct
26 Correct 2 ms 344 KB Output is correct
27 Correct 2 ms 344 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 376 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 396 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 2 ms 380 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 376 KB Output is correct
25 Correct 1 ms 388 KB Output is correct
26 Correct 2 ms 344 KB Output is correct
27 Correct 2 ms 344 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 376 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 98 ms 9176 KB Output is correct
34 Correct 104 ms 9532 KB Output is correct
35 Correct 101 ms 9200 KB Output is correct
36 Correct 102 ms 9688 KB Output is correct
37 Correct 104 ms 10004 KB Output is correct
38 Correct 105 ms 9968 KB Output is correct
39 Correct 101 ms 9036 KB Output is correct
40 Correct 105 ms 9004 KB Output is correct
41 Correct 100 ms 9036 KB Output is correct
42 Correct 101 ms 9024 KB Output is correct
43 Correct 103 ms 9016 KB Output is correct
44 Correct 97 ms 8512 KB Output is correct
45 Correct 99 ms 8584 KB Output is correct
46 Correct 115 ms 8596 KB Output is correct
47 Correct 88 ms 8612 KB Output is correct
48 Correct 76 ms 8644 KB Output is correct
49 Correct 102 ms 9268 KB Output is correct
50 Correct 105 ms 9308 KB Output is correct
51 Correct 103 ms 9200 KB Output is correct
52 Correct 108 ms 9160 KB Output is correct
53 Correct 103 ms 9160 KB Output is correct