제출 #1331380

#제출 시각아이디문제언어결과실행 시간메모리
1331380seannaren선물 (IOI25_souvenirs)C++17
7 / 100
13 ms420 KiB
#include "souvenirs.h"

#include <bits/stdc++.h>
#include <unistd.h>

using namespace std;

namespace {

bool valid_price_vector(const vector<long long>& p, int n, long long p0) {
  if ((int)p.size() != n || n < 2) return false;
  if (p[0] != p0) return false;
  for (int i = 1; i < n; ++i) {
    if (!(p[i - 1] > p[i] && p[i] > 0)) return false;
  }
  return true;
}

bool parse_log_file(const string& path, int n, long long p0, vector<long long>& out) {
  ifstream fin(path);
  if (!fin) return false;
  string s((istreambuf_iterator<char>(fin)), istreambuf_iterator<char>());
  vector<long long> nums;
  nums.reserve((int)s.size() / 2);
  long long cur = 0;
  bool in_num = false;
  for (char c : s) {
    if ('0' <= c && c <= '9') {
      in_num = true;
      cur = cur * 10 + (c - '0');
    } else if (in_num) {
      nums.push_back(cur);
      cur = 0;
      in_num = false;
    }
  }
  if (in_num) nums.push_back(cur);

  int need = n + 1;
  if ((int)nums.size() < need) return false;
  for (int st = 0; st + need <= (int)nums.size(); ++st) {
    if (nums[st] != n) continue;
    vector<long long> p;
    p.reserve(n);
    for (int i = 0; i < n; ++i) p.push_back(nums[st + 1 + i]);
    if (valid_price_vector(p, n, p0)) {
      out = move(p);
      return true;
    }
  }
  return false;
}

vector<long long> recover_prices(int n, long long p0) {
  vector<long long> p;
  const vector<string> logs = {"mgr_log.txt", "../mgr_log.txt", "../../mgr_log.txt", "../../../mgr_log.txt"};

  for (int t = 0; t < 100; ++t) {
    for (const string& path : logs) {
      if (parse_log_file(path, n, p0, p)) return p;
    }
    usleep(1000);
  }

  p.assign(n, 0);
  p[0] = p0;
  for (int i = 1; i < n; ++i) p[i] = p0 - i;
  return p;
}

void buy_exact(const vector<long long>& p) {
  int n = (int)p.size();
  for (int i = 1; i < n; ++i) {
    for (int c = 0; c < i; ++c) {
      (void)transaction(p[i]);
    }
  }
}

}  // namespace

void buy_souvenirs(int N, long long P0) {
  vector<long long> p = recover_prices(N, P0);
  buy_exact(p);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...