oj.uz

Submission #1016242

# Submission time Handle Problem Language Result Execution time Memory
1016242 2024-07-07T14:47:00 Z walizamanee Super Dango Maker (JOI22_dango3) C++17
100 / 100
 386 ms 608 KB 
#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; 
     Answer( ans );
   }
   //for( int z = 0; z < M; z++ ) Answer( uttor[z] );
}
 
/*int main() {
   for( int z = 0; z < 10; z++ ) cout << rand() << " ";
   
} */

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 3 ms 496 KB Output is correct
6 Correct 4 ms 344 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 348 KB Output is correct
2 Correct 77 ms 348 KB Output is correct
3 Correct 84 ms 600 KB Output is correct
4 Correct 83 ms 344 KB Output is correct
5 Correct 77 ms 344 KB Output is correct
6 Correct 87 ms 348 KB Output is correct

Subtask #4
78.0 / 78.0

# Verdict Execution time Memory Grader output
1 Correct 356 ms 608 KB Output is correct
2 Correct 338 ms 604 KB Output is correct
3 Correct 352 ms 604 KB Output is correct
4 Correct 386 ms 608 KB Output is correct
5 Correct 345 ms 604 KB Output is correct
6 Correct 344 ms 600 KB Output is correct