제출 #1321057

#제출 시각아이디문제언어결과실행 시간메모리
1321057sadixSouvenirs (IOI25_souvenirs)C++17
0 / 100
0 ms332 KiB
#include "souvenirs.h"
#include <utility>
#include <vector>
#include <stdint.h>
#include <algorithm>

void buy_souvenirs(int N, long long P0) {
  const int32_t M = P0 - 1;
  std::vector<int32_t> bought(N, 0);
  int32_t balance = 0u;
  
  for(int32_t typeIdx = 1; typeIdx < N; typeIdx++) {
    while(bought[typeIdx] <= typeIdx) {
      auto transactionResult = transaction(balance);
      const auto& souvenirs = transactionResult.first;
      balance = transactionResult.second;

      if(souvenirs.empty()) {
        balance += M;
        continue;
      }
      
      for(uint32_t i = 0; i < souvenirs.size(); i++) {
        bought[souvenirs[i]]++;
      }
    }
  }
  return;
}
#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...