Submission #890256

#	Time	Username	Problem	Language	Result	Execution time	Memory
890256		amirhoseinfar1385	Super Dango Maker (JOI22_dango3)	C++17	2 / 100	1 ms	604 KiB

dango3

#include "dango3.h"
#include <bits/stdc++.h>
using namespace std;
int n,m,vis[18];
vector<vector<int>>alln;
vector<int>tof;
void aval(int now=0,int mina=0){
    if(now==4){
        alln.push_back(tof);
        return ;
    }
    for(int i=mina+1;i<=16;i++){
        tof.push_back(i);
        aval(now+1,i);
        tof.pop_back();
    }
}

void Solve(int N, int M) {
    n=N;
    m=M;
    if(n!=4||m!=4){
        assert(0);
    }
    aval();
    vector<int>now;
    for(int i=1;i<=n*m;i++){
        now.push_back(i);
    }
    for(int i=0;i<4;i++){
        for(int j=0;j<(int)alln.size();j++){
            int f=0;
            for(auto x:alln[j]){
                if(vis[x]==1){
                    f=1;
                }
            }
            if(f==0){
                int z=Query(alln[j]);
                if(z==1){
                    Answer(alln[j]);
                //    cout<<"wtf: ";
                   for(auto x:alln[j]){
                 //       cout<<x<<" ";
                        vis[x]=1;
                    }
                  //  cout<<"\n";
                }
            }
        }
    }
}

• Subtask 1: 2 / 2
• Subtask 2: 0 / 5
• Subtask 3: 0 / 15
• Subtask 4: 0 / 78