Submission #660023

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
660023	2022-11-20T08:52:17 Z	aebov	Palembang Bridges (APIO15_bridge)	C++17	Compilation error	0 ms	0 KB

bridge

#include<iostream>
#include<algorithm>
#include<cstring>
#include<iomanip>
#include<map>
#include<utility>
#include<unordered_map>
#include<vector>
#include<set>
#define pii pair<int,int>
#define pll pair<ll, ll>
#define F first
#define S second
#define ll long long
#define pb push_back
using namespace std;

const int N = (int)1e5 + 5, mod = (ll)1e9 + 7;
int n, k, x, y;
char ch, hc;
ll sm = 0, sm2 = (ll)1e18 + 18;

void sub(){
//	cerr << "\n entered #sub 2 \n";
	vector<int> cv;
	vector<pii> vc; vc.pb({0,0});
	for(int i = 1; i <= n; i ++){
		cin >> ch >> x >> hc >> y;
		if(x < y)swap(x, y);
		if(ch == hc) sm += x - y;
		else vc.pb({y, x});
	} n = vc.size() - 1;
//	cout << "N " << n << endl;
	for(int i = 1; i <= n; i ++) {
		cv.pb(vc[i].F);
		cv.pb(vc[i].S);
	}
	qsort(cv.begin(), cv.end());
  	//exit(0);
//	for(auto u : cv)cout << u << endl;
	for(int i = 0; i < cv.size(); i ++){
		for(int j = i; j < cv.size(); j ++) {
			int x = cv[i], y = cv[j];
			ll sum = 0;
			for(int z = 1; z <= n; z ++){
				if(vc[z].S < x) sum +=  (x<<1) - vc[z].F - vc[z].S + 1;
				else if(vc[z].F > y) sum += vc[z].F + vc[z].S - (y<<1) + 1;
				else if(x < vc[z].F && vc[z].S < y)sum += min(vc[z].F + vc[z].S -(x<<1) + 1,(y<<1) - vc[z].F - vc[z].S + 1);
				else sum += vc[z].S - vc[z].F + 1;
			}
			sm2 = min(sm2, sum);
		}
	}
//	cout << sm  << " " << sm2 << endl;
	cout << sm + sm2 << endl;
	exit(0);
}
int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> k >> n;
	vector<int> vc;
	if(k == 2 && n < 101)sub();
//	cerr << "\n enteres #sub1 \n";
	for(int i = 1; i <= n; i ++){
		cin >> ch >> x >> hc >> y;
		if(ch == hc) sm += abs(x - y);
		else sm ++, vc.pb(x), vc.pb(y);
	}
	sort(vc.begin(), vc.end());
	int pos = vc[(vc.size() - 1) / 2];
	for(auto x : vc)sm += abs(x - pos);
	cout << sm << endl;
}

Compilation message

bridge.cpp: In function 'void sub()':
bridge.cpp:38:16: error: cannot convert 'std::vector<int>::iterator' to 'void*'
   38 |  qsort(cv.begin(), cv.end());
      |        ~~~~~~~~^~
      |                |
      |                std::vector<int>::iterator
In file included from /usr/include/c++/10/cstdlib:75,
                 from /usr/include/c++/10/ext/string_conversions.h:41,
                 from /usr/include/c++/10/bits/basic_string.h:6535,
                 from /usr/include/c++/10/string:55,
                 from /usr/include/c++/10/bits/locale_classes.h:40,
                 from /usr/include/c++/10/bits/ios_base.h:41,
                 from /usr/include/c++/10/ios:42,
                 from /usr/include/c++/10/ostream:38,
                 from /usr/include/c++/10/iostream:39,
                 from bridge.cpp:1:
/usr/include/stdlib.h:830:26: note:   initializing argument 1 of 'void qsort(void*, size_t, size_t, __compar_fn_t)'
  830 | extern void qsort (void *__base, size_t __nmemb, size_t __size,
      |                    ~~~~~~^~~~~~
bridge.cpp:41:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |  for(int i = 0; i < cv.size(); i ++){
      |                 ~~^~~~~~~~~~~
bridge.cpp:42:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |   for(int j = i; j < cv.size(); j ++) {
      |                  ~~^~~~~~~~~~~