oj.uz

Submission #951547

# Submission time Handle Problem Language Result Execution time Memory
951547 2024-03-22T05:58:30 Z Darren0724 Super Dango Maker (JOI22_dango3) C++17
7 / 100
 770 ms 796 KB 
#include "dango3.h"

#include <bits/stdc++.h>
using namespace std;
const int N=10005;

void Solve(int n, int m) {
	vector<int> vis(N);
	for (int i = 0; i < m; i++) {
    	vector<int> a;
		for(int j=1;j<=n*m;j++){
			if(!vis[j]){
				a.push_back(j);
			}
		}
		int sz=a.size();
		vector<int> t(sz,1);
		for(int j=0;j<sz;j++){
			t[j]=0;
			vector<int> v;
			for(int k=0;k<sz;k++){
				if(t[k]){
					v.push_back(a[k]);
				}
			}
			if(Query(v)==0){
				t[j]=1;
			}
		}
		vector<int> v;
		for(int k=0;k<sz;k++){
			if(t[k]){
				v.push_back(a[k]);
				vis[a[k]]=1;
			}
		}
		Answer(v);
  	}
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 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 9 ms 344 KB Output is correct
2 Correct 9 ms 444 KB Output is correct
3 Correct 14 ms 348 KB Output is correct
4 Correct 9 ms 548 KB Output is correct
5 Correct 8 ms 348 KB Output is correct
6 Correct 12 ms 796 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 334 ms 636 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 78.0

# Verdict Execution time Memory Grader output
1 Incorrect 770 ms 680 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -