제출 #599044

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
599044	2022-07-19 09:27:46	almothana05	Potatoes and fertilizers (LMIO19_bulves)	C++14	24 / 100	124 ms	38260 KiB

bulves

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
vector<vector<long long> >cmp;
vector<long long>num;
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
   long long menge , numm , nummer , erg = 0;;
   cin >> menge;
   for(long long i = 0 ; i < menge; i++){
      cin >> numm >> nummer;
      if(numm > 0){
         cmp.push_back({numm , i});
      }
      num.push_back(nummer);
   }
   long long pl = cmp.size() - 1;
   for(long long i = menge - 1;  i >= 0 ; i--){
      while(num[i]){
         if(cmp[pl][0] == 0){
            pl--;
         }
         if(pl < 0){
            break;
         }
         nummer = min(num[i], cmp[pl][0]);
         num[i] -= nummer;
         cmp[pl][0] -= nummer;
         erg += nummer * abs(i - cmp[pl][1]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 24 / 24
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 10
• Subtask 5: 0 / 36