oj.uz

Submission #826064

# Submission time Handle Problem Language Result Execution time Memory
826064 2023-08-15T10:09:44 Z ajay Just Long Neckties (JOI20_ho_t1) C++14
9 / 100
 1000 ms 15084 KB 
/* Ajay Jadhav */

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <deque>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <string.h>
#include <climits>
#include <cstring>
using namespace std;

#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
#define endl '\n'

void solve()
{
    int n;
    cin >> n;
    vi a(n + 1), b(n);
    set<int> st;
    rep(i, 0, n + 1)
    {
        int x;
        cin >> x;
        a[i] = x;
        st.insert(x);
    }
    rep(i, 0, n)
    {
        cin >> b[i];
    }
    sort(all(b));
    vi ans(n + 1);
    rep(i, 0, n + 1)
    {
        int to_remove = a[i];
        int d = 0, index = 0;
        st.erase(st.find(to_remove));
        for (int a : st)
        {
            d = max(d, max(a - b[index++], 0));
        }
        ans[i] = max(ans[i], d);
        st.insert(to_remove);
        cout << ans[i] << " ";
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin>>t;
    while (t--)
    {
        solve();
    }
    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 4 ms 340 KB Output is correct
15 Correct 13 ms 448 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 18 ms 476 KB Output is correct
18 Correct 13 ms 404 KB Output is correct
19 Correct 14 ms 460 KB Output is correct
20 Correct 14 ms 408 KB Output is correct
21 Correct 15 ms 340 KB Output is correct
22 Correct 14 ms 340 KB Output is correct
23 Correct 14 ms 448 KB Output is correct
24 Correct 15 ms 444 KB Output is correct
25 Correct 20 ms 456 KB Output is correct
26 Correct 22 ms 532 KB Output is correct
27 Correct 18 ms 408 KB Output is correct
28 Correct 21 ms 468 KB Output is correct
29 Correct 18 ms 508 KB Output is correct
30 Correct 20 ms 468 KB Output is correct
31 Correct 21 ms 460 KB Output is correct
32 Correct 22 ms 468 KB Output is correct

Subtask #3
0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 4 ms 340 KB Output is correct
15 Correct 13 ms 448 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 18 ms 476 KB Output is correct
18 Correct 13 ms 404 KB Output is correct
19 Correct 14 ms 460 KB Output is correct
20 Correct 14 ms 408 KB Output is correct
21 Correct 15 ms 340 KB Output is correct
22 Correct 14 ms 340 KB Output is correct
23 Correct 14 ms 448 KB Output is correct
24 Correct 15 ms 444 KB Output is correct
25 Correct 20 ms 456 KB Output is correct
26 Correct 22 ms 532 KB Output is correct
27 Correct 18 ms 408 KB Output is correct
28 Correct 21 ms 468 KB Output is correct
29 Correct 18 ms 508 KB Output is correct
30 Correct 20 ms 468 KB Output is correct
31 Correct 21 ms 460 KB Output is correct
32 Correct 22 ms 468 KB Output is correct
33 Execution timed out 1069 ms 15084 KB Time limit exceeded
34 Halted 0 ms 0 KB -