Submission #893346

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
893346	2023-12-27T02:58:45 Z	vjudge1	Road Construction (JOI21_road_construction)	C++17	Compilation error	0 ms	0 KB

road_construction

#include <bits/stdc++.h>
#define ll long long
#define str string
#define ins insert
#define ld long double
#define pb push_back
#define pf push_front
#define pof pop_front()
#define pob pop_back()
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define vll vector<ll>
#define bc back()
#define arr array
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <class _T>
bool chmin(_T &x, const _T &y){
    bool flag=false;
    if(x>y) x=y;flag|=true;
    return flag;
}
template <class _T>
bool chmax(_T &x, const _T &y){
    bool flag=false;
    if (x<y) x=y;flag|=true;
    return flag;
}
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const ll inf=1e9+7;
const ll mod=1e9+7;
const ll N=3e3+5;
const ld eps=1e-9;
vll x,y;
ll dis(ll i,ll j){
    return abs(x[i]-x[j])+abs(y[i]-y[j]);
}
void solve(){
	ll i,j;
	ll n,k;
    cin>>n>>k;
    x.resize(n);
    y.resize(n);
    bool flag=true;
    for(i=0;i<n;i++) {
        cin>>x[i]>>y[i];
        if(y[i])flag=false;
    }
    if(n<=1000){
        vll v;
        for(i=0;i<n;i++){
            for(j=i+1;j<n;j++){
                v.pb(dis(i,j));
            }
        }
        sort(all(v));
        for(i=0;i<k;i++) cout<<v[i]<<' ';
        cout<<endl;
        return;
    }
    if(flag){
        vector<pair<ll,ll>> v;
        for(i=0;i<n;i++){
            v.pb({x[i],y[i]});
        }
        sort(all(v));
        bool l[n+5],r[n+5];
        memset(l,false,sizeof(l));
        memset(r,false,sizeof(r));
        set<pair<ll,pair<ll,ll>>> seg;
        for(i=0;i<n;i++){
            seg.ins()
        }
    }
}
signed main(){
	start();
    ll t=1;
	//cin>>t;
    while(t--) solve();
    return 0;
}
/*






*/

Compilation message

road_construction.cpp: In function 'bool chmin(_T&, const _T&)':
road_construction.cpp:28:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   28 |     if(x>y) x=y;flag|=true;
      |     ^~
road_construction.cpp:28:17: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   28 |     if(x>y) x=y;flag|=true;
      |                 ^~~~
road_construction.cpp: In function 'bool chmax(_T&, const _T&)':
road_construction.cpp:34:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   34 |     if (x<y) x=y;flag|=true;
      |     ^~
road_construction.cpp:34:18: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   34 |     if (x<y) x=y;flag|=true;
      |                  ^~~~
road_construction.cpp: In function 'void solve()':
road_construction.cpp:86:21: error: no matching function for call to 'std::set<std::pair<long long int, std::pair<long long int, long long int> > >::insert()'
   86 |             seg.ins()
      |                     ^
In file included from /usr/include/c++/10/set:61,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:87,
                 from road_construction.cpp:1:
/usr/include/c++/10/bits/stl_set.h:509:7: note: candidate: 'std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(const value_type&) [with _Key = std::pair<long long int, std::pair<long long int, long long int> >; _Compare = std::less<std::pair<long long int, std::pair<long long int, long long int> > >; _Alloc = std::allocator<std::pair<long long int, std::pair<long long int, long long int> > >; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree<std::pair<long long int, std::pair<long long int, long long int> >, std::pair<long long int, std::pair<long long int, long long int> >, std::_Identity<std::pair<long long int, std::pair<long long int, long long int> > >, std::less<std::pair<long long int, std::pair<long long int, long long int> > >, std::allocator<std::pair<long long int, std::pair<long long int, long long int> > > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::pair<long long int, std::pair<long long int, long long int> >]'
  509 |       insert(const value_type& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:509:7: note:   candidate expects 1 argument, 0 provided
/usr/include/c++/10/bits/stl_set.h:518:7: note: candidate: 'std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::value_type&&) [with _Key = std::pair<long long int, std::pair<long long int, long long int> >; _Compare = std::less<std::pair<long long int, std::pair<long long int, long long int> > >; _Alloc = std::allocator<std::pair<long long int, std::pair<long long int, long long int> > >; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree<std::pair<long long int, std::pair<long long int, long long int> >, std::pair<long long int, std::pair<long long int, long long int> >, std::_Identity<std::pair<long long int, std::pair<long long int, long long int> > >, std::less<std::pair<long long int, std::pair<long long int, long long int> > >, std::allocator<std::pair<long long int, std::pair<long long int, long long int> > > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::pair<long long int, std::pair<long long int, long long int> >]'
  518 |       insert(value_type&& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:518:7: note:   candidate expects 1 argument, 0 provided
/usr/include/c++/10/bits/stl_set.h:546:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, const value_type&) [with _Key = std::pair<long long int, std::pair<long long int, long long int> >; _Compare = std::less<std::pair<long long int, std::pair<long long int, long long int> > >; _Alloc = std::allocator<std::pair<long long int, std::pair<long long int, long long int> > >; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<std::pair<long long int, std::pair<long long int, long long int> >, std::pair<long long int, std::pair<long long int, long long int> >, std::_Identity<std::pair<long long int, std::pair<long long int, long long int> > >, std::less<std::pair<long long int, std::pair<long long int, long long int> > >, std::allocator<std::pair<long long int, std::pair<long long int, long long int> > > >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<std::pair<long long int, std::pair<long long int, long long int> >, std::pair<long long int, std::pair<long long int, long long int> >, std::_Identity<std::pair<long long int, std::pair<long long int, long long int> > >, std::less<std::pair<long long int, std::pair<long long int, long long int> > >, std::allocator<std::pair<long long int, std::pair<long long int, long long int> > > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::pair<long long int, std::pair<long long int, long long int> >]'
  546 |       insert(const_iterator __position, const value_type& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:546:7: note:   candidate expects 2 arguments, 0 provided
/usr/include/c++/10/bits/stl_set.h:551:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, std::set<_Key, _Compare, _Alloc>::value_type&&) [with _Key = std::pair<long long int, std::pair<long long int, long long int> >; _Compare = std::less<std::pair<long long int, std::pair<long long int, long long int> > >; _Alloc = std::allocator<std::pair<long long int, std::pair<long long int, long long int> > >; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<std::pair<long long int, std::pair<long long int, long long int> >, std::pair<long long int, std::pair<long long int, long long int> >, std::_Identity<std::pair<long long int, std::pair<long long int, long long int> > >, std::less<std::pair<long long int, std::pair<long long int, long long int> > >, std::allocator<std::pair<long long int, std::pair<long long int, long long int> > > >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<std::pair<long long int, std::pair<long long int, long long int> >, std::pair<long long int, std::pair<long long int, long long int> >, std::_Identity<std::pair<long long int, std::pair<long long int, long long int> > >, std::less<std::pair<long long int, std::pair<long long int, long long int> > >, std::allocator<std::pair<long long int, std::pair<long long int, long long int> > > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::pair<long long int, std::pair<long long int, long long int> >]'
  551 |       insert(const_iterator __position, value_type&& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:551:7: note:   candidate expects 2 arguments, 0 provided
/usr/include/c++/10/bits/stl_set.h:566:2: note: candidate: 'template<class _InputIterator> void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = _InputIterator; _Key = std::pair<long long int, std::pair<long long int, long long int> >; _Compare = std::less<std::pair<long long int, std::pair<long long int, long long int> > >; _Alloc = std::allocator<std::pair<long long int, std::pair<long long int, long long int> > >]'
  566 |  insert(_InputIterator __first, _InputIterator __last)
      |  ^~~~~~
/usr/include/c++/10/bits/stl_set.h:566:2: note:   template argument deduction/substitution failed:
road_construction.cpp:86:21: note:   candidate expects 2 arguments, 0 provided
   86 |             seg.ins()
      |                     ^
In file included from /usr/include/c++/10/set:61,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:87,
                 from road_construction.cpp:1:
/usr/include/c++/10/bits/stl_set.h:578:7: note: candidate: 'void std::set<_Key, _Compare, _Alloc>::insert(std::initializer_list<_Tp>) [with _Key = std::pair<long long int, std::pair<long long int, long long int> >; _Compare = std::less<std::pair<long long int, std::pair<long long int, long long int> > >; _Alloc = std::allocator<std::pair<long long int, std::pair<long long int, long long int> > >]'
  578 |       insert(initializer_list<value_type> __l)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:578:7: note:   candidate expects 1 argument, 0 provided
/usr/include/c++/10/bits/stl_set.h:598:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::insert_return_type std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::node_type&&) [with _Key = std::pair<long long int, std::pair<long long int, long long int> >; _Compare = std::less<std::pair<long long int, std::pair<long long int, long long int> > >; _Alloc = std::allocator<std::pair<long long int, std::pair<long long int, long long int> > >; std::set<_Key, _Compare, _Alloc>::insert_return_type = std::_Rb_tree<std::pair<long long int, std::pair<long long int, long long int> >, std::pair<long long int, std::pair<long long int, long long int> >, std::_Identity<std::pair<long long int, std::pair<long long int, long long int> > >, std::less<std::pair<long long int, std::pair<long long int, long long int> > >, std::allocator<std::pair<long long int, std::pair<long long int, long long int> > > >::insert_return_type; std::set<_Key, _Compare, _Alloc>::node_type = std::_Rb_tree<std::pair<long long int, std::pair<long long int, long long int> >, std::pair<long long int, std::pair<long long int, long long int> >, std::_Identity<std::pair<long long int, std::pair<long long int, long long int> > >, std::less<std::pair<long long int, std::pair<long long int, long long int> > >, std::allocator<std::pair<long long int, std::pair<long long int, long long int> > > >::node_type]'
  598 |       insert(node_type&& __nh)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:598:7: note:   candidate expects 1 argument, 0 provided
/usr/include/c++/10/bits/stl_set.h:603:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, std::set<_Key, _Compare, _Alloc>::node_type&&) [with _Key = std::pair<long long int, std::pair<long long int, long long int> >; _Compare = std::less<std::pair<long long int, std::pair<long long int, long long int> > >; _Alloc = std::allocator<std::pair<long long int, std::pair<long long int, long long int> > >; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<std::pair<long long int, std::pair<long long int, long long int> >, std::pair<long long int, std::pair<long long int, long long int> >, std::_Identity<std::pair<long long int, std::pair<long long int, long long int> > >, std::less<std::pair<long long int, std::pair<long long int, long long int> > >, std::allocator<std::pair<long long int, std::pair<long long int, long long int> > > >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<std::pair<long long int, std::pair<long long int, long long int> >, std::pair<long long int, std::pair<long long int, long long int> >, std::_Identity<std::pair<long long int, std::pair<long long int, long long int> > >, std::less<std::pair<long long int, std::pair<long long int, long long int> > >, std::allocator<std::pair<long long int, std::pair<long long int, long long int> > > >::const_iterator; std::set<_Key, _Compare, _Alloc>::node_type = std::_Rb_tree<std::pair<long long int, std::pair<long long int, long long int> >, std::pair<long long int, std::pair<long long int, long long int> >, std::_Identity<std::pair<long long int, std::pair<long long int, long long int> > >, std::less<std::pair<long long int, std::pair<long long int, long long int> > >, std::allocator<std::pair<long long int, std::pair<long long int, long long int> > > >::node_type]'
  603 |       insert(const_iterator __hint, node_type&& __nh)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:603:7: note:   candidate expects 2 arguments, 0 provided
road_construction.cpp: In function 'void fre(std::string)':
road_construction.cpp:38:27: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 | void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
road_construction.cpp:38:64: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 | void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                                                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~