제출 #1286210

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

void buy_souvenirs(int N, long long P0) {
	if (N == 2) {
        transaction(P0 - 1);
        return;
    }
	if (P0 == N) {
        for (long long M = N - 1; M >= 1; --M) {
            transaction(M);
        }
        return;
    }
}
#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...