# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1051508 | anton | Toys (CEOI18_toy) | C++17 | 5041 ms | 812 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<bits/stdc++.h>
using namespace std;
#define int long long
struct Venice{
unordered_set<int> s;
int d = 0;
void add(int k){
d+=k;
}
void insert(int i){
s.insert(i-d);
}
vector<int> iter(){
vector<int> res;
for(auto e: s){
res.push_back(e+d);
}
return res;
}
void merge(Venice& b){
if(b.s.size()>s.size()){
swap(b.s, s);
swap(d, b.d);
}
for(auto e: b.iter()){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |