제출 #494522

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
494522		yoavL	Devil's Share (RMI19_devil)	C++14	0 / 100	118 ms	1204 KiB

devil

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <bitset>
#include <math.h>
#include <fstream>
#include <iomanip>
#include <functional>
#include <numeric>


using namespace std;

using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using pb = pair<bool, bool>;
using vpb = vector<pb>;
using vvpb = vector<vpb>;
using vi = vector<int>;
using vvi = vector<vi>;
using pi = pair<int, int>;
using vpi = vector<pi>;

const ll inf = (ll)2e18;
const ll mod = (ll)(1e9 + 7);

#define FAST        ios_base::sync_with_stdio(0)
#define FASTIN		cin.tie(0)
#define FASTOUT		cout.tie(0)

#define upmin(a, b) if(a > b) a = b
#define upmax(a, b) if(a < b) a = b

#define pr(x) cout << x << endl
#define prv(v) for(auto it : v) cout << it << " "; cout << endl;
#define prvv(v) for(auto it : v) { for(auto it2 : it) cout << it2 << " "; cout << endl; } cout << endl;
#define wpr(x) cout << #x << " = " << (x) << endl;
#define wprv(v) cout << #v << ": " << endl; for(auto it : v) cout << it << " "; cout << endl;
#define wprvv(v) cout << #v << ": " << endl; for(auto it : v) { for(auto it2 : it) cout << it2 << " "; cout << endl; } cout << endl;
#define spr(x) cout << x << " "
#define wspr(x) cout << #x << ": " << x << " "


#define rep(i, s, e) for(ll i = s; i < e; i++)
#define repr(i, s, e) for(ll i = e - (ll)1; i >= s; i--)
#define all(x) x.begin(),x.end()
#define pb push_back

void solve()
{
	ll k;
	cin >> k;
	vll cnt(9);
	rep(i, 0, 9) {
		cin >> cnt[i];
	}
	vll arr;
	rep(i, 1, 10) {
		rep(j, 0, cnt[i-1]) {
			arr.push_back(i);
		}
	}
	vll res;
	ll n = arr.size();
	for (ll i = 0; i <= n - i - 1; i++) {
		res.push_back(arr[i]);
		if (i < n - i) res.push_back(arr[n - i - 1]);
	}
	reverse(res.begin(), res.end());
	rep(i, 0, n) {
		cout << res[i];
	}
	cout << endl;
}


int main()
{
	FAST;
	FASTIN; FASTOUT;
	ll test;
	cin >> test;
	while (test--) {
		solve();
	}

}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 14
• Subtask 3: 0 / 29
• Subtask 4: 0 / 44