제출 #1341038

#제출 시각아이디문제언어결과실행 시간메모리
1341038nathlol2선물 (IOI25_souvenirs)C++20
3 / 100
12 ms344 KiB
#include "souvenirs.h"
#include <bits/stdc++.h>
using namespace std;

void buy_souvenirs(int n, long long p0){
  int p[n], cnt[n]; p[0] = p0;
  memset(cnt, 0, sizeof cnt);
  for(int i = 1;i<n;i++){
    auto res = transaction(p[i - 1] - 1);
    for(auto x : res.first) cnt[x]++;
    if(res.first.size() == 2){
      p[i] = p[i - 1] - 1;
      p[n - 1] = 1;
    }else{
      if(res.second == 1){
        p[i] = p[i - 1] - 2;
      }else{
        p[i] = p[i - 1] - 1;
      }
    }
  }
  for(int i = 1;i<n;i++){
    for(int j = cnt[i];j<i;j++) auto res = transaction(p[i]);
  }
}
#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...