oj.uz

Submission #361183

# Submission time Handle Problem Language Result Execution time Memory
361183 2021-01-28T13:10:51 Z HoneyBadger Just Long Neckties (JOI20_ho_t1) C++17
9 / 100
 1000 ms 15980 KB 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <bitset>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <algorithm>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <ctime>
#include <chrono>


/*
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native")
*/


#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << x << endl;
#else
    #define dbg(x)
#endif

#define int long long
#define pb push_back
#define ppb pop_back()
#define mp make_pair
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define fk(a, b) for (int k = a; k < b; k++)
#define fi1(a, b) for (int i = a - 1; i >= b; i--)
#define fj1(a, b) for (int j = a - 1; j >= b; j--)
#define fk1(a, b) for (int k = a - 1; k >= b; k--)
#define fx(x, a) for (auto& x : a)
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)
#define siz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

using namespace std;

template<typename T1, typename T2>inline void mine(T1 &x, const T2 &y) { if (y < x) x = y; }
template<typename T1, typename T2>inline void maxe(T1 &x, const T2 &y) { if (x < y) x = y; }

ostream& operator << (ostream &out, const vector<int> &b) {
    for (auto k : b) out << k << ' ';
    return out;
}

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef char ch;
typedef string str;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ch> vch;
typedef vector<vch> vvch;
typedef vector<str> vs;



const int MOD = 1000000007;
const int INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
const int MX = 200010;
const double EPS = 1e-9;


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


int a[MX];
int b[MX];

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;
    multiset<int> kek;
    for (int i = 0; i <= n; ++i) {
    	cin >> a[i];
    	kek.insert(a[i]);
    }
    for (int i = 0; i < n; ++i)
    	cin >> b[i];
    sort(b, b + n);
    for (int i = 0; i <= n; ++i) {
    	kek.erase(kek.find(a[i]));
    	int it = 0;
    	int ans = 0;
    	fx(x, kek) {
    		int dx = x - b[it++];
    		maxe(ans, dx);
    	}
    	kek.insert(a[i]);
    	cout << ans << ' ';
    }
    cout << '\n';

}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 8 ms 492 KB Output is correct
15 Correct 26 ms 492 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 41 ms 492 KB Output is correct
18 Correct 29 ms 492 KB Output is correct
19 Correct 30 ms 492 KB Output is correct
20 Correct 28 ms 492 KB Output is correct
21 Correct 30 ms 492 KB Output is correct
22 Correct 28 ms 524 KB Output is correct
23 Correct 28 ms 492 KB Output is correct
24 Correct 31 ms 492 KB Output is correct
25 Correct 41 ms 620 KB Output is correct
26 Correct 38 ms 492 KB Output is correct
27 Correct 38 ms 620 KB Output is correct
28 Correct 44 ms 640 KB Output is correct
29 Correct 34 ms 492 KB Output is correct
30 Correct 37 ms 492 KB Output is correct
31 Correct 43 ms 492 KB Output is correct
32 Correct 46 ms 492 KB Output is correct

Subtask #3
0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 8 ms 492 KB Output is correct
15 Correct 26 ms 492 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 41 ms 492 KB Output is correct
18 Correct 29 ms 492 KB Output is correct
19 Correct 30 ms 492 KB Output is correct
20 Correct 28 ms 492 KB Output is correct
21 Correct 30 ms 492 KB Output is correct
22 Correct 28 ms 524 KB Output is correct
23 Correct 28 ms 492 KB Output is correct
24 Correct 31 ms 492 KB Output is correct
25 Correct 41 ms 620 KB Output is correct
26 Correct 38 ms 492 KB Output is correct
27 Correct 38 ms 620 KB Output is correct
28 Correct 44 ms 640 KB Output is correct
29 Correct 34 ms 492 KB Output is correct
30 Correct 37 ms 492 KB Output is correct
31 Correct 43 ms 492 KB Output is correct
32 Correct 46 ms 492 KB Output is correct
33 Execution timed out 1099 ms 15980 KB Time limit exceeded
34 Halted 0 ms 0 KB -