제출 #1249666

#제출 시각아이디문제언어결과실행 시간메모리
1249666_abaatar선물 (IOI25_souvenirs)C++20
4 / 100
0 ms412 KiB
#include "souvenirs.h"
#include <utility>
#include <vector>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <cstring>
using namespace std;

const int Ma = 5e2+10;
using ll = long long;


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