#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define main dummy_main
int main( ) {
return 0 ;
}
#undef main
class Solution{
public :
vector< int > decompressRLElist( vector< int > & nums) {
int i;
vector< int > res;
for ( i= ( 0 ) ; i< ( nums.size ( ) ) ; i+ = ( 2 ) ) {
int Q5VJL1cS;
for ( Q5VJL1cS= ( 0 ) ; Q5VJL1cS< ( nums[ i] ) ; Q5VJL1cS++ ) {
res.push_back ( nums[ i+ 1 ] ) ;
}
}
return res;
}
}
;
// cLay varsion 20200112-1
// --- original code ---
// #define main dummy_main
// {}
// #undef main
//
// class Solution {
// public:
// vector<int> decompressRLElist(vector<int>& nums) {
// vector<int> res;
// rep(i,0,nums.size(),2){
// rep(nums[i]) res.push_back(nums[i+1]);
// }
// return res;
// }
// };
I3ByYWdtYSBHQ0Mgb3B0aW1pemUgKCJPZmFzdCIpCiNpbmNsdWRlPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgbWFpbiBkdW1teV9tYWluCmludCBtYWluKCl7CiAgcmV0dXJuIDA7Cn0KI3VuZGVmIG1haW4KY2xhc3MgU29sdXRpb257CiAgcHVibGljOgogIHZlY3RvcjxpbnQ+IGRlY29tcHJlc3NSTEVsaXN0KHZlY3RvcjxpbnQ+JiBudW1zKXsKICAgIGludCBpOwogICAgdmVjdG9yPGludD4gcmVzOwogICAgZm9yKGk9KDApO2k8KG51bXMuc2l6ZSgpKTtpKz0oMikpewogICAgICBpbnQgUTVWSkwxY1M7CiAgICAgIGZvcihRNVZKTDFjUz0oMCk7UTVWSkwxY1M8KG51bXNbaV0pO1E1VkpMMWNTKyspewogICAgICAgIHJlcy5wdXNoX2JhY2sobnVtc1tpKzFdKTsKICAgICAgfQogICAgfQogICAgcmV0dXJuIHJlczsKICB9Cn0KOwovLyBjTGF5IHZhcnNpb24gMjAyMDAxMTItMQoKLy8gLS0tIG9yaWdpbmFsIGNvZGUgLS0tCi8vICNkZWZpbmUgbWFpbiBkdW1teV9tYWluCi8vIHt9Ci8vICN1bmRlZiBtYWluCi8vIAovLyBjbGFzcyBTb2x1dGlvbiB7Ci8vIHB1YmxpYzoKLy8gICB2ZWN0b3I8aW50PiBkZWNvbXByZXNzUkxFbGlzdCh2ZWN0b3I8aW50PiYgbnVtcykgewovLyAgICAgdmVjdG9yPGludD4gcmVzOwovLyAgICAgcmVwKGksMCxudW1zLnNpemUoKSwyKXsKLy8gICAgICAgcmVwKG51bXNbaV0pIHJlcy5wdXNoX2JhY2sobnVtc1tpKzFdKTsKLy8gICAgIH0KLy8gICAgIHJldHVybiByZXM7Ci8vICAgfQovLyB9Owo=