제출 #1250831

#제출 시각아이디문제언어결과실행 시간메모리
1250831JoksimKaktus선물 (IOI25_souvenirs)C++20
3 / 100
12 ms412 KiB
#include "souvenirs.h" #include <bits/stdc++.h> using namespace std; void buy_souvenirs(int N, long long p) { int bet = p-1; int repeat = 1; int one = 0; for(int i = N-1;i > 1;i--){ pair<vector<int>,long long> k; for(int j = 0;j < repeat;j++){ k = transaction(bet); if(j == 0){ if(k.first.size() == 2){ one++; bet--; }else if(k.second == 1){ bet--; } } } bet--; repeat++; } while(one < N-1){ one++; transaction(bet); } 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...