제출 #1014644

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1014644		MilosMilutinovic	Shortcut (IOI16_shortcut)	C++14	31 / 100	2072 ms	2512 KiB

shortcut

#include "shortcut.h"
#include <bits/stdc++.h>

using namespace std;

long long find_shortcut(int n, vector<int> l, vector<int> d, int c) {
  vector<long long> x(n);
  for (int i = 1; i < n; i++) {
    x[i] = x[i - 1] + l[i - 1];
  }
  auto Check = [&](long long diam) {
    vector<array<long long, 4>> sq;
    for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        if (d[i] + d[j] + x[j] - x[i] <= diam) {
          continue;
        }
        long long r = diam - d[i] - d[j] - c;
        if (r < 0) {
          return false;
        }
        sq.push_back({x[i] + x[j] - r, x[j] - r - x[i], x[i] + x[j] + r, x[j] + r - x[i]});
      }
    }
    for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        long long cx = x[i] + x[j];
        long long cy = x[j] - x[i];
        bool ok = true;
        for (auto& p : sq) {
          if (p[0] <= cx && cx <= p[2] && p[1] <= cy && cy <= p[3]) {
            //...
          } else {
            ok = false;
            break;
          }
        }
        if (ok) {
          return true;
        }
      }
    }
    return false;
  };  
  long long low = 0, high = 1e18, ans = 0;
  while (low <= high) {
    long long mid = (low + high) >> 1;
    if (Check(mid)) {
      ans = mid;
      high = mid - 1;
    } else {
      low = mid + 1;
    }
  }
  return ans;
}

• Subtask 1: 9 / 9
• Subtask 2: 14 / 14
• Subtask 3: 8 / 8
• Subtask 4: 0 / 7
• Subtask 5: 0 / 33
• Subtask 6: 0 / 22
• Subtask 7: 0 / 4
• Subtask 8: 0 / 3