제출 #567996

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
567996		hhhhaura	즐거운 행로 (APIO20_fun)	C++14	0 / 100	1 ms	468 KiB

fun

#include "fun.h"
#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse")
#pragma loop-opt(on)
#define rep(i, a, b) for(int i = a; i <= b; i ++)
#define rrep(i, a, b) for(int i = b; i >= a; i --)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))
#define ll long long int
#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())
#define INF 2000000000
#define MOD 1000000007
#define eps (1e-9)
using namespace std;
#ifdef wiwihorz
#define print(a...)cerr<<"Line "<<__LINE__<<":",kout("["+string(#a)+"] = ", a)
void vprint(auto L,auto R){while(L<R)cerr<<*L<<" \n"[next(L) == R], ++L; }
void kout() { cerr << endl; }
template<class T1,class ... T2>void kout(T1 a,T2 ... e){cerr<<a<<" ",kout(e...);}
#else
#define print(...) 0
#define vprint(...) 0
#endif
vector<int> createFunTour(int N, int Q) {
	if(N == 2) return {0, 1};
	vector<int> sz(N, 0), dis(N, 0), up;
	vector<vector<int>> v(3, vector<int>());
	int cen = 0, best = N;
	rep(i, 1, N - 1) {
		sz[i] = attractionsBehind(0, i);
		if(sz[i] >= N / 2&& best > sz[i]) {
			cen = i, best = sz[i];
		} 
	}
	auto cmp = [&](int x, int y) {
		return dis[x] > dis[y];
	};
	rep(i, 0, N - 1) if(cen != i) {
		dis[i] = hoursRequired(cen, i);
		if(dis[i] == 1) up.push_back(i);
	}
	assert(up.size() == 2 || up.size() == 3);
	rep(i, 0, N - 1) if(i != cen) {
		int L = hoursRequired(up[0], i);
		int R = hoursRequired(up[1], i);
		if(L + 1 == dis[i]) v[0].push_back(i);
		else if(R + 1 == dis[i]) v[1].push_back(i);
		else v[2].push_back(i);
	}
	vector<int> L, R, ans;
	if(up.size() == 3) {
		vector<int> piv(3, 0);
		int a = v[0].size(), b = v[1].size(), c = v[2].size();
		rep(i, 0, 2) sort(all(v[i]), cmp);
		int pre = -1, cur = 0, tot = 0;
		while(max({a - piv[0], b - piv[1], c - piv[2]}) * 2 < a + b + c - tot) {
			cur = -1;
			rep(i, 0, 2) if(i != pre && piv[i] < v[i].size()) {
				if(cur == -1 || dis[v[i][piv[i]]] 
					> dis[v[cur][piv[cur]]]) cur = i;
			}
			assert(cur != -1);
			tot ++, pre = cur;
			ans.push_back(v[cur][piv[cur] ++]);
		}
		rep(i, 1, 2) if(v[i].size() - piv[i] 
			> v[0].size() - piv[0]) swap(v[0], v[i]);
		rep(i, piv[0], v[0].size() - 1) L.push_back(v[0][i]);
		rep(i, piv[1], v[1].size() - 1) R.push_back(v[1][i]);
		rep(i, piv[2], v[2].size() - 1) R.push_back(v[2][i]);
	}
	else L = v[0], R = v[1];
	if(L.size() < R.size()) swap(L, R);
	sort(all(R), cmp);
	sort(all(L), cmp);
	int l = 0, r = 0;
	assert(abs(signed(L.size()) - signed(R.size())) <= 1);
	while(l < L.size() || r < R.size()) {
		if(l < L.size()) ans.push_back(L[l++]);
		if(r < R.size()) ans.push_back(R[r++]);
	}
	ans.push_back(cen);
	return ans;
}

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

fun.cpp:6: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
    6 | #pragma loop-opt(on)
      | 
fun.cpp:21:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   21 | void vprint(auto L,auto R){while(L<R)cerr<<*L<<" \n"[next(L) == R], ++L; }
      |             ^~~~
fun.cpp:21:20: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   21 | void vprint(auto L,auto R){while(L<R)cerr<<*L<<" \n"[next(L) == R], ++L; }
      |                    ^~~~
fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:62:39: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |    rep(i, 0, 2) if(i != pre && piv[i] < v[i].size()) {
fun.cpp:7:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define rep(i, a, b) for(int i = a; i <= b; i ++)
......
   72 |   rep(i, piv[0], v[0].size() - 1) L.push_back(v[0][i]);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~       
fun.cpp:72:3: note: in expansion of macro 'rep'
   72 |   rep(i, piv[0], v[0].size() - 1) L.push_back(v[0][i]);
      |   ^~~
fun.cpp:7:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define rep(i, a, b) for(int i = a; i <= b; i ++)
......
   73 |   rep(i, piv[1], v[1].size() - 1) R.push_back(v[1][i]);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~       
fun.cpp:73:3: note: in expansion of macro 'rep'
   73 |   rep(i, piv[1], v[1].size() - 1) R.push_back(v[1][i]);
      |   ^~~
fun.cpp:7:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define rep(i, a, b) for(int i = a; i <= b; i ++)
......
   74 |   rep(i, piv[2], v[2].size() - 1) R.push_back(v[2][i]);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~       
fun.cpp:74:3: note: in expansion of macro 'rep'
   74 |   rep(i, piv[2], v[2].size() - 1) R.push_back(v[2][i]);
      |   ^~~
fun.cpp:82:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |  while(l < L.size() || r < R.size()) {
      |        ~~^~~~~~~~~~
fun.cpp:82:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |  while(l < L.size() || r < R.size()) {
      |                        ~~^~~~~~~~~~
fun.cpp:83:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |   if(l < L.size()) ans.push_back(L[l++]);
      |      ~~^~~~~~~~~~
fun.cpp:84:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |   if(r < R.size()) ans.push_back(R[r++]);
      |      ~~^~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 16
• Subtask 3: 0 / 21
• Subtask 4: 0 / 19
• Subtask 5: 0 / 34