Submission #1732579


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long

typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> pipii;
typedef pair<ll,pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()

const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1<<30;
const ll mod = 1000000000 + 7;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;

#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod

string s;
int k;
string ans = "zzzzzzzzzzz";

void dfs(int cnt, string t) {
    if (cnt == k) {
        ans = min(ans, t);
        return;
    }
    string tmp = t;
    int m = t.size();
    rep(i, m) {
        string tmp1 = tmp;
        tmp1.erase(tmp1.begin() + i);
        dfs(cnt + 1, tmp1);
    }
    rep(i, m) {
        rep(j, 26) {
            string tmp2 = tmp;
            char c = 'a' + j;
            tmp2[i] = c;
            dfs(cnt + 1, tmp2);
        }
    }
    rep(i, m + 1) {
        rep(j, 26) {
            string tmp3 = tmp;
            string tmp4;
            char c = 'a' + j;
            rep(k, m + 1) {
                if (i == k) {
                    tmp4 += c;
                    break;
                }
                else {
                    tmp4 += tmp3[k];
                }   
            }
            rep2(k, i, m) tmp4 += tmp3[k];
            dfs(cnt + 1, tmp4);
        }
    }
    return ;
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> s;
    cin >> k;
    if (s.size() > 10) return 0;
    dfs(0, s);
    cout << ans << endl;
}

Submission Info

Submission Time
Task C - アメージングな文字列は、きみが作る!
User roto_37
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2397 Byte
Status WA
Exec Time 3155 ms
Memory 720 KB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3 All
Score / Max Score 0 / 0 0 / 10 0 / 10 0 / 20 0 / 60
Status
AC × 3
AC × 6
TLE × 7
AC × 6
WA × 15
TLE × 7
AC × 6
WA × 30
TLE × 7
AC × 6
WA × 49
TLE × 7
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt, 00_example_03.txt
Subtask1 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 10_rand_01.txt, 10_rand_02.txt, 10_rand_03.txt, 10_rand_04.txt, 10_rand_05.txt, 20_hand_01.txt, 20_hand_02.txt, 20_hand_03.txt, 20_hand_04.txt, 20_hand_05.txt
Subtask2 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 10_rand_01.txt, 10_rand_02.txt, 10_rand_03.txt, 10_rand_04.txt, 10_rand_05.txt, 20_hand_01.txt, 20_hand_02.txt, 20_hand_03.txt, 20_hand_04.txt, 20_hand_05.txt, 40_rand_01.txt, 40_rand_02.txt, 40_rand_03.txt, 40_rand_04.txt, 40_rand_05.txt, 40_rand_06.txt, 40_rand_07.txt, 40_rand_08.txt, 40_rand_09.txt, 40_rand_10.txt, 50_hand_01.txt, 50_hand_02.txt, 50_hand_03.txt, 50_hand_04.txt, 50_hand_05.txt
Subtask3 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 10_rand_01.txt, 10_rand_02.txt, 10_rand_03.txt, 10_rand_04.txt, 10_rand_05.txt, 20_hand_01.txt, 20_hand_02.txt, 20_hand_03.txt, 20_hand_04.txt, 20_hand_05.txt, 40_rand_01.txt, 40_rand_02.txt, 40_rand_03.txt, 40_rand_04.txt, 40_rand_05.txt, 40_rand_06.txt, 40_rand_07.txt, 40_rand_08.txt, 40_rand_09.txt, 40_rand_10.txt, 50_hand_01.txt, 50_hand_02.txt, 50_hand_03.txt, 50_hand_04.txt, 50_hand_05.txt, 60_rand_01.txt, 60_rand_02.txt, 60_rand_03.txt, 60_rand_04.txt, 60_rand_05.txt, 60_rand_06.txt, 60_rand_07.txt, 60_rand_08.txt, 70_hand_01.txt, 70_hand_02.txt, 70_hand_03.txt, 70_hand_04.txt, 70_hand_05.txt, 70_hand_06.txt, 70_hand_07.txt
All 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 10_rand_01.txt, 10_rand_02.txt, 10_rand_03.txt, 10_rand_04.txt, 10_rand_05.txt, 20_hand_01.txt, 20_hand_02.txt, 20_hand_03.txt, 20_hand_04.txt, 20_hand_05.txt, 40_rand_01.txt, 40_rand_02.txt, 40_rand_03.txt, 40_rand_04.txt, 40_rand_05.txt, 40_rand_06.txt, 40_rand_07.txt, 40_rand_08.txt, 40_rand_09.txt, 40_rand_10.txt, 50_hand_01.txt, 50_hand_02.txt, 50_hand_03.txt, 50_hand_04.txt, 50_hand_05.txt, 60_rand_01.txt, 60_rand_02.txt, 60_rand_03.txt, 60_rand_04.txt, 60_rand_05.txt, 60_rand_06.txt, 60_rand_07.txt, 60_rand_08.txt, 70_hand_01.txt, 70_hand_02.txt, 70_hand_03.txt, 70_hand_04.txt, 70_hand_05.txt, 70_hand_06.txt, 70_hand_07.txt, 80_rand_01.txt, 80_rand_02.txt, 80_rand_03.txt, 80_rand_04.txt, 80_rand_05.txt, 80_rand_06.txt, 80_rand_07.txt, 80_rand_08.txt, 80_rand_09.txt, 80_rand_10.txt, 90_hand_01.txt, 90_hand_02.txt, 90_hand_03.txt, 90_hand_04.txt, 90_hand_05.txt, 90_hand_06.txt, 90_hand_07.txt, 90_hand_08.txt, 90_hand_09.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 1 ms 256 KB
00_example_02.txt AC 9 ms 256 KB
00_example_03.txt AC 1 ms 256 KB
10_rand_01.txt TLE 3155 ms 256 KB
10_rand_02.txt TLE 3155 ms 256 KB
10_rand_03.txt AC 1 ms 256 KB
10_rand_04.txt AC 2 ms 256 KB
10_rand_05.txt AC 1 ms 256 KB
20_hand_01.txt TLE 3155 ms 256 KB
20_hand_02.txt TLE 3155 ms 256 KB
20_hand_03.txt TLE 3155 ms 256 KB
20_hand_04.txt TLE 3155 ms 256 KB
20_hand_05.txt TLE 3155 ms 256 KB
40_rand_01.txt WA 1 ms 256 KB
40_rand_02.txt WA 1 ms 256 KB
40_rand_03.txt WA 1 ms 256 KB
40_rand_04.txt WA 1 ms 256 KB
40_rand_05.txt WA 1 ms 256 KB
40_rand_06.txt WA 1 ms 256 KB
40_rand_07.txt WA 1 ms 256 KB
40_rand_08.txt WA 1 ms 256 KB
40_rand_09.txt WA 1 ms 256 KB
40_rand_10.txt WA 1 ms 256 KB
50_hand_01.txt WA 1 ms 256 KB
50_hand_02.txt WA 1 ms 256 KB
50_hand_03.txt WA 1 ms 256 KB
50_hand_04.txt WA 1 ms 256 KB
50_hand_05.txt WA 1 ms 256 KB
60_rand_01.txt WA 1 ms 256 KB
60_rand_02.txt WA 1 ms 256 KB
60_rand_03.txt WA 1 ms 256 KB
60_rand_04.txt WA 1 ms 256 KB
60_rand_05.txt WA 1 ms 256 KB
60_rand_06.txt WA 1 ms 256 KB
60_rand_07.txt WA 1 ms 256 KB
60_rand_08.txt WA 1 ms 256 KB
70_hand_01.txt WA 1 ms 256 KB
70_hand_02.txt WA 1 ms 256 KB
70_hand_03.txt WA 1 ms 256 KB
70_hand_04.txt WA 1 ms 256 KB
70_hand_05.txt WA 1 ms 256 KB
70_hand_06.txt WA 1 ms 256 KB
70_hand_07.txt WA 1 ms 256 KB
80_rand_01.txt WA 2 ms 592 KB
80_rand_02.txt WA 2 ms 512 KB
80_rand_03.txt WA 2 ms 720 KB
80_rand_04.txt WA 2 ms 592 KB
80_rand_05.txt WA 2 ms 720 KB
80_rand_06.txt WA 2 ms 720 KB
80_rand_07.txt WA 2 ms 720 KB
80_rand_08.txt WA 2 ms 720 KB
80_rand_09.txt WA 2 ms 720 KB
80_rand_10.txt WA 2 ms 512 KB
90_hand_01.txt WA 2 ms 720 KB
90_hand_02.txt WA 2 ms 720 KB
90_hand_03.txt WA 2 ms 720 KB
90_hand_04.txt WA 2 ms 720 KB
90_hand_05.txt WA 2 ms 720 KB
90_hand_06.txt WA 2 ms 720 KB
90_hand_07.txt WA 2 ms 720 KB
90_hand_08.txt WA 2 ms 720 KB
90_hand_09.txt WA 2 ms 720 KB