제출 #168142

#제출 시각아이디문제언어결과실행 시간메모리
168142dimash241도서관 (JOI18_library)C++17
0 / 100
582 ms262148 KiB
#include "library.h"

#include<bits/stdc++.h>
#define F first
#define S second
#define pb push_back 
using namespace std;

bool SEND = 1;
                                         
//int Query(const std::vector<int>& M);
//void Answer(const std::vector<int>& res);
int n, a[2222];

int ask (const std::vector < int > &m) {
	if (SEND) {
		return Query(m);
	}

	int l = -1, r = -1;
	for (int i = 1; i <= n; i ++) {
		if (m[a[i]-1]) {
			if (r == -1) l = i;
			r = i;
		}
	}
	
	if (r == -1) assert(0);
	return r - l;
}


void print (const std:: vector <int> &res) {
	if (SEND) {
		Answer(res);

	} else {
		for (auto x : res)
			cout << x << ' ';
		cout << '\n';
		exit(0);	
	}
}

void go (int i, vector < vector < int > > &g, vector < int > & ans, int pr = 0) {
	ans.pb(i + 1);
	for (auto to : g[i]) if (to != i) {
		go(to, g, ans, i);
	}
}

void Solve(int n) {
	if (n > 200) exit(0);
	vector <int> m(n, 0);
	vector < vector < int > > g;
	g.resize(n);

	for(int i = 0; i < n; i ++) {
		m[i] = 1;
		for (int j = i + 1; j < n; j ++) {
			m[j] = 1;
			if (ask(m) == 1) {
				g[i].pb(j);
				g[j].pb(i);
			}
			m[j] = 0;
		}
		m[i] = 0;
	}

	vector < int > ans;
	for (int i = 0; i < n; i ++) if(g[i].size() == 1) {
		go(i, g, ans);
		break;
	}

	assert(ans.size() == n);
	
	print(ans);
}

// B...a

컴파일 시 표준 에러 (stderr) 메시지

In file included from /usr/include/c++/7/cassert:44:0,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:33,
                 from library.cpp:3:
library.cpp: In function 'void Solve(int)':
library.cpp:77:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  assert(ans.size() == n);
         ~~~~~~~~~~~^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...