Submission #797387

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
797387	2023-07-29T10:16:35 Z	alvingogo	Ancient Books (IOI17_books)	C++14	Compilation error	0 ms	0 KB

books

#include "books.h"
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

typedef long long ll;
struct DSU{
	vector<int> bo;
	void init(int x){
		bo.resize(x);
		iota(bo.begin(),bo.end(),0);
	}
	int find(int x){
		return bo[x]==x?x:bo[x]=find(bo[x]);
	}
	int merge(int x,int y){
		x=find(x);
		y=find(y);
		if(x==y){
			return 0;
		}
		bo[x]=y;
		return 1;
	}
}dsu;
ll minimum_walk(vector<int> p, int s) {
	ll ans=0;
	int n=p.size();
	dsu.init(n);
	vector<int> bo(n,-1),k(n),pre(n);
	for(int i=0;i<n;i++){
		if(bo[i]==-1){
			pre[i]++;
			int cnt=0;
			int f=0;
			for(int x=i;bo[x]==-1;x=p[x]){
				dsu.merge(x,i);
				bo[x]=i;
				cnt++;
				f=max(f,x);
			}
			if(cnt>=2){
				k[i]=1;
			}
			pre[f]--;
		}
		ans+=abs(i-p[i]);
	}
	for(int i=1;i<n;i++){
		pre[i]+=pre[i-1];
	}
	k[bo[s]]=1;
	for(int i=0;i+1<n;i++){
		if(pre[i]){
			dsu.merge(i,i+1);
		}
	}
	int mn=-1;
	vector<pair<int,pair<int,int> > > e;
	for(int i=0;i<n;i++){
		if(k[bo[i]]){
			if(mn!=-1){
				e.push_back({i-mn,i,mn});
			}
			mn=i;
		}
	}
	sort(e.begin(),e.end());
	for(auto h:e){
		ans+=2*dsu.merge(h.sc.fs,h.sc.sc)*h.fs;
	}
	return ans;
}

Compilation message

books.cpp: In function 'll minimum_walk(std::vector<int>, int)':
books.cpp:67:28: error: no matching function for call to 'std::vector<std::pair<int, std::pair<int, int> > >::push_back(<brace-enclosed initializer list>)'
   67 |     e.push_back({i-mn,i,mn});
      |                            ^
In file included from /usr/include/c++/10/vector:67,
                 from books.h:1,
                 from books.cpp:1:
/usr/include/c++/10/bits/stl_vector.h:1187:7: note: candidate: 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<int, std::pair<int, int> >; _Alloc = std::allocator<std::pair<int, std::pair<int, int> > >; std::vector<_Tp, _Alloc>::value_type = std::pair<int, std::pair<int, int> >]'
 1187 |       push_back(const value_type& __x)
      |       ^~~~~~~~~
/usr/include/c++/10/bits/stl_vector.h:1187:35: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type&' {aka 'const std::pair<int, std::pair<int, int> >&'}
 1187 |       push_back(const value_type& __x)
      |                 ~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_vector.h:1203:7: note: candidate: 'void std::vector<_Tp, _Alloc>::push_back(std::vector<_Tp, _Alloc>::value_type&&) [with _Tp = std::pair<int, std::pair<int, int> >; _Alloc = std::allocator<std::pair<int, std::pair<int, int> > >; std::vector<_Tp, _Alloc>::value_type = std::pair<int, std::pair<int, int> >]'
 1203 |       push_back(value_type&& __x)
      |       ^~~~~~~~~
/usr/include/c++/10/bits/stl_vector.h:1203:30: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::vector<std::pair<int, std::pair<int, int> > >::value_type&&' {aka 'std::pair<int, std::pair<int, int> >&&'}
 1203 |       push_back(value_type&& __x)
      |                 ~~~~~~~~~~~~~^~~