oj.uz

Submission #790621

# Submission time Handle Problem Language Result Execution time Memory
790621 2023-07-23T01:35:28 Z tvladm2009 Cake 3 (JOI19_cake3) C++17
24 / 100
 4000 ms 8128 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

/**const int INF = (int) 1e9;

vector<int> v;

void run(int lvl = 0) {
  if (lvl == 4) {
    vector<int> cv = v;
    sort(cv.begin(), cv.end());
    int best = INF;
    while (next_permutation(cv.begin(), cv.end())) {
      int now = 0;
      for (int i = 1; i < (int) cv.size(); i++) {
        now += abs(cv[i] - cv[i - 1]);
      }
      now += abs(cv.back() - cv[0]);
      if (now < best) {
        best = now;
      }
    }
    cv = v;
    sort(cv.begin(), cv.end());
    cout << "[";
    for (int i = 0; i < (int) v.size(); i++) {
      cout << v[i];
      if (i < v.size() - 1) {
        cout << " ";
      }
    }
    cout << "] ";
    cout << " -> ";
    while (next_permutation(cv.begin(), cv.end())) {
      int now = 0;
      for (int i = 1; i < (int) cv.size(); i++) {
        now += abs(cv[i] - cv[i - 1]);
      }
      now += abs(cv.back() - cv[0]);
      if (now == best) {
        cout << "[";
        for (int i = 0; i < (int) cv.size(); i++) {
          cout << cv[i];
          if (i < cv.size() - 1) {
            cout << " ";
          }
        }
        cout << "] sau ";
      }
    }
    cout << "\n";
    return;
  }
  for (int i = 1; i <= 4; i++) {
    v.push_back(i);
    run(lvl + 1);
    v.pop_back();
  }
}**/

#define int ll

const int N = (int) 2e5 + 7;
const ll INF = (ll) 1e18;
pair<int, int> a[N];
int n, m;


signed main() {
  ios::sync_with_stdio(0); cin.tie(0);

  // freopen("input", "r", stdin);

  /// run();

  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> a[i].first >> a[i].second;
  }
  sort(a + 1, a + n + 1, [&](pair<int, int> a, pair<int, int> b) {
    return a.second < b.second;
  });
  ll ret = -INF;
  for (int i = m; i <= n; i++) {
    priority_queue<int> pq;
    ll s = 0;
    vector<int> v;
    for (int j = i - 1; j >= 1; j--) {
      if (i - j - 1 >= m - 2) {
        v.push_back(a[j].first + s + a[i].first - (2 * a[i].second - 2 * a[j].second));
        ret = max(ret, a[j].first + s + a[i].first - (2 * a[i].second - 2 * a[j].second));
      }
      pq.push(-a[j].first);
      s += a[j].first;
      if ((int) pq.size() > m - 2) {
        s -= -pq.top();
        pq.pop();
      }
    }
    /**vector<int> sgn;
    for (int j = 1; j < (int) v.size(); j++) {
      if (v[j] > v[j - 1]) {
        sgn.push_back(-1);
      } else {
        sgn.push_back(+1);
      }
    }
    int changes = 0;
    for (int j = 0; j < (int) sgn.size() - 1; j++) {
      changes += (sgn[j] != sgn[j + 1]);
    }
    assert(changes <= 2);**/
  }
  cout << ret << "\n";
  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 328 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 324 KB Output is correct
37 Correct 0 ms 212 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 328 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 324 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 58 ms 408 KB Output is correct
39 Correct 60 ms 416 KB Output is correct
40 Correct 35 ms 340 KB Output is correct
41 Correct 38 ms 340 KB Output is correct
42 Correct 20 ms 340 KB Output is correct
43 Correct 26 ms 400 KB Output is correct
44 Correct 51 ms 408 KB Output is correct
45 Correct 58 ms 400 KB Output is correct
46 Correct 63 ms 340 KB Output is correct
47 Correct 62 ms 404 KB Output is correct
48 Correct 54 ms 404 KB Output is correct
49 Correct 48 ms 400 KB Output is correct
50 Correct 49 ms 408 KB Output is correct
51 Correct 46 ms 340 KB Output is correct
52 Correct 41 ms 340 KB Output is correct
53 Correct 45 ms 392 KB Output is correct
54 Correct 29 ms 368 KB Output is correct
55 Correct 19 ms 340 KB Output is correct
56 Correct 20 ms 408 KB Output is correct
57 Correct 25 ms 396 KB Output is correct
58 Correct 21 ms 340 KB Output is correct
59 Correct 14 ms 340 KB Output is correct
60 Correct 19 ms 416 KB Output is correct
61 Correct 15 ms 408 KB Output is correct
62 Correct 11 ms 340 KB Output is correct
63 Correct 17 ms 424 KB Output is correct
64 Correct 12 ms 340 KB Output is correct
65 Correct 50 ms 400 KB Output is correct
66 Correct 48 ms 408 KB Output is correct
67 Correct 55 ms 404 KB Output is correct
68 Correct 49 ms 424 KB Output is correct
69 Correct 41 ms 400 KB Output is correct
70 Correct 46 ms 400 KB Output is correct
71 Correct 68 ms 380 KB Output is correct
72 Correct 34 ms 360 KB Output is correct
73 Correct 59 ms 400 KB Output is correct
74 Correct 1 ms 384 KB Output is correct

Subtask #3
0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 328 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 324 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 58 ms 408 KB Output is correct
39 Correct 60 ms 416 KB Output is correct
40 Correct 35 ms 340 KB Output is correct
41 Correct 38 ms 340 KB Output is correct
42 Correct 20 ms 340 KB Output is correct
43 Correct 26 ms 400 KB Output is correct
44 Correct 51 ms 408 KB Output is correct
45 Correct 58 ms 400 KB Output is correct
46 Correct 63 ms 340 KB Output is correct
47 Correct 62 ms 404 KB Output is correct
48 Correct 54 ms 404 KB Output is correct
49 Correct 48 ms 400 KB Output is correct
50 Correct 49 ms 408 KB Output is correct
51 Correct 46 ms 340 KB Output is correct
52 Correct 41 ms 340 KB Output is correct
53 Correct 45 ms 392 KB Output is correct
54 Correct 29 ms 368 KB Output is correct
55 Correct 19 ms 340 KB Output is correct
56 Correct 20 ms 408 KB Output is correct
57 Correct 25 ms 396 KB Output is correct
58 Correct 21 ms 340 KB Output is correct
59 Correct 14 ms 340 KB Output is correct
60 Correct 19 ms 416 KB Output is correct
61 Correct 15 ms 408 KB Output is correct
62 Correct 11 ms 340 KB Output is correct
63 Correct 17 ms 424 KB Output is correct
64 Correct 12 ms 340 KB Output is correct
65 Correct 50 ms 400 KB Output is correct
66 Correct 48 ms 408 KB Output is correct
67 Correct 55 ms 404 KB Output is correct
68 Correct 49 ms 424 KB Output is correct
69 Correct 41 ms 400 KB Output is correct
70 Correct 46 ms 400 KB Output is correct
71 Correct 68 ms 380 KB Output is correct
72 Correct 34 ms 360 KB Output is correct
73 Correct 59 ms 400 KB Output is correct
74 Correct 1 ms 384 KB Output is correct
75 Execution timed out 4048 ms 8128 KB Time limit exceeded
76 Halted 0 ms 0 KB -