답안 #168121

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
168121 2019-12-11T13:07:15 Z dimash241 도서관 (JOI18_library) C++17
컴파일 오류
0 ms 0 KB
# include <bits/stdc++.h>
#include "library.h"

using namespace std;
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 

inline void Solve(int n) {
	vector <int> m(n);

	m[0] = 1;
	int mx = 0, p = 0;
	for(int i = 1; i < n; i ++) {
		m[i] = 1;
		int x;
		x = Query(m);
		if (x > mx) {
			mx = x;
			p = i;
		}
		m[i] = 0;
	}
	vector < pair < int, int > > res;
	m[0] = 0;
	//m[p] = 1;
	for (int i = 0; i < n; i ++) {
		m[p] = 1;
		m[i] = 1;
		res.pb({Query(m), i});
		m[p] = 0;
		m[i] = 0;
		
	} 
	sort(every(res));
	vector < int > ans;
	for (int i = 0; i < n; i ++)
		ans.pb(res[i].second);

	Answer(ans);
}


// B...a

Compilation message

/tmp/ccm48u3B.o: In function `main':
grader.cpp:(.text.startup+0x1a): undefined reference to `Solve(int)'
collect2: error: ld returned 1 exit status