oj.uz

Submission #895409

# Submission time Handle Problem Language Result Execution time Memory
895409 2023-12-29T22:14:43 Z MilosMilutinovic Naan (JOI19_naan) C++14
100 / 100
 364 ms 100980 KB 
#include <bits/stdc++.h>

using namespace std;

struct frac {
  long long p, q;
  frac() : p(1), q(0) {}
  frac(long long p, long long q) : p(p), q(q) {}
};

bool operator < (const frac &a, const frac &b) {
  return (__int128) a.p * b.q < (__int128) b.p * a.q;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, l;
  cin >> n >> l;
  vector<vector<int>> v(n, vector<int>(l));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < l; j++) {
      cin >> v[i][j];
    }
  }
  vector<vector<frac>> to(n, vector<frac>(n));
  for (int i = 0; i < n; i++) {
    vector<long long> pref(l);
    for (int j = 0; j < l; j++) {
      if (j > 0) {
        pref[j] = pref[j - 1];
      }
      pref[j] += v[i][j];
    }
    int ptr = 0;
    for (int j = 0; j < n; j++) {
      while (pref[ptr] * 1LL * n < pref[l - 1] * (j + 1)) {
        ptr += 1;
      }
      to[i][j] = frac(pref[l - 1] * 1LL * (j + 1) - (ptr == 0 ? 0 : pref[ptr - 1]) * 1LL * n + ptr * n * 1LL * v[i][ptr], n * v[i][ptr]);
    }
  }
  vector<bool> was(n);
  vector<frac> all;
  vector<int> p;
  for (int i = 0; i < n; i++) {
    vector<int> ids;
    for (int j = 0; j < n; j++) {
      if (!was[j]) {
        ids.push_back(j);
      }
    }
    sort(ids.begin(), ids.end(), [&](int a, int b) {
      return to[a][i] < to[b][i];
    });
    all.push_back(to[ids[0]][i]);
    was[ids[0]] = true;
    p.push_back(ids[0]);
  }
  all.pop_back();
  for (int i = 0; i < (int) all.size(); i++) {
    cout << all[i].p << " " << all[i].q << '\n';
  }
  for (int i = 0; i < n; i++) {
    cout << p[i] + 1 << " ";
  }
  cout << '\n';
  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 424 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct

Subtask #3
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 424 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 34 ms 6748 KB Output is correct
44 Correct 202 ms 46396 KB Output is correct
45 Correct 106 ms 20220 KB Output is correct
46 Correct 15 ms 2496 KB Output is correct
47 Correct 131 ms 29156 KB Output is correct
48 Correct 219 ms 60824 KB Output is correct
49 Correct 60 ms 15520 KB Output is correct
50 Correct 311 ms 76904 KB Output is correct
51 Correct 122 ms 27984 KB Output is correct
52 Correct 286 ms 66264 KB Output is correct
53 Correct 237 ms 58800 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 103 ms 32324 KB Output is correct
56 Correct 168 ms 39504 KB Output is correct
57 Correct 135 ms 33104 KB Output is correct
58 Correct 223 ms 57368 KB Output is correct
59 Correct 151 ms 32596 KB Output is correct
60 Correct 337 ms 100712 KB Output is correct
61 Correct 327 ms 100772 KB Output is correct
62 Correct 364 ms 100344 KB Output is correct
63 Correct 361 ms 100980 KB Output is correct
64 Correct 350 ms 100948 KB Output is correct
65 Correct 276 ms 87520 KB Output is correct
66 Correct 275 ms 87632 KB Output is correct
67 Correct 281 ms 87476 KB Output is correct
68 Correct 125 ms 42832 KB Output is correct
69 Correct 137 ms 40660 KB Output is correct
70 Correct 152 ms 52820 KB Output is correct
71 Correct 207 ms 63060 KB Output is correct