# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
157013 | user202729 | Cake 3 (JOI19_cake3) | C++17 | 2 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<climits>
struct Myset{
std::multiset<int> d;
int64_t sum;
Myset():d{},sum(0){}
/* // implementation of some special member function, for safety (after being moved from a set will be in a valid state)
Myset(Myset const& x)=default;
Myset(Myset&& x){
*this=std::move(x);
}
Myset& operator=(Myset const& x)=default;
Myset& operator=(Myset&& x){
d=std::move(x.d);
sum=x.sum;
x.d.clear();
x.sum=0;
return *this;
}
*/
int size()const{return d.size();}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |