제출 #1250193

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

souvenirs

#include "souvenirs.h"
#include <utility>
#include <vector>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
void buy_souvenirs(int N, long long P0) {
	long long pl= max(1ll, P0 -2ll*(N-1));
	vector<ll>p(N) ,cnt(N);
	while(1){
		std::pair<std::vector<int>, long long> res = transaction(pl);
		if(res.ff.size()==1){
			p[N-1]=pl;
			break;
		}
		pl++;
	}
	
	return ;
	cnt[N-1]++;
	for(int i=N-2;i>=0;i--){
		std::pair<std::vector<int>, long long> res = transaction(p[i+1]+1);
		if(res.ff[0]==i){
			cnt[i]++;
			p[i]=p[i+1]+1;
		}
		else{
			cnt[i+1]++;
			p[i]=p[i+1]+2;
		}
	}
	for(int i=1;i<N;i++){
		for(int j=cnt[i];j<i;j++){
			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