oj.uz

답안 #770953

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
770953 2023-07-02T07:51:02 Z dxz05 Potatoes and fertilizers (LMIO19_bulves) C++17
0 / 100
 19 ms 392 KB 
#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("avx,avx2")

#include <bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)
#define MP make_pair
//#define endl '\n'

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

typedef long long ll;
const int MOD = 1e9 + 7;
const int N = 5e5 + 30;

int a[N], b[N];
void solve(){
    int n;
    cin >> n;

    for (int i = 1; i <= n; i++) cin >> a[i] >> b[i];

    ll ans = 0;
    auto transfer = [&](int to, int from) -> void{
        int mn = min(a[from] - b[from], b[to] - a[to]);

        cerr << from << " -> " << to << ": " << mn << " units\n";

        ans += (ll) mn * abs(from - to);
        a[from] -= mn;
        a[to] += mn;
    };

    vector<int> p(n);
    iota(all(p), 1);
    sort(all(p), [&](int i, int j){
        return b[i] - a[i] < b[j] - a[j];
    });

    for (int t : p){
        if (a[t] >= b[t]) continue;

        int i = t - 1, j = t + 1;

        while (a[t] < b[t]){
            while (i >= 1 && a[i] <= b[i]) i--;
            while (j <= n && a[j] <= b[j]) j++;

            if (i >= 1 && (j > n || t - i < j - t)){
                transfer(t, i);
            } else {
                transfer(t, j);
            }
        }

    }

    cout << ans << endl;

}

int main(){
    clock_t startTime = clock();
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int test_cases = 1;
//    cin >> test_cases;

    for (int test = 1; test <= test_cases; test++){
        //cout << (solve() ? "YES" : "NO") << endl;
        solve();
    }

#ifdef LOCAL
    cerr << "Time: " << int((double) (clock() - startTime) / CLOCKS_PER_SEC * 1000) << " ms" << endl;
#endif

    return 0;
}

Compilation message

bulves.cpp: In function 'int main()':
bulves.cpp:68:13: warning: unused variable 'startTime' [-Wunused-variable]
   68 |     clock_t startTime = clock();
      |             ^~~~~~~~~

Subtask #1
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Incorrect 19 ms 392 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Incorrect 19 ms 392 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Incorrect 6 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Incorrect 19 ms 392 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Incorrect 19 ms 392 KB Output isn't correct
4 Halted 0 ms 0 KB -