# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
258161 | 2020-08-05T13:00:38 Z | cheeheng | Devil's Share (RMI19_devil) | C++14 | 1500 ms | 2040 KB |
#include <bits/stdc++.h> using namespace std; int D[12]; int X[100005]; int ans[100005]; 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); if(K == 2){ for(int i = 0; i < S; i ++){ if(i%2 == 0){ ans[i] = X[S-1-i/2]; }else{ ans[i] = X[i/2]; } } reverse(ans, ans+S); for(int i = 0; i < S; i ++){ printf("%d", ans[i]); } printf("\n"); continue; } 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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 415 ms | 504 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 134 ms | 1272 KB | Output is correct |
2 | Correct | 124 ms | 1336 KB | Output is correct |
3 | Correct | 118 ms | 1400 KB | Output is correct |
4 | Correct | 140 ms | 1276 KB | Output is correct |
5 | Correct | 100 ms | 1400 KB | Output is correct |
6 | Correct | 87 ms | 1272 KB | Output is correct |
7 | Correct | 87 ms | 1272 KB | Output is correct |
8 | Correct | 100 ms | 1400 KB | Output is correct |
9 | Correct | 90 ms | 2040 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1585 ms | 256 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 415 ms | 504 KB | Output is correct |
2 | Correct | 134 ms | 1272 KB | Output is correct |
3 | Correct | 124 ms | 1336 KB | Output is correct |
4 | Correct | 118 ms | 1400 KB | Output is correct |
5 | Correct | 140 ms | 1276 KB | Output is correct |
6 | Correct | 100 ms | 1400 KB | Output is correct |
7 | Correct | 87 ms | 1272 KB | Output is correct |
8 | Correct | 87 ms | 1272 KB | Output is correct |
9 | Correct | 100 ms | 1400 KB | Output is correct |
10 | Correct | 90 ms | 2040 KB | Output is correct |
11 | Execution timed out | 1585 ms | 256 KB | Time limit exceeded |
12 | Halted | 0 ms | 0 KB | - |