제출 #1279250

#제출 시각아이디문제언어결과실행 시간메모리
1279250thegodbridgexd선물 (IOI25_souvenirs)C++20
0 / 100
1 ms332 KiB
#include "souvenirs.h" #include <utility> #include <vector> //pragma GCC optimize("Ohio") #include <bits/stdc++.h> using namespace std; #define ll long long #define ull unsigned long long #define matrix vector<vector<ll>> #define fi first #define se second #define BIG __int128 #define wtf array<int,3> #define dcm pair<int,int> #define db long double //MAIN void buy_souvenirs(int N, ll P0){ auto [v, c] = transaction(P0 - 1); P0 -= c; if (v.size() == 1){ transaction(P0 - 1); transaction(P0 - 1); } else{ transaction(P0 / 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...