제출 #1344722

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

#define ll long long

void buy_souvenirs(int N,long long P0)
{
      vector<long long>cost(N,-1);
      vector<long long>cnt(N,0);
      cost[0]=P0;
      for(int i=1;i<N;i++){
            long long fi=cost[i-1]-1;
            long long si=cost[i-1]-2;
            if(si==0){
                  cost[i]=fi;
                  continue;
            }
            if(i==N-1){
                  if(transaction(fi).first[0]==i){
                        cost[i]=fi;
                        cnt[i]++;
                        break;
                  }
            }
            if(transaction(si).first[0]==i){
                  cost[i]=si;
                  cnt[i]++;
            }
            else{
                  cost[i]=fi;
                  cnt[i+1]++;
            }
      }
      for(int i=0;i<N;i++){
            while(cnt[i]!=i){
                  ++cnt[i];
                  transaction(cost[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...