oj.uz

Submission #892533

# Submission time Handle Problem Language Result Execution time Memory
892533 2023-12-25T13:18:08 Z iskhakkutbilim Super Dango Maker (JOI22_dango3) C++17
0 / 100
 174 ms 648 KB 
#include "dango3.h"
#include <bits/stdc++.h>
using namespace std;



void Solve(int n, int m){
	vector<int> used(n * m + 1, 0);
	vector<vector<int> > ans(m);
	for(int i = 0;i < m; i++){
		vector<int> idx;
		for(int j = 1;j <= n * m; j++){
			if(used[j]) continue;
			idx.push_back(j);
		}
		while(idx.size()){
			int bc = idx.back();
			idx.pop_back();
			int cnt = Query(idx);
			if(cnt == 0){
				ans[i].push_back(bc);
				used[bc] = 1;
			}
		}	
	}
	
	for(int i = 0;i < m; i++){
		Answer(ans[i]);
	}
}

Subtask #1
0 / 2.0

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

Subtask #2
0 / 5.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 78.0

# Verdict Execution time Memory Grader output
1 Incorrect 174 ms 648 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -