oj.uz

답안 #589728

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
589728 2022-07-05T08:02:47 Z Tekor Super Dango Maker (JOI22_dango3) C++17
2 / 100
 415 ms 452 KB 
#include "dango3.h"

#include <vector>

namespace {

int variable_example = 1;

}  // namespace
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int K = 1e4 + 10;
bool ban[K];
vector <int> dob;
int check(int l,int r,int n) {
	vector <int> zap;
	for(int i = l;i <= r;i++) {
		if(ban[i])continue;
		zap.pb(i);
	}
	for(auto to : dob)zap.pb(to);
	if(zap.size() < n)return 0;
//	cout <<"? ";
//	for(auto to : zap) {
//		cout << to << " ";
//	}
//	cout << " from ";
//	for(auto to : dob) {
//		cout << to << " ";
//	}
//	cout << endl;
	return Query(zap);
}
/*
3 2
3 3 1 2 1 2
*/
void Solve(int n,int m) {
	for(int i = 1;i <= n * m;i++)ban[i] = 0;
	queue <int> q;
	for(int it = 1;it <= m;it++) {
		int fir = -1;
		while(!q.empty()) {
			fir = q.front();
			q.pop();
			if(!ban[fir])break;
		}
		if(fir == -1) {
			for(int l = 1;l <= n * m;l++) {
				if(!ban[l]) {
					fir = l;
					break;
				}
			}	
		}
		dob.clear();
		dob.pb(fir);
		ban[fir] = 1;
		int last = fir;
		for(int i = 2;i <= n;i++) {
			int l = last + 2,r = n * m,ans = n * m + 1;
			while(l <= r) {
				int mid = (l + r) / 2;
				int dd = check(mid,n * m,n);
				if(dd > 1 && !ban[mid]) {
					q.push(mid);
				}
				if(dd == 0) {
					ans = mid;
					r = mid - 1;
				}else {
					l = mid + 1;
				}
			}
			dob.pb(ans - 1);
			ban[ans - 1] = 1;
			last = ans - 1;
		}
		Answer(dob);
	}
}

Compilation message

dango3.cpp: In function 'int check(int, int, int)':
dango3.cpp:23:16: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   23 |  if(zap.size() < n)return 0;
      |     ~~~~~~~~~~~^~~
dango3.cpp: At global scope:
dango3.cpp:7:5: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
    7 | int variable_example = 1;
      |     ^~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 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
0 / 5.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 78.0

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