제출 #131748

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
131748		IOrtroiii	Naan (JOI19_naan)	C++14	29 / 100	147 ms	11724 KiB

naan

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using Val = array<ll, 3>;

Val make(ll x, ll y, ll z) {
   ll g = __gcd(y, z);
   y /= g, z /= g;
   return {x, y, z};
}

bool cmp(Val l, Val r) {
   if (l[0] ^ r[0]) {
      return l[0] < r[0];
   } else {
      return l[0] * r[1] < l[1] * r[0];
   }
}

int main() {
   ios_base::sync_with_stdio(false);
   int n, l;
   cin >> n >> l;
   vector<vector<Val>> go(n);
   for (int i = 0; i < n; ++i) {
      ll sum = 0;
      vector<ll> a(l);
      for (int j = 0; j < l; ++j) {
         cin >> a[j];
         sum += a[j];
      }
      ll csum = 0;
      int cur = 0;
      for (int j = 1; j < n; ++j) {
         while (cur < l && (ll) (csum + a[cur]) * n <= (ll) sum * j) {
            csum += a[cur++];
         }
         go[i].push_back(make(cur, sum * j - csum * n, a[cur] * n));
      }
      go[i].push_back(make(l, 0, 1));
   }
   vector<Val> ans;
   vector<int> p;
   vector<bool> used(n, false);
   for (int i = 0; i < n; ++i) {
      int nxt = -1;
      for (int j = 0; j < n; ++j) {
         if (used[j]) continue;
         if (nxt == -1 || cmp(go[j][i], go[nxt][i])) {
            nxt = j;
         }
      }
      used[nxt] = true;
      ans.push_back(go[nxt][i]);
      p.push_back(nxt);
   }
   ans.pop_back();
   for (auto v : ans) {
      cout << v[0] * v[2] + v[1] << " " << v[2] << "\n";
   }
   for (int v : p) {
      cout << v + 1 << " ";
   }
}

• Subtask 1: 5 / 5
• Subtask 2: 24 / 24
• Subtask 3: 0 / 71