oj.uz

답안 #912418

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
912418 2024-01-19T12:36:22 Z vjudge1 Potatoes and fertilizers (LMIO19_bulves) C++17
0 / 100
 1000 ms 348 KB 
#include <bits/stdc++.h>
#define f first
#define s second	
#define ent '\n'
#define int long long

#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

using namespace std;
typedef long long ll;
const int mx=1e6+12;
const int mod=1e9+7;
int dx[]={1,-1,0,0,1,-1,1,-1};
int dy[]={0,0,1,-1,1,-1,-1,1};

int a[mx];
int n,m,k;

void Press_Fn_with_F11(){
	cin>>n;
	set<int> s;
	for(int i=1;i<=n;i++){
		int x,y;
		cin>>x>>y;
		a[i]=x-y;
		if(a[i]>0)s.insert(i);
	}
	int ans=0;
	for(int i=1;i<=n;i++){
		while(a[i]<0){
			int j=*s.begin();
			s.erase(s.begin());
			int x=min(-a[i],a[j]);
			ans+=x*abs(i-j);
			a[i]+=x;
			a[j]-=x;
			if(a[j]>0)s.insert(a[j]);
		}
	}
	cout<<ans<<ent;
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int Alikhan_abi_crush=1;
	// cin>>Alikhan_abi_crush;
	while(Alikhan_abi_crush--){
		Press_Fn_with_F11();
	}
}

Subtask #1
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1050 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1050 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1050 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1050 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1050 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -