#include <bits/stdc++.h>
#include "treasure.h"
using namespace std;
typedef long long ll;
map<pair<ll,ll>,vector<pair<int, int>>> mp;
vector<pair<int, int>> decode(vector<int> S){
ll x1 = 0, x2 = 0;
bool x1d = false;
for(auto i : S){
int cur = i;
if(cur%10==0){
cur/=10;
x1+=cur;
}
else{
cur++;
cur/=10;
x2+=cur;
}
}
return mp[{x1,x2}];
}
vector<int> encode(vector<pair<int, int>> P){
ll x1 = 0, x2 = 0;
for(auto i : P){
x1 += i.first; x2+=i.second;
}
mp[{x1,x2}] = P;
vector<int> a;
while(x1>0){
int cur = min(200000000LL,x1);
cur *= 10;
a.push_back(cur);
x1 -= min(200000000LL,x1);
}
while(x2>0){
int cur = min(200000000LL,x2);
cur *= 10; cur--;
if(cur<0) cur = 1;
a.push_back(cur);
x2 -= min(200000000LL,x2);
}
return a;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |