Submission #1285897

#	Time	Username	Problem	Language	Result	Execution time	Memory
1285897		nozika	선물 (IOI25_souvenirs)	C++20	0 / 100	13 ms	476 KiB

souvenirs

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


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

void buy_souvenirs(int n, long long p0) {
  
  
    vector<long long> p(n, -1);
   
   
    p[0] = p0;

  
    vector<vector<int>> got(p0);
    
    
    for (long long m = 1; m < p0; m++) {
     
     
        auto [l, r] = transaction(m);
     
     
     
        got[m] = l;
   
   
    }

    for (int i = 1; i < n; i++) {
      
      
      
        for (long long m = 1; m < p0; m++) {
          
          
            if (find(got[m].begin(), got[m].end(), i) != got[m].end()) {
            
            
                p[i] = m;
        
                break;
           
           
            }
     
     
        }
    
        
        
    }

    
   
    for (int i = 1; i < n; i++) {
     
     
        for (int k = 0; k < i; k++) {
     
            transaction(p[i]);
      
      
        }
  
  
    }
}

• 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