Submission #201681

#TimeUsernameProblemLanguageResultExecution timeMemory
201681kostia244Devil's Share (RMI19_devil)C++17
0 / 100
1597 ms512 KiB
#pragma GCC optimize("O2") #pragma GCC target("avx,avx2,ssse3,sse2,sse,fma,tune=native") #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> #include<bits/extc++.h> #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define pb push_back using namespace std; using ll = long long; using vi = vector<int>; using pi = pair<int, int>; using vpi = vector<pair<int, int>>; using namespace __gnu_pbds; using oset = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>; int k, a[11], perm[12]; string solve() { int s = 0; for(int i = 1; i <= 9; i++) s += a[i]; int c = 1; for(int i = 0; i < s; i++) { while(a[c]==0) c++; perm[i] = c; a[c]--; } ll ans; string res; do { string t; ll mx = 0, cur = 0, pw = 1; for(int i = 0; i < k; i++) pw*=10; for(int i = 0; i < s; i++) { t.pb(perm[i]+'0'); cur = cur*10 + perm[i]; if(i>=k) cur -= pw*perm[i-k]; mx = max(mx, cur); } if(mx < ans) ans = mx, res = t; } while(next_permutation(perm, perm+s)); return res; } void solve2() { } void read() { cin >> k; for(int i = 1; i <= 9; i++) cin >> a[i]; // if(k==2) solve2(); // else cout << solve() << "\n"; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while(t--) read(); return 0; }

Compilation message (stderr)

devil.cpp: In function 'std::__cxx11::string solve()':
devil.cpp:40:3: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   if(mx < ans)
   ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...