結果
問題 | No.2768 Password Crack |
ユーザー |
![]() |
提出日時 | 2024-05-31 21:50:01 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,168 bytes |
コンパイル時間 | 5,886 ms |
コンパイル使用メモリ | 322,240 KB |
実行使用メモリ | 28,340 KB |
平均クエリ数 | 955.37 |
最終ジャッジ日時 | 2024-12-20 23:10:21 |
合計ジャッジ時間 | 13,642 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | WA * 1 |
other | WA * 29 |
ソースコード
#include <bits/stdc++.h>using namespace std;#include <atcoder/all>using namespace atcoder;using ll = long long;using ql = queue<ll>;using sl = set<ll>;using vl = vector<ll>;using msl = multiset<ll>;using Graph = vector<vector<ll>>;using P = pair<ll, ll>;template <typename T> inline bool chmax(T &a, T b) {return ((a < b) ? (a = b, true) : (false));}template <typename T> inline bool chmin(T &a, T b) {return ((a > b) ? (a = b, true) : (false));}#define YES \{ \cout << "Yes\n"; \exit(0); \}#define NO \{ \cout << "No\n"; \exit(0); \}#define rep1(i, n) for(ll i = 1; i <= ((ll)n); ++i)#define rep(i, n) for(ll i = 0; i < ((ll)n); ++i)#define ALL(a) (a).begin(), (a).end()#define rALL(a) (a).rbegin(), (a).rend()#define INF ((1LL << 62) - (1LL << 31))ll LCS(string s, string t) {ll n = s.size(), m = t.size();Graph dp(n, vl(m, 0));rep(i, n) {rep(j, m) {if(i)dp[i][j] = max(dp[i][j], dp[i - 1][j]);if(j)dp[i][j] = max(dp[i][j], dp[i][j - 1]);if(s[i] == t[j]) {if(i && j)dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + 1);elsedp[i][j] = 1;}}}rep(i, n) {// rep(j,m)cout<<dp[i][j]<<" ";// cout<<endl;}return dp[n - 1][m - 1];}template <class Type> size_t LIS(const std::vector<Type> &v) {std::vector<Type> dp;for(const auto &elem : v) {auto it = std::lower_bound(dp.begin(), dp.end(), elem);if(it == dp.end()) {dp.push_back(elem);} else {*it = elem;}}return dp.size();}template <bool Strict, class Type> size_t LIS(const std::vector<Type> &v) {std::vector<Type> dp;auto it = dp.begin();for(const auto &elem : v) {if constexpr(Strict) {it = std::lower_bound(dp.begin(), dp.end(), elem);} else {it = std::upper_bound(dp.begin(), dp.end(), elem);}if(it == dp.end()) {dp.push_back(elem);} else {*it = elem;}}return dp.size();}vector<pair<long long, long long>> prime_factorize(long long N) {// 答えを表す可変長配列vector<pair<long long, long long>> res;// √N まで試し割っていくfor(long long p = 2; p * p <= N; ++p) {// N が p で割り切れないならばスキップif(N % p != 0) {continue;}// N の素因数 p に対する指数を求めるint e = 0;while(N % p == 0) {// 指数を 1 増やす++e;// N を p で割るN /= p;}// 答えに追加res.emplace_back(p, e);}// 素数が最後に残ることがありうるif(N != 1) {res.emplace_back(N, 1);}return res;}vector<long long> divisor(long long n) {vector<long long> ret;for(long long i = 1; i * i <= n; i++) {if(n % i == 0) {ret.push_back(i);if(i * i != n)ret.push_back(n / i);}}sort(ret.begin(), ret.end()); // 昇順に並べるreturn ret;}template <typename T> void print(T &d) {for(auto &i : d)cout << i << " ";if(d.size())cout << endl;}vector<ll> dx = {1, 0, -1, 0};vector<ll> dy = {0, 1, 0, -1};// using mint = modint998244353;using mint = modint1000000007;// using mint = modint;ll MAX = 1e6;vector<mint> fac(MAX + 1, 1);vector<mint> ifac(MAX + 1, 1);mint binomial(ll n, ll k) {if(k < 0 || n < k)return 0;return fac[n] * ifac[n - k] * ifac[k];}void solve() {ll n;cin>>n;string s;rep(i,n)s.push_back('a');rep(i,n){cout<<"? "<<s<<endl;ll x;cin>>x;bool flag = false;rep1(j,24){s[i] = 'a'+j;cout<<"? "<<s<<endl;ll y;cin>>y;if(y>x){flag = true;break;}else if(y<x){s[i] = 'a';flag = true;break;}}if(!flag)s[i] = 'z';}cout<<s<<endl;}int main() {// { // 前処理 MAX=1e6// rep1(i, MAX) fac[i] = i * fac[i - 1];// ifac[MAX] = fac[MAX].inv();// for(ll i = MAX; i >= 1; i--)// ifac[i - 1] = ifac[i] * (i);// }ll t;t = 1;// cin >> t;rep(_, t) solve();}