제출 #258160

#제출 시각아이디문제언어결과실행 시간메모리
258160cheehengDevil's Share (RMI19_devil)C++14
13 / 100
1588 ms1400 KiB
#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); 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; }

컴파일 시 표준 에러 (stderr) 메시지

devil.cpp: In function 'int main()':
devil.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &T);
     ~~~~~^~~~~~~~~~
devil.cpp:14:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &K);
         ~~~~~^~~~~~~~~~
devil.cpp:18:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &D[i]);
             ~~~~~^~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...