답안 #283795

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
283795	2020-08-26T07:22:13 Z	erd1	고대 책들 (IOI17_books)	C++14	컴파일 오류	0 ms	0 KB

books

#include "books.h"

#include<bits/stdc++.h>

using namespace std;
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef pair<int, int> pii;
typedef long long lld;
typedef long double ld;

template<typename Iter>
ostream& outIt(ostream& out, Iter b, Iter e){
	for(Iter i = b; i != e; ++i)
		out << (i == b?"":" ") << *i;
	return out;
}
template<typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> p){
	return out << '(' << p.ff << ", " << p.ss << ')';
}
template<typename T>
ostream& operator<<(ostream& out, vector<T> v){
	return outIt(out << '[', all(v)) << ']';
}
vector<pii> cs;
long long minimum_walk(vector<int> p, int s) {
	lld ans = 0;
	int pmin = INT_MAX, pmax = INT_MIN;
	for(int i = 0; i < p.size(); i++)if(p[i] != i)ans += abs(p[i]-i), cs.pb({min(i, p[i]), max(i, p[i])}), pmin = min(pmin, i), pmax = max(pmax, i);
	if(ans == 0)return 0;
	sort(all(cs));
	int l = s, r = s;
	while(l >= 0 && p[l] == l)l--;
	while(r < p.size() && p[r] == r)r++;
	if(l < 0)ans += 2*(r-s);
	else if(r == p.size()) ans += 2*(s-l);
	else ans += 2*min(r-s, s-l);
	int r = cs.front().ff;
	for(int i = 0; i < cs.size(); i++){
		ans += 2*max(0, cs[i].ff - r);
		r = max(r, cs[i].ss);
	}
	return ans;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:33:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |  for(int i = 0; i < p.size(); i++)if(p[i] != i)ans += abs(p[i]-i), cs.pb({min(i, p[i]), max(i, p[i])}), pmin = min(pmin, i), pmax = max(pmax, i);
      |                 ~~^~~~~~~~~~
books.cpp:38:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |  while(r < p.size() && p[r] == r)r++;
      |        ~~^~~~~~~~~~
books.cpp:40:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |  else if(r == p.size()) ans += 2*(s-l);
      |          ~~^~~~~~~~~~~
books.cpp:42:6: error: redeclaration of 'int r'
   42 |  int r = cs.front().ff;
      |      ^
books.cpp:36:13: note: 'int r' previously declared here
   36 |  int l = s, r = s;
      |             ^
books.cpp:43:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |  for(int i = 0; i < cs.size(); i++){
      |                 ~~^~~~~~~~~~~