oj.uz

답안 #245407

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
245407 2020-07-06T10:33:03 Z kevlee Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 344 ms 18556 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mod 1000000007
#define h1 7897897897897897
#define h2 7897466719774591
#define b1 98762051
#define b2 98765431
#define inf 1000000000
#define pi 3.1415926535897932384626
#define LMAX 9223372036854775807
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pii>
#define SET(a, b) memset(a, b, sizeof(a));
#define all(x) (x).begin(), (x).end()
#define flush fflush(stdout)
#define debug printf("Hello\n")
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
//priority_queue <int, vector <int>, greater <int> > pq;
int n, m, k, x, y, sum, cnt, ans[200005];
pii a[200005];
int b[200005];
int main () {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  FOR(i, 1, n+1) {
    cin >> a[i].fi;
    a[i].se = i;
  }
  FOR(i, 1, n) {
    cin >> b[i];
  }
  sort(a+1, a+n+2);
  sort(b+1, b+n+1);
  set <pii> s;
  FOR(i, 1, n) {
    s.insert({max(a[i].fi - b[i], 0), i});
  }
  auto it = s.end();
  it--;
  ans[a[n + 1].se] = it->fi;
  FORD(i, n, 1) {
    auto it = s.find({max(a[i].fi - b[i], 0), i});
    s.erase(it);
    s.insert({max(a[i+1].fi - b[i], 0), i});
    it = s.end();
    it--;
    ans[a[i].se] = it->fi;
  }
  FOR(i, 1, n+1) {
    cout << ans[i] << ' ';
  } 
  cout << endl;
  return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 404 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 6 ms 512 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 6 ms 512 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 224 ms 17512 KB Output is correct
34 Correct 236 ms 18080 KB Output is correct
35 Correct 206 ms 17656 KB Output is correct
36 Correct 237 ms 18168 KB Output is correct
37 Correct 243 ms 18556 KB Output is correct
38 Correct 231 ms 18428 KB Output is correct
39 Correct 276 ms 17400 KB Output is correct
40 Correct 287 ms 17400 KB Output is correct
41 Correct 317 ms 17528 KB Output is correct
42 Correct 309 ms 17528 KB Output is correct
43 Correct 344 ms 17400 KB Output is correct
44 Correct 206 ms 16892 KB Output is correct
45 Correct 208 ms 17016 KB Output is correct
46 Correct 202 ms 16864 KB Output is correct
47 Correct 190 ms 17144 KB Output is correct
48 Correct 192 ms 17144 KB Output is correct
49 Correct 292 ms 17784 KB Output is correct
50 Correct 289 ms 17784 KB Output is correct
51 Correct 290 ms 17784 KB Output is correct
52 Correct 279 ms 17784 KB Output is correct
53 Correct 285 ms 17784 KB Output is correct