제출 #1251594

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1251594		archso	선물 (IOI25_souvenirs)	C++20	0 / 100	11 ms	412 KiB

souvenirs

#include <bits/stdc++.h>
#include "souvenirs.h"
using namespace std;


void buy_souvenirs(int n, long long p0){
  int amnt = 0;
  int curr = p0;
  for(int i = 2; i <= n; i++){
    pair<vector<int>,int> stuff = transaction(curr-1);
    if(stuff.first.size() == 2){
      // multiple elements
      // which has to be the last 
      amnt++;
      curr-=2;
    }
    else{
      // one element
      curr -= (1+stuff.second);
    }
    for(int j = 2; j < i; j++){
      transaction(curr);
    }
  }
  // the last element has been queried a total of amnt times.
  for(int i = amnt; i < n; i++){
    transaction(curr-1);
  }
    
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 4
• Subtask 2: 0 / 3
• Subtask 3: 0 / 14
• Subtask 4: 0 / 18
• Subtask 5: 0 / 28
• Subtask 6: 0 / 33