Submission #1016223

#TimeUsernameProblemLanguageResultExecution timeMemory
1016223walizamaneeSuper Dango Maker (JOI22_dango3)C++17
0 / 100
143 ms852 KiB
#include "dango3.h" #include<bits/stdc++.h> using namespace std; //int Query(vector<int> hehe); //int Answer( vector<int> lmao ); void Solve(int N, int M) { vector<int> uttor[M]; vector<int> one; for( int z = 0; z < N * M; z++ ) one.push_back(z + 1); for( int z = 0; z < M; z++ ) { vector<int> ans; // vector<int> one = arr; ans.clear(); //ans.push_back(one[one.size() - 1]); // one.pop_back(); int siz = (int)one.size(); while( (int)ans.size() != N ) { long long ek = rand(); long long dui = rand(); long long lo = ( ek * dui) % (long long)( siz ); int lol = (int)lo; int bruh = one[lol]; one.erase(one.begin() + lol); int an = Query(one); if( an != (M - z) + 1 ) one.push_back(bruh); else ans.push_back(bruh); siz--; } uttor[z] = ans; } for( int z = 0; z < M; z++ ) Answer( uttor[z] ); } /*int main() { for( int z = 0; z < 10; z++ ) cout << rand() << " "; } */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...