oj.uz

답안 #951913

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
951913 2024-03-23T01:24:56 Z Gromp15 Super Dango Maker (JOI22_dango3) C++17
7 / 100
 357 ms 628 KB 
#include "dango3.h"

#include <vector>
#include <cassert>
using namespace std;

namespace {

}

void Solve(int n, int m) {
	vector<bool> used(n*m);
	for (int t = 0; t < m; t++) {
		vector<int> here;
		for (int i = 0; i < n*m; i++) if (!used[i]) {
			here.push_back(i + 1);
		}
		for (int i = 0; i < (int)here.size(); i++) {
			int orig = here[i];
			here.erase(here.begin() + i);
			int res = Query(here);
			if (res == 0) here.insert(here.begin() + i, orig);
			else i--;
		}
		Answer(here);
		for (int x : here) used[x-1] = 1;
	}
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 348 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 5 ms 348 KB Output is correct
4 Correct 5 ms 424 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 4 ms 344 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 152 ms 548 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 78.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 357 ms 628 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -