Submission #1300486

#TimeUsernameProblemLanguageResultExecution timeMemory
1300486NotLinuxDevil's Share (RMI19_devil)C++20
0 / 100
1605 ms257020 KiB
#include <bits/stdc++.h> using namespace std; #define sz(x) (int)x.size() #define all(x) x.begin() , x.end() int k,cnt[9]; map<string,vector<string>>mpa; string str; void dfs(int x){ if(x == 0){ string maxi; for(int i = 0;i+k-1<sz(str);i++){ string cand = str.substr(i , i + k); if(maxi.empty() or maxi < cand)maxi = cand; } mpa[maxi].push_back(str); return; } for(int i = 0;i<9;i++){ if(cnt[i]){ cnt[i]--; str += to_string(i+1); dfs(x-1); str.pop_back(); cnt[i]++; } } } void solve(){ cin >> k; int sum = 0; for(int i = 0;i<9;i++){ cin >> cnt[i]; sum += cnt[i]; } dfs(sum); cout << mpa.begin()->second[0] << endl; // cout << "best subtstr : " << mpa.begin()->first << endl; // cout << "answers : " << endl; // for(auto itr : mpa.begin()->second){ // cout << itr << endl; // } // cout << endl; } signed main(){ ios_base::sync_with_stdio(0);cin.tie(0); int testcase=1;cin >> testcase; while(testcase--)solve(); cerr << 1000.0 * clock() / CLOCKS_PER_SEC << " ms" << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...