oj.uz

Submission #690920

# Submission time Handle Problem Language Result Execution time Memory
690920 2023-01-30T16:22:03 Z penguin133 Super Dango Maker (JOI22_dango3) C++17
7 / 100
 2990 ms 764 KB 
#include <bits/stdc++.h>
using namespace std;
#include "dango3.h"
 
int vis[20005];
void Solve(int N, int M) {
	for(int i=1;i<=M;i++){
		vector <int> fin;
		for(int j=1;j<=N*M;j++){
			if(vis[j])continue;
			vector <int> stuf;
			for(int k=1;k<=N*M;k++){
				if(vis[k] || k == j)continue;
				stuf.push_back(k);
			}
			if(Query(stuf) == M - i){
				fin.push_back(j);
				vis[j] = 1;
			}
          if((int)fin.size() == N)break;
		}
		Answer(fin);
	}
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 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 0 ms 340 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 372 KB Output is correct
2 Correct 21 ms 380 KB Output is correct
3 Correct 37 ms 364 KB Output is correct
4 Correct 37 ms 340 KB Output is correct
5 Correct 8 ms 340 KB Output is correct
6 Correct 10 ms 324 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 842 ms 436 KB Output is correct
2 Correct 947 ms 456 KB Output is correct
3 Incorrect 1682 ms 468 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #4
0 / 78.0

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