# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
331946 | 2020-11-30T18:52:40 Z | a_player | Password (RMI18_password) | C++17 | 192 ms | 380 KB |
#include <bits/stdc++.h> #ifdef ALE #include "grader.cpp" #endif using namespace std; int query(string str); bool v[50]; string guess(int n, int s){ string t=""; string sol=""; for(int q=0;q<n;q++){ for(int k=0;k<s;k++)v[k]=0; bool found=false; char possible='a'; v[0]=1; while(!found){ t=sol; for(int i=0;i<n-sol.size();i++)t+=possible; int l=query(t); bool prev=false; for(int i=0;i<s;i++){ if(v[i])continue; v[i]=true; t[(int)sol.size()]='a'+i; if(query(t)>l){ possible='a'+i; prev=true; i=s; } } if(!prev){ sol+=possible; found=true; } } } assert(false); return sol; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 364 KB | Execution killed with signal 13 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 364 KB | Execution killed with signal 13 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 192 ms | 380 KB | Execution killed with signal 13 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 364 KB | Execution killed with signal 13 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 364 KB | Execution killed with signal 13 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |