Submission #1286100

#	Time	Username	Problem	Language	Result	Execution time	Memory
1286100		lukasuliashvili	선물 (IOI25_souvenirs)	C++20	39 / 100	14 ms	400 KiB

souvenirs

#include <bits/stdc++.h>
#include "souvenirs.h"

using namespace std;

pair<vector<int>, long long> transaction(long long M);

void buy_souvenirs(int n, long long P0) {

    pair<vector<int>, long long> vp;

    if (n==2){
    
    
        transaction(P0-1);
   
   
   
    }
    else if (n==3){
      
        vp=transaction(P0-1);

    
    
        if (vp.first.size()==1){
         
            long long tt=vp.second;
            
         
         
            long long p2=P0-1-tt;
            
         
         
         
            transaction(p2-1);            
         
         
            
       
       
       
            transaction(p2-1);            
        }
        
      
      
        else{
            
          
          
          
            long long tt=vp.second;
          
          
            
          
          
          
            long long p2=(P0-1-tt)/2;
          
          
            
          
          
            transaction(p2);            
        }
    }
    
    
    else{
        long long sm=n-2;
        
       
       
        for (int i=1; i<n; i++){

           
           
            long long cnt=i-1;
            
            if (i==n-1){
               
               
                cnt=sm;
            }
            
            vp=transaction(P0-1);
            
            long long tt=vp.second;            
                
          
          
            if (vp.first.size()==2){sm--;tt++;}
            
         
         
         
            long long pk=P0-1-tt;
                
         
         
            P0=pk;
                
       
       
       
            for (int j=0; j<cnt; j++){
        
        
        
                transaction(pk);    
        
        
            }
        }
    }
}

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