oj.uz

Submission #640090

# Submission time Handle Problem Language Result Execution time Memory
640090 2022-09-13T14:27:47 Z victor_gao Super Dango Maker (JOI22_dango3) C++17
22 / 100
 507 ms 468 KB 
#include<bits/stdc++.h>
#include "dango3.h"
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void Solve(int N,int M){
    int B[30]={0,1,1,1,1,1,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3,4,4,4,4,4};
    deque<int>all;
    for (int i=1;i<=N*M;i++)
        all.push_back(i);
    for (int i=M;i>=1;i--){
        bool find=1;
        int cnt=0;
        while (find){
            cnt++;
            shuffle(all.begin(),all.end(),rng);
            vector<int>now;
            vector<int>ok,no;
            int sz=all.size();
            for (int j=0;j<sz/B[i];j++){
                now.push_back(all[sz+j-sz/B[i]]);
            }
            int Q=Query(now);
            if (Q==0) continue;
            else {
                int nsz=now.size();
                for (int j=0;j<nsz;j++){
                    int out=now.back();
                    now.pop_back();
                    all.pop_back();
                    int nq=Query(now);
                    if (nq==0){
                        now.insert(now.begin(),out);
                    }
                    else no.push_back(out);
                }
                for (auto j:no)
                    all.push_back(j);
                if (now.size()!=N){
                    assert(0);
                }
                find=0;
                Answer(now);
            }
            //assert(cnt<=500);
        }
    }
}

Compilation message

dango3.cpp: In function 'void Solve(int, int)':
dango3.cpp:38:31: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   38 |                 if (now.size()!=N){
      |                     ~~~~~~~~~~^~~

Subtask #1
2.0 / 2.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 400 KB Output is correct
2 Correct 79 ms 340 KB Output is correct
3 Correct 61 ms 420 KB Output is correct
4 Correct 90 ms 400 KB Output is correct
5 Correct 83 ms 408 KB Output is correct
6 Correct 80 ms 404 KB Output is correct

Subtask #4
0 / 78.0

# Verdict Execution time Memory Grader output
1 Correct 430 ms 468 KB Output is correct
2 Correct 460 ms 468 KB Output is correct
3 Incorrect 507 ms 464 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -