Submission #343399

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
343399	2021-01-03T22:08:25 Z	MvC	Comparing Plants (IOI20_plants)	C++11	Compilation error	0 ms	0 KB

plants

#include "plants.h"
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define lun(x) (int)x.size()
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<60);
const int inf=(1<<30);
const int nmax=2e5+50;
const ll mod=1e9+7;
using namespace std;
int n,a[nmax],lzy[4*nmax],k;
pair<int,int>st[4*nmax];
pair<int,int> mrg(pair<int,int> x,pair<int,int> y)
{
    if(x.fr<y.fr)return x;
    else if(y.fr<x.fr)return y;
    return mkp(x.fr,min(x.sc,y.sc));
}
void build(int x,int l,int r,vector<int> *v)
{
    if(l==r)
    {
        st[x]=mkp(v[l],l);
        return;
    }
    int mid=(l+r)/2;
    build(2*x,l,mid,v);
    build(2*x+1,mid+1,r,v);
    st[x]=mrg(st[2*x],st[2*x+1]);
}
void push(int nod,int l,int r)
{
    if(!lzy[nod])return;
    st[nod].fr+=lzy[nod];
    if(l!=r)
    {
    	lzy[nod*2]+=lzy[nod];
		lzy[nod*2+1]+=lzy[nod];
	}
    lzy[nod]=0;
}
void upd(int nod,int l,int r,int tl,int tr,int v)
{
    push(nod,l,r);
    if(tl<=l && r<=tr)
	{
        lzy[nod]+=v;
        push(nod,l,r);
        return;
    }
    int mid=(l+r)/2;
    if(tl<=mid)upd(nod*2,l,mid,tl,tr,v);
    if(mid<tr)upd(nod*2+1,mid+1,r,tl,tr,v);
    push(nod*2,l,mid);
	push(nod*2+1,mid+1,r);
    st[nod]=mrg(st[nod*2],st[nod*2+1]);
}
pair<int,int> qry(int nod,int l,int r,int tl,int tr)
{
    if(l>tr || r<tl)return mkp(inf,inf);
    push(nod,l,r);
    if(tl<=l && r<=tr)return st[nod];
    int mid=(l+r)/2;
    return mrg(qry(2*nod,l,mid,tl,tr),qry(2*nod+1,mid+1,r,tl,tr));
}
int solve(int x)
{
    if(x<k-1)
    {
        pair<int,int> y=qry(1,0,n-1,x-k+n+1,n-1);
        if(!y.fr)x=y.sc;
    }
    upd(1,0,n-1,x,x,2*n);
    if(x>=k-1)upd(1,0,n-1,x-k+1,x,-1);
    else
    {
        upd(1,0,n-1,0,x,-1);
        upd(1,0,n-1,x-k+n+1,n-1,-1);
    }
    return x;
}
void init(int K,vector<int> r)
{
    k=K;
    n=lun(r);
    build(1,0,n-1,r);
    for(int i=n-1;i>=0;i--)a[solve(qry(1,0,n-1,0,n-1).sc)]=i;
}
int compare_plants(int x,int y)
{
    if(a[x]>a[y])return 1;
    return -1;
}
/*int main()
{
    //freopen("sol.in","r",stdin);
    //freopen("sol.out","w",stdout);
    //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);

    return 0;
}*/

Compilation message

plants.cpp: In function 'void build(int, int, int, std::vector<int>*)':
plants.cpp:33:25: error: no match for 'operator=' (operand types are 'std::pair<int, int>' and 'std::pair<std::vector<int>, int>')
   33 |         st[x]=mkp(v[l],l);
      |                         ^
In file included from /usr/include/c++/9/bits/stl_algobase.h:64,
                 from /usr/include/c++/9/vector:60,
                 from plants.h:1,
                 from plants.cpp:1:
/usr/include/c++/9/bits/stl_pair.h:378:7: note: candidate: 'std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(typename std::conditional<std::__and_<std::is_copy_assignable<_T1>, std::is_copy_assignable<_T2> >::value, const std::pair<_T1, _T2>&, const std::__nonesuch_no_braces&>::type) [with _T1 = int; _T2 = int; typename std::conditional<std::__and_<std::is_copy_assignable<_T1>, std::is_copy_assignable<_T2> >::value, const std::pair<_T1, _T2>&, const std::__nonesuch_no_braces&>::type = const std::pair<int, int>&]'
  378 |       operator=(typename conditional<
      |       ^~~~~~~~
/usr/include/c++/9/bits/stl_pair.h:381:51: note:   no known conversion for argument 1 from 'std::pair<std::vector<int>, int>' to 'std::conditional<true, const std::pair<int, int>&, const std::__nonesuch_no_braces&>::type' {aka 'const std::pair<int, int>&'}
  378 |       operator=(typename conditional<
      |                 ~~~~~~~~~~~~~~~~~~~~~              
  379 |   __and_<is_copy_assignable<_T1>,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
  380 |          is_copy_assignable<_T2>>::value,
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~          
  381 |   const pair&, const __nonesuch_no_braces&>::type __p)
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/9/bits/stl_pair.h:389:7: note: candidate: 'std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(typename std::conditional<std::__and_<std::is_move_assignable<_Tp>, std::is_move_assignable<_T2> >::value, std::pair<_T1, _T2>&&, std::__nonesuch_no_braces&&>::type) [with _T1 = int; _T2 = int; typename std::conditional<std::__and_<std::is_move_assignable<_Tp>, std::is_move_assignable<_T2> >::value, std::pair<_T1, _T2>&&, std::__nonesuch_no_braces&&>::type = std::pair<int, int>&&]'
  389 |       operator=(typename conditional<
      |       ^~~~~~~~
/usr/include/c++/9/bits/stl_pair.h:392:41: note:   no known conversion for argument 1 from 'std::pair<std::vector<int>, int>' to 'std::conditional<true, std::pair<int, int>&&, std::__nonesuch_no_braces&&>::type' {aka 'std::pair<int, int>&&'}
  389 |       operator=(typename conditional<
      |                 ~~~~~~~~~~~~~~~~~~~~~    
  390 |   __and_<is_move_assignable<_T1>,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~        
  391 |          is_move_assignable<_T2>>::value,
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  392 |   pair&&, __nonesuch_no_braces&&>::type __p)
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/9/bits/stl_pair.h:405:2: note: candidate: 'template<class _U1, class _U2> typename std::enable_if<std::__and_<std::is_assignable<_T1&, const _U1&>, std::is_assignable<_T2&, const _U2&> >::value, std::pair<_T1, _T2>&>::type std::pair<_T1, _T2>::operator=(const std::pair<_U1, _U2>&) [with _U1 = _U1; _U2 = _U2; _T1 = int; _T2 = int]'
  405 |  operator=(const pair<_U1, _U2>& __p)
      |  ^~~~~~~~
/usr/include/c++/9/bits/stl_pair.h:405:2: note:   template argument deduction/substitution failed:
/usr/include/c++/9/bits/stl_pair.h: In substitution of 'template<class _U1, class _U2> typename std::enable_if<std::__and_<std::is_assignable<int&, const _U1&>, std::is_assignable<int&, const _U2&> >::value, std::pair<int, int>&>::type std::pair<int, int>::operator=<_U1, _U2>(const std::pair<_T1, _T2>&) [with _U1 = std::vector<int>; _U2 = int]':
plants.cpp:33:25:   required from here
/usr/include/c++/9/bits/stl_pair.h:405:2: error: no type named 'type' in 'struct std::enable_if<false, std::pair<int, int>&>'
/usr/include/c++/9/bits/stl_pair.h:416:2: note: candidate: 'template<class _U1, class _U2> typename std::enable_if<std::__and_<std::is_assignable<_T1&, _U1&&>, std::is_assignable<_T2&, _U2&&> >::value, std::pair<_T1, _T2>&>::type std::pair<_T1, _T2>::operator=(std::pair<_U1, _U2>&&) [with _U1 = _U1; _U2 = _U2; _T1 = int; _T2 = int]'
  416 |  operator=(pair<_U1, _U2>&& __p)
      |  ^~~~~~~~
/usr/include/c++/9/bits/stl_pair.h:416:2: note:   template argument deduction/substitution failed:
/usr/include/c++/9/bits/stl_pair.h: In substitution of 'template<class _U1, class _U2> typename std::enable_if<std::__and_<std::is_assignable<int&, _U1&&>, std::is_assignable<int&, _U2&&> >::value, std::pair<int, int>&>::type std::pair<int, int>::operator=<_U1, _U2>(std::pair<_T1, _T2>&&) [with _U1 = std::vector<int>; _U2 = int]':
plants.cpp:33:25:   required from here
/usr/include/c++/9/bits/stl_pair.h:416:2: error: no type named 'type' in 'struct std::enable_if<false, std::pair<int, int>&>'
plants.cpp: In function 'void init(int, std::vector<int>)':
plants.cpp:96:19: error: cannot convert 'std::vector<int>' to 'std::vector<int>*'
   96 |     build(1,0,n-1,r);
      |                   ^
      |                   |
      |                   std::vector<int>
plants.cpp:29:43: note:   initializing argument 4 of 'void build(int, int, int, std::vector<int>*)'
   29 | void build(int x,int l,int r,vector<int> *v)
      |                              ~~~~~~~~~~~~~^