# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
680194 | Beverita | Treasure (info1cup19_treasure) | C++17 | 2 ms | 468 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;
//ifstream in("trampoline.in");
//ofstream out("trampoline.out");
string s;
vector<pair<int,string> >v;
int n,k,cnt=1;
string
ind;
void mergeVector(){
int contor=0,indice=v.size();
string val=0;
for(int i=v.size()-1;i>=0;i--){
if(v[i].first!=0){
if(v[i].second==val){
v[indice].first=0;
v[i].first+=contor;
contor=v[i].first;
indice=i;
}else{
contor=v[i].first;
indice=i;
val=v[i].second;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |