結果

問題 No.2768 Password Crack
ユーザー noya2noya2
提出日時 2024-05-31 21:55:54
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,027 bytes
コンパイル時間 3,052 ms
コンパイル使用メモリ 254,392 KB
実行使用メモリ 25,476 KB
平均クエリ数 799.57
最終ジャッジ日時 2024-05-31 21:56:02
合計ジャッジ時間 6,529 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 28 ms
25,196 KB
testcase_01 AC 25 ms
25,220 KB
testcase_02 AC 77 ms
24,836 KB
testcase_03 WA -
testcase_04 AC 66 ms
25,220 KB
testcase_05 AC 29 ms
24,836 KB
testcase_06 AC 42 ms
25,220 KB
testcase_07 AC 50 ms
25,220 KB
testcase_08 AC 35 ms
25,220 KB
testcase_09 AC 57 ms
25,220 KB
testcase_10 AC 60 ms
25,220 KB
testcase_11 AC 58 ms
25,220 KB
testcase_12 AC 60 ms
25,476 KB
testcase_13 AC 63 ms
24,916 KB
testcase_14 AC 59 ms
25,220 KB
testcase_15 AC 71 ms
24,580 KB
testcase_16 AC 60 ms
24,964 KB
testcase_17 AC 60 ms
24,824 KB
testcase_18 AC 56 ms
24,964 KB
testcase_19 AC 42 ms
24,964 KB
testcase_20 AC 41 ms
24,580 KB
testcase_21 AC 62 ms
25,220 KB
testcase_22 AC 57 ms
25,220 KB
testcase_23 AC 30 ms
25,136 KB
testcase_24 AC 37 ms
24,964 KB
testcase_25 AC 60 ms
24,964 KB
testcase_26 AC 42 ms
24,964 KB
testcase_27 AC 52 ms
25,092 KB
testcase_28 AC 31 ms
24,964 KB
testcase_29 AC 34 ms
25,220 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"
namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(vector<T> &v){
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"


void solve(){
    int n; in(n);
    auto ask = [&](string s){
        cout << "? " << s << endl;
        int r; cin >> r;
        return r;
    };
    string s(n,'a');
    int acnt = ask(s);
    if (acnt == n){
        out(s);
        return ;
    }
    string ans = s;
    random_device rd;
    mt19937 mt(rd());
    string order = alp.substr(1);
    rep(i,n){
        shuffle(all(order),mt);
        for (auto c : order){
            s[i] = c;
            int cnt = ask(s);
            if (cnt < acnt){
                ans[i] = 'a';
                break;
            }
            if (cnt > acnt){
                ans[i] = c;
                break;
            }
        }
        s[i] = 'a';
    }
    cout << "! " << ans << endl;
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0