Submission #154194

# Submission time Handle Problem Language Result Execution time Memory
154194 2019-09-18T19:47:34 Z AKaan37 Potatoes and fertilizers (LMIO19_bulves) C++17
24 / 100
170 ms 18976 KB
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< int,int > PII;

#define fi first
#define se second
#define int long long
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 1000005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t;
int cev;
string s;
vector<PII> v;
vector<PII> vv;

main(void){
	scanf("%lld",&n);
	FOR{
		scanf("%lld %lld",&a[i],&b[i]);
		if(a[i]>b[i])
			v.pb(mp(i,abs(a[i]-b[i])));
		else if(a[i]<b[i])
			vv.pb(mp(i,abs(a[i]-b[i])));
	}
	//~ at=0;
	int bb=0;
	int ii=0;
	sort(v.begin(),v.end());
	sort(vv.begin(),vv.end());
	while(ii<(int)vv.size()){
		int at=min(v[bb].se,vv[ii].se);
		cev+=abs(vv[ii].fi-v[bb].fi)*at;
		v[bb].se-=at;
		vv[ii].se-=at;
		if(vv[ii].se==0)ii++;
		if(v[bb].se==0)bb++;
	}
	printf("%lld\n",cev);
	return 0;
}

Compilation message

bulves.cpp:43:10: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(void){
          ^
bulves.cpp: In function 'int main()':
bulves.cpp:44:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&n);
  ~~~~~^~~~~~~~~~~
bulves.cpp:46:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld",&a[i],&b[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 15 ms 1604 KB Output is correct
5 Correct 27 ms 3564 KB Output is correct
6 Correct 79 ms 8500 KB Output is correct
7 Correct 170 ms 18976 KB Output is correct
8 Correct 125 ms 17100 KB Output is correct
9 Correct 134 ms 16508 KB Output is correct
10 Correct 103 ms 14296 KB Output is correct
11 Correct 105 ms 14336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 15 ms 1604 KB Output is correct
5 Correct 27 ms 3564 KB Output is correct
6 Correct 79 ms 8500 KB Output is correct
7 Correct 170 ms 18976 KB Output is correct
8 Correct 125 ms 17100 KB Output is correct
9 Correct 134 ms 16508 KB Output is correct
10 Correct 103 ms 14296 KB Output is correct
11 Correct 105 ms 14336 KB Output is correct
12 Incorrect 43 ms 5068 KB Output isn't correct
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Incorrect 2 ms 376 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -