oj.uz

Submission #892625

# Submission time Handle Problem Language Result Execution time Memory
892625 2023-12-25T15:35:03 Z Nurislam Super Dango Maker (JOI22_dango3) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
#include "dango3.h"
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
//~ #define int long long
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vii;
/*                                                    __                    __                        __                        */
/*        ======     _      /| /|  __   _            /   |  |   /|  |   @  |    |  |  | /   /| |\  | /   |  |  @ | /            */   
/*          ||  |_| |_     / |/ | |  | |_  |-        |   |--|  /-|  |   |  \ \  |==|  |-   /=| | \ | |   |--|  | |-             */
/*          ||  | | |_    /     | |__|  _| |_        \__ |  | /  |  |__ |  __|  |  |  | \ /  | |  \| \__ |  |  | | \            */ 
/*                                                                                                                              */         


void Solve(int N, int M) {
	queue<pair<vi, int> > q;
	vi v;
	for(int i = 1; i <= N*M; i++){
		v.pb(i);
	}
	q.push({v, M});
	while(q.empty()){
		auto [a, m] = q.front();
		q.pop();
		if(m <= 1){
			Answer(a);
			continue;	 
		}else{
			int n = a.size();
			int us[n]{};
			for(int i = 0; i < n; i++){
				us[i] = 1;
				vi res;
				for(int j = 0; j < n; j++){
					if(!us[j])res.pb(a[j]);
				}
				if(Query(res) < m/2)us[i] = 0;
			}
            vi g1,g2;
            for(int i = 0; i < n; i++){
                if(us[i]==0)g1.pb(v[i]);
                else g2.pb(v[i]);
            }
            q.push({g1,m/2});
            if(m%2==1)q.push({g2,m/2+1});
            else q.push({g2,m/2});
		}
	}
	return;
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Wrong Answer [8]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [8]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Wrong Answer [8]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 78.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Wrong Answer [8]
2 Halted 0 ms 0 KB -