# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
258151 | 2020-08-05T12:45:26 Z | cheeheng | Devil's Share (RMI19_devil) | C++14 | 1500 ms | 380 KB |
#include <bits/stdc++.h> using namespace std; int D[12]; int X[505]; int ans[505]; int main(){ int T; scanf("%d", &T); while(T --){ int K; scanf("%d", &K); int S = 0; for(int i = 1; i < 10; i ++){ scanf("%d", &D[i]); S += D[i]; } int cnt = 0; for(int i = 1; i < 10; i ++){ for(int j = 0; j < D[i]; j ++){ X[cnt++] = i; } } sort(X, X+S); long long minVal = 1LL << 62; do{ long long tempMax = 0; for(int i = 0; i <= S-K; i ++){ long long temp = 0; for(int j = i; j < i+K; j ++){ temp = temp*10+X[j]; } //printf("%lld\n", temp); tempMax = max(tempMax, temp); } if(tempMax < minVal){ for(int i = 0; i < S; i ++){ ans[i] = X[i]; } minVal = tempMax; //printf("tempMax=%lld\n", tempMax); } }while(next_permutation(X, X+S)); for(int i = 0; i < S; i ++){ printf("%d", ans[i]); } printf("\n"); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 460 ms | 380 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1578 ms | 256 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1575 ms | 256 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 460 ms | 380 KB | Output is correct |
2 | Execution timed out | 1578 ms | 256 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |