제출 #1286263

#제출 시각아이디문제언어결과실행 시간메모리
1286263aleksandre선물 (IOI25_souvenirs)C++20
0 / 100
1 ms388 KiB
#include "souvenirs.h"
#include <utility>
#include <vector>
using namespace std; 

void buy_souvenirs(int N, long long P0) {
    int k = 0;
	pair <vector<int>, long long> m = transaction(P0-1);
	if (int(m.first.size()) == 2) {
		k = 1;
	}
	if (k == 1) {
		transaction(P0-1-m.second-1);
		transaction(P0-1-m.second-1);
	} else {
		transaction((P0-1-m.second)/2);
	}
}
#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...