Submission #315155

#TimeUsernameProblemLanguageResultExecution timeMemory
315155yjojdkgk5bpMouse (info1cup19_mouse)C++14
6.00 / 100
3084 ms256 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; void solve(int n) { vector<int> p; for(int i=1; i<=n; i++) p.push_back(i); do{ int v=query(p); if(v==n) return; }while(next_permutation(p.begin(),p.end())); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...